/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 10:33:53,760 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 10:33:53,762 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 10:33:53,773 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 10:33:53,774 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 10:33:53,775 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 10:33:53,776 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 10:33:53,777 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 10:33:53,779 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 10:33:53,780 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 10:33:53,780 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 10:33:53,781 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 10:33:53,782 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 10:33:53,783 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 10:33:53,784 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 10:33:53,785 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 10:33:53,785 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 10:33:53,786 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 10:33:53,788 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 10:33:53,790 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 10:33:53,791 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 10:33:53,792 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 10:33:53,793 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 10:33:53,794 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 10:33:53,796 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 10:33:53,796 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 10:33:53,797 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 10:33:53,798 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 10:33:53,798 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 10:33:53,799 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 10:33:53,799 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 10:33:53,800 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 10:33:53,800 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 10:33:53,801 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 10:33:53,802 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 10:33:53,802 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 10:33:53,803 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 10:33:53,803 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 10:33:53,803 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 10:33:53,804 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 10:33:53,805 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 10:33:53,805 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 10:33:53,820 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 10:33:53,820 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 10:33:53,821 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 10:33:53,822 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 10:33:53,822 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 10:33:53,822 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 10:33:53,822 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 10:33:53,822 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 10:33:53,822 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 10:33:53,823 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 10:33:53,823 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 10:33:53,823 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 10:33:53,823 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 10:33:53,823 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 10:33:53,823 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 10:33:53,824 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 10:33:53,824 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 10:33:53,824 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 10:33:53,824 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 10:33:53,824 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 10:33:53,825 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 10:33:53,825 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 10:33:53,825 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 10:33:53,825 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 10:33:53,825 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 10:33:53,826 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 10:33:53,826 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 10:33:53,826 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 10:33:53,826 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 10:33:53,996 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 10:33:54,010 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 10:33:54,013 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 10:33:54,015 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 10:33:54,015 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 10:33:54,016 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 10:33:54,095 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_NSOuUo/tmp/ceb2790ab44243a5ae4cc37bb5be6ab7/FLAG319a8eb6f [2020-07-01 10:33:54,422 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 10:33:54,422 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 10:33:54,429 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_NSOuUo/tmp/ceb2790ab44243a5ae4cc37bb5be6ab7/FLAG319a8eb6f [2020-07-01 10:33:54,839 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_NSOuUo/tmp/ceb2790ab44243a5ae4cc37bb5be6ab7 [2020-07-01 10:33:54,850 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 10:33:54,852 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 10:33:54,853 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 10:33:54,853 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 10:33:54,856 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 10:33:54,857 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 10:33:54" (1/1) ... [2020-07-01 10:33:54,860 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2adbae0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:33:54, skipping insertion in model container [2020-07-01 10:33:54,861 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 10:33:54" (1/1) ... [2020-07-01 10:33:54,869 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 10:33:54,885 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 10:33:55,111 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 10:33:55,117 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 10:33:55,137 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 10:33:55,158 INFO L208 MainTranslator]: Completed translation [2020-07-01 10:33:55,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:33:55 WrapperNode [2020-07-01 10:33:55,159 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 10:33:55,160 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 10:33:55,160 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 10:33:55,160 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 10:33:55,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:33:55" (1/1) ... [2020-07-01 10:33:55,178 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:33:55" (1/1) ... [2020-07-01 10:33:55,197 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 10:33:55,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 10:33:55,198 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 10:33:55,198 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 10:33:55,208 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:33:55" (1/1) ... [2020-07-01 10:33:55,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:33:55" (1/1) ... [2020-07-01 10:33:55,209 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:33:55" (1/1) ... [2020-07-01 10:33:55,209 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:33:55" (1/1) ... [2020-07-01 10:33:55,214 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:33:55" (1/1) ... [2020-07-01 10:33:55,219 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:33:55" (1/1) ... [2020-07-01 10:33:55,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:33:55" (1/1) ... [2020-07-01 10:33:55,221 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 10:33:55,222 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 10:33:55,222 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 10:33:55,222 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 10:33:55,223 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:33:55" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 10:33:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 10:33:55,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 10:33:55,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 10:33:55,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 10:33:55,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 10:33:55,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 10:33:55,482 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 10:33:55,483 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-01 10:33:55,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 10:33:55 BoogieIcfgContainer [2020-07-01 10:33:55,487 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 10:33:55,487 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 10:33:55,488 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 10:33:55,490 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 10:33:55,491 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 10:33:55" (1/1) ... [2020-07-01 10:33:55,504 INFO L313 BlockEncoder]: Initial Icfg 17 locations, 18 edges [2020-07-01 10:33:55,505 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 10:33:55,506 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 10:33:55,507 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 10:33:55,507 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 10:33:55,509 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 10:33:55,510 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 10:33:55,510 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 10:33:55,527 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 10:33:55,544 INFO L200 BlockEncoder]: SBE split 7 edges [2020-07-01 10:33:55,548 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 10:33:55,550 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 10:33:55,569 INFO L100 BaseMinimizeStates]: Removed 8 edges and 4 locations by large block encoding [2020-07-01 10:33:55,572 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 10:33:55,573 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 10:33:55,574 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 10:33:55,582 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding [2020-07-01 10:33:55,582 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 10:33:55,583 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 10:33:55,583 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 10:33:55,583 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 10:33:55,584 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 10:33:55,584 INFO L313 BlockEncoder]: Encoded RCFG 11 locations, 18 edges [2020-07-01 10:33:55,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 10:33:55 BasicIcfg [2020-07-01 10:33:55,585 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 10:33:55,586 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 10:33:55,586 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 10:33:55,590 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 10:33:55,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 10:33:54" (1/4) ... [2020-07-01 10:33:55,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b989c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 10:33:55, skipping insertion in model container [2020-07-01 10:33:55,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:33:55" (2/4) ... [2020-07-01 10:33:55,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b989c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 10:33:55, skipping insertion in model container [2020-07-01 10:33:55,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 10:33:55" (3/4) ... [2020-07-01 10:33:55,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b989c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 10:33:55, skipping insertion in model container [2020-07-01 10:33:55,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 10:33:55" (4/4) ... [2020-07-01 10:33:55,596 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 10:33:55,606 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 10:33:55,613 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-07-01 10:33:55,627 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-07-01 10:33:55,650 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 10:33:55,651 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 10:33:55,651 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 10:33:55,651 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 10:33:55,651 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 10:33:55,651 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 10:33:55,652 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 10:33:55,652 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 10:33:55,666 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2020-07-01 10:33:55,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 10:33:55,672 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 10:33:55,673 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 10:33:55,674 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 10:33:55,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:33:55,680 INFO L82 PathProgramCache]: Analyzing trace with hash 66149, now seen corresponding path program 1 times [2020-07-01 10:33:55,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:33:55,690 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598106346] [2020-07-01 10:33:55,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:33:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:33:55,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 10:33:55,840 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598106346] [2020-07-01 10:33:55,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 10:33:55,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 10:33:55,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660496350] [2020-07-01 10:33:55,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 10:33:55,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:33:55,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 10:33:55,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 10:33:55,866 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2020-07-01 10:33:55,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:33:55,925 INFO L93 Difference]: Finished difference Result 20 states and 33 transitions. [2020-07-01 10:33:55,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 10:33:55,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 10:33:55,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 10:33:55,939 INFO L225 Difference]: With dead ends: 20 [2020-07-01 10:33:55,939 INFO L226 Difference]: Without dead ends: 11 [2020-07-01 10:33:55,942 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 10:33:55,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-07-01 10:33:55,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-07-01 10:33:55,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-01 10:33:55,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2020-07-01 10:33:55,977 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 3 [2020-07-01 10:33:55,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 10:33:55,978 INFO L479 AbstractCegarLoop]: Abstraction has 11 states and 17 transitions. [2020-07-01 10:33:55,978 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 10:33:55,978 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 17 transitions. [2020-07-01 10:33:55,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 10:33:55,978 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 10:33:55,978 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 10:33:55,980 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 10:33:55,981 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 10:33:55,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:33:55,981 INFO L82 PathProgramCache]: Analyzing trace with hash 66180, now seen corresponding path program 1 times [2020-07-01 10:33:55,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:33:55,982 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376532408] [2020-07-01 10:33:55,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:33:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:33:56,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 10:33:56,015 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376532408] [2020-07-01 10:33:56,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 10:33:56,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 10:33:56,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636900434] [2020-07-01 10:33:56,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 10:33:56,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:33:56,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 10:33:56,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 10:33:56,018 INFO L87 Difference]: Start difference. First operand 11 states and 17 transitions. Second operand 3 states. [2020-07-01 10:33:56,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:33:56,055 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2020-07-01 10:33:56,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 10:33:56,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 10:33:56,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 10:33:56,056 INFO L225 Difference]: With dead ends: 11 [2020-07-01 10:33:56,056 INFO L226 Difference]: Without dead ends: 8 [2020-07-01 10:33:56,057 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 10:33:56,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-07-01 10:33:56,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-07-01 10:33:56,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-01 10:33:56,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2020-07-01 10:33:56,060 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 3 [2020-07-01 10:33:56,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 10:33:56,060 INFO L479 AbstractCegarLoop]: Abstraction has 8 states and 11 transitions. [2020-07-01 10:33:56,060 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 10:33:56,060 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. [2020-07-01 10:33:56,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 10:33:56,061 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 10:33:56,061 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 10:33:56,061 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 10:33:56,061 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 10:33:56,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:33:56,062 INFO L82 PathProgramCache]: Analyzing trace with hash 66182, now seen corresponding path program 1 times [2020-07-01 10:33:56,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:33:56,062 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866189945] [2020-07-01 10:33:56,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:33:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:33:56,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 10:33:56,081 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866189945] [2020-07-01 10:33:56,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 10:33:56,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 10:33:56,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445331285] [2020-07-01 10:33:56,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 10:33:56,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:33:56,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 10:33:56,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 10:33:56,083 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand 3 states. [2020-07-01 10:33:56,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:33:56,100 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2020-07-01 10:33:56,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 10:33:56,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 10:33:56,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 10:33:56,101 INFO L225 Difference]: With dead ends: 11 [2020-07-01 10:33:56,102 INFO L226 Difference]: Without dead ends: 8 [2020-07-01 10:33:56,102 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 10:33:56,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-07-01 10:33:56,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-07-01 10:33:56,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-01 10:33:56,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2020-07-01 10:33:56,105 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 3 [2020-07-01 10:33:56,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 10:33:56,105 INFO L479 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2020-07-01 10:33:56,105 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 10:33:56,105 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2020-07-01 10:33:56,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 10:33:56,106 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 10:33:56,106 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 10:33:56,106 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 10:33:56,106 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 10:33:56,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:33:56,107 INFO L82 PathProgramCache]: Analyzing trace with hash 66183, now seen corresponding path program 1 times [2020-07-01 10:33:56,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:33:56,107 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987641285] [2020-07-01 10:33:56,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:33:56,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:33:56,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 10:33:56,136 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987641285] [2020-07-01 10:33:56,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 10:33:56,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 10:33:56,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764989201] [2020-07-01 10:33:56,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 10:33:56,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:33:56,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 10:33:56,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 10:33:56,138 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 3 states. [2020-07-01 10:33:56,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:33:56,153 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2020-07-01 10:33:56,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 10:33:56,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 10:33:56,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 10:33:56,154 INFO L225 Difference]: With dead ends: 8 [2020-07-01 10:33:56,154 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 10:33:56,154 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 10:33:56,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 10:33:56,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 10:33:56,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 10:33:56,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 10:33:56,155 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 3 [2020-07-01 10:33:56,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 10:33:56,155 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 10:33:56,155 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 10:33:56,155 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 10:33:56,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 10:33:56,156 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 10:33:56,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 10:33:56,183 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 10:33:56,183 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 10:33:56,184 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-01 10:33:56,184 INFO L268 CegarLoopResult]: For program point L13-1(line 13) no Hoare annotation was computed. [2020-07-01 10:33:56,184 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 10:33:56,184 INFO L264 CegarLoopResult]: At program point L12-3(lines 12 14) the Hoare annotation is: (and (= 1 (select |#valid| |ULTIMATE.start_main_~#a~0.base|)) (= 0 |ULTIMATE.start_main_~#a~0.offset|) (<= 1 |#StackHeapBarrier|) (= 4192 (select |#length| |ULTIMATE.start_main_~#a~0.base|))) [2020-07-01 10:33:56,184 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 10:33:56,185 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 10:33:56,185 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 10:33:56,185 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 10:33:56,185 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 10:33:56,187 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 10:33:56,196 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 10:33:56,197 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 10:33:56,201 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 10:33:56,201 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 10:33:56,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 10:33:56 BasicIcfg [2020-07-01 10:33:56,204 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 10:33:56,204 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 10:33:56,204 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 10:33:56,208 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 10:33:56,208 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 10:33:56,209 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 10:33:54" (1/5) ... [2020-07-01 10:33:56,209 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d6c9d14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 10:33:56, skipping insertion in model container [2020-07-01 10:33:56,209 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 10:33:56,209 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:33:55" (2/5) ... [2020-07-01 10:33:56,210 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d6c9d14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 10:33:56, skipping insertion in model container [2020-07-01 10:33:56,210 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 10:33:56,210 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 10:33:55" (3/5) ... [2020-07-01 10:33:56,210 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d6c9d14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 10:33:56, skipping insertion in model container [2020-07-01 10:33:56,210 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 10:33:56,211 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 10:33:55" (4/5) ... [2020-07-01 10:33:56,211 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d6c9d14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 10:33:56, skipping insertion in model container [2020-07-01 10:33:56,211 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 10:33:56,211 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 10:33:56" (5/5) ... [2020-07-01 10:33:56,212 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 10:33:56,234 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 10:33:56,235 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 10:33:56,235 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 10:33:56,235 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 10:33:56,235 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 10:33:56,235 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 10:33:56,235 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 10:33:56,235 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 10:33:56,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-07-01 10:33:56,243 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-01 10:33:56,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 10:33:56,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 10:33:56,248 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 10:33:56,248 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-01 10:33:56,248 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 10:33:56,248 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-07-01 10:33:56,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-01 10:33:56,250 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 10:33:56,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 10:33:56,250 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 10:33:56,250 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-01 10:33:56,255 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue [36] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 3#L-1true [56] L-1-->L12-3: Formula: (and (= (store |v_#valid_4| |v_ULTIMATE.start_main_~#a~0.base_1| 1) |v_#valid_3|) (= (store |v_#length_2| |v_ULTIMATE.start_main_~#a~0.base_1| 4192) |v_#length_1|) (= 0 |v_ULTIMATE.start_main_~#a~0.offset_1|) (< 0 |v_ULTIMATE.start_main_~#a~0.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#a~0.base_1|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_~#a~0.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_1|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem0=|v_ULTIMATE.start_main_#t~mem0_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#a~0.offset, ULTIMATE.start_main_~#a~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem1, #length, ULTIMATE.start_main_#t~mem0] 12#L12-3true [2020-07-01 10:33:56,256 INFO L796 eck$LassoCheckResult]: Loop: 12#L12-3true [73] L12-3-->L13: Formula: (let ((.cse0 (+ |v_ULTIMATE.start_main_~#a~0.offset_16| 12))) (and (<= (+ |v_ULTIMATE.start_main_~#a~0.offset_16| 16) (select |v_#length_10| |v_ULTIMATE.start_main_~#a~0.base_22|)) (<= 0 .cse0) (<= 0 (select (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#a~0.base_22|) .cse0)) (= 1 (select |v_#valid_20| |v_ULTIMATE.start_main_~#a~0.base_22|)))) InVars {ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_16|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_22|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_7|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_16|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_22|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~mem0=|v_ULTIMATE.start_main_#t~mem0_13|, #length=|v_#length_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem0] 10#L13true [43] L13-->L13-1: Formula: (let ((.cse0 (+ |v_ULTIMATE.start_main_~#a~0.offset_6| 12))) (and (= 1 (select |v_#valid_7| |v_ULTIMATE.start_main_~#a~0.base_7|)) (<= (+ |v_ULTIMATE.start_main_~#a~0.offset_6| 16) (select |v_#length_5| |v_ULTIMATE.start_main_~#a~0.base_7|)) (= |v_ULTIMATE.start_main_#t~mem1_2| (select (select |v_#memory_int_2| |v_ULTIMATE.start_main_~#a~0.base_7|) .cse0)) (<= 0 .cse0))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_6|, #length=|v_#length_5|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_7|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_6|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_7|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_2|, #length=|v_#length_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 8#L13-1true [71] L13-1-->L12-3: Formula: (let ((.cse0 (+ |v_ULTIMATE.start_main_~#a~0.offset_14| 12))) (and (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#a~0.base_19| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#a~0.base_19|) .cse0 (+ |v_ULTIMATE.start_main_#t~mem1_6| (- 1))))) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_main_~#a~0.offset_14| 16) (select |v_#length_9| |v_ULTIMATE.start_main_~#a~0.base_19|)) (= (select |v_#valid_17| |v_ULTIMATE.start_main_~#a~0.base_19|) 1))) InVars {ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_14|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_19|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_6|, #length=|v_#length_9|} OutVars{ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_14|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_19|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem1] 12#L12-3true [2020-07-01 10:33:56,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:33:56,257 INFO L82 PathProgramCache]: Analyzing trace with hash 2133, now seen corresponding path program 1 times [2020-07-01 10:33:56,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:33:56,257 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902190456] [2020-07-01 10:33:56,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:33:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:33:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:33:56,291 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 10:33:56,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:33:56,292 INFO L82 PathProgramCache]: Analyzing trace with hash 101348, now seen corresponding path program 1 times [2020-07-01 10:33:56,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:33:56,292 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122014384] [2020-07-01 10:33:56,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:33:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:33:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:33:56,307 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 10:33:56,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:33:56,307 INFO L82 PathProgramCache]: Analyzing trace with hash 63615760, now seen corresponding path program 1 times [2020-07-01 10:33:56,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:33:56,308 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325611308] [2020-07-01 10:33:56,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:33:56,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:33:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:33:56,334 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 10:33:56,455 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 10:33:56,456 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 10:33:56,456 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 10:33:56,456 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 10:33:56,456 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 10:33:56,456 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 10:33:56,456 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 10:33:56,457 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 10:33:56,457 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-07-01 10:33:56,457 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 10:33:56,457 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 10:33:56,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:33:56,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:33:56,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:33:56,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:33:56,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:33:56,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:33:56,687 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 10:33:56,692 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 10:33:56,700 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 10:33:56,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 10:33:56,704 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 10:33:56,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 10:33:56,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 10:33:56,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 10:33:56,707 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 10:33:56,707 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 10:33:56,711 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 10:33:56,748 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 10:33:56,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 10:33:56,751 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 10:33:56,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 10:33:56,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 10:33:56,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 10:33:56,752 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 10:33:56,752 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 10:33:56,754 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 10:33:56,791 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 10:33:56,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 10:33:56,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 10:33:56,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 10:33:56,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 10:33:56,798 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 10:33:56,798 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 10:33:56,804 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 10:33:56,838 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 10:33:56,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 10:33:56,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 10:33:56,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 10:33:56,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 10:33:56,846 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 10:33:56,846 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 10:33:56,853 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 10:33:56,889 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 10:33:56,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 10:33:56,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 10:33:56,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 10:33:56,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 10:33:56,894 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 10:33:56,895 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 10:33:56,899 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 10:33:56,935 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 10:33:56,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 10:33:56,937 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 10:33:56,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 10:33:56,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 10:33:56,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 10:33:56,939 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 10:33:56,940 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 10:33:56,943 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 10:33:56,950 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 10:33:56,951 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 10:33:56,966 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 10:33:56,966 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 10:33:56,967 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 10:33:56,967 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~#a~0.base) (+ ULTIMATE.start_main_~#a~0.offset 12))_1) = 2*v_rep(select (select #memory_int ULTIMATE.start_main_~#a~0.base) (+ ULTIMATE.start_main_~#a~0.offset 12))_1 + 1 Supporting invariants [] [2020-07-01 10:33:57,002 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2020-07-01 10:33:57,005 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 10:33:57,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:33:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:33:57,033 INFO L264 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 10:33:57,034 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:33:57,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:33:57,048 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 10:33:57,049 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:33:57,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 10:33:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:33:57,116 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 10:33:57,117 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-07-01 10:33:57,120 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-01 10:33:57,121 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 11 states. Second operand 4 states. [2020-07-01 10:33:57,230 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 11 states.. Second operand 4 states. Result 29 states and 57 transitions. Complement of second has 8 states. [2020-07-01 10:33:57,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-01 10:33:57,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-01 10:33:57,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2020-07-01 10:33:57,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 2 letters. Loop has 3 letters. [2020-07-01 10:33:57,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 10:33:57,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 5 letters. Loop has 3 letters. [2020-07-01 10:33:57,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 10:33:57,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 2 letters. Loop has 6 letters. [2020-07-01 10:33:57,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 10:33:57,244 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 57 transitions. [2020-07-01 10:33:57,246 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-01 10:33:57,247 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 5 states and 5 transitions. [2020-07-01 10:33:57,248 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-07-01 10:33:57,249 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-07-01 10:33:57,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 5 transitions. [2020-07-01 10:33:57,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-01 10:33:57,250 INFO L688 BuchiCegarLoop]: Abstraction has 5 states and 5 transitions. [2020-07-01 10:33:57,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states and 5 transitions. [2020-07-01 10:33:57,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2020-07-01 10:33:57,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-01 10:33:57,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2020-07-01 10:33:57,252 INFO L711 BuchiCegarLoop]: Abstraction has 5 states and 5 transitions. [2020-07-01 10:33:57,252 INFO L591 BuchiCegarLoop]: Abstraction has 5 states and 5 transitions. [2020-07-01 10:33:57,252 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-01 10:33:57,252 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 5 transitions. [2020-07-01 10:33:57,252 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-01 10:33:57,252 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 10:33:57,252 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 10:33:57,253 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 10:33:57,253 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-01 10:33:57,253 INFO L794 eck$LassoCheckResult]: Stem: 93#ULTIMATE.startENTRY [36] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 91#L-1 [55] L-1-->L12-3: Formula: (and (= (store |v_#valid_4| |v_ULTIMATE.start_main_~#a~0.base_1| 1) |v_#valid_3|) (= (store |v_#length_2| |v_ULTIMATE.start_main_~#a~0.base_1| 4192) |v_#length_1|) (= 0 |v_ULTIMATE.start_main_~#a~0.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#a~0.base_1|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_~#a~0.base_1|)) (> 0 |v_ULTIMATE.start_main_~#a~0.base_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_1|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem0=|v_ULTIMATE.start_main_#t~mem0_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#a~0.offset, ULTIMATE.start_main_~#a~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem1, #length, ULTIMATE.start_main_#t~mem0] 92#L12-3 [2020-07-01 10:33:57,254 INFO L796 eck$LassoCheckResult]: Loop: 92#L12-3 [73] L12-3-->L13: Formula: (let ((.cse0 (+ |v_ULTIMATE.start_main_~#a~0.offset_16| 12))) (and (<= (+ |v_ULTIMATE.start_main_~#a~0.offset_16| 16) (select |v_#length_10| |v_ULTIMATE.start_main_~#a~0.base_22|)) (<= 0 .cse0) (<= 0 (select (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#a~0.base_22|) .cse0)) (= 1 (select |v_#valid_20| |v_ULTIMATE.start_main_~#a~0.base_22|)))) InVars {ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_16|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_22|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_7|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_16|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_22|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~mem0=|v_ULTIMATE.start_main_#t~mem0_13|, #length=|v_#length_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem0] 95#L13 [43] L13-->L13-1: Formula: (let ((.cse0 (+ |v_ULTIMATE.start_main_~#a~0.offset_6| 12))) (and (= 1 (select |v_#valid_7| |v_ULTIMATE.start_main_~#a~0.base_7|)) (<= (+ |v_ULTIMATE.start_main_~#a~0.offset_6| 16) (select |v_#length_5| |v_ULTIMATE.start_main_~#a~0.base_7|)) (= |v_ULTIMATE.start_main_#t~mem1_2| (select (select |v_#memory_int_2| |v_ULTIMATE.start_main_~#a~0.base_7|) .cse0)) (<= 0 .cse0))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_6|, #length=|v_#length_5|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_7|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_6|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_7|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_2|, #length=|v_#length_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 94#L13-1 [71] L13-1-->L12-3: Formula: (let ((.cse0 (+ |v_ULTIMATE.start_main_~#a~0.offset_14| 12))) (and (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#a~0.base_19| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#a~0.base_19|) .cse0 (+ |v_ULTIMATE.start_main_#t~mem1_6| (- 1))))) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_main_~#a~0.offset_14| 16) (select |v_#length_9| |v_ULTIMATE.start_main_~#a~0.base_19|)) (= (select |v_#valid_17| |v_ULTIMATE.start_main_~#a~0.base_19|) 1))) InVars {ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_14|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_19|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_6|, #length=|v_#length_9|} OutVars{ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_14|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_19|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem1] 92#L12-3 [2020-07-01 10:33:57,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:33:57,255 INFO L82 PathProgramCache]: Analyzing trace with hash 2132, now seen corresponding path program 1 times [2020-07-01 10:33:57,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:33:57,255 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706045144] [2020-07-01 10:33:57,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:33:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:33:57,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 10:33:57,276 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706045144] [2020-07-01 10:33:57,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 10:33:57,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-07-01 10:33:57,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647338003] [2020-07-01 10:33:57,277 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 10:33:57,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:33:57,278 INFO L82 PathProgramCache]: Analyzing trace with hash 101348, now seen corresponding path program 2 times [2020-07-01 10:33:57,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:33:57,278 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368218071] [2020-07-01 10:33:57,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:33:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:33:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:33:57,290 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 10:33:57,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:33:57,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 10:33:57,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 10:33:57,324 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. cyclomatic complexity: 1 Second operand 3 states. [2020-07-01 10:33:57,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:33:57,325 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2020-07-01 10:33:57,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 10:33:57,327 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2 states and 1 transitions. [2020-07-01 10:33:57,327 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-01 10:33:57,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2 states to 0 states and 0 transitions. [2020-07-01 10:33:57,328 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-01 10:33:57,328 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-01 10:33:57,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-01 10:33:57,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-01 10:33:57,328 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 10:33:57,328 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 10:33:57,328 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 10:33:57,328 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-01 10:33:57,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-01 10:33:57,329 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-01 10:33:57,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-01 10:33:57,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 10:33:57 BasicIcfg [2020-07-01 10:33:57,335 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-01 10:33:57,338 INFO L168 Benchmark]: Toolchain (without parser) took 2485.63 ms. Allocated memory was 649.6 MB in the beginning and 691.5 MB in the end (delta: 41.9 MB). Free memory was 562.9 MB in the beginning and 438.8 MB in the end (delta: 124.0 MB). Peak memory consumption was 166.0 MB. Max. memory is 50.3 GB. [2020-07-01 10:33:57,338 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 583.3 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 10:33:57,339 INFO L168 Benchmark]: CACSL2BoogieTranslator took 306.42 ms. Allocated memory was 649.6 MB in the beginning and 691.5 MB in the end (delta: 41.9 MB). Free memory was 562.9 MB in the beginning and 654.4 MB in the end (delta: -91.5 MB). Peak memory consumption was 28.1 MB. Max. memory is 50.3 GB. [2020-07-01 10:33:57,340 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.84 ms. Allocated memory is still 691.5 MB. Free memory was 654.4 MB in the beginning and 652.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-07-01 10:33:57,340 INFO L168 Benchmark]: Boogie Preprocessor took 23.78 ms. Allocated memory is still 691.5 MB. Free memory was 652.2 MB in the beginning and 651.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-07-01 10:33:57,341 INFO L168 Benchmark]: RCFGBuilder took 265.31 ms. Allocated memory is still 691.5 MB. Free memory was 651.1 MB in the beginning and 633.3 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 50.3 GB. [2020-07-01 10:33:57,341 INFO L168 Benchmark]: BlockEncodingV2 took 97.55 ms. Allocated memory is still 691.5 MB. Free memory was 633.3 MB in the beginning and 625.8 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 50.3 GB. [2020-07-01 10:33:57,342 INFO L168 Benchmark]: TraceAbstraction took 617.74 ms. Allocated memory is still 691.5 MB. Free memory was 624.7 MB in the beginning and 572.8 MB in the end (delta: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 50.3 GB. [2020-07-01 10:33:57,342 INFO L168 Benchmark]: BuchiAutomizer took 1131.11 ms. Allocated memory is still 691.5 MB. Free memory was 572.8 MB in the beginning and 438.8 MB in the end (delta: 133.9 MB). Peak memory consumption was 133.9 MB. Max. memory is 50.3 GB. [2020-07-01 10:33:57,346 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 17 locations, 18 edges - StatisticsResult: Encoded RCFG 11 locations, 18 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 583.3 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 306.42 ms. Allocated memory was 649.6 MB in the beginning and 691.5 MB in the end (delta: 41.9 MB). Free memory was 562.9 MB in the beginning and 654.4 MB in the end (delta: -91.5 MB). Peak memory consumption was 28.1 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 37.84 ms. Allocated memory is still 691.5 MB. Free memory was 654.4 MB in the beginning and 652.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 23.78 ms. Allocated memory is still 691.5 MB. Free memory was 652.2 MB in the beginning and 651.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 265.31 ms. Allocated memory is still 691.5 MB. Free memory was 651.1 MB in the beginning and 633.3 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 97.55 ms. Allocated memory is still 691.5 MB. Free memory was 633.3 MB in the beginning and 625.8 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 50.3 GB. * TraceAbstraction took 617.74 ms. Allocated memory is still 691.5 MB. Free memory was 624.7 MB in the beginning and 572.8 MB in the end (delta: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 1131.11 ms. Allocated memory is still 691.5 MB. Free memory was 572.8 MB in the beginning and 438.8 MB in the end (delta: 133.9 MB). Peak memory consumption was 133.9 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant [2020-07-01 10:33:57,354 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 10:33:57,355 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 10:33:57,355 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 10:33:57,355 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((1 == \valid[a] && 0 == a) && 1 <= unknown-#StackHeapBarrier-unknown) && 4192 == unknown-#length-unknown[a] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 0.5s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7 SDtfs, 34 SDslu, 2 SDs, 0 SdLazy, 35 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 17 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 12 NumberOfCodeBlocks, 12 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 48 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[a][a + 12] + 1 and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.1s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 5 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 5 SDtfs, 45 SDslu, 0 SDs, 0 SdLazy, 60 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital87 mio100 ax100 hnf100 lsp93 ukn50 mio100 lsp43 div100 bol100 ite100 ukn100 eq144 hnf92 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 1 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-07-01 10:33:51.593 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp/BenchExec_run_NSOuUo/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 10:33:57.784 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check