./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0233d496bfaf5cb1311bfa260a57f41458184795 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-26 04:13:18,231 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 04:13:18,235 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 04:13:18,302 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 04:13:18,303 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 04:13:18,309 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 04:13:18,313 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 04:13:18,321 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 04:13:18,325 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 04:13:18,333 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 04:13:18,335 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 04:13:18,341 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 04:13:18,342 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 04:13:18,345 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 04:13:18,347 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 04:13:18,349 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 04:13:18,351 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 04:13:18,355 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 04:13:18,357 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 04:13:18,366 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 04:13:18,370 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 04:13:18,372 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 04:13:18,376 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 04:13:18,377 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 04:13:18,382 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 04:13:18,383 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 04:13:18,383 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 04:13:18,386 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 04:13:18,386 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 04:13:18,388 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 04:13:18,388 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 04:13:18,389 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 04:13:18,391 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 04:13:18,392 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 04:13:18,394 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 04:13:18,394 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 04:13:18,395 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 04:13:18,396 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 04:13:18,396 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 04:13:18,399 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 04:13:18,400 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 04:13:18,401 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-10-26 04:13:18,453 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 04:13:18,453 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 04:13:18,458 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 04:13:18,459 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 04:13:18,459 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 04:13:18,459 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-26 04:13:18,460 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-26 04:13:18,460 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-26 04:13:18,460 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-26 04:13:18,460 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-26 04:13:18,462 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-26 04:13:18,462 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 04:13:18,463 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-26 04:13:18,463 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 04:13:18,463 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 04:13:18,463 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-26 04:13:18,464 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-26 04:13:18,464 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-26 04:13:18,464 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 04:13:18,464 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-26 04:13:18,465 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 04:13:18,465 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-26 04:13:18,465 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 04:13:18,466 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 04:13:18,466 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-26 04:13:18,466 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 04:13:18,467 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 04:13:18,467 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 04:13:18,467 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-26 04:13:18,469 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-26 04:13:18,469 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0233d496bfaf5cb1311bfa260a57f41458184795 [2020-10-26 04:13:18,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 04:13:18,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 04:13:18,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 04:13:18,943 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 04:13:18,944 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 04:13:18,944 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2020-10-26 04:13:19,041 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1238dc336/e53d8c93a90d424c8cbb5c8cb77b64d6/FLAG1c9305b41 [2020-10-26 04:13:19,746 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 04:13:19,747 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2020-10-26 04:13:19,754 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1238dc336/e53d8c93a90d424c8cbb5c8cb77b64d6/FLAG1c9305b41 [2020-10-26 04:13:20,094 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1238dc336/e53d8c93a90d424c8cbb5c8cb77b64d6 [2020-10-26 04:13:20,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 04:13:20,105 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 04:13:20,109 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 04:13:20,110 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 04:13:20,114 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 04:13:20,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 04:13:20" (1/1) ... [2020-10-26 04:13:20,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@781bd9e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:13:20, skipping insertion in model container [2020-10-26 04:13:20,121 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 04:13:20" (1/1) ... [2020-10-26 04:13:20,129 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 04:13:20,145 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 04:13:20,317 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 04:13:20,329 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 04:13:20,346 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 04:13:20,359 INFO L208 MainTranslator]: Completed translation [2020-10-26 04:13:20,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:13:20 WrapperNode [2020-10-26 04:13:20,359 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 04:13:20,361 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 04:13:20,361 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 04:13:20,361 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 04:13:20,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:13:20" (1/1) ... [2020-10-26 04:13:20,378 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:13:20" (1/1) ... [2020-10-26 04:13:20,399 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 04:13:20,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 04:13:20,401 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 04:13:20,401 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 04:13:20,411 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:13:20" (1/1) ... [2020-10-26 04:13:20,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:13:20" (1/1) ... [2020-10-26 04:13:20,413 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:13:20" (1/1) ... [2020-10-26 04:13:20,414 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:13:20" (1/1) ... [2020-10-26 04:13:20,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:13:20" (1/1) ... [2020-10-26 04:13:20,423 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:13:20" (1/1) ... [2020-10-26 04:13:20,425 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:13:20" (1/1) ... [2020-10-26 04:13:20,428 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 04:13:20,429 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 04:13:20,429 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 04:13:20,429 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 04:13:20,430 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:13:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:13:20,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-26 04:13:20,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 04:13:20,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 04:13:20,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-26 04:13:20,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 04:13:20,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-26 04:13:20,831 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 04:13:20,831 INFO L298 CfgBuilder]: Removed 5 assume(true) statements. [2020-10-26 04:13:20,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:13:20 BoogieIcfgContainer [2020-10-26 04:13:20,834 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 04:13:20,835 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-26 04:13:20,835 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-26 04:13:20,840 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-26 04:13:20,841 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:13:20,841 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.10 04:13:20" (1/3) ... [2020-10-26 04:13:20,843 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a847943 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 04:13:20, skipping insertion in model container [2020-10-26 04:13:20,843 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:13:20,843 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:13:20" (2/3) ... [2020-10-26 04:13:20,844 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a847943 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 04:13:20, skipping insertion in model container [2020-10-26 04:13:20,844 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:13:20,844 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:13:20" (3/3) ... [2020-10-26 04:13:20,846 INFO L373 chiAutomizerObserver]: Analyzing ICFG 4BitCounterPointer.c [2020-10-26 04:13:20,962 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-26 04:13:20,962 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-26 04:13:20,962 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-26 04:13:20,962 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 04:13:20,962 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 04:13:20,963 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-26 04:13:20,963 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 04:13:20,963 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-26 04:13:21,001 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-10-26 04:13:21,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-26 04:13:21,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:13:21,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:13:21,051 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:13:21,052 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 04:13:21,052 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-26 04:13:21,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-10-26 04:13:21,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-26 04:13:21,055 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:13:21,055 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:13:21,056 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-26 04:13:21,056 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 04:13:21,066 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3#L-1true havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 6#L24-2true [2020-10-26 04:13:21,067 INFO L796 eck$LassoCheckResult]: Loop: 6#L24-2true call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 12#L15-1true assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 5#L16true assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 6#L24-2true [2020-10-26 04:13:21,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:13:21,075 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-26 04:13:21,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:13:21,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91922207] [2020-10-26 04:13:21,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:13:21,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:13:21,391 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:13:21,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:13:21,488 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:13:21,528 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:13:21,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:13:21,539 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2020-10-26 04:13:21,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:13:21,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787464893] [2020-10-26 04:13:21,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:13:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:13:21,574 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:13:21,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:13:21,586 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:13:21,594 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:13:21,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:13:21,599 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2020-10-26 04:13:21,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:13:21,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713740586] [2020-10-26 04:13:21,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:13:21,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:13:21,675 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:13:21,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:13:21,730 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:13:21,746 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:13:22,562 WARN L193 SmtUtils]: Spent 674.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 88 [2020-10-26 04:13:22,944 WARN L193 SmtUtils]: Spent 376.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-10-26 04:13:22,959 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:13:22,960 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:13:22,960 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:13:22,960 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:13:22,960 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:13:22,960 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:13:22,961 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:13:22,961 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:13:22,961 INFO L133 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration1_Lasso [2020-10-26 04:13:22,961 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:13:22,961 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:13:22,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:13:22,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:13:23,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:13:23,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:13:23,596 WARN L193 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2020-10-26 04:13:23,732 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2020-10-26 04:13:23,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-10-26 04:13:23,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:13:23,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:13:23,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:13:23,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:13:23,992 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2020-10-26 04:13:24,548 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:13:24,557 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:13:24,573 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:13:24,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:13:24,575 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:13:24,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:13:24,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:13:24,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:13:24,579 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:13:24,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:13:24,583 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:13:24,613 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:13:24,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:13:24,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:13:24,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:13:24,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:13:24,619 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:13:24,620 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:13:24,624 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:13:24,673 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:13:24,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:13:24,677 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:13:24,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:13:24,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:13:24,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:13:24,679 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:13:24,680 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:13:24,682 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:13:24,726 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:13:24,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:13:24,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:13:24,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:13:24,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:13:24,736 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:13:24,737 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:13:24,741 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:13:24,789 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:13:24,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:13:24,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:13:24,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:13:24,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:13:24,799 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:13:24,800 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:13:24,806 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:13:24,848 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:13:24,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:13:24,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:13:24,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:13:24,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:13:24,858 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:13:24,858 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:13:24,866 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:13:24,903 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:13:24,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:13:24,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:13:24,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:13:24,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:13:24,917 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:13:24,917 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:13:24,928 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:13:24,967 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:13:24,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:13:24,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:13:24,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:13:24,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:13:25,000 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:13:25,001 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:13:25,021 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:13:25,056 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:13:25,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:13:25,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:13:25,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:13:25,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:13:25,068 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:13:25,068 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:13:25,072 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:13:25,117 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:13:25,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:13:25,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:13:25,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:13:25,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:13:25,126 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:13:25,127 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:13:25,132 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:13:25,170 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:13:25,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:13:25,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:13:25,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:13:25,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:13:25,175 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:13:25,176 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:13:25,180 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:13:25,213 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:13:25,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:13:25,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:13:25,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:13:25,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:13:25,219 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:13:25,220 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:13:25,226 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:13:25,297 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:13:25,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:13:25,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:13:25,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:13:25,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:13:25,306 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:13:25,307 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:13:25,318 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:13:25,358 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:13:25,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:13:25,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:13:25,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:13:25,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:13:25,374 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:13:25,374 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:13:25,388 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:13:25,427 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:13:25,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:13:25,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:13:25,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:13:25,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:13:25,433 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:13:25,433 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:13:25,439 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:13:25,466 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:13:25,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:13:25,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:13:25,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:13:25,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:13:25,472 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:13:25,472 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:13:25,478 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:13:25,590 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-10-26 04:13:25,590 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:13:25,616 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:13:25,645 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-26 04:13:25,646 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:13:25,646 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)_1 + 1 Supporting invariants [] [2020-10-26 04:13:25,864 INFO L297 tatePredicateManager]: 36 out of 36 supporting invariants were superfluous and have been removed [2020-10-26 04:13:25,874 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-26 04:13:25,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:13:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:13:25,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 04:13:25,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:13:25,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:13:25,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-26 04:13:26,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:13:26,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:13:26,051 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-26 04:13:26,053 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 4 states. [2020-10-26 04:13:26,120 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 4 states. Result 29 states and 36 transitions. Complement of second has 8 states. [2020-10-26 04:13:26,122 INFO L141 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-10-26 04:13:26,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-26 04:13:26,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2020-10-26 04:13:26,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 3 letters. [2020-10-26 04:13:26,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:13:26,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2020-10-26 04:13:26,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:13:26,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 6 letters. [2020-10-26 04:13:26,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:13:26,132 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2020-10-26 04:13:26,138 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-26 04:13:26,143 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 13 states and 18 transitions. [2020-10-26 04:13:26,145 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-10-26 04:13:26,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-10-26 04:13:26,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2020-10-26 04:13:26,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:13:26,154 INFO L691 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-10-26 04:13:26,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2020-10-26 04:13:26,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-10-26 04:13:26,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-26 04:13:26,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2020-10-26 04:13:26,189 INFO L714 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-10-26 04:13:26,189 INFO L594 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-10-26 04:13:26,189 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-26 04:13:26,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2020-10-26 04:13:26,191 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-26 04:13:26,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:13:26,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:13:26,192 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-26 04:13:26,192 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 04:13:26,193 INFO L794 eck$LassoCheckResult]: Stem: 233#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 227#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 228#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 237#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 229#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 230#L20 [2020-10-26 04:13:26,193 INFO L796 eck$LassoCheckResult]: Loop: 230#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 234#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 235#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 239#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 230#L20 [2020-10-26 04:13:26,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:13:26,194 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2020-10-26 04:13:26,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:13:26,194 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197334190] [2020-10-26 04:13:26,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:13:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:13:26,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:13:26,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197334190] [2020-10-26 04:13:26,338 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:13:26,339 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 04:13:26,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739540078] [2020-10-26 04:13:26,345 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:13:26,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:13:26,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1526457, now seen corresponding path program 1 times [2020-10-26 04:13:26,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:13:26,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131639410] [2020-10-26 04:13:26,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:13:26,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:13:26,364 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:13:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:13:26,375 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:13:26,378 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:13:26,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:13:26,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 04:13:26,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-26 04:13:26,505 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 5 states. [2020-10-26 04:13:26,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:13:26,623 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2020-10-26 04:13:26,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 04:13:26,624 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2020-10-26 04:13:26,625 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-26 04:13:26,626 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 22 transitions. [2020-10-26 04:13:26,626 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-26 04:13:26,626 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-26 04:13:26,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2020-10-26 04:13:26,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:13:26,627 INFO L691 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2020-10-26 04:13:26,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2020-10-26 04:13:26,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2020-10-26 04:13:26,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-26 04:13:26,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2020-10-26 04:13:26,629 INFO L714 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-10-26 04:13:26,630 INFO L594 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-10-26 04:13:26,630 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-26 04:13:26,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2020-10-26 04:13:26,631 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-26 04:13:26,631 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:13:26,631 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:13:26,631 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2020-10-26 04:13:26,631 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 04:13:26,632 INFO L794 eck$LassoCheckResult]: Stem: 278#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 272#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 273#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 280#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 276#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 277#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 281#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 284#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 285#L20 [2020-10-26 04:13:26,632 INFO L796 eck$LassoCheckResult]: Loop: 285#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 275#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 279#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 287#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 285#L20 [2020-10-26 04:13:26,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:13:26,632 INFO L82 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 1 times [2020-10-26 04:13:26,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:13:26,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68159560] [2020-10-26 04:13:26,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:13:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:13:26,655 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:13:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:13:26,675 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:13:26,681 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:13:26,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:13:26,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1526457, now seen corresponding path program 2 times [2020-10-26 04:13:26,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:13:26,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523487026] [2020-10-26 04:13:26,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:13:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:13:26,688 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:13:26,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:13:26,693 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:13:26,695 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:13:26,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:13:26,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1467212285, now seen corresponding path program 1 times [2020-10-26 04:13:26,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:13:26,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687242788] [2020-10-26 04:13:26,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:13:26,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:13:26,779 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:13:26,779 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687242788] [2020-10-26 04:13:26,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935681152] [2020-10-26 04:13:26,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:13:26,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:13:26,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-26 04:13:26,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:13:26,886 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2020-10-26 04:13:26,888 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:13:26,891 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:13:26,891 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-26 04:13:26,891 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2020-10-26 04:13:26,902 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-26 04:13:26,903 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:13:26,909 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:13:26,909 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-26 04:13:26,910 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2020-10-26 04:13:26,937 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-10-26 04:13:26,938 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:13:26,946 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:13:26,950 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-26 04:13:26,950 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2020-10-26 04:13:27,013 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-10-26 04:13:27,015 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:13:27,020 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:13:27,023 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-26 04:13:27,023 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2020-10-26 04:13:27,024 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-26 04:13:27,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:13:27,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 8 [2020-10-26 04:13:27,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304058207] [2020-10-26 04:13:27,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:13:27,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-26 04:13:27,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-10-26 04:13:27,162 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 9 states. [2020-10-26 04:13:27,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:13:27,285 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2020-10-26 04:13:27,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-26 04:13:27,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 25 transitions. [2020-10-26 04:13:27,287 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-10-26 04:13:27,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 25 transitions. [2020-10-26 04:13:27,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-10-26 04:13:27,288 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-10-26 04:13:27,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2020-10-26 04:13:27,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:13:27,289 INFO L691 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-10-26 04:13:27,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2020-10-26 04:13:27,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2020-10-26 04:13:27,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-26 04:13:27,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2020-10-26 04:13:27,291 INFO L714 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-10-26 04:13:27,291 INFO L594 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-10-26 04:13:27,291 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-26 04:13:27,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2020-10-26 04:13:27,292 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-26 04:13:27,292 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:13:27,292 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:13:27,293 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2020-10-26 04:13:27,293 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-26 04:13:27,293 INFO L794 eck$LassoCheckResult]: Stem: 368#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 362#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 363#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 371#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 366#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 367#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 372#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 375#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 374#L20 [2020-10-26 04:13:27,293 INFO L796 eck$LassoCheckResult]: Loop: 374#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 373#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 365#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 376#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 377#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 374#L20 [2020-10-26 04:13:27,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:13:27,294 INFO L82 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 2 times [2020-10-26 04:13:27,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:13:27,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311169179] [2020-10-26 04:13:27,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:13:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:13:27,313 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:13:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:13:27,331 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:13:27,336 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:13:27,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:13:27,337 INFO L82 PathProgramCache]: Analyzing trace with hash 49698504, now seen corresponding path program 1 times [2020-10-26 04:13:27,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:13:27,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710798773] [2020-10-26 04:13:27,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:13:27,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:13:27,344 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:13:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:13:27,349 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:13:27,352 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:13:27,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:13:27,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1758681084, now seen corresponding path program 1 times [2020-10-26 04:13:27,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:13:27,353 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996563000] [2020-10-26 04:13:27,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:13:27,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:13:27,507 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:13:27,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996563000] [2020-10-26 04:13:27,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792013017] [2020-10-26 04:13:27,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:13:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:13:27,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 19 conjunts are in the unsatisfiable core [2020-10-26 04:13:27,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:13:27,604 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:13:27,605 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2020-10-26 04:13:27,607 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:13:27,614 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:13:27,615 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-26 04:13:27,615 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2020-10-26 04:13:27,638 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-26 04:13:27,639 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:13:27,648 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:13:27,648 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-26 04:13:27,648 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2020-10-26 04:13:27,681 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-10-26 04:13:27,682 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:13:27,704 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:13:27,708 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-26 04:13:27,708 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2020-10-26 04:13:27,764 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2020-10-26 04:13:27,765 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:13:27,781 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:13:27,787 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-26 04:13:27,788 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:34 [2020-10-26 04:13:27,899 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2020-10-26 04:13:27,902 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:13:27,910 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:13:27,914 INFO L545 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-26 04:13:27,914 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:41, output treesize:3 [2020-10-26 04:13:27,916 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-26 04:13:27,916 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:13:27,916 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2020-10-26 04:13:27,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986944856] [2020-10-26 04:13:28,035 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-10-26 04:13:28,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:13:28,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-26 04:13:28,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2020-10-26 04:13:28,126 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 13 states. [2020-10-26 04:13:52,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:13:52,453 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2020-10-26 04:13:52,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-26 04:13:52,454 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2020-10-26 04:13:52,456 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-10-26 04:13:52,457 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 28 transitions. [2020-10-26 04:13:52,457 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-10-26 04:13:52,457 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-10-26 04:13:52,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2020-10-26 04:13:52,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:13:52,458 INFO L691 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2020-10-26 04:13:52,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2020-10-26 04:13:52,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 16. [2020-10-26 04:13:52,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-26 04:13:52,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2020-10-26 04:13:52,460 INFO L714 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-10-26 04:13:52,460 INFO L594 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-10-26 04:13:52,460 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-26 04:13:52,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2020-10-26 04:13:52,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-26 04:13:52,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:13:52,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:13:52,462 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2020-10-26 04:13:52,462 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2020-10-26 04:13:52,462 INFO L794 eck$LassoCheckResult]: Stem: 472#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 466#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 467#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 475#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 470#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 471#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 476#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 479#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 478#L20 [2020-10-26 04:13:52,462 INFO L796 eck$LassoCheckResult]: Loop: 478#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 473#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 474#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 468#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 469#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 480#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 481#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 478#L20 [2020-10-26 04:13:52,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:13:52,463 INFO L82 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 3 times [2020-10-26 04:13:52,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:13:52,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783490438] [2020-10-26 04:13:52,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:13:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:13:52,479 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:13:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:13:52,495 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:13:52,500 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:13:52,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:13:52,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1770012235, now seen corresponding path program 1 times [2020-10-26 04:13:52,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:13:52,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559756531] [2020-10-26 04:13:52,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:13:52,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:13:52,511 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:13:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:13:52,518 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:13:52,520 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:13:52,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:13:52,521 INFO L82 PathProgramCache]: Analyzing trace with hash -161041423, now seen corresponding path program 2 times [2020-10-26 04:13:52,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:13:52,521 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731828764] [2020-10-26 04:13:52,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:13:52,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:13:52,541 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:13:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:13:52,562 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:13:52,567 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:13:52,772 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2020-10-26 04:13:53,912 WARN L193 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 147 DAG size of output: 113 [2020-10-26 04:13:54,267 WARN L193 SmtUtils]: Spent 341.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-10-26 04:13:54,273 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:13:54,273 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:13:54,273 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:13:54,273 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:13:54,273 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:13:54,273 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:13:54,273 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:13:54,273 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:13:54,273 INFO L133 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration5_Lasso [2020-10-26 04:13:54,273 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:13:54,273 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:13:54,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:13:54,899 WARN L193 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2020-10-26 04:13:55,110 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2020-10-26 04:13:55,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:13:55,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:13:55,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:13:55,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:13:55,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:13:55,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:13:55,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:13:55,492 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2020-10-26 04:13:55,940 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:13:55,941 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:13:55,950 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:13:55,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:13:55,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:13:55,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:13:55,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:13:55,964 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:13:55,965 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:13:55,988 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:13:56,034 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:13:56,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:13:56,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:13:56,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:13:56,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:13:56,041 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:13:56,041 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:13:56,051 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:13:56,068 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-10-26 04:13:56,068 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:13:56,077 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:13:56,080 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2020-10-26 04:13:56,081 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:13:56,081 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_2 + 3 Supporting invariants [3*ULTIMATE.start_main_#t~mem6 - 2*v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_2 >= 0, -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_2 + 1 >= 0] [2020-10-26 04:13:56,294 INFO L297 tatePredicateManager]: 38 out of 39 supporting invariants were superfluous and have been removed [2020-10-26 04:13:56,297 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-26 04:13:56,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:13:56,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:13:56,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 17 conjunts are in the unsatisfiable core [2020-10-26 04:13:56,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:13:56,453 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:13:56,453 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2020-10-26 04:13:56,459 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:13:56,460 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:13:56,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:13:56,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:13:56,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:13:56,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:13:56,483 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-26 04:13:56,484 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:13:56,484 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:13:56,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:13:56,488 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:13:56,516 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:13:56,528 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 29 [2020-10-26 04:13:56,528 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-26 04:13:56,562 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:13:56,568 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-26 04:13:56,568 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:158, output treesize:54 [2020-10-26 04:13:56,727 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2020-10-26 04:13:56,730 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:13:56,757 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:13:56,762 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-26 04:13:56,763 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:65, output treesize:54 [2020-10-26 04:13:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:13:56,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-26 04:13:56,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:13:56,855 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 34 treesize of output 22 [2020-10-26 04:13:56,864 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:13:56,873 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:13:56,901 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-26 04:13:56,902 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:38 [2020-10-26 04:13:57,072 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:13:57,072 INFO L384 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 26 treesize of output 57 [2020-10-26 04:13:57,074 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-26 04:13:57,076 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:13:57,138 INFO L625 ElimStorePlain]: treesize reduction 24, result has 69.2 percent of original size [2020-10-26 04:13:57,142 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-26 04:13:57,143 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:54 [2020-10-26 04:13:57,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:13:57,323 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 4 loop predicates [2020-10-26 04:13:57,324 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 7 states. [2020-10-26 04:13:57,458 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 22 states and 28 transitions. Complement of second has 6 states. [2020-10-26 04:13:57,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 0 non-accepting loop states 2 accepting loop states [2020-10-26 04:13:57,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-26 04:13:57,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2020-10-26 04:13:57,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 7 letters. [2020-10-26 04:13:57,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:13:57,460 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-26 04:13:57,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:13:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:13:57,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 17 conjunts are in the unsatisfiable core [2020-10-26 04:13:57,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:13:57,592 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:13:57,593 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2020-10-26 04:13:57,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:13:57,596 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:13:57,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:13:57,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:13:57,602 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:13:57,609 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:13:57,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:13:57,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:13:57,614 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:13:57,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:13:57,616 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-26 04:13:57,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:13:57,619 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:13:57,652 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:13:57,671 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 29 [2020-10-26 04:13:57,672 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-26 04:13:57,700 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:13:57,707 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-26 04:13:57,707 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:158, output treesize:54 [2020-10-26 04:13:57,787 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2020-10-26 04:13:57,789 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:13:57,815 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:13:57,819 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-26 04:13:57,820 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:65, output treesize:54 [2020-10-26 04:13:57,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:13:57,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-26 04:13:57,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:13:57,927 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 34 treesize of output 22 [2020-10-26 04:13:57,929 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:13:57,938 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:13:57,957 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-26 04:13:57,957 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:56 [2020-10-26 04:13:58,128 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:13:58,128 INFO L384 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 26 treesize of output 57 [2020-10-26 04:13:58,130 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-26 04:13:58,131 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:13:58,193 INFO L625 ElimStorePlain]: treesize reduction 24, result has 75.0 percent of original size [2020-10-26 04:13:58,206 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-26 04:13:58,206 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:74, output treesize:72 [2020-10-26 04:13:58,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:13:58,379 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 4 loop predicates [2020-10-26 04:13:58,379 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 7 states. [2020-10-26 04:13:58,628 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 41 states and 53 transitions. Complement of second has 14 states. [2020-10-26 04:13:58,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 3 stem states 4 non-accepting loop states 1 accepting loop states [2020-10-26 04:13:58,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-26 04:13:58,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 25 transitions. [2020-10-26 04:13:58,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 25 transitions. Stem has 8 letters. Loop has 7 letters. [2020-10-26 04:13:58,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:13:58,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 25 transitions. Stem has 15 letters. Loop has 7 letters. [2020-10-26 04:13:58,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:13:58,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 25 transitions. Stem has 8 letters. Loop has 14 letters. [2020-10-26 04:13:58,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:13:58,631 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2020-10-26 04:13:58,633 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-26 04:13:58,634 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 27 states and 34 transitions. [2020-10-26 04:13:58,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-26 04:13:58,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-26 04:13:58,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 34 transitions. [2020-10-26 04:13:58,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:13:58,635 INFO L691 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2020-10-26 04:13:58,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 34 transitions. [2020-10-26 04:13:58,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2020-10-26 04:13:58,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-26 04:13:58,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2020-10-26 04:13:58,638 INFO L714 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2020-10-26 04:13:58,638 INFO L594 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2020-10-26 04:13:58,639 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-26 04:13:58,639 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2020-10-26 04:13:58,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-26 04:13:58,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:13:58,640 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:13:58,641 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2020-10-26 04:13:58,641 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2020-10-26 04:13:58,641 INFO L794 eck$LassoCheckResult]: Stem: 860#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 854#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 855#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 861#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 858#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 859#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 862#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 865#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 874#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 863#L24 [2020-10-26 04:13:58,641 INFO L796 eck$LassoCheckResult]: Loop: 863#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 864#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 877#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 856#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 857#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 876#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 875#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 866#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 863#L24 [2020-10-26 04:13:58,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:13:58,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1269321585, now seen corresponding path program 1 times [2020-10-26 04:13:58,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:13:58,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040224702] [2020-10-26 04:13:58,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:13:58,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:13:58,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:13:58,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040224702] [2020-10-26 04:13:58,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201564500] [2020-10-26 04:13:58,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:13:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:13:58,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 21 conjunts are in the unsatisfiable core [2020-10-26 04:13:58,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:13:58,854 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:13:58,854 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2020-10-26 04:13:58,856 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:13:58,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:13:58,861 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:13:58,885 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:13:58,898 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 29 [2020-10-26 04:13:58,898 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-26 04:13:58,920 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:13:58,924 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-26 04:13:58,926 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:157, output treesize:53 [2020-10-26 04:13:58,995 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2020-10-26 04:13:58,997 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:13:59,020 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:13:59,023 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-26 04:13:59,023 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:64, output treesize:53 [2020-10-26 04:13:59,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-26 04:13:59,123 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2020-10-26 04:13:59,125 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:13:59,139 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:13:59,141 INFO L545 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-26 04:13:59,141 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:68, output treesize:3 [2020-10-26 04:13:59,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:13:59,143 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:13:59,143 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2020-10-26 04:13:59,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648671952] [2020-10-26 04:13:59,144 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:13:59,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:13:59,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1088312668, now seen corresponding path program 1 times [2020-10-26 04:13:59,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:13:59,144 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779103893] [2020-10-26 04:13:59,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:13:59,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:13:59,159 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:13:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:13:59,166 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:13:59,169 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:13:59,446 WARN L193 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2020-10-26 04:13:59,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:13:59,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-26 04:13:59,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-26 04:13:59,540 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. cyclomatic complexity: 9 Second operand 8 states. [2020-10-26 04:13:59,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:13:59,731 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2020-10-26 04:13:59,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-26 04:13:59,732 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 34 transitions. [2020-10-26 04:13:59,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-26 04:13:59,734 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 34 transitions. [2020-10-26 04:13:59,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-26 04:13:59,738 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-26 04:13:59,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 34 transitions. [2020-10-26 04:13:59,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:13:59,738 INFO L691 BuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2020-10-26 04:13:59,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 34 transitions. [2020-10-26 04:13:59,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2020-10-26 04:13:59,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-26 04:13:59,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2020-10-26 04:13:59,744 INFO L714 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2020-10-26 04:13:59,744 INFO L594 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2020-10-26 04:13:59,745 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-26 04:13:59,745 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 29 transitions. [2020-10-26 04:13:59,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-26 04:13:59,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:13:59,748 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:13:59,750 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2020-10-26 04:13:59,750 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2020-10-26 04:13:59,750 INFO L794 eck$LassoCheckResult]: Stem: 948#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 946#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 947#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 953#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 951#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 952#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 968#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 965#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 960#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 954#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 955#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 959#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 967#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 964#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 962#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 961#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 956#L24 [2020-10-26 04:13:59,750 INFO L796 eck$LassoCheckResult]: Loop: 956#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 957#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 958#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 949#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 950#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 969#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 966#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 963#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 956#L24 [2020-10-26 04:13:59,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:13:59,752 INFO L82 PathProgramCache]: Analyzing trace with hash -697316795, now seen corresponding path program 1 times [2020-10-26 04:13:59,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:13:59,752 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681921022] [2020-10-26 04:13:59,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:13:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:13:59,796 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:13:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:13:59,831 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:13:59,840 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:13:59,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:13:59,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1088312668, now seen corresponding path program 2 times [2020-10-26 04:13:59,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:13:59,844 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125540603] [2020-10-26 04:13:59,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:13:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:13:59,857 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:13:59,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:13:59,875 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:13:59,878 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:13:59,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:13:59,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1710122080, now seen corresponding path program 1 times [2020-10-26 04:13:59,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:13:59,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736899274] [2020-10-26 04:13:59,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:13:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:14:00,122 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-10-26 04:14:00,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736899274] [2020-10-26 04:14:00,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883716870] [2020-10-26 04:14:00,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:14:00,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:14:00,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 20 conjunts are in the unsatisfiable core [2020-10-26 04:14:00,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:14:00,206 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:14:00,207 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2020-10-26 04:14:00,213 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:14:00,220 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:14:00,221 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-26 04:14:00,221 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2020-10-26 04:14:00,256 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-26 04:14:00,257 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:14:00,270 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:14:00,270 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-26 04:14:00,271 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2020-10-26 04:14:00,301 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-10-26 04:14:00,301 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:14:00,314 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:14:00,317 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-26 04:14:00,317 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2020-10-26 04:14:00,358 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2020-10-26 04:14:00,359 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:14:00,374 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:14:00,377 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-26 04:14:00,378 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:34 [2020-10-26 04:14:00,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-26 04:14:00,466 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2020-10-26 04:14:00,467 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:14:00,476 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:14:00,478 INFO L545 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-26 04:14:00,478 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:49, output treesize:3 [2020-10-26 04:14:00,482 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-10-26 04:14:00,483 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:14:00,483 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2020-10-26 04:14:00,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137865534] [2020-10-26 04:14:00,809 WARN L193 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 84 [2020-10-26 04:14:00,914 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-10-26 04:14:00,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:14:00,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-26 04:14:00,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-10-26 04:14:00,916 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. cyclomatic complexity: 8 Second operand 12 states. [2020-10-26 04:14:01,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:14:01,156 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2020-10-26 04:14:01,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-26 04:14:01,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 37 transitions. [2020-10-26 04:14:01,158 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-10-26 04:14:01,158 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 37 transitions. [2020-10-26 04:14:01,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-10-26 04:14:01,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-10-26 04:14:01,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 37 transitions. [2020-10-26 04:14:01,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:14:01,159 INFO L691 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2020-10-26 04:14:01,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 37 transitions. [2020-10-26 04:14:01,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-10-26 04:14:01,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-26 04:14:01,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2020-10-26 04:14:01,162 INFO L714 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2020-10-26 04:14:01,162 INFO L594 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2020-10-26 04:14:01,162 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-26 04:14:01,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2020-10-26 04:14:01,163 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-10-26 04:14:01,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:14:01,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:14:01,165 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2020-10-26 04:14:01,165 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2020-10-26 04:14:01,165 INFO L794 eck$LassoCheckResult]: Stem: 1101#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1095#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 1096#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1105#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1099#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1100#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1104#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1123#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1122#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1110#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1119#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1118#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1116#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1113#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1111#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1109#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1106#L24 [2020-10-26 04:14:01,165 INFO L796 eck$LassoCheckResult]: Loop: 1106#L24 assume !(0 == main_#t~mem7);havoc main_#t~mem7;call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(1, main_~x3~0.base, main_~x3~0.offset, 4); 1107#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1121#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1120#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1115#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1117#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1114#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1112#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1106#L24 [2020-10-26 04:14:01,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:14:01,166 INFO L82 PathProgramCache]: Analyzing trace with hash -697316795, now seen corresponding path program 2 times [2020-10-26 04:14:01,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:14:01,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708923252] [2020-10-26 04:14:01,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:14:01,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:01,188 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:01,205 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:01,210 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:14:01,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:14:01,211 INFO L82 PathProgramCache]: Analyzing trace with hash 278966042, now seen corresponding path program 1 times [2020-10-26 04:14:01,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:14:01,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25499200] [2020-10-26 04:14:01,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:14:01,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:14:01,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-26 04:14:01,252 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25499200] [2020-10-26 04:14:01,252 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:14:01,253 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 04:14:01,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561218711] [2020-10-26 04:14:01,253 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:14:01,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:14:01,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 04:14:01,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 04:14:01,254 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-10-26 04:14:01,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:14:01,291 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2020-10-26 04:14:01,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 04:14:01,291 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 38 transitions. [2020-10-26 04:14:01,292 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-10-26 04:14:01,293 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 31 states and 36 transitions. [2020-10-26 04:14:01,293 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-10-26 04:14:01,294 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-10-26 04:14:01,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 36 transitions. [2020-10-26 04:14:01,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:14:01,295 INFO L691 BuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2020-10-26 04:14:01,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 36 transitions. [2020-10-26 04:14:01,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-10-26 04:14:01,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-26 04:14:01,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2020-10-26 04:14:01,298 INFO L714 BuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2020-10-26 04:14:01,298 INFO L594 BuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2020-10-26 04:14:01,298 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-26 04:14:01,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 36 transitions. [2020-10-26 04:14:01,300 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-10-26 04:14:01,300 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:14:01,300 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:14:01,302 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2020-10-26 04:14:01,302 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 2, 2, 1, 1, 1] [2020-10-26 04:14:01,303 INFO L794 eck$LassoCheckResult]: Stem: 1174#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1168#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 1169#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1178#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1172#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1173#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1177#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1196#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1195#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1183#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1192#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1191#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1189#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1186#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1184#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1182#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1179#L24 [2020-10-26 04:14:01,303 INFO L796 eck$LassoCheckResult]: Loop: 1179#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 1175#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1176#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1170#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1171#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1198#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1197#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1180#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1181#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1194#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1193#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1188#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1190#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1187#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1185#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1179#L24 [2020-10-26 04:14:01,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:14:01,303 INFO L82 PathProgramCache]: Analyzing trace with hash -697316795, now seen corresponding path program 3 times [2020-10-26 04:14:01,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:14:01,303 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207137461] [2020-10-26 04:14:01,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:14:01,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:01,328 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:01,345 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:01,350 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:14:01,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:14:01,351 INFO L82 PathProgramCache]: Analyzing trace with hash 2047759866, now seen corresponding path program 1 times [2020-10-26 04:14:01,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:14:01,351 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145917396] [2020-10-26 04:14:01,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:14:01,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:01,363 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:01,380 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:01,387 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:14:01,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:14:01,388 INFO L82 PathProgramCache]: Analyzing trace with hash 462437174, now seen corresponding path program 2 times [2020-10-26 04:14:01,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:14:01,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587608800] [2020-10-26 04:14:01,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:14:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:01,432 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:01,460 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:01,467 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:14:02,334 WARN L193 SmtUtils]: Spent 865.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 117 [2020-10-26 04:14:02,544 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-10-26 04:14:05,434 WARN L193 SmtUtils]: Spent 2.89 s on a formula simplification. DAG size of input: 195 DAG size of output: 153 [2020-10-26 04:14:05,911 WARN L193 SmtUtils]: Spent 468.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-10-26 04:14:05,917 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:14:05,917 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:14:05,917 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:14:05,917 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:14:05,918 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:14:05,918 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:14:05,918 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:14:05,918 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:14:05,918 INFO L133 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration9_Lasso [2020-10-26 04:14:05,918 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:14:05,918 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:14:05,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:14:05,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:14:05,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:14:06,749 WARN L193 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 80 [2020-10-26 04:14:07,045 WARN L193 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2020-10-26 04:14:07,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:14:07,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:14:07,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:14:07,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:14:07,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:14:07,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:14:07,471 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2020-10-26 04:14:08,007 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:14:08,007 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:14:08,019 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:14:08,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:14:08,021 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:14:08,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:14:08,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:14:08,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:14:08,022 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:14:08,022 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:14:08,024 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:14:08,049 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:14:08,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:14:08,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:14:08,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:14:08,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:14:08,051 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:14:08,051 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:14:08,055 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:14:08,081 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:14:08,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:14:08,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:14:08,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:14:08,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:14:08,095 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:14:08,095 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:14:08,108 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:14:08,140 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:14:08,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:14:08,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:14:08,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:14:08,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:14:08,145 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:14:08,145 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:14:08,150 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:14:08,174 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:14:08,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:14:08,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:14:08,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:14:08,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:14:08,187 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:14:08,187 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:14:08,191 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:14:08,215 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:14:08,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:14:08,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:14:08,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:14:08,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:14:08,220 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:14:08,220 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:14:08,227 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:14:08,251 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:14:08,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:14:08,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:14:08,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:14:08,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:14:08,257 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:14:08,257 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:14:08,263 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:14:08,293 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:14:08,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:14:08,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:14:08,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:14:08,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:14:08,297 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:14:08,297 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:14:08,301 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:14:08,327 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:14:08,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:14:08,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:14:08,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:14:08,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:14:08,332 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:14:08,332 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:14:08,337 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:14:08,380 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:14:08,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:14:08,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:14:08,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:14:08,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:14:08,385 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:14:08,386 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:14:08,392 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:14:08,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:14:08,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:14:08,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:14:08,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:14:08,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:14:08,438 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:14:08,438 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:14:08,446 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:14:08,488 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:14:08,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:14:08,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:14:08,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:14:08,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:14:08,507 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:14:08,507 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:14:08,551 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:14:08,595 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:14:08,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:14:08,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:14:08,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:14:08,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:14:08,603 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:14:08,603 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:14:08,610 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:14:08,622 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-10-26 04:14:08,622 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:14:08,627 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 04:14:08,631 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-26 04:14:08,631 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:14:08,631 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem7) = -2*ULTIMATE.start_main_#t~mem7 + 1 Supporting invariants [] [2020-10-26 04:14:08,912 INFO L297 tatePredicateManager]: 42 out of 42 supporting invariants were superfluous and have been removed [2020-10-26 04:14:08,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:14:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:14:08,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 04:14:08,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:14:09,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:14:09,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 15 conjunts are in the unsatisfiable core [2020-10-26 04:14:09,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:14:09,022 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-26 04:14:09,023 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:14:09,030 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:14:09,030 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-26 04:14:09,030 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2020-10-26 04:14:09,104 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:14:09,105 INFO L384 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 26 treesize of output 57 [2020-10-26 04:14:09,106 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-26 04:14:09,109 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:14:09,145 INFO L625 ElimStorePlain]: treesize reduction 24, result has 57.9 percent of original size [2020-10-26 04:14:09,145 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-26 04:14:09,145 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:33 [2020-10-26 04:14:09,191 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-10-26 04:14:09,193 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:14:09,204 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:14:09,204 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2020-10-26 04:14:09,206 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-26 04:14:09,241 INFO L625 ElimStorePlain]: treesize reduction 40, result has 43.7 percent of original size [2020-10-26 04:14:09,242 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-26 04:14:09,242 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:93, output treesize:31 [2020-10-26 04:14:09,448 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2020-10-26 04:14:09,449 INFO L350 Elim1Store]: treesize reduction 12, result has 87.9 percent of original size [2020-10-26 04:14:09,449 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 103 [2020-10-26 04:14:09,451 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-10-26 04:14:09,453 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-26 04:14:09,456 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:14:09,523 INFO L625 ElimStorePlain]: treesize reduction 40, result has 54.5 percent of original size [2020-10-26 04:14:09,524 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-26 04:14:09,524 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:48 [2020-10-26 04:14:09,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 04:14:09,669 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:14:09,670 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 103 [2020-10-26 04:14:09,672 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:14:09,690 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-10-26 04:14:09,691 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-26 04:14:09,709 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:14:09,709 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2020-10-26 04:14:09,714 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-26 04:14:09,794 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:14:09,795 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 103 [2020-10-26 04:14:09,796 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-26 04:14:09,964 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 37 [2020-10-26 04:14:09,965 INFO L625 ElimStorePlain]: treesize reduction 182, result has 32.8 percent of original size [2020-10-26 04:14:09,965 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-26 04:14:09,966 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:183, output treesize:89 [2020-10-26 04:14:10,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:14:10,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:14:10,106 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:14:10,107 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 67 [2020-10-26 04:14:10,108 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:14:10,160 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:14:10,160 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 67 [2020-10-26 04:14:10,161 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-26 04:14:10,224 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:14:10,225 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 67 [2020-10-26 04:14:10,226 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-26 04:14:10,280 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:14:10,281 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 67 [2020-10-26 04:14:10,282 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-26 04:14:10,414 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2020-10-26 04:14:10,415 INFO L625 ElimStorePlain]: treesize reduction 166, result has 34.4 percent of original size [2020-10-26 04:14:10,416 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:14:10,417 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2020-10-26 04:14:10,418 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:201, output treesize:87 [2020-10-26 04:14:10,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:14:10,419 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:14:10,915 WARN L193 SmtUtils]: Spent 458.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2020-10-26 04:14:10,917 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:14:10,917 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2020-10-26 04:14:10,918 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 8 Second operand 9 states. [2020-10-26 04:14:12,337 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 8. Second operand 9 states. Result 61 states and 71 transitions. Complement of second has 23 states. [2020-10-26 04:14:12,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2020-10-26 04:14:12,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-26 04:14:12,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 33 transitions. [2020-10-26 04:14:12,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 33 transitions. Stem has 16 letters. Loop has 15 letters. [2020-10-26 04:14:12,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:14:12,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 33 transitions. Stem has 31 letters. Loop has 15 letters. [2020-10-26 04:14:12,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:14:12,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 33 transitions. Stem has 16 letters. Loop has 30 letters. [2020-10-26 04:14:12,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:14:12,342 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 71 transitions. [2020-10-26 04:14:12,343 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-26 04:14:12,344 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 46 states and 51 transitions. [2020-10-26 04:14:12,344 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-10-26 04:14:12,344 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-10-26 04:14:12,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 51 transitions. [2020-10-26 04:14:12,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:14:12,344 INFO L691 BuchiCegarLoop]: Abstraction has 46 states and 51 transitions. [2020-10-26 04:14:12,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 51 transitions. [2020-10-26 04:14:12,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2020-10-26 04:14:12,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-26 04:14:12,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2020-10-26 04:14:12,348 INFO L714 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2020-10-26 04:14:12,348 INFO L594 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2020-10-26 04:14:12,348 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-26 04:14:12,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 44 transitions. [2020-10-26 04:14:12,348 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-26 04:14:12,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:14:12,349 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:14:12,349 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1, 1] [2020-10-26 04:14:12,349 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2020-10-26 04:14:12,349 INFO L794 eck$LassoCheckResult]: Stem: 1581#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1579#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 1580#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1592#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1584#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1585#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1613#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1611#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1609#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1598#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1608#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1606#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1604#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1602#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1600#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1597#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1590#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 1586#L24-2 [2020-10-26 04:14:12,349 INFO L796 eck$LassoCheckResult]: Loop: 1586#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1587#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1582#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1583#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1617#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1616#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1593#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1586#L24-2 [2020-10-26 04:14:12,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:14:12,350 INFO L82 PathProgramCache]: Analyzing trace with hash -141984140, now seen corresponding path program 3 times [2020-10-26 04:14:12,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:14:12,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669694830] [2020-10-26 04:14:12,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:14:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:12,371 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:12,409 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:12,428 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:14:12,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:14:12,431 INFO L82 PathProgramCache]: Analyzing trace with hash -276975247, now seen corresponding path program 2 times [2020-10-26 04:14:12,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:14:12,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288044365] [2020-10-26 04:14:12,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:14:12,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:12,442 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:12,446 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:12,447 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:14:12,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:14:12,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1710122082, now seen corresponding path program 4 times [2020-10-26 04:14:12,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:14:12,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107950467] [2020-10-26 04:14:12,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:14:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:12,483 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:12,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:12,513 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:12,521 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:14:12,702 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2020-10-26 04:14:16,178 WARN L193 SmtUtils]: Spent 3.41 s on a formula simplification. DAG size of input: 200 DAG size of output: 153 [2020-10-26 04:14:16,944 WARN L193 SmtUtils]: Spent 750.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-10-26 04:14:16,948 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:14:16,948 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:14:16,948 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:14:16,948 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:14:16,948 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:14:16,948 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:14:16,948 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:14:16,949 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:14:16,949 INFO L133 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration10_Lasso [2020-10-26 04:14:16,949 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:14:16,949 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:14:16,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:14:16,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:14:16,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:14:16,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:14:16,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:14:16,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:14:16,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:14:16,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:14:17,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:14:17,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:14:17,719 WARN L193 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2020-10-26 04:14:17,936 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2020-10-26 04:14:18,275 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2020-10-26 04:14:18,719 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:14:18,720 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:14:18,728 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:14:18,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:14:18,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:14:18,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:14:18,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:14:18,732 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:14:18,732 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:14:18,735 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:14:18,757 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:14:18,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:14:18,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:14:18,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:14:18,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:14:18,760 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:14:18,761 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:14:18,765 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:14:18,786 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:14:18,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:14:18,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:14:18,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:14:18,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:14:18,789 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:14:18,790 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:14:18,792 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:14:18,817 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:14:18,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:14:18,819 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:14:18,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:14:18,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:14:18,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:14:18,819 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:14:18,819 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:14:18,821 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:14:18,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:14:18,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:14:18,862 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:14:18,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:14:18,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:14:18,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:14:18,863 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:14:18,863 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:14:18,864 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:14:18,889 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:14:18,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:14:18,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:14:18,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:14:18,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:14:18,892 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:14:18,892 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:14:18,896 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:14:18,919 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:14:18,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:14:18,920 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:14:18,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:14:18,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:14:18,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:14:18,921 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:14:18,921 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:14:18,922 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:14:18,945 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:14:18,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:14:18,947 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:14:18,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:14:18,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:14:18,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:14:18,947 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:14:18,947 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:14:18,948 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:14:18,971 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:14:18,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:14:18,972 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:14:18,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:14:18,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:14:18,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:14:18,972 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:14:18,973 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:14:18,974 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:14:18,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:14:18,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:14:18,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:14:18,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:14:18,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:14:19,000 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:14:19,000 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:14:19,007 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:14:19,013 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-10-26 04:14:19,014 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:14:19,016 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 04:14:19,018 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-26 04:14:19,018 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:14:19,018 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_4) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_4 + 1 Supporting invariants [] [2020-10-26 04:14:19,228 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2020-10-26 04:14:19,230 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-26 04:14:19,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:14:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:14:19,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 04:14:19,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:14:19,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:14:19,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-26 04:14:19,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:14:19,363 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:14:19,364 INFO L384 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 30 treesize of output 61 [2020-10-26 04:14:19,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:14:19,367 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-26 04:14:19,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:14:19,374 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-26 04:14:19,376 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-26 04:14:19,378 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:14:19,445 INFO L625 ElimStorePlain]: treesize reduction 32, result has 59.0 percent of original size [2020-10-26 04:14:19,446 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-26 04:14:19,446 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:46 [2020-10-26 04:14:19,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:14:19,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:14:19,521 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2020-10-26 04:14:19,522 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:14:19,561 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:14:19,561 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2020-10-26 04:14:19,562 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-26 04:14:19,571 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2020-10-26 04:14:19,575 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-26 04:14:19,629 INFO L625 ElimStorePlain]: treesize reduction 34, result has 60.0 percent of original size [2020-10-26 04:14:19,630 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2020-10-26 04:14:19,631 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:118, output treesize:51 [2020-10-26 04:14:19,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:14:19,675 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2020-10-26 04:14:19,675 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 44 transitions. cyclomatic complexity: 9 Second operand 6 states. [2020-10-26 04:14:19,832 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 44 transitions. cyclomatic complexity: 9. Second operand 6 states. Result 79 states and 86 transitions. Complement of second has 13 states. [2020-10-26 04:14:19,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2020-10-26 04:14:19,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-26 04:14:19,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2020-10-26 04:14:19,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 17 letters. Loop has 7 letters. [2020-10-26 04:14:19,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:14:19,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 24 letters. Loop has 7 letters. [2020-10-26 04:14:19,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:14:19,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 17 letters. Loop has 14 letters. [2020-10-26 04:14:19,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:14:19,837 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 86 transitions. [2020-10-26 04:14:19,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-26 04:14:19,839 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 59 states and 64 transitions. [2020-10-26 04:14:19,839 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-26 04:14:19,839 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-26 04:14:19,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 64 transitions. [2020-10-26 04:14:19,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:14:19,840 INFO L691 BuchiCegarLoop]: Abstraction has 59 states and 64 transitions. [2020-10-26 04:14:19,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 64 transitions. [2020-10-26 04:14:19,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2020-10-26 04:14:19,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-10-26 04:14:19,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2020-10-26 04:14:19,844 INFO L714 BuchiCegarLoop]: Abstraction has 53 states and 58 transitions. [2020-10-26 04:14:19,844 INFO L594 BuchiCegarLoop]: Abstraction has 53 states and 58 transitions. [2020-10-26 04:14:19,844 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-26 04:14:19,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 58 transitions. [2020-10-26 04:14:19,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-26 04:14:19,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:14:19,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:14:19,846 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 4, 4, 2, 2, 2, 1, 1] [2020-10-26 04:14:19,846 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2020-10-26 04:14:19,847 INFO L794 eck$LassoCheckResult]: Stem: 1959#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1953#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 1954#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1960#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1985#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1984#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1967#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1968#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1980#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1974#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1979#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1978#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1977#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1976#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1975#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1973#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1963#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 1961#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1962#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1957#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1958#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 2005#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1992#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1993#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1999#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1998#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1997#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1996#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1995#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1994#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1972#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1964#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 1965#L24-2 [2020-10-26 04:14:19,847 INFO L796 eck$LassoCheckResult]: Loop: 1965#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1983#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1955#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1956#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1982#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1981#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1969#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1965#L24-2 [2020-10-26 04:14:19,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:14:19,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1450650531, now seen corresponding path program 5 times [2020-10-26 04:14:19,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:14:19,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897217232] [2020-10-26 04:14:19,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:14:19,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:14:20,188 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 35 proven. 43 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-10-26 04:14:20,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897217232] [2020-10-26 04:14:20,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971747832] [2020-10-26 04:14:20,189 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:14:20,317 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2020-10-26 04:14:20,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 04:14:20,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 25 conjunts are in the unsatisfiable core [2020-10-26 04:14:20,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:14:20,373 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-26 04:14:20,373 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:14:20,384 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:14:20,384 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-26 04:14:20,385 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2020-10-26 04:14:20,477 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:14:20,478 INFO L384 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 26 treesize of output 45 [2020-10-26 04:14:20,479 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:14:20,480 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:14:20,517 INFO L625 ElimStorePlain]: treesize reduction 16, result has 63.6 percent of original size [2020-10-26 04:14:20,518 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-26 04:14:20,518 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:28 [2020-10-26 04:14:20,566 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-10-26 04:14:20,567 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:14:20,599 INFO L625 ElimStorePlain]: treesize reduction 4, result has 88.6 percent of original size [2020-10-26 04:14:20,600 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-26 04:14:20,600 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:31 [2020-10-26 04:14:20,697 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:14:20,697 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 87 [2020-10-26 04:14:20,699 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:14:20,699 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:14:20,700 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:14:20,763 INFO L625 ElimStorePlain]: treesize reduction 42, result has 48.1 percent of original size [2020-10-26 04:14:20,764 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-26 04:14:20,764 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:39 [2020-10-26 04:14:20,820 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 04:14:20,889 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:14:20,890 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 79 [2020-10-26 04:14:20,891 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:14:20,897 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-10-26 04:14:20,904 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-26 04:14:21,022 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2020-10-26 04:14:21,023 INFO L625 ElimStorePlain]: treesize reduction 68, result has 36.4 percent of original size [2020-10-26 04:14:21,023 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-26 04:14:21,024 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:89, output treesize:39 [2020-10-26 04:14:21,115 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:14:21,116 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 55 [2020-10-26 04:14:21,117 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:14:21,158 INFO L625 ElimStorePlain]: treesize reduction 16, result has 69.2 percent of original size [2020-10-26 04:14:21,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:14:21,160 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-26 04:14:21,160 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:36 [2020-10-26 04:14:21,160 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:14:21,215 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:14:21,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:14:21,217 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:14:21,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-26 04:14:21,229 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-10-26 04:14:21,231 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:14:21,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-26 04:14:21,248 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:14:21,248 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 29 [2020-10-26 04:14:21,248 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-26 04:14:21,262 INFO L625 ElimStorePlain]: treesize reduction 17, result has 32.0 percent of original size [2020-10-26 04:14:21,263 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-26 04:14:21,263 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:76, output treesize:3 [2020-10-26 04:14:21,298 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 59 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-10-26 04:14:21,299 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:14:21,299 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2020-10-26 04:14:21,299 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109874152] [2020-10-26 04:14:21,299 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:14:21,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:14:21,300 INFO L82 PathProgramCache]: Analyzing trace with hash -276975247, now seen corresponding path program 3 times [2020-10-26 04:14:21,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:14:21,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862503506] [2020-10-26 04:14:21,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:14:21,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:21,306 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:14:21,310 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:14:21,313 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:14:21,477 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2020-10-26 04:14:21,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:14:21,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-26 04:14:21,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2020-10-26 04:14:21,527 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. cyclomatic complexity: 10 Second operand 20 states. [2020-10-26 04:14:22,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:14:22,566 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2020-10-26 04:14:22,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-26 04:14:22,566 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 41 transitions. [2020-10-26 04:14:22,567 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 04:14:22,567 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 0 states and 0 transitions. [2020-10-26 04:14:22,568 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-26 04:14:22,568 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-26 04:14:22,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-26 04:14:22,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:14:22,568 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 04:14:22,568 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 04:14:22,568 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 04:14:22,568 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-26 04:14:22,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-26 04:14:22,568 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 04:14:22,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-26 04:14:22,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.10 04:14:22 BoogieIcfgContainer [2020-10-26 04:14:22,575 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-26 04:14:22,575 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 04:14:22,575 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 04:14:22,576 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 04:14:22,576 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:13:20" (3/4) ... [2020-10-26 04:14:22,580 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-26 04:14:22,580 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 04:14:22,581 INFO L168 Benchmark]: Toolchain (without parser) took 62481.37 ms. Allocated memory was 50.3 MB in the beginning and 157.3 MB in the end (delta: 107.0 MB). Free memory was 27.2 MB in the beginning and 47.7 MB in the end (delta: -20.5 MB). Peak memory consumption was 87.6 MB. Max. memory is 16.1 GB. [2020-10-26 04:14:22,581 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 50.3 MB. Free memory was 31.6 MB in the beginning and 31.6 MB in the end (delta: 63.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 04:14:22,581 INFO L168 Benchmark]: CACSL2BoogieTranslator took 250.34 ms. Allocated memory is still 50.3 MB. Free memory was 26.6 MB in the beginning and 29.0 MB in the end (delta: -2.4 MB). Peak memory consumption was 5.3 MB. Max. memory is 16.1 GB. [2020-10-26 04:14:22,582 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.03 ms. Allocated memory is still 50.3 MB. Free memory was 29.0 MB in the beginning and 27.6 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 04:14:22,582 INFO L168 Benchmark]: Boogie Preprocessor took 27.58 ms. Allocated memory is still 50.3 MB. Free memory was 27.6 MB in the beginning and 26.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 04:14:22,582 INFO L168 Benchmark]: RCFGBuilder took 405.02 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 26.4 MB in the beginning and 35.0 MB in the end (delta: -8.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. [2020-10-26 04:14:22,583 INFO L168 Benchmark]: BuchiAutomizer took 61739.58 ms. Allocated memory was 60.8 MB in the beginning and 157.3 MB in the end (delta: 96.5 MB). Free memory was 34.7 MB in the beginning and 47.7 MB in the end (delta: -13.0 MB). Peak memory consumption was 83.1 MB. Max. memory is 16.1 GB. [2020-10-26 04:14:22,583 INFO L168 Benchmark]: Witness Printer took 4.36 ms. Allocated memory is still 157.3 MB. Free memory is still 47.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 04:14:22,585 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 50.3 MB. Free memory was 31.6 MB in the beginning and 31.6 MB in the end (delta: 63.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 250.34 ms. Allocated memory is still 50.3 MB. Free memory was 26.6 MB in the beginning and 29.0 MB in the end (delta: -2.4 MB). Peak memory consumption was 5.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 39.03 ms. Allocated memory is still 50.3 MB. Free memory was 29.0 MB in the beginning and 27.6 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 27.58 ms. Allocated memory is still 50.3 MB. Free memory was 27.6 MB in the beginning and 26.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 405.02 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 26.4 MB in the beginning and 35.0 MB in the end (delta: -8.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 61739.58 ms. Allocated memory was 60.8 MB in the beginning and 157.3 MB in the end (delta: 96.5 MB). Free memory was 34.7 MB in the beginning and 47.7 MB in the end (delta: -13.0 MB). Peak memory consumption was 83.1 MB. Max. memory is 16.1 GB. * Witness Printer took 4.36 ms. Allocated memory is still 157.3 MB. Free memory is still 47.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (7 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x0][x0] + 1 and consists of 5 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x1][x1] + 3 and consists of 9 locations. One deterministic module has affine ranking function -2 * aux-x2-aux + 1 and consists of 13 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x1][x1] + 1 and consists of 7 locations. 7 modules have a trivial ranking function, the largest among these consists of 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 61.6s and 12 iterations. TraceHistogramMax:8. Analysis of lassos took 28.6s. Construction of modules took 25.8s. Büchi inclusion checks took 6.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 36 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 53 states and ocurred in iteration 10. Nontrivial modules had stage [3, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 13/25 HoareTripleCheckerStatistics: 51 SDtfs, 105 SDslu, 48 SDs, 0 SdLazy, 648 SolverSat, 117 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 25.8s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc3 concLT0 SILN0 SILU3 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital2006 mio100 ax100 hnf100 lsp98 ukn26 mio100 lsp40 div100 bol100 ite100 ukn100 eq184 hnf88 smp95 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms 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! Received shutdown request...