YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 10:02:11,069 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 10:02:11,071 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 10:02:11,082 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 10:02:11,083 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 10:02:11,084 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 10:02:11,085 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 10:02:11,086 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 10:02:11,088 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 10:02:11,089 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 10:02:11,090 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 10:02:11,090 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 10:02:11,091 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 10:02:11,092 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 10:02:11,093 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 10:02:11,093 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 10:02:11,094 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 10:02:11,096 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 10:02:11,098 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 10:02:11,099 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 10:02:11,100 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 10:02:11,101 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 10:02:11,103 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 10:02:11,104 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 10:02:11,104 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 10:02:11,105 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 10:02:11,105 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 10:02:11,106 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 10:02:11,106 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 10:02:11,107 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 10:02:11,108 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 10:02:11,108 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 10:02:11,110 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 10:02:11,110 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 10:02:11,110 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 10:02:11,111 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 10:02:11,111 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 10:02:11,112 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 10:02:11,112 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 10:02:11,113 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 10:02:11,128 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 10:02:11,128 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 10:02:11,129 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 10:02:11,129 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 10:02:11,129 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 10:02:11,130 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:02:11,130 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 10:02:11,130 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 10:02:11,130 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 10:02:11,130 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 10:02:11,130 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 10:02:11,130 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 10:02:11,131 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 10:02:11,131 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 10:02:11,131 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:02:11,131 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 10:02:11,131 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 10:02:11,131 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 10:02:11,132 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 10:02:11,132 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 10:02:11,132 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 10:02:11,132 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 10:02:11,132 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 10:02:11,132 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 10:02:11,133 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:02:11,133 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 10:02:11,133 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 10:02:11,133 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 10:02:11,133 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 10:02:11,160 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 10:02:11,174 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 10:02:11,177 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 10:02:11,179 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 10:02:11,179 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 10:02:11,180 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 10:02:11,248 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/4e6ae958611246debcf0915fb77f6e47/FLAGdbd43c630 !SESSION 2020-06-22 10:02:08.691 ----------------------------------------------- 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/sandbox2/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/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.cdt.core 1 0 2020-06-22 10:02:11.520 !MESSAGE Indexed 'FLAGdbd43c630' (0 sources, 0 headers) in 0.006 sec: 0 declarations; 0 references; 0 unresolved inclusions; 0 syntax errors; 0 unresolved names (0%) [2020-06-22 10:02:11,609 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 10:02:11,610 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 10:02:11,610 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 10:02:11,616 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/4e6ae958611246debcf0915fb77f6e47/FLAGdbd43c630 [2020-06-22 10:02:12,043 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/4e6ae958611246debcf0915fb77f6e47 [2020-06-22 10:02:12,055 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 10:02:12,057 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 10:02:12,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 10:02:12,058 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 10:02:12,061 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 10:02:12,062 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:02:12" (1/1) ... [2020-06-22 10:02:12,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a6adcae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:02:12, skipping insertion in model container [2020-06-22 10:02:12,066 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:02:12" (1/1) ... [2020-06-22 10:02:12,073 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 10:02:12,092 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 10:02:12,311 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:02:12,323 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 10:02:12,342 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:02:12,358 INFO L195 MainTranslator]: Completed translation [2020-06-22 10:02:12,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:02:12 WrapperNode [2020-06-22 10:02:12,359 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 10:02:12,360 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 10:02:12,360 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 10:02:12,360 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 10:02:12,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:02:12" (1/1) ... [2020-06-22 10:02:12,378 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:02:12" (1/1) ... [2020-06-22 10:02:12,400 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 10:02:12,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 10:02:12,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 10:02:12,400 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 10:02:12,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:02:12" (1/1) ... [2020-06-22 10:02:12,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:02:12" (1/1) ... [2020-06-22 10:02:12,413 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:02:12" (1/1) ... [2020-06-22 10:02:12,413 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:02:12" (1/1) ... [2020-06-22 10:02:12,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:02:12" (1/1) ... [2020-06-22 10:02:12,424 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:02:12" (1/1) ... [2020-06-22 10:02:12,425 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:02:12" (1/1) ... [2020-06-22 10:02:12,427 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 10:02:12,427 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 10:02:12,427 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 10:02:12,428 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 10:02:12,428 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:02:12" (1/1) ... No working directory specified, using /export/starexec/sandbox2/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-06-22 10:02:12,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 10:02:12,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 10:02:12,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 10:02:12,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 10:02:12,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 10:02:12,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 10:02:12,772 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 10:02:12,773 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2020-06-22 10:02:12,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:02:12 BoogieIcfgContainer [2020-06-22 10:02:12,774 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 10:02:12,775 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 10:02:12,775 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 10:02:12,777 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 10:02:12,778 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:02:12" (1/1) ... [2020-06-22 10:02:12,796 INFO L313 BlockEncoder]: Initial Icfg 37 locations, 43 edges [2020-06-22 10:02:12,798 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 10:02:12,798 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 10:02:12,799 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 10:02:12,799 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:02:12,801 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 10:02:12,802 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 10:02:12,802 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 10:02:12,826 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 10:02:12,853 INFO L200 BlockEncoder]: SBE split 16 edges [2020-06-22 10:02:12,858 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-06-22 10:02:12,860 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:02:12,888 INFO L100 BaseMinimizeStates]: Removed 16 edges and 8 locations by large block encoding [2020-06-22 10:02:12,890 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 10:02:12,892 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 10:02:12,892 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:02:12,892 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 10:02:12,893 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 10:02:12,893 INFO L313 BlockEncoder]: Encoded RCFG 28 locations, 48 edges [2020-06-22 10:02:12,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:02:12 BasicIcfg [2020-06-22 10:02:12,894 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 10:02:12,895 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 10:02:12,895 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 10:02:12,899 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 10:02:12,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 10:02:12" (1/4) ... [2020-06-22 10:02:12,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ff0dd08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:02:12, skipping insertion in model container [2020-06-22 10:02:12,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:02:12" (2/4) ... [2020-06-22 10:02:12,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ff0dd08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:02:12, skipping insertion in model container [2020-06-22 10:02:12,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:02:12" (3/4) ... [2020-06-22 10:02:12,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ff0dd08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:02:12, skipping insertion in model container [2020-06-22 10:02:12,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:02:12" (4/4) ... [2020-06-22 10:02:12,903 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:02:12,913 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 10:02:12,921 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2020-06-22 10:02:12,938 INFO L257 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2020-06-22 10:02:12,967 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:02:12,968 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 10:02:12,968 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 10:02:12,968 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:02:12,969 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:02:12,969 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:02:12,969 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 10:02:12,969 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:02:12,969 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 10:02:12,984 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2020-06-22 10:02:12,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:02:12,990 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:02:12,991 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:02:12,991 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 10:02:12,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:02:12,997 INFO L82 PathProgramCache]: Analyzing trace with hash 186803813, now seen corresponding path program 1 times [2020-06-22 10:02:12,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:02:12,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:02:13,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:02:13,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:02:13,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:02:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:02:13,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:02:13,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:02:13,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:02:13,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:02:13,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:02:13,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:02:13,187 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 3 states. [2020-06-22 10:02:13,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:02:13,315 INFO L93 Difference]: Finished difference Result 28 states and 48 transitions. [2020-06-22 10:02:13,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:02:13,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 10:02:13,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:02:13,331 INFO L225 Difference]: With dead ends: 28 [2020-06-22 10:02:13,332 INFO L226 Difference]: Without dead ends: 21 [2020-06-22 10:02:13,335 INFO L631 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-06-22 10:02:13,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-06-22 10:02:13,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-06-22 10:02:13,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 10:02:13,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 34 transitions. [2020-06-22 10:02:13,371 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 34 transitions. Word has length 5 [2020-06-22 10:02:13,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:02:13,371 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 34 transitions. [2020-06-22 10:02:13,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:02:13,371 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2020-06-22 10:02:13,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:02:13,372 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:02:13,372 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:02:13,372 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 10:02:13,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:02:13,372 INFO L82 PathProgramCache]: Analyzing trace with hash 186803815, now seen corresponding path program 1 times [2020-06-22 10:02:13,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:02:13,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:02:13,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:02:13,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:02:13,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:02:13,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:02:13,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:02:13,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:02:13,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:02:13,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:02:13,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:02:13,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:02:13,416 INFO L87 Difference]: Start difference. First operand 21 states and 34 transitions. Second operand 3 states. [2020-06-22 10:02:13,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:02:13,534 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2020-06-22 10:02:13,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:02:13,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 10:02:13,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:02:13,535 INFO L225 Difference]: With dead ends: 46 [2020-06-22 10:02:13,535 INFO L226 Difference]: Without dead ends: 39 [2020-06-22 10:02:13,536 INFO L631 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-06-22 10:02:13,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-06-22 10:02:13,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2020-06-22 10:02:13,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-06-22 10:02:13,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 56 transitions. [2020-06-22 10:02:13,543 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 56 transitions. Word has length 5 [2020-06-22 10:02:13,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:02:13,544 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 56 transitions. [2020-06-22 10:02:13,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:02:13,544 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions. [2020-06-22 10:02:13,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:02:13,544 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:02:13,544 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:02:13,545 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 10:02:13,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:02:13,545 INFO L82 PathProgramCache]: Analyzing trace with hash 186803816, now seen corresponding path program 1 times [2020-06-22 10:02:13,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:02:13,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:02:13,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:02:13,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:02:13,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:02:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:02:13,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:02:13,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:02:13,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:02:13,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:02:13,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:02:13,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:02:13,593 INFO L87 Difference]: Start difference. First operand 32 states and 56 transitions. Second operand 4 states. [2020-06-22 10:02:13,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:02:13,673 INFO L93 Difference]: Finished difference Result 39 states and 56 transitions. [2020-06-22 10:02:13,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:02:13,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-06-22 10:02:13,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:02:13,675 INFO L225 Difference]: With dead ends: 39 [2020-06-22 10:02:13,675 INFO L226 Difference]: Without dead ends: 32 [2020-06-22 10:02:13,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:02:13,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-06-22 10:02:13,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-06-22 10:02:13,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-06-22 10:02:13,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2020-06-22 10:02:13,680 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 5 [2020-06-22 10:02:13,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:02:13,680 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2020-06-22 10:02:13,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:02:13,681 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2020-06-22 10:02:13,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 10:02:13,681 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:02:13,681 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:02:13,682 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 10:02:13,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:02:13,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1551395682, now seen corresponding path program 1 times [2020-06-22 10:02:13,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:02:13,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:02:13,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:02:13,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:02:13,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:02:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:02:13,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:02:13,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:02:13,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:02:13,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:02:13,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:02:13,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:02:13,731 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand 4 states. [2020-06-22 10:02:13,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:02:13,801 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2020-06-22 10:02:13,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:02:13,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-06-22 10:02:13,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:02:13,802 INFO L225 Difference]: With dead ends: 32 [2020-06-22 10:02:13,802 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 10:02:13,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:02:13,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 10:02:13,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 10:02:13,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 10:02:13,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 10:02:13,803 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2020-06-22 10:02:13,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:02:13,803 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:02:13,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:02:13,804 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:02:13,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 10:02:13,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 10:02:13,877 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2020-06-22 10:02:13,877 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2020-06-22 10:02:13,877 INFO L448 ceAbstractionStarter]: For program point L13-1(lines 13 15) no Hoare annotation was computed. [2020-06-22 10:02:13,878 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. [2020-06-22 10:02:13,878 INFO L448 ceAbstractionStarter]: For program point L11-1(lines 11 15) no Hoare annotation was computed. [2020-06-22 10:02:13,878 INFO L444 ceAbstractionStarter]: At program point L9-2(lines 9 21) the Hoare annotation is: (and (<= (* 4 ULTIMATE.start_test_fun_~N) (select |#length| ULTIMATE.start_test_fun_~a.base)) (= 0 ULTIMATE.start_test_fun_~a.offset) (<= 0 (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~a.base))) [2020-06-22 10:02:13,878 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 10:02:13,879 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 28) no Hoare annotation was computed. [2020-06-22 10:02:13,879 INFO L448 ceAbstractionStarter]: For program point L26-2(lines 26 28) no Hoare annotation was computed. [2020-06-22 10:02:13,879 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 10:02:13,879 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2020-06-22 10:02:13,879 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 10:02:13,879 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 19) no Hoare annotation was computed. [2020-06-22 10:02:13,879 INFO L448 ceAbstractionStarter]: For program point L18-2(line 18) no Hoare annotation was computed. [2020-06-22 10:02:13,879 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 10:02:13,880 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 10:02:13,880 INFO L448 ceAbstractionStarter]: For program point L16-2(lines 9 21) no Hoare annotation was computed. [2020-06-22 10:02:13,880 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 10:02:13,880 INFO L448 ceAbstractionStarter]: For program point L16-3(lines 16 19) no Hoare annotation was computed. [2020-06-22 10:02:13,880 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 10:02:13,880 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 10:02:13,880 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 10:02:13,880 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 10:02:13,881 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 10:02:13,881 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:02:13,881 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:02:13,881 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 10:02:13,881 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 10:02:13,881 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 10:02:13,890 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:02:13,897 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:02:13,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:02:13 BasicIcfg [2020-06-22 10:02:13,900 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 10:02:13,900 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 10:02:13,901 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 10:02:13,904 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 10:02:13,905 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:02:13,905 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 10:02:12" (1/5) ... [2020-06-22 10:02:13,906 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@78e17124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:02:13, skipping insertion in model container [2020-06-22 10:02:13,906 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:02:13,906 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:02:12" (2/5) ... [2020-06-22 10:02:13,906 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@78e17124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:02:13, skipping insertion in model container [2020-06-22 10:02:13,906 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:02:13,907 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:02:12" (3/5) ... [2020-06-22 10:02:13,907 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@78e17124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:02:13, skipping insertion in model container [2020-06-22 10:02:13,907 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:02:13,907 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:02:12" (4/5) ... [2020-06-22 10:02:13,907 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@78e17124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:02:13, skipping insertion in model container [2020-06-22 10:02:13,907 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:02:13,908 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:02:13" (5/5) ... [2020-06-22 10:02:13,910 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:02:13,932 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:02:13,932 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 10:02:13,932 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 10:02:13,932 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:02:13,932 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:02:13,933 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:02:13,933 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 10:02:13,933 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:02:13,933 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 10:02:13,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2020-06-22 10:02:13,943 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-06-22 10:02:13,943 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:02:13,943 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:02:13,948 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 10:02:13,948 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:02:13,948 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 10:02:13,948 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2020-06-22 10:02:13,950 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-06-22 10:02:13,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:02:13,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:02:13,951 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 10:02:13,951 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:02:13,957 INFO L794 eck$LassoCheckResult]: Stem: 26#ULTIMATE.startENTRYtrue [168] ULTIMATE.startENTRY-->L26: Formula: (and (= (store |v_#valid_22| 0 0) |v_#valid_21|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_21|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_#t~malloc8.offset, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet7, #NULL.base] 19#L26true [116] L26-->L26-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 30#L26-2true [137] L26-2-->L9-2: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc8.base_4|) 0) (= |v_ULTIMATE.start_test_fun_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= v_ULTIMATE.start_test_fun_~i~0_3 0) (= v_ULTIMATE.start_test_fun_~a.offset_1 |v_ULTIMATE.start_test_fun_#in~a.offset_1|) (= |v_ULTIMATE.start_test_fun_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0) (= v_ULTIMATE.start_test_fun_~a.base_1 |v_ULTIMATE.start_test_fun_#in~a.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1)) (= |v_ULTIMATE.start_test_fun_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_test_fun_~N_1 |v_ULTIMATE.start_test_fun_#in~N_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc8.base_4| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_test_fun_#in~a.base=|v_ULTIMATE.start_test_fun_#in~a.base_1|, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_1, ULTIMATE.start_test_fun_#t~post0=|v_ULTIMATE.start_test_fun_#t~post0_3|, ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_1, ULTIMATE.start_test_fun_#in~N=|v_ULTIMATE.start_test_fun_#in~N_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_1, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#in~a.offset=|v_ULTIMATE.start_test_fun_#in~a.offset_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#t~post6=|v_ULTIMATE.start_test_fun_#t~post6_1|, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_1|, #valid=|v_#valid_5|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_1, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_test_fun_#in~a.base, ULTIMATE.start_test_fun_~res~0, ULTIMATE.start_test_fun_#t~post0, ULTIMATE.start_test_fun_~a.offset, ULTIMATE.start_test_fun_#in~N, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_~a.base, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#in~a.offset, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~post6, ULTIMATE.start_test_fun_#t~mem1, #valid, ULTIMATE.start_main_#t~malloc8.offset, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0] 7#L9-2true [2020-06-22 10:02:13,958 INFO L796 eck$LassoCheckResult]: Loop: 7#L9-2true [83] L9-2-->L11: Formula: (and (= v_ULTIMATE.start_test_fun_~res~0_3 1) (< v_ULTIMATE.start_test_fun_~i~0_7 v_ULTIMATE.start_test_fun_~N_4)) InVars {ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_7} OutVars{ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_7, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_3} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~res~0] 27#L11true [106] L11-->L11-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_8))) (let ((.cse0 (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1))) (and (= |v_ULTIMATE.start_test_fun_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_test_fun_~a.base_3) .cse0)) (<= 0 .cse0) (<= (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1 4) (select |v_#length_3| v_ULTIMATE.start_test_fun_~a.base_3)) (= 1 (select |v_#valid_7| v_ULTIMATE.start_test_fun_~a.base_3))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_8} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1] 25#L11-1true [103] L11-1-->L16-2: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem1_4| 0) (= v_ULTIMATE.start_test_fun_~res~0_4 1)) InVars {ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_4|} OutVars{ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_3|, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_4} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1, ULTIMATE.start_test_fun_~res~0] 17#L16-2true [94] L16-2-->L16: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_12))) (let ((.cse0 (+ v_ULTIMATE.start_test_fun_~a.offset_7 .cse1))) (and (<= 0 .cse0) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~a.base_9)) (<= (+ v_ULTIMATE.start_test_fun_~a.offset_7 .cse1 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~a.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_test_fun_~a.base_9) .cse0))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_7, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_9, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_12} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_7, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_9, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 4#L16true [128] L16-->L16-3: Formula: (>= 0 |v_ULTIMATE.start_test_fun_#t~mem3_4|) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_4|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 16#L16-3true [173] L16-3-->L9-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_27))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_18))) (and (= (store |v_#memory_int_12| v_ULTIMATE.start_test_fun_~a.base_25 (store (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~a.base_25) .cse0 v_ULTIMATE.start_test_fun_~res~0_11)) |v_#memory_int_11|) (<= (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_18 4) (select |v_#length_18| v_ULTIMATE.start_test_fun_~a.base_25)) (<= 0 .cse0) (= 1 (select |v_#valid_30| v_ULTIMATE.start_test_fun_~a.base_25)) (= (+ v_ULTIMATE.start_test_fun_~i~0_27 1) v_ULTIMATE.start_test_fun_~i~0_26)))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_18, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_25, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_11, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_27} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_18, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_25, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_11, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_#t~post0=|v_ULTIMATE.start_test_fun_#t~post0_4|, #length=|v_#length_18|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_26} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~post0, ULTIMATE.start_test_fun_~i~0] 7#L9-2true [2020-06-22 10:02:13,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:02:13,959 INFO L82 PathProgramCache]: Analyzing trace with hash 194972, now seen corresponding path program 1 times [2020-06-22 10:02:13,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:02:13,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:02:13,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:02:13,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:02:13,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:02:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:02:13,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:02:13,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:02:13,996 INFO L82 PathProgramCache]: Analyzing trace with hash -930187908, now seen corresponding path program 1 times [2020-06-22 10:02:13,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:02:13,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:02:13,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:02:13,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:02:13,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:02:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:02:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:02:14,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:02:14,015 INFO L82 PathProgramCache]: Analyzing trace with hash 907579095, now seen corresponding path program 1 times [2020-06-22 10:02:14,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:02:14,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:02:14,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:02:14,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:02:14,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:02:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:02:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:02:14,268 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:02:14,270 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:02:14,290 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:02:14,290 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:02:14,291 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:02:14,291 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:02:14,291 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:02:14,291 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:02:14,291 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-06-22 10:02:14,291 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:02:14,292 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:02:14,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:02:14,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:02:14,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:02:14,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:02:14,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:02:14,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:02:14,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:02:14,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:02:14,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:02:14,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:02:14,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:02:14,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:02:14,763 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:02:14,779 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:02:14,782 INFO L122 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-06-22 10:02:14,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:02:14,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:02:14,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:02:14,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:02:14,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:02:14,787 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:02:14,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:02:14,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:02:14,789 INFO L122 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-06-22 10:02:14,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:02:14,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:02:14,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:02:14,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:02:14,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:02:14,791 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:02:14,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:02:14,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:02:14,792 INFO L122 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-06-22 10:02:14,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:02:14,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:02:14,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:02:14,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:02:14,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:02:14,793 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:02:14,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:02:14,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:02:14,795 INFO L122 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-06-22 10:02:14,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:02:14,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:02:14,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:02:14,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:02:14,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:02:14,796 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:02:14,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:02:14,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:02:14,797 INFO L122 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-06-22 10:02:14,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:02:14,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:02:14,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:02:14,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:02:14,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:02:14,799 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:02:14,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:02:14,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:02:14,800 INFO L122 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-06-22 10:02:14,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:02:14,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:02:14,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:02:14,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:02:14,803 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:02:14,804 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:02:14,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:02:14,807 INFO L122 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-06-22 10:02:14,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:02:14,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:02:14,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:02:14,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:02:14,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:02:14,809 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:02:14,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:02:14,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:02:14,810 INFO L122 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-06-22 10:02:14,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:02:14,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:02:14,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:02:14,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:02:14,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:02:14,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:02:14,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:02:14,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:02:14,815 INFO L122 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-06-22 10:02:14,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:02:14,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:02:14,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:02:14,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:02:14,822 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:02:14,822 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:02:14,868 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:02:14,907 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-06-22 10:02:14,907 INFO L444 ModelExtractionUtils]: 27 out of 34 variables were initially zero. Simplification set additionally 3 variables to zero. [2020-06-22 10:02:14,910 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:02:14,912 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:02:14,913 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:02:14,913 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~a.offset, ULTIMATE.start_test_fun_~i~0, v_rep(select #length ULTIMATE.start_test_fun_~a.base)_1) = -1*ULTIMATE.start_test_fun_~a.offset - 4*ULTIMATE.start_test_fun_~i~0 + 1*v_rep(select #length ULTIMATE.start_test_fun_~a.base)_1 Supporting invariants [] [2020-06-22 10:02:14,930 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-06-22 10:02:14,933 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:02:14,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:02:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:02:14,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:02:14,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:02:14,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:02:14,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:02:14,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:02:15,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:02:15,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:02:15,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:02:15,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:02:15,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:02:15,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:02:15,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:02:15,136 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 10:02:15,139 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-06-22 10:02:15,140 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 28 states. Second operand 4 states. [2020-06-22 10:02:15,366 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 28 states.. Second operand 4 states. Result 84 states and 129 transitions. Complement of second has 7 states. [2020-06-22 10:02:15,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 10:02:15,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 10:02:15,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2020-06-22 10:02:15,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 92 transitions. Stem has 3 letters. Loop has 6 letters. [2020-06-22 10:02:15,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:02:15,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 92 transitions. Stem has 9 letters. Loop has 6 letters. [2020-06-22 10:02:15,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:02:15,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 92 transitions. Stem has 3 letters. Loop has 12 letters. [2020-06-22 10:02:15,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:02:15,381 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 129 transitions. [2020-06-22 10:02:15,386 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2020-06-22 10:02:15,387 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 35 states and 50 transitions. [2020-06-22 10:02:15,388 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-06-22 10:02:15,389 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-06-22 10:02:15,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 50 transitions. [2020-06-22 10:02:15,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:02:15,390 INFO L706 BuchiCegarLoop]: Abstraction has 35 states and 50 transitions. [2020-06-22 10:02:15,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 50 transitions. [2020-06-22 10:02:15,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-06-22 10:02:15,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-06-22 10:02:15,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2020-06-22 10:02:15,394 INFO L729 BuchiCegarLoop]: Abstraction has 35 states and 50 transitions. [2020-06-22 10:02:15,394 INFO L609 BuchiCegarLoop]: Abstraction has 35 states and 50 transitions. [2020-06-22 10:02:15,394 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 10:02:15,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 50 transitions. [2020-06-22 10:02:15,395 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2020-06-22 10:02:15,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:02:15,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:02:15,396 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 10:02:15,396 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:02:15,396 INFO L794 eck$LassoCheckResult]: Stem: 233#ULTIMATE.startENTRY [168] ULTIMATE.startENTRY-->L26: Formula: (and (= (store |v_#valid_22| 0 0) |v_#valid_21|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_21|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_#t~malloc8.offset, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet7, #NULL.base] 211#L26 [116] L26-->L26-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 212#L26-2 [136] L26-2-->L9-2: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc8.base_4|) 0) (= |v_ULTIMATE.start_test_fun_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= v_ULTIMATE.start_test_fun_~i~0_3 0) (> |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= v_ULTIMATE.start_test_fun_~a.offset_1 |v_ULTIMATE.start_test_fun_#in~a.offset_1|) (= |v_ULTIMATE.start_test_fun_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0) (= v_ULTIMATE.start_test_fun_~a.base_1 |v_ULTIMATE.start_test_fun_#in~a.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1)) (= |v_ULTIMATE.start_test_fun_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_test_fun_~N_1 |v_ULTIMATE.start_test_fun_#in~N_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc8.base_4| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_test_fun_#in~a.base=|v_ULTIMATE.start_test_fun_#in~a.base_1|, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_1, ULTIMATE.start_test_fun_#t~post0=|v_ULTIMATE.start_test_fun_#t~post0_3|, ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_1, ULTIMATE.start_test_fun_#in~N=|v_ULTIMATE.start_test_fun_#in~N_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_1, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#in~a.offset=|v_ULTIMATE.start_test_fun_#in~a.offset_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#t~post6=|v_ULTIMATE.start_test_fun_#t~post6_1|, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_1|, #valid=|v_#valid_5|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_1, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_test_fun_#in~a.base, ULTIMATE.start_test_fun_~res~0, ULTIMATE.start_test_fun_#t~post0, ULTIMATE.start_test_fun_~a.offset, ULTIMATE.start_test_fun_#in~N, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_~a.base, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#in~a.offset, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~post6, ULTIMATE.start_test_fun_#t~mem1, #valid, ULTIMATE.start_main_#t~malloc8.offset, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0] 224#L9-2 [2020-06-22 10:02:15,397 INFO L796 eck$LassoCheckResult]: Loop: 224#L9-2 [83] L9-2-->L11: Formula: (and (= v_ULTIMATE.start_test_fun_~res~0_3 1) (< v_ULTIMATE.start_test_fun_~i~0_7 v_ULTIMATE.start_test_fun_~N_4)) InVars {ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_7} OutVars{ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_7, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_3} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~res~0] 225#L11 [106] L11-->L11-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_8))) (let ((.cse0 (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1))) (and (= |v_ULTIMATE.start_test_fun_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_test_fun_~a.base_3) .cse0)) (<= 0 .cse0) (<= (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1 4) (select |v_#length_3| v_ULTIMATE.start_test_fun_~a.base_3)) (= 1 (select |v_#valid_7| v_ULTIMATE.start_test_fun_~a.base_3))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_8} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1] 234#L11-1 [103] L11-1-->L16-2: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem1_4| 0) (= v_ULTIMATE.start_test_fun_~res~0_4 1)) InVars {ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_4|} OutVars{ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_3|, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_4} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1, ULTIMATE.start_test_fun_~res~0] 241#L16-2 [94] L16-2-->L16: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_12))) (let ((.cse0 (+ v_ULTIMATE.start_test_fun_~a.offset_7 .cse1))) (and (<= 0 .cse0) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~a.base_9)) (<= (+ v_ULTIMATE.start_test_fun_~a.offset_7 .cse1 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~a.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_test_fun_~a.base_9) .cse0))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_7, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_9, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_12} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_7, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_9, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 239#L16 [128] L16-->L16-3: Formula: (>= 0 |v_ULTIMATE.start_test_fun_#t~mem3_4|) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_4|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 237#L16-3 [173] L16-3-->L9-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_27))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_18))) (and (= (store |v_#memory_int_12| v_ULTIMATE.start_test_fun_~a.base_25 (store (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~a.base_25) .cse0 v_ULTIMATE.start_test_fun_~res~0_11)) |v_#memory_int_11|) (<= (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_18 4) (select |v_#length_18| v_ULTIMATE.start_test_fun_~a.base_25)) (<= 0 .cse0) (= 1 (select |v_#valid_30| v_ULTIMATE.start_test_fun_~a.base_25)) (= (+ v_ULTIMATE.start_test_fun_~i~0_27 1) v_ULTIMATE.start_test_fun_~i~0_26)))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_18, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_25, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_11, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_27} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_18, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_25, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_11, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_#t~post0=|v_ULTIMATE.start_test_fun_#t~post0_4|, #length=|v_#length_18|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_26} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~post0, ULTIMATE.start_test_fun_~i~0] 224#L9-2 [2020-06-22 10:02:15,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:02:15,397 INFO L82 PathProgramCache]: Analyzing trace with hash 194971, now seen corresponding path program 1 times [2020-06-22 10:02:15,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:02:15,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:02:15,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:02:15,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:02:15,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:02:15,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:02:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:02:15,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:02:15,411 INFO L82 PathProgramCache]: Analyzing trace with hash -930187908, now seen corresponding path program 2 times [2020-06-22 10:02:15,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:02:15,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:02:15,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:02:15,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:02:15,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:02:15,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:02:15,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:02:15,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:02:15,422 INFO L82 PathProgramCache]: Analyzing trace with hash 20075414, now seen corresponding path program 1 times [2020-06-22 10:02:15,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:02:15,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:02:15,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:02:15,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:02:15,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:02:15,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:02:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:02:15,609 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:02:15,609 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:02:15,609 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:02:15,609 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:02:15,609 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:02:15,610 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:02:15,610 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:02:15,610 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:02:15,610 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso [2020-06-22 10:02:15,610 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:02:15,610 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:02:15,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:02:15,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:02:15,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:02:15,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:02:15,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:02:15,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:02:15,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:02:15,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:02:15,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:02:15,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:02:15,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:02:15,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:02:15,987 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:02:15,987 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:02:15,987 INFO L122 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-06-22 10:02:15,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:02:15,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:02:15,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:02:15,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:02:15,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:02:15,989 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:02:15,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:02:15,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:02:15,991 INFO L122 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-06-22 10:02:15,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:02:15,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:02:15,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:02:15,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:02:15,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:02:15,992 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:02:15,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:02:15,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:02:15,993 INFO L122 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-06-22 10:02:15,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:02:15,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:02:15,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:02:15,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:02:15,995 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:02:15,995 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:02:15,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:02:15,998 INFO L122 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-06-22 10:02:15,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:02:15,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:02:15,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:02:15,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:02:15,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:02:15,999 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:02:15,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:02:15,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:02:16,000 INFO L122 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-06-22 10:02:16,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:02:16,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:02:16,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:02:16,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:02:16,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:02:16,001 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:02:16,001 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:02:16,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:02:16,002 INFO L122 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-06-22 10:02:16,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:02:16,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:02:16,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:02:16,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:02:16,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:02:16,003 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:02:16,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:02:16,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:02:16,004 INFO L122 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-06-22 10:02:16,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:02:16,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:02:16,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:02:16,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:02:16,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:02:16,005 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:02:16,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:02:16,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:02:16,008 INFO L122 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-06-22 10:02:16,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:02:16,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:02:16,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:02:16,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:02:16,010 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:02:16,010 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:02:16,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:02:16,018 INFO L122 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-06-22 10:02:16,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:02:16,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:02:16,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:02:16,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:02:16,022 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:02:16,022 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:02:16,042 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:02:16,058 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 10:02:16,058 INFO L444 ModelExtractionUtils]: 28 out of 34 variables were initially zero. Simplification set additionally 3 variables to zero. [2020-06-22 10:02:16,058 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:02:16,059 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:02:16,060 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:02:16,060 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0) = 1*ULTIMATE.start_test_fun_~N - 1*ULTIMATE.start_test_fun_~i~0 Supporting invariants [] [2020-06-22 10:02:16,066 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-06-22 10:02:16,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:02:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:02:16,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:02:16,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:02:16,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:02:16,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:02:16,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:02:16,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:02:16,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:02:16,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:02:16,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:02:16,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:02:16,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:02:16,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:02:16,212 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 10:02:16,212 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-06-22 10:02:16,212 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 35 states and 50 transitions. cyclomatic complexity: 18 Second operand 3 states. [2020-06-22 10:02:16,271 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 35 states and 50 transitions. cyclomatic complexity: 18. Second operand 3 states. Result 46 states and 66 transitions. Complement of second has 4 states. [2020-06-22 10:02:16,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 10:02:16,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 10:02:16,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2020-06-22 10:02:16,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 3 letters. Loop has 6 letters. [2020-06-22 10:02:16,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:02:16,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 9 letters. Loop has 6 letters. [2020-06-22 10:02:16,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:02:16,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 3 letters. Loop has 12 letters. [2020-06-22 10:02:16,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:02:16,277 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 66 transitions. [2020-06-22 10:02:16,278 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-06-22 10:02:16,279 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 45 states and 65 transitions. [2020-06-22 10:02:16,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-06-22 10:02:16,280 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-06-22 10:02:16,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 65 transitions. [2020-06-22 10:02:16,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:02:16,280 INFO L706 BuchiCegarLoop]: Abstraction has 45 states and 65 transitions. [2020-06-22 10:02:16,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 65 transitions. [2020-06-22 10:02:16,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 24. [2020-06-22 10:02:16,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-06-22 10:02:16,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2020-06-22 10:02:16,283 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2020-06-22 10:02:16,283 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2020-06-22 10:02:16,283 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 10:02:16,283 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 35 transitions. [2020-06-22 10:02:16,284 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 10:02:16,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:02:16,284 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:02:16,284 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:02:16,284 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 10:02:16,285 INFO L794 eck$LassoCheckResult]: Stem: 405#ULTIMATE.startENTRY [168] ULTIMATE.startENTRY-->L26: Formula: (and (= (store |v_#valid_22| 0 0) |v_#valid_21|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_21|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_#t~malloc8.offset, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet7, #NULL.base] 384#L26 [116] L26-->L26-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 385#L26-2 [137] L26-2-->L9-2: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc8.base_4|) 0) (= |v_ULTIMATE.start_test_fun_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= v_ULTIMATE.start_test_fun_~i~0_3 0) (= v_ULTIMATE.start_test_fun_~a.offset_1 |v_ULTIMATE.start_test_fun_#in~a.offset_1|) (= |v_ULTIMATE.start_test_fun_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0) (= v_ULTIMATE.start_test_fun_~a.base_1 |v_ULTIMATE.start_test_fun_#in~a.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1)) (= |v_ULTIMATE.start_test_fun_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_test_fun_~N_1 |v_ULTIMATE.start_test_fun_#in~N_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc8.base_4| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_test_fun_#in~a.base=|v_ULTIMATE.start_test_fun_#in~a.base_1|, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_1, ULTIMATE.start_test_fun_#t~post0=|v_ULTIMATE.start_test_fun_#t~post0_3|, ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_1, ULTIMATE.start_test_fun_#in~N=|v_ULTIMATE.start_test_fun_#in~N_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_1, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#in~a.offset=|v_ULTIMATE.start_test_fun_#in~a.offset_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#t~post6=|v_ULTIMATE.start_test_fun_#t~post6_1|, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_1|, #valid=|v_#valid_5|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_1, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_test_fun_#in~a.base, ULTIMATE.start_test_fun_~res~0, ULTIMATE.start_test_fun_#t~post0, ULTIMATE.start_test_fun_~a.offset, ULTIMATE.start_test_fun_#in~N, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_~a.base, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#in~a.offset, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~post6, ULTIMATE.start_test_fun_#t~mem1, #valid, ULTIMATE.start_main_#t~malloc8.offset, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0] 397#L9-2 [83] L9-2-->L11: Formula: (and (= v_ULTIMATE.start_test_fun_~res~0_3 1) (< v_ULTIMATE.start_test_fun_~i~0_7 v_ULTIMATE.start_test_fun_~N_4)) InVars {ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_7} OutVars{ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_7, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_3} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~res~0] 399#L11 [106] L11-->L11-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_8))) (let ((.cse0 (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1))) (and (= |v_ULTIMATE.start_test_fun_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_test_fun_~a.base_3) .cse0)) (<= 0 .cse0) (<= (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1 4) (select |v_#length_3| v_ULTIMATE.start_test_fun_~a.base_3)) (= 1 (select |v_#valid_7| v_ULTIMATE.start_test_fun_~a.base_3))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_8} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1] 401#L11-1 [103] L11-1-->L16-2: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem1_4| 0) (= v_ULTIMATE.start_test_fun_~res~0_4 1)) InVars {ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_4|} OutVars{ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_3|, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_4} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1, ULTIMATE.start_test_fun_~res~0] 392#L16-2 [2020-06-22 10:02:16,285 INFO L796 eck$LassoCheckResult]: Loop: 392#L16-2 [94] L16-2-->L16: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_12))) (let ((.cse0 (+ v_ULTIMATE.start_test_fun_~a.offset_7 .cse1))) (and (<= 0 .cse0) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~a.base_9)) (<= (+ v_ULTIMATE.start_test_fun_~a.offset_7 .cse1 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~a.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_test_fun_~a.base_9) .cse0))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_7, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_9, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_12} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_7, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_9, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 386#L16 [76] L16-->L17: Formula: (< 0 |v_ULTIMATE.start_test_fun_#t~mem3_6|) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 387#L17 [172] L17-->L18: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_25))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_17))) (and (<= 0 .cse0) (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~a.base_24)) (= (* v_ULTIMATE.start_test_fun_~res~0_10 (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~a.base_24) .cse0)) v_ULTIMATE.start_test_fun_~res~0_9) (<= (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_17 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~a.base_24))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_17, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_24, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_10, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_25} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_17, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_24, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_9, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_25} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_~res~0] 395#L18 [174] L18-->L18-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_28))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_19))) (and (= |v_ULTIMATE.start_test_fun_#t~post6_5| |v_ULTIMATE.start_test_fun_#t~mem5_5|) (<= 0 .cse0) (= |v_ULTIMATE.start_test_fun_#t~mem5_5| (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~a.base_26) .cse0)) (<= (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_19 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~a.base_26)) (= 1 (select |v_#valid_31| v_ULTIMATE.start_test_fun_~a.base_26))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_19, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_26, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_28} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_19, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_26, ULTIMATE.start_test_fun_#t~post6=|v_ULTIMATE.start_test_fun_#t~post6_5|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_28} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~post6] 391#L18-2 [175] L18-2-->L16-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_29))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_20))) (and (= 1 (select |v_#valid_32| v_ULTIMATE.start_test_fun_~a.base_27)) (= (store |v_#memory_int_15| v_ULTIMATE.start_test_fun_~a.base_27 (store (select |v_#memory_int_15| v_ULTIMATE.start_test_fun_~a.base_27) .cse0 (+ |v_ULTIMATE.start_test_fun_#t~post6_7| (- 1)))) |v_#memory_int_14|) (<= 0 .cse0) (<= (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_20 4) (select |v_#length_20| v_ULTIMATE.start_test_fun_~a.base_27))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_20, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_27, ULTIMATE.start_test_fun_#t~post6=|v_ULTIMATE.start_test_fun_#t~post6_7|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_15|, #length=|v_#length_20|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_29} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_20, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_27, ULTIMATE.start_test_fun_#t~post6=|v_ULTIMATE.start_test_fun_#t~post6_6|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_29} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~post6, #memory_int] 392#L16-2 [2020-06-22 10:02:16,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:02:16,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1513526708, now seen corresponding path program 1 times [2020-06-22 10:02:16,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:02:16,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:02:16,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:02:16,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:02:16,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:02:16,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:02:16,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:02:16,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:02:16,301 INFO L82 PathProgramCache]: Analyzing trace with hash 117875102, now seen corresponding path program 1 times [2020-06-22 10:02:16,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:02:16,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:02:16,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:02:16,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:02:16,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:02:16,305 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:02:16,306 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:02:16,306 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:02:16,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:02:16,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:02:16,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:02:16,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:02:16,373 INFO L82 PathProgramCache]: Analyzing trace with hash 303604683, now seen corresponding path program 1 times [2020-06-22 10:02:16,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:02:16,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:02:16,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:02:16,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:02:16,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:02:16,380 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:02:16,380 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:02:16,380 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:02:16,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:02:16,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:02:16,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:02:16,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:02:16,451 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2020-06-22 10:02:16,452 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:02:16,455 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:02:16,455 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:02:16,455 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:23, output treesize:3 [2020-06-22 10:02:16,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:02:16,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:02:16,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 10:02:16,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 10:02:16,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:02:16,552 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. cyclomatic complexity: 13 Second operand 5 states. [2020-06-22 10:02:16,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:02:16,610 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2020-06-22 10:02:16,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 10:02:16,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 45 transitions. [2020-06-22 10:02:16,615 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 10:02:16,615 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 29 states and 39 transitions. [2020-06-22 10:02:16,615 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-06-22 10:02:16,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-06-22 10:02:16,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 39 transitions. [2020-06-22 10:02:16,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:02:16,616 INFO L706 BuchiCegarLoop]: Abstraction has 29 states and 39 transitions. [2020-06-22 10:02:16,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 39 transitions. [2020-06-22 10:02:16,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2020-06-22 10:02:16,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 10:02:16,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2020-06-22 10:02:16,618 INFO L729 BuchiCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-06-22 10:02:16,618 INFO L609 BuchiCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-06-22 10:02:16,618 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 10:02:16,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 38 transitions. [2020-06-22 10:02:16,619 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 10:02:16,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:02:16,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:02:16,620 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:02:16,620 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 10:02:16,620 INFO L794 eck$LassoCheckResult]: Stem: 506#ULTIMATE.startENTRY [168] ULTIMATE.startENTRY-->L26: Formula: (and (= (store |v_#valid_22| 0 0) |v_#valid_21|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_21|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_#t~malloc8.offset, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet7, #NULL.base] 483#L26 [116] L26-->L26-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 484#L26-2 [137] L26-2-->L9-2: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc8.base_4|) 0) (= |v_ULTIMATE.start_test_fun_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= v_ULTIMATE.start_test_fun_~i~0_3 0) (= v_ULTIMATE.start_test_fun_~a.offset_1 |v_ULTIMATE.start_test_fun_#in~a.offset_1|) (= |v_ULTIMATE.start_test_fun_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0) (= v_ULTIMATE.start_test_fun_~a.base_1 |v_ULTIMATE.start_test_fun_#in~a.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1)) (= |v_ULTIMATE.start_test_fun_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_test_fun_~N_1 |v_ULTIMATE.start_test_fun_#in~N_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc8.base_4| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_test_fun_#in~a.base=|v_ULTIMATE.start_test_fun_#in~a.base_1|, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_1, ULTIMATE.start_test_fun_#t~post0=|v_ULTIMATE.start_test_fun_#t~post0_3|, ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_1, ULTIMATE.start_test_fun_#in~N=|v_ULTIMATE.start_test_fun_#in~N_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_1, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#in~a.offset=|v_ULTIMATE.start_test_fun_#in~a.offset_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#t~post6=|v_ULTIMATE.start_test_fun_#t~post6_1|, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_1|, #valid=|v_#valid_5|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_1, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_test_fun_#in~a.base, ULTIMATE.start_test_fun_~res~0, ULTIMATE.start_test_fun_#t~post0, ULTIMATE.start_test_fun_~a.offset, ULTIMATE.start_test_fun_#in~N, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_~a.base, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#in~a.offset, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~post6, ULTIMATE.start_test_fun_#t~mem1, #valid, ULTIMATE.start_main_#t~malloc8.offset, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0] 496#L9-2 [83] L9-2-->L11: Formula: (and (= v_ULTIMATE.start_test_fun_~res~0_3 1) (< v_ULTIMATE.start_test_fun_~i~0_7 v_ULTIMATE.start_test_fun_~N_4)) InVars {ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_7} OutVars{ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_7, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_3} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~res~0] 498#L11 [106] L11-->L11-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_8))) (let ((.cse0 (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1))) (and (= |v_ULTIMATE.start_test_fun_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_test_fun_~a.base_3) .cse0)) (<= 0 .cse0) (<= (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1 4) (select |v_#length_3| v_ULTIMATE.start_test_fun_~a.base_3)) (= 1 (select |v_#valid_7| v_ULTIMATE.start_test_fun_~a.base_3))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_8} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1] 500#L11-1 [143] L11-1-->L13: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem1_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_6|} OutVars{ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1] 501#L13 [111] L13-->L13-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_10))) (let ((.cse0 (+ v_ULTIMATE.start_test_fun_~a.offset_5 .cse1))) (and (= |v_ULTIMATE.start_test_fun_#t~mem2_2| (select (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~a.base_6) .cse0)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~a.base_6)) (<= (+ v_ULTIMATE.start_test_fun_~a.offset_5 .cse1 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~a.base_6)) (<= 0 .cse0)))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_5, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_6, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_10} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_5, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_6, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_2|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2] 507#L13-1 [109] L13-1-->L16-2: Formula: (and (< |v_ULTIMATE.start_test_fun_#t~mem2_4| 0) (= v_ULTIMATE.start_test_fun_~res~0_5 0)) InVars {ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_4|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_3|, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_~res~0] 490#L16-2 [2020-06-22 10:02:16,621 INFO L796 eck$LassoCheckResult]: Loop: 490#L16-2 [94] L16-2-->L16: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_12))) (let ((.cse0 (+ v_ULTIMATE.start_test_fun_~a.offset_7 .cse1))) (and (<= 0 .cse0) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~a.base_9)) (<= (+ v_ULTIMATE.start_test_fun_~a.offset_7 .cse1 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~a.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_test_fun_~a.base_9) .cse0))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_7, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_9, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_12} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_7, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_9, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 485#L16 [76] L16-->L17: Formula: (< 0 |v_ULTIMATE.start_test_fun_#t~mem3_6|) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 486#L17 [172] L17-->L18: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_25))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_17))) (and (<= 0 .cse0) (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~a.base_24)) (= (* v_ULTIMATE.start_test_fun_~res~0_10 (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~a.base_24) .cse0)) v_ULTIMATE.start_test_fun_~res~0_9) (<= (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_17 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~a.base_24))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_17, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_24, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_10, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_25} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_17, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_24, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_9, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_25} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_~res~0] 493#L18 [174] L18-->L18-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_28))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_19))) (and (= |v_ULTIMATE.start_test_fun_#t~post6_5| |v_ULTIMATE.start_test_fun_#t~mem5_5|) (<= 0 .cse0) (= |v_ULTIMATE.start_test_fun_#t~mem5_5| (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~a.base_26) .cse0)) (<= (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_19 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~a.base_26)) (= 1 (select |v_#valid_31| v_ULTIMATE.start_test_fun_~a.base_26))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_19, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_26, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_28} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_19, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_26, ULTIMATE.start_test_fun_#t~post6=|v_ULTIMATE.start_test_fun_#t~post6_5|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_28} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~post6] 489#L18-2 [175] L18-2-->L16-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_29))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_20))) (and (= 1 (select |v_#valid_32| v_ULTIMATE.start_test_fun_~a.base_27)) (= (store |v_#memory_int_15| v_ULTIMATE.start_test_fun_~a.base_27 (store (select |v_#memory_int_15| v_ULTIMATE.start_test_fun_~a.base_27) .cse0 (+ |v_ULTIMATE.start_test_fun_#t~post6_7| (- 1)))) |v_#memory_int_14|) (<= 0 .cse0) (<= (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_20 4) (select |v_#length_20| v_ULTIMATE.start_test_fun_~a.base_27))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_20, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_27, ULTIMATE.start_test_fun_#t~post6=|v_ULTIMATE.start_test_fun_#t~post6_7|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_15|, #length=|v_#length_20|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_29} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_20, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_27, ULTIMATE.start_test_fun_#t~post6=|v_ULTIMATE.start_test_fun_#t~post6_6|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_29} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~post6, #memory_int] 490#L16-2 [2020-06-22 10:02:16,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:02:16,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1494704966, now seen corresponding path program 1 times [2020-06-22 10:02:16,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:02:16,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:02:16,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:02:16,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:02:16,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:02:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:02:16,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:02:16,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:02:16,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 10:02:16,659 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 10:02:16,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:02:16,659 INFO L82 PathProgramCache]: Analyzing trace with hash 117875102, now seen corresponding path program 2 times [2020-06-22 10:02:16,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:02:16,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:02:16,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:02:16,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:02:16,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:02:16,662 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:02:16,662 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:02:16,663 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:02:16,679 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 10:02:16,688 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-06-22 10:02:16,688 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2020-06-22 10:02:16,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:02:16,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 10:02:16,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:02:16,764 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-06-22 10:02:16,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:02:16,837 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2020-06-22 10:02:16,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 10:02:16,841 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 48 transitions. [2020-06-22 10:02:16,842 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 10:02:16,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 48 transitions. [2020-06-22 10:02:16,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-06-22 10:02:16,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-06-22 10:02:16,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 48 transitions. [2020-06-22 10:02:16,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:02:16,843 INFO L706 BuchiCegarLoop]: Abstraction has 39 states and 48 transitions. [2020-06-22 10:02:16,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 48 transitions. [2020-06-22 10:02:16,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2020-06-22 10:02:16,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 10:02:16,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2020-06-22 10:02:16,846 INFO L729 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2020-06-22 10:02:16,846 INFO L609 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2020-06-22 10:02:16,846 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 10:02:16,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2020-06-22 10:02:16,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 10:02:16,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:02:16,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:02:16,847 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:02:16,847 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 10:02:16,848 INFO L794 eck$LassoCheckResult]: Stem: 583#ULTIMATE.startENTRY [168] ULTIMATE.startENTRY-->L26: Formula: (and (= (store |v_#valid_22| 0 0) |v_#valid_21|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_21|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_#t~malloc8.offset, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet7, #NULL.base] 560#L26 [116] L26-->L26-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 561#L26-2 [137] L26-2-->L9-2: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc8.base_4| |v_#StackHeapBarrier_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc8.base_4|) 0) (= |v_ULTIMATE.start_test_fun_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= v_ULTIMATE.start_test_fun_~i~0_3 0) (= v_ULTIMATE.start_test_fun_~a.offset_1 |v_ULTIMATE.start_test_fun_#in~a.offset_1|) (= |v_ULTIMATE.start_test_fun_#in~N_1| v_ULTIMATE.start_main_~array_size~0_7) (< |v_ULTIMATE.start_main_#t~malloc8.base_4| 0) (= |v_ULTIMATE.start_main_#t~malloc8.offset_4| 0) (= v_ULTIMATE.start_test_fun_~a.base_1 |v_ULTIMATE.start_test_fun_#in~a.base_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_4|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_4|) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc8.base_4| 1)) (= |v_ULTIMATE.start_test_fun_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_test_fun_~N_1 |v_ULTIMATE.start_test_fun_#in~N_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc8.base_4| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_6|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_4|, ULTIMATE.start_test_fun_#in~a.base=|v_ULTIMATE.start_test_fun_#in~a.base_1|, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_1, ULTIMATE.start_test_fun_#t~post0=|v_ULTIMATE.start_test_fun_#t~post0_3|, ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_1, ULTIMATE.start_test_fun_#in~N=|v_ULTIMATE.start_test_fun_#in~N_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_1, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#in~a.offset=|v_ULTIMATE.start_test_fun_#in~a.offset_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#t~post6=|v_ULTIMATE.start_test_fun_#t~post6_1|, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_1|, #valid=|v_#valid_5|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_4|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_1, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_test_fun_#in~a.base, ULTIMATE.start_test_fun_~res~0, ULTIMATE.start_test_fun_#t~post0, ULTIMATE.start_test_fun_~a.offset, ULTIMATE.start_test_fun_#in~N, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_~a.base, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#in~a.offset, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~post6, ULTIMATE.start_test_fun_#t~mem1, #valid, ULTIMATE.start_main_#t~malloc8.offset, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0] 573#L9-2 [83] L9-2-->L11: Formula: (and (= v_ULTIMATE.start_test_fun_~res~0_3 1) (< v_ULTIMATE.start_test_fun_~i~0_7 v_ULTIMATE.start_test_fun_~N_4)) InVars {ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_7} OutVars{ULTIMATE.start_test_fun_~N=v_ULTIMATE.start_test_fun_~N_4, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_7, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_3} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~res~0] 575#L11 [106] L11-->L11-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_8))) (let ((.cse0 (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1))) (and (= |v_ULTIMATE.start_test_fun_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_test_fun_~a.base_3) .cse0)) (<= 0 .cse0) (<= (+ v_ULTIMATE.start_test_fun_~a.offset_3 .cse1 4) (select |v_#length_3| v_ULTIMATE.start_test_fun_~a.base_3)) (= 1 (select |v_#valid_7| v_ULTIMATE.start_test_fun_~a.base_3))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_8} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_3, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_3, ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1] 577#L11-1 [143] L11-1-->L13: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem1_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_6|} OutVars{ULTIMATE.start_test_fun_#t~mem1=|v_ULTIMATE.start_test_fun_#t~mem1_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem1] 578#L13 [111] L13-->L13-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_10))) (let ((.cse0 (+ v_ULTIMATE.start_test_fun_~a.offset_5 .cse1))) (and (= |v_ULTIMATE.start_test_fun_#t~mem2_2| (select (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~a.base_6) .cse0)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~a.base_6)) (<= (+ v_ULTIMATE.start_test_fun_~a.offset_5 .cse1 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~a.base_6)) (<= 0 .cse0)))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_5, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_6, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_10} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_5, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_6, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_2|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_10} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2] 584#L13-1 [129] L13-1-->L16-2: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem2_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_6|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2] 567#L16-2 [2020-06-22 10:02:16,849 INFO L796 eck$LassoCheckResult]: Loop: 567#L16-2 [94] L16-2-->L16: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_12))) (let ((.cse0 (+ v_ULTIMATE.start_test_fun_~a.offset_7 .cse1))) (and (<= 0 .cse0) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~a.base_9)) (<= (+ v_ULTIMATE.start_test_fun_~a.offset_7 .cse1 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~a.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_test_fun_~a.base_9) .cse0))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_7, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_9, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_12} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_7, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_9, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 562#L16 [76] L16-->L17: Formula: (< 0 |v_ULTIMATE.start_test_fun_#t~mem3_6|) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 563#L17 [172] L17-->L18: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_25))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_17))) (and (<= 0 .cse0) (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~a.base_24)) (= (* v_ULTIMATE.start_test_fun_~res~0_10 (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~a.base_24) .cse0)) v_ULTIMATE.start_test_fun_~res~0_9) (<= (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_17 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~a.base_24))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_17, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_24, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_10, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_25} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_17, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_24, ULTIMATE.start_test_fun_~res~0=v_ULTIMATE.start_test_fun_~res~0_9, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_25} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_~res~0] 570#L18 [174] L18-->L18-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_28))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_19))) (and (= |v_ULTIMATE.start_test_fun_#t~post6_5| |v_ULTIMATE.start_test_fun_#t~mem5_5|) (<= 0 .cse0) (= |v_ULTIMATE.start_test_fun_#t~mem5_5| (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~a.base_26) .cse0)) (<= (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_19 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~a.base_26)) (= 1 (select |v_#valid_31| v_ULTIMATE.start_test_fun_~a.base_26))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_19, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_26, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_28} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_19, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_26, ULTIMATE.start_test_fun_#t~post6=|v_ULTIMATE.start_test_fun_#t~post6_5|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_28} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~post6] 566#L18-2 [175] L18-2-->L16-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_test_fun_~i~0_29))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_20))) (and (= 1 (select |v_#valid_32| v_ULTIMATE.start_test_fun_~a.base_27)) (= (store |v_#memory_int_15| v_ULTIMATE.start_test_fun_~a.base_27 (store (select |v_#memory_int_15| v_ULTIMATE.start_test_fun_~a.base_27) .cse0 (+ |v_ULTIMATE.start_test_fun_#t~post6_7| (- 1)))) |v_#memory_int_14|) (<= 0 .cse0) (<= (+ .cse1 v_ULTIMATE.start_test_fun_~a.offset_20 4) (select |v_#length_20| v_ULTIMATE.start_test_fun_~a.base_27))))) InVars {ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_20, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_27, ULTIMATE.start_test_fun_#t~post6=|v_ULTIMATE.start_test_fun_#t~post6_7|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_15|, #length=|v_#length_20|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_29} OutVars{ULTIMATE.start_test_fun_~a.offset=v_ULTIMATE.start_test_fun_~a.offset_20, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|, ULTIMATE.start_test_fun_~a.base=v_ULTIMATE.start_test_fun_~a.base_27, ULTIMATE.start_test_fun_#t~post6=|v_ULTIMATE.start_test_fun_#t~post6_6|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|, ULTIMATE.start_test_fun_~i~0=v_ULTIMATE.start_test_fun_~i~0_29} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~post6, #memory_int] 567#L16-2 [2020-06-22 10:02:16,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:02:16,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1494704946, now seen corresponding path program 1 times [2020-06-22 10:02:16,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:02:16,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:02:16,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:02:16,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:02:16,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:02:16,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:02:16,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:02:16,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:02:16,864 INFO L82 PathProgramCache]: Analyzing trace with hash 117875102, now seen corresponding path program 3 times [2020-06-22 10:02:16,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:02:16,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:02:16,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:02:16,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:02:16,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:02:16,868 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:02:16,868 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:02:16,868 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:02:16,880 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2020-06-22 10:02:16,888 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2020-06-22 10:02:16,889 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2020-06-22 10:02:16,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:02:16,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:02:16,923 INFO L82 PathProgramCache]: Analyzing trace with hash 49347825, now seen corresponding path program 1 times [2020-06-22 10:02:16,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:02:16,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:02:16,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:02:16,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:02:16,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:02:16,931 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:02:16,931 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:02:16,932 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:02:16,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:02:16,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:02:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:02:17,248 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2020-06-22 10:02:17,314 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:02:17,314 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:02:17,314 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:02:17,315 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:02:17,315 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:02:17,315 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:02:17,315 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:02:17,315 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:02:17,315 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso [2020-06-22 10:02:17,315 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:02:17,315 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:02:17,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:02:17,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:02:17,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:02:17,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:02:17,457 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2020-06-22 10:02:17,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:02:17,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:02:17,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:02:17,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-06-22 10:02:17,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:02:17,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:02:17,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:02:17,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:02:17,735 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:02:17,736 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:02:17,736 INFO L122 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-06-22 10:02:17,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:02:17,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:02:17,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:02:17,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:02:17,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:02:17,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:02:17,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:02:17,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:02:17,739 INFO L122 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-06-22 10:02:17,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:02:17,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:02:17,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:02:17,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:02:17,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:02:17,740 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:02:17,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:02:17,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:02:17,741 INFO L122 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-06-22 10:02:17,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:02:17,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:02:17,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:02:17,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:02:17,743 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:02:17,743 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:02:17,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:02:17,745 INFO L122 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-06-22 10:02:17,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:02:17,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:02:17,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:02:17,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:02:17,747 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:02:17,747 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:02:17,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:02:17,753 INFO L122 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-06-22 10:02:17,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:02:17,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:02:17,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:02:17,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:02:17,757 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:02:17,757 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:02:17,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:02:17,769 INFO L122 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-06-22 10:02:17,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:02:17,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:02:17,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:02:17,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:02:17,771 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:02:17,771 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:02:17,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:02:17,777 INFO L122 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-06-22 10:02:17,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:02:17,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:02:17,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:02:17,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:02:17,779 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:02:17,780 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:02:17,787 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:02:17,789 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 10:02:17,790 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:02:17,790 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:02:17,791 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:02:17,791 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:02:17,791 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_2 Supporting invariants [] [2020-06-22 10:02:17,798 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-06-22 10:02:17,799 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:02:17,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:02:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:02:17,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:02:17,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:02:17,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:02:17,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 10:02:17,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:02:17,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:02:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:02:17,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 10:02:17,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:02:17,966 INFO L340 Elim1Store]: treesize reduction 49, result has 25.8 percent of original size [2020-06-22 10:02:17,966 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 36 [2020-06-22 10:02:17,967 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:02:17,975 INFO L497 ElimStorePlain]: treesize reduction 13, result has 56.7 percent of original size [2020-06-22 10:02:17,976 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:02:17,976 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:13 [2020-06-22 10:02:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:02:18,031 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:02:18,031 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-06-22 10:02:18,031 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 5 loop predicates [2020-06-22 10:02:18,031 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 28 states and 36 transitions. cyclomatic complexity: 10 Second operand 5 states. [2020-06-22 10:02:18,077 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 28 states and 36 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 42 states and 52 transitions. Complement of second has 10 states. [2020-06-22 10:02:18,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2020-06-22 10:02:18,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 10:02:18,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2020-06-22 10:02:18,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 8 letters. Loop has 5 letters. [2020-06-22 10:02:18,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:02:18,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 13 letters. Loop has 5 letters. [2020-06-22 10:02:18,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:02:18,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 8 letters. Loop has 10 letters. [2020-06-22 10:02:18,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:02:18,083 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 52 transitions. [2020-06-22 10:02:18,084 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:02:18,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 0 states and 0 transitions. [2020-06-22 10:02:18,084 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 10:02:18,084 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 10:02:18,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 10:02:18,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:02:18,085 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:02:18,085 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:02:18,085 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:02:18,085 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 10:02:18,085 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:02:18,085 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:02:18,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 10:02:18,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:02:18 BasicIcfg [2020-06-22 10:02:18,091 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 10:02:18,092 INFO L168 Benchmark]: Toolchain (without parser) took 6036.34 ms. Allocated memory was 649.6 MB in the beginning and 762.3 MB in the end (delta: 112.7 MB). Free memory was 563.1 MB in the beginning and 507.3 MB in the end (delta: 55.7 MB). Peak memory consumption was 168.4 MB. Max. memory is 50.3 GB. [2020-06-22 10:02:18,093 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 649.6 MB. Free memory is still 585.7 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:02:18,093 INFO L168 Benchmark]: CACSL2BoogieTranslator took 301.66 ms. Allocated memory was 649.6 MB in the beginning and 670.0 MB in the end (delta: 20.4 MB). Free memory was 563.1 MB in the beginning and 634.6 MB in the end (delta: -71.6 MB). Peak memory consumption was 28.8 MB. Max. memory is 50.3 GB. [2020-06-22 10:02:18,094 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.21 ms. Allocated memory is still 670.0 MB. Free memory was 634.6 MB in the beginning and 631.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-06-22 10:02:18,094 INFO L168 Benchmark]: Boogie Preprocessor took 26.82 ms. Allocated memory is still 670.0 MB. Free memory was 631.9 MB in the beginning and 630.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-22 10:02:18,095 INFO L168 Benchmark]: RCFGBuilder took 347.18 ms. Allocated memory is still 670.0 MB. Free memory was 630.6 MB in the beginning and 608.2 MB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 50.3 GB. [2020-06-22 10:02:18,095 INFO L168 Benchmark]: BlockEncodingV2 took 119.48 ms. Allocated memory is still 670.0 MB. Free memory was 608.2 MB in the beginning and 598.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. [2020-06-22 10:02:18,096 INFO L168 Benchmark]: TraceAbstraction took 1004.74 ms. Allocated memory is still 670.0 MB. Free memory was 598.8 MB in the beginning and 502.3 MB in the end (delta: 96.5 MB). Peak memory consumption was 96.5 MB. Max. memory is 50.3 GB. [2020-06-22 10:02:18,096 INFO L168 Benchmark]: BuchiAutomizer took 4190.69 ms. Allocated memory was 670.0 MB in the beginning and 762.3 MB in the end (delta: 92.3 MB). Free memory was 502.3 MB in the beginning and 507.3 MB in the end (delta: -5.1 MB). Peak memory consumption was 87.2 MB. Max. memory is 50.3 GB. [2020-06-22 10:02:18,101 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 37 locations, 43 edges - StatisticsResult: Encoded RCFG 28 locations, 48 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 649.6 MB. Free memory is still 585.7 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 301.66 ms. Allocated memory was 649.6 MB in the beginning and 670.0 MB in the end (delta: 20.4 MB). Free memory was 563.1 MB in the beginning and 634.6 MB in the end (delta: -71.6 MB). Peak memory consumption was 28.8 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 40.21 ms. Allocated memory is still 670.0 MB. Free memory was 634.6 MB in the beginning and 631.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 26.82 ms. Allocated memory is still 670.0 MB. Free memory was 631.9 MB in the beginning and 630.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 347.18 ms. Allocated memory is still 670.0 MB. Free memory was 630.6 MB in the beginning and 608.2 MB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 119.48 ms. Allocated memory is still 670.0 MB. Free memory was 608.2 MB in the beginning and 598.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1004.74 ms. Allocated memory is still 670.0 MB. Free memory was 598.8 MB in the beginning and 502.3 MB in the end (delta: 96.5 MB). Peak memory consumption was 96.5 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 4190.69 ms. Allocated memory was 670.0 MB in the beginning and 762.3 MB in the end (delta: 92.3 MB). Free memory was 502.3 MB in the beginning and 507.3 MB in the end (delta: -5.1 MB). Peak memory consumption was 87.2 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: 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: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 9]: Loop Invariant [2020-06-22 10:02:18,109 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:02:18,110 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((4 * N <= unknown-#length-unknown[a] && 0 == a) && 0 <= 4 * i + a) && 1 == \valid[a] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 14 error locations. SAFE Result, 0.9s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 24 SDtfs, 112 SDslu, 28 SDs, 0 SdLazy, 154 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 23 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 27 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 676 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 0 deterministic, 3 nondeterministic). One nondeterministic module has affine ranking function -1 * a + -4 * i + unknown-#length-unknown[a] and consists of 5 locations. One nondeterministic module has affine ranking function N + -1 * i and consists of 3 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[a][a + 4 * i] and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.1s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 3.0s. Construction of modules took 0.3s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 33 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 35 states and ocurred in iteration 1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 63 SDtfs, 196 SDslu, 79 SDs, 0 SdLazy, 351 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital142 mio100 ax100 hnf100 lsp95 ukn75 mio100 lsp57 div100 bol100 ite100 ukn100 eq177 hnf89 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 1 VariablesLoop: 0 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! !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 10:02:18.336 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check