./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 a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer --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-a4ecdab [2020-11-29 19:32:12,411 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 19:32:12,413 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 19:32:12,467 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 19:32:12,467 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 19:32:12,488 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 19:32:12,490 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 19:32:12,493 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 19:32:12,495 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 19:32:12,497 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 19:32:12,498 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 19:32:12,500 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 19:32:12,501 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 19:32:12,502 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 19:32:12,504 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 19:32:12,505 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 19:32:12,507 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 19:32:12,508 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 19:32:12,510 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 19:32:12,513 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 19:32:12,515 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 19:32:12,517 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 19:32:12,519 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 19:32:12,520 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 19:32:12,524 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 19:32:12,525 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 19:32:12,525 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 19:32:12,526 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 19:32:12,527 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 19:32:12,528 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 19:32:12,528 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 19:32:12,530 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 19:32:12,531 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 19:32:12,532 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 19:32:12,533 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 19:32:12,534 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 19:32:12,535 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 19:32:12,535 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 19:32:12,536 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 19:32:12,537 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 19:32:12,538 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 19:32:12,541 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-11-29 19:32:12,583 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 19:32:12,584 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 19:32:12,585 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 19:32:12,585 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 19:32:12,585 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 19:32:12,586 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-29 19:32:12,586 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-29 19:32:12,586 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-29 19:32:12,586 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-29 19:32:12,587 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-29 19:32:12,587 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-29 19:32:12,587 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 19:32:12,587 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-29 19:32:12,588 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 19:32:12,591 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 19:32:12,591 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-29 19:32:12,591 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-29 19:32:12,591 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-29 19:32:12,592 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 19:32:12,592 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-29 19:32:12,592 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 19:32:12,592 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-29 19:32:12,593 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 19:32:12,593 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 19:32:12,593 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-29 19:32:12,594 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 19:32:12,594 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 19:32:12,594 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 19:32:12,595 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-29 19:32:12,596 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-29 19:32:12,596 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:/tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/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 -> /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer 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-11-29 19:32:12,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 19:32:12,923 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 19:32:12,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 19:32:12,930 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 19:32:12,931 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 19:32:12,932 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/../../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2020-11-29 19:32:13,023 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/data/ac72b979a/54312292a979459285693de17a6ed70a/FLAG643cddd6d [2020-11-29 19:32:13,456 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 19:32:13,457 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2020-11-29 19:32:13,472 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/data/ac72b979a/54312292a979459285693de17a6ed70a/FLAG643cddd6d [2020-11-29 19:32:13,854 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/data/ac72b979a/54312292a979459285693de17a6ed70a [2020-11-29 19:32:13,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 19:32:13,858 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 19:32:13,859 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 19:32:13,860 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 19:32:13,863 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 19:32:13,864 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:32:13" (1/1) ... [2020-11-29 19:32:13,866 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73f36da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:32:13, skipping insertion in model container [2020-11-29 19:32:13,866 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:32:13" (1/1) ... [2020-11-29 19:32:13,877 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 19:32:13,891 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 19:32:14,028 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 19:32:14,038 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 19:32:14,057 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 19:32:14,078 INFO L208 MainTranslator]: Completed translation [2020-11-29 19:32:14,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:32:14 WrapperNode [2020-11-29 19:32:14,080 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 19:32:14,081 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 19:32:14,081 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 19:32:14,082 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 19:32:14,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:32:14" (1/1) ... [2020-11-29 19:32:14,128 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:32:14" (1/1) ... [2020-11-29 19:32:14,155 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 19:32:14,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 19:32:14,157 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 19:32:14,157 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 19:32:14,173 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:32:14" (1/1) ... [2020-11-29 19:32:14,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:32:14" (1/1) ... [2020-11-29 19:32:14,188 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:32:14" (1/1) ... [2020-11-29 19:32:14,189 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:32:14" (1/1) ... [2020-11-29 19:32:14,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:32:14" (1/1) ... [2020-11-29 19:32:14,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:32:14" (1/1) ... [2020-11-29 19:32:14,202 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:32:14" (1/1) ... [2020-11-29 19:32:14,210 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 19:32:14,211 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 19:32:14,211 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 19:32:14,212 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 19:32:14,213 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:32:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/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-11-29 19:32:14,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-29 19:32:14,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 19:32:14,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 19:32:14,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-29 19:32:14,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 19:32:14,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-29 19:32:14,646 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 19:32:14,646 INFO L298 CfgBuilder]: Removed 5 assume(true) statements. [2020-11-29 19:32:14,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:32:14 BoogieIcfgContainer [2020-11-29 19:32:14,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 19:32:14,649 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-29 19:32:14,650 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-29 19:32:14,656 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-29 19:32:14,657 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 19:32:14,658 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 07:32:13" (1/3) ... [2020-11-29 19:32:14,659 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e1c94c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 07:32:14, skipping insertion in model container [2020-11-29 19:32:14,659 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 19:32:14,659 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:32:14" (2/3) ... [2020-11-29 19:32:14,660 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e1c94c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 07:32:14, skipping insertion in model container [2020-11-29 19:32:14,660 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-29 19:32:14,660 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:32:14" (3/3) ... [2020-11-29 19:32:14,662 INFO L373 chiAutomizerObserver]: Analyzing ICFG 4BitCounterPointer.c [2020-11-29 19:32:14,716 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-29 19:32:14,716 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-29 19:32:14,716 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-29 19:32:14,716 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 19:32:14,717 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 19:32:14,717 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-29 19:32:14,717 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 19:32:14,717 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-29 19:32:14,729 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-11-29 19:32:14,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-29 19:32:14,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:32:14,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:32:14,765 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 19:32:14,765 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-29 19:32:14,765 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-29 19:32:14,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-11-29 19:32:14,772 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-29 19:32:14,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:32:14,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:32:14,773 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-29 19:32:14,773 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-29 19:32:14,780 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-11-29 19:32:14,795 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-11-29 19:32:14,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:32:14,802 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-11-29 19:32:14,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:32:14,812 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315018196] [2020-11-29 19:32:14,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:32:14,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:32:14,979 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:32:15,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:32:15,027 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:32:15,048 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:32:15,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:32:15,050 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2020-11-29 19:32:15,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:32:15,051 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16533625] [2020-11-29 19:32:15,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:32:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:32:15,061 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:32:15,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:32:15,068 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:32:15,071 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:32:15,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:32:15,074 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2020-11-29 19:32:15,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:32:15,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796319457] [2020-11-29 19:32:15,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:32:15,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:32:15,144 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:32:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:32:15,188 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:32:15,197 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:32:15,404 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2020-11-29 19:32:16,105 WARN L193 SmtUtils]: Spent 697.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 88 [2020-11-29 19:32:16,390 WARN L193 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-11-29 19:32:16,417 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 19:32:16,418 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 19:32:16,418 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 19:32:16,418 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 19:32:16,418 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-29 19:32:16,419 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:32:16,419 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 19:32:16,419 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 19:32:16,419 INFO L133 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration1_Lasso [2020-11-29 19:32:16,419 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 19:32:16,420 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 19:32:16,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:32:16,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:32:16,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:32:16,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:32:17,087 WARN L193 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2020-11-29 19:32:17,277 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2020-11-29 19:32:17,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:32:17,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:32:17,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:32:17,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:32:17,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:32:17,543 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2020-11-29 19:32:17,999 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-29 19:32:18,004 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/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-11-29 19:32:18,013 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-11-29 19:32:18,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:32:18,016 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:32:18,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:32:18,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:32:18,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:32:18,020 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:32:18,020 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:32:18,027 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/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-11-29 19:32:18,068 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-11-29 19:32:18,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:32:18,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:32:18,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:32:18,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:32:18,075 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:32:18,075 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:32:18,104 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/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-11-29 19:32:18,136 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-11-29 19:32:18,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:32:18,137 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:32:18,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:32:18,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:32:18,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:32:18,139 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:32:18,139 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:32:18,140 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/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-11-29 19:32:18,163 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-11-29 19:32:18,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:32:18,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:32:18,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:32:18,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:32:18,181 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:32:18,181 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:32:18,200 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/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-11-29 19:32:18,231 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-11-29 19:32:18,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:32:18,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:32:18,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:32:18,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:32:18,237 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:32:18,237 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:32:18,242 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:32:18,301 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-11-29 19:32:18,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:32:18,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:32:18,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:32:18,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:32:18,308 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:32:18,308 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:32:18,316 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/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-11-29 19:32:18,348 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-11-29 19:32:18,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:32:18,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:32:18,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:32:18,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:32:18,359 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:32:18,359 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:32:18,363 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/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-11-29 19:32:18,386 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-11-29 19:32:18,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:32:18,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:32:18,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:32:18,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:32:18,406 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:32:18,406 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:32:18,424 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/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-11-29 19:32:18,447 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-11-29 19:32:18,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:32:18,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:32:18,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:32:18,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:32:18,452 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:32:18,452 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:32:18,472 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:32:18,514 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-11-29 19:32:18,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:32:18,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:32:18,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:32:18,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:32:18,520 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:32:18,520 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:32:18,526 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:32:18,567 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-11-29 19:32:18,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:32:18,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:32:18,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:32:18,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:32:18,572 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:32:18,572 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:32:18,577 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/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-11-29 19:32:18,607 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-11-29 19:32:18,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:32:18,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:32:18,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:32:18,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:32:18,621 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:32:18,622 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:32:18,627 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:32:18,661 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-11-29 19:32:18,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:32:18,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:32:18,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:32:18,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:32:18,668 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:32:18,669 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:32:18,679 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:32:18,722 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-11-29 19:32:18,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:32:18,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:32:18,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:32:18,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:32:18,735 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:32:18,735 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:32:18,746 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:32:18,793 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-11-29 19:32:18,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:32:18,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:32:18,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:32:18,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:32:18,797 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:32:18,797 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-11-29 19:32:18,802 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/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-11-29 19:32:18,825 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-11-29 19:32:18,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:32:18,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:32:18,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:32:18,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:32:18,830 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:32:18,830 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:32:18,834 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-29 19:32:18,893 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-11-29 19:32:18,893 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:32:18,901 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-11-29 19:32:18,909 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-29 19:32:18,909 INFO L510 LassoAnalysis]: Proved termination. [2020-11-29 19:32:18,910 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-11-29 19:32:19,180 INFO L297 tatePredicateManager]: 36 out of 36 supporting invariants were superfluous and have been removed [2020-11-29 19:32:19,189 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-29 19:32:19,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:32:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:32:19,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-29 19:32:19,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:32:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:32:19,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-29 19:32:19,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:32:19,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:32:19,312 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-11-29 19:32:19,313 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 4 states. [2020-11-29 19:32:19,361 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-11-29 19:32:19,362 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-11-29 19:32:19,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-11-29 19:32:19,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2020-11-29 19:32:19,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 3 letters. [2020-11-29 19:32:19,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:32:19,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2020-11-29 19:32:19,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:32:19,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 6 letters. [2020-11-29 19:32:19,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:32:19,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2020-11-29 19:32:19,370 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-29 19:32:19,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 13 states and 18 transitions. [2020-11-29 19:32:19,375 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-11-29 19:32:19,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-11-29 19:32:19,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2020-11-29 19:32:19,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 19:32:19,376 INFO L691 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-11-29 19:32:19,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2020-11-29 19:32:19,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-11-29 19:32:19,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-11-29 19:32:19,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2020-11-29 19:32:19,403 INFO L714 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-11-29 19:32:19,403 INFO L594 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-11-29 19:32:19,403 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-29 19:32:19,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2020-11-29 19:32:19,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-29 19:32:19,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:32:19,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:32:19,405 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-11-29 19:32:19,405 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 19:32:19,405 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-11-29 19:32:19,405 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-11-29 19:32:19,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:32:19,406 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2020-11-29 19:32:19,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:32:19,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020721810] [2020-11-29 19:32:19,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:32:19,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:32:19,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:32:19,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020721810] [2020-11-29 19:32:19,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:32:19,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 19:32:19,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507181455] [2020-11-29 19:32:19,588 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:32:19,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:32:19,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1526457, now seen corresponding path program 1 times [2020-11-29 19:32:19,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:32:19,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623881725] [2020-11-29 19:32:19,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:32:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:32:19,610 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:32:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:32:19,620 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:32:19,625 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:32:19,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:32:19,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 19:32:19,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:32:19,726 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 5 states. [2020-11-29 19:32:19,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:32:19,846 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2020-11-29 19:32:19,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:32:19,847 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2020-11-29 19:32:19,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-11-29 19:32:19,849 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 22 transitions. [2020-11-29 19:32:19,850 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-11-29 19:32:19,850 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-11-29 19:32:19,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2020-11-29 19:32:19,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 19:32:19,850 INFO L691 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2020-11-29 19:32:19,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2020-11-29 19:32:19,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2020-11-29 19:32:19,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-11-29 19:32:19,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2020-11-29 19:32:19,852 INFO L714 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-11-29 19:32:19,853 INFO L594 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-11-29 19:32:19,853 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-29 19:32:19,853 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2020-11-29 19:32:19,855 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-11-29 19:32:19,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:32:19,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:32:19,856 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2020-11-29 19:32:19,856 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-29 19:32:19,856 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-11-29 19:32:19,857 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-11-29 19:32:19,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:32:19,859 INFO L82 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 1 times [2020-11-29 19:32:19,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:32:19,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889652713] [2020-11-29 19:32:19,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:32:19,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:32:19,904 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:32:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:32:19,966 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:32:19,972 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:32:19,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:32:19,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1526457, now seen corresponding path program 2 times [2020-11-29 19:32:19,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:32:19,980 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205956542] [2020-11-29 19:32:19,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:32:19,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:32:19,989 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:32:19,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:32:19,996 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:32:20,002 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:32:20,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:32:20,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1467212285, now seen corresponding path program 1 times [2020-11-29 19:32:20,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:32:20,003 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455724696] [2020-11-29 19:32:20,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:32:20,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:32:20,159 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:32:20,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455724696] [2020-11-29 19:32:20,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510611392] [2020-11-29 19:32:20,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/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-11-29 19:32:20,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:32:20,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 14 conjunts are in the unsatisfiable core [2020-11-29 19:32:20,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:32:20,271 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-11-29 19:32:20,272 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:32:20,278 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:32:20,278 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 19:32:20,278 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2020-11-29 19:32:20,303 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-11-29 19:32:20,303 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:32:20,314 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:32:20,315 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 19:32:20,315 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2020-11-29 19:32:20,366 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-11-29 19:32:20,367 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:32:20,384 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:32:20,386 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-11-29 19:32:20,387 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2020-11-29 19:32:20,497 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-11-29 19:32:20,500 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:32:20,514 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:32:20,520 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 19:32:20,521 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2020-11-29 19:32:20,522 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-11-29 19:32:20,522 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:32:20,522 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 8 [2020-11-29 19:32:20,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201782716] [2020-11-29 19:32:20,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:32:20,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 19:32:20,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-11-29 19:32:20,642 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 9 states. [2020-11-29 19:32:20,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:32:20,805 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2020-11-29 19:32:20,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 19:32:20,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 25 transitions. [2020-11-29 19:32:20,807 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-11-29 19:32:20,808 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 25 transitions. [2020-11-29 19:32:20,808 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-11-29 19:32:20,809 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-11-29 19:32:20,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2020-11-29 19:32:20,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 19:32:20,809 INFO L691 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-11-29 19:32:20,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2020-11-29 19:32:20,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2020-11-29 19:32:20,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-11-29 19:32:20,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2020-11-29 19:32:20,812 INFO L714 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-11-29 19:32:20,812 INFO L594 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-11-29 19:32:20,812 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-29 19:32:20,812 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2020-11-29 19:32:20,813 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-11-29 19:32:20,813 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:32:20,813 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:32:20,814 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2020-11-29 19:32:20,814 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-11-29 19:32:20,814 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-11-29 19:32:20,815 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-11-29 19:32:20,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:32:20,815 INFO L82 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 2 times [2020-11-29 19:32:20,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:32:20,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982869055] [2020-11-29 19:32:20,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:32:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:32:20,835 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:32:20,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:32:20,853 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:32:20,857 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:32:20,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:32:20,858 INFO L82 PathProgramCache]: Analyzing trace with hash 49698504, now seen corresponding path program 1 times [2020-11-29 19:32:20,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:32:20,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536711119] [2020-11-29 19:32:20,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:32:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:32:20,883 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:32:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:32:20,888 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:32:20,890 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:32:20,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:32:20,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1758681084, now seen corresponding path program 1 times [2020-11-29 19:32:20,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:32:20,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57721894] [2020-11-29 19:32:20,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:32:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:32:21,002 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:32:21,003 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57721894] [2020-11-29 19:32:21,003 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329989409] [2020-11-29 19:32:21,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/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-11-29 19:32:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:32:21,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 19 conjunts are in the unsatisfiable core [2020-11-29 19:32:21,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:32:21,145 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:32:21,146 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-11-29 19:32:21,152 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:32:21,170 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:32:21,171 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 19:32:21,171 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2020-11-29 19:32:21,207 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-11-29 19:32:21,208 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:32:21,220 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:32:21,221 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 19:32:21,221 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2020-11-29 19:32:21,257 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-11-29 19:32:21,258 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:32:21,281 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:32:21,283 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-11-29 19:32:21,283 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2020-11-29 19:32:21,390 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-11-29 19:32:21,391 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:32:21,418 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:32:21,423 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-11-29 19:32:21,424 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:34 [2020-11-29 19:32:21,532 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-11-29 19:32:21,534 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:32:21,543 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:32:21,545 INFO L545 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 19:32:21,545 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:41, output treesize:3 [2020-11-29 19:32:21,546 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-11-29 19:32:21,547 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:32:21,547 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2020-11-29 19:32:21,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102659530] [2020-11-29 19:32:21,662 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-11-29 19:32:21,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:32:21,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-29 19:32:21,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2020-11-29 19:32:21,745 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 13 states. [2020-11-29 19:32:46,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:32:46,076 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2020-11-29 19:32:46,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-29 19:32:46,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2020-11-29 19:32:46,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-11-29 19:32:46,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 28 transitions. [2020-11-29 19:32:46,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-11-29 19:32:46,079 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-11-29 19:32:46,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2020-11-29 19:32:46,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 19:32:46,079 INFO L691 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2020-11-29 19:32:46,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2020-11-29 19:32:46,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 16. [2020-11-29 19:32:46,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-11-29 19:32:46,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2020-11-29 19:32:46,081 INFO L714 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-11-29 19:32:46,081 INFO L594 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-11-29 19:32:46,081 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-29 19:32:46,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2020-11-29 19:32:46,082 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-11-29 19:32:46,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:32:46,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:32:46,083 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2020-11-29 19:32:46,083 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2020-11-29 19:32:46,083 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-11-29 19:32:46,083 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-11-29 19:32:46,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:32:46,084 INFO L82 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 3 times [2020-11-29 19:32:46,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:32:46,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988066400] [2020-11-29 19:32:46,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:32:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:32:46,101 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:32:46,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:32:46,116 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:32:46,120 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:32:46,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:32:46,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1770012235, now seen corresponding path program 1 times [2020-11-29 19:32:46,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:32:46,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140772327] [2020-11-29 19:32:46,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:32:46,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:32:46,129 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:32:46,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:32:46,135 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:32:46,137 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:32:46,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:32:46,138 INFO L82 PathProgramCache]: Analyzing trace with hash -161041423, now seen corresponding path program 2 times [2020-11-29 19:32:46,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:32:46,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403565940] [2020-11-29 19:32:46,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:32:46,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:32:46,162 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:32:46,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:32:46,204 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:32:46,210 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:32:46,400 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2020-11-29 19:32:47,602 WARN L193 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 147 DAG size of output: 113 [2020-11-29 19:32:47,919 WARN L193 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-11-29 19:32:47,923 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 19:32:47,923 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 19:32:47,923 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 19:32:47,923 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 19:32:47,924 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-29 19:32:47,924 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:32:47,924 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 19:32:47,924 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 19:32:47,924 INFO L133 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration5_Lasso [2020-11-29 19:32:47,924 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 19:32:47,924 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 19:32:47,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:32:48,515 WARN L193 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2020-11-29 19:32:48,694 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2020-11-29 19:32:48,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:32:48,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:32:48,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:32:48,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:32:48,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:32:48,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:32:48,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:32:49,009 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2020-11-29 19:32:49,376 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-29 19:32:49,376 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/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-11-29 19:32:49,389 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-11-29 19:32:49,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:32:49,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:32:49,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:32:49,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:32:49,401 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:32:49,401 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:32:49,416 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:32:49,461 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-11-29 19:32:49,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:32:49,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:32:49,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:32:49,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:32:49,469 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:32:49,469 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:32:49,476 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-29 19:32:49,496 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-11-29 19:32:49,497 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-29 19:32:49,505 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-11-29 19:32:49,508 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2020-11-29 19:32:49,508 INFO L510 LassoAnalysis]: Proved termination. [2020-11-29 19:32:49,508 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-11-29 19:32:49,800 INFO L297 tatePredicateManager]: 38 out of 39 supporting invariants were superfluous and have been removed [2020-11-29 19:32:49,803 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-29 19:32:49,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:32:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:32:49,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 14 conjunts are in the unsatisfiable core [2020-11-29 19:32:49,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:32:49,898 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:32:49,898 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-11-29 19:32:49,900 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:32:49,909 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:32:49,910 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:32:49,925 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:32:50,006 INFO L350 Elim1Store]: treesize reduction 72, result has 23.4 percent of original size [2020-11-29 19:32:50,007 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 123 treesize of output 29 [2020-11-29 19:32:50,007 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 19:32:50,028 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:32:50,029 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-11-29 19:32:50,029 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:144, output treesize:42 [2020-11-29 19:32:50,109 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 33 treesize of output 31 [2020-11-29 19:32:50,111 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:32:50,122 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:32:50,123 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-11-29 19:32:50,123 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:35 [2020-11-29 19:32:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:32:50,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-29 19:32:50,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:32:50,195 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-11-29 19:32:50,199 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:32:50,206 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:32:50,216 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-11-29 19:32:50,216 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:38 [2020-11-29 19:32:50,415 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:32:50,416 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-11-29 19:32:50,417 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-29 19:32:50,418 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:32:50,474 INFO L625 ElimStorePlain]: treesize reduction 24, result has 69.2 percent of original size [2020-11-29 19:32:50,477 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-11-29 19:32:50,477 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:54 [2020-11-29 19:32:50,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:32:50,645 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-11-29 19:32:50,645 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 7 states. [2020-11-29 19:32:50,764 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-11-29 19:32:50,765 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-11-29 19:32:50,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-11-29 19:32:50,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2020-11-29 19:32:50,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 7 letters. [2020-11-29 19:32:50,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:32:50,766 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-11-29 19:32:50,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:32:50,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:32:50,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 17 conjunts are in the unsatisfiable core [2020-11-29 19:32:50,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:32:50,932 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:32:50,932 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-11-29 19:32:50,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:32:50,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:32:50,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:32:50,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:32:50,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:32:50,949 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:32:50,950 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:32:50,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:32:50,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:32:50,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:32:50,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:32:50,962 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:32:50,963 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:32:50,995 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:32:51,027 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-11-29 19:32:51,028 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 19:32:51,048 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:32:51,053 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-11-29 19:32:51,053 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:158, output treesize:54 [2020-11-29 19:32:51,167 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-11-29 19:32:51,173 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:32:51,202 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:32:51,206 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-11-29 19:32:51,206 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:65, output treesize:54 [2020-11-29 19:32:51,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:32:51,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 11 conjunts are in the unsatisfiable core [2020-11-29 19:32:51,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:32:51,308 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-11-29 19:32:51,309 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:32:51,325 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:32:51,346 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-11-29 19:32:51,346 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:56 [2020-11-29 19:32:51,553 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:32:51,553 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-11-29 19:32:51,554 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-29 19:32:51,556 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:32:51,623 INFO L625 ElimStorePlain]: treesize reduction 24, result has 75.0 percent of original size [2020-11-29 19:32:51,628 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-11-29 19:32:51,629 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:74, output treesize:72 [2020-11-29 19:32:51,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:32:51,801 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-11-29 19:32:51,801 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 7 states. [2020-11-29 19:32:52,009 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-11-29 19:32:52,010 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-11-29 19:32:52,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-11-29 19:32:52,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 25 transitions. [2020-11-29 19:32:52,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 25 transitions. Stem has 8 letters. Loop has 7 letters. [2020-11-29 19:32:52,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:32:52,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 25 transitions. Stem has 15 letters. Loop has 7 letters. [2020-11-29 19:32:52,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:32:52,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 25 transitions. Stem has 8 letters. Loop has 14 letters. [2020-11-29 19:32:52,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:32:52,012 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2020-11-29 19:32:52,013 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-11-29 19:32:52,014 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 27 states and 34 transitions. [2020-11-29 19:32:52,014 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-11-29 19:32:52,014 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-11-29 19:32:52,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 34 transitions. [2020-11-29 19:32:52,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 19:32:52,015 INFO L691 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2020-11-29 19:32:52,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 34 transitions. [2020-11-29 19:32:52,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2020-11-29 19:32:52,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-11-29 19:32:52,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2020-11-29 19:32:52,017 INFO L714 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2020-11-29 19:32:52,017 INFO L594 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2020-11-29 19:32:52,017 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-11-29 19:32:52,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2020-11-29 19:32:52,018 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-11-29 19:32:52,018 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:32:52,018 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:32:52,019 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2020-11-29 19:32:52,019 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2020-11-29 19:32:52,019 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-11-29 19:32:52,019 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-11-29 19:32:52,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:32:52,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1269321585, now seen corresponding path program 1 times [2020-11-29 19:32:52,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:32:52,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271638708] [2020-11-29 19:32:52,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:32:52,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:32:52,188 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:32:52,188 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271638708] [2020-11-29 19:32:52,188 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119375362] [2020-11-29 19:32:52,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/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-11-29 19:32:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:32:52,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 21 conjunts are in the unsatisfiable core [2020-11-29 19:32:52,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:32:52,299 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:32:52,300 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-11-29 19:32:52,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:32:52,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:32:52,306 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:32:52,334 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:32:52,340 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-11-29 19:32:52,341 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 19:32:52,369 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:32:52,373 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-11-29 19:32:52,373 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:157, output treesize:53 [2020-11-29 19:32:52,453 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-11-29 19:32:52,457 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:32:52,510 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:32:52,513 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-11-29 19:32:52,513 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:64, output treesize:53 [2020-11-29 19:32:52,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 19:32:52,628 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-11-29 19:32:52,630 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:32:52,646 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:32:52,648 INFO L545 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 19:32:52,648 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:68, output treesize:3 [2020-11-29 19:32:52,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:32:52,650 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:32:52,650 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2020-11-29 19:32:52,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224984259] [2020-11-29 19:32:52,650 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:32:52,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:32:52,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1088312668, now seen corresponding path program 1 times [2020-11-29 19:32:52,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:32:52,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261852117] [2020-11-29 19:32:52,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:32:52,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:32:52,664 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:32:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:32:52,684 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:32:52,687 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:32:52,938 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2020-11-29 19:32:53,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:32:53,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 19:32:53,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-11-29 19:32:53,023 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. cyclomatic complexity: 9 Second operand 8 states. [2020-11-29 19:32:53,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:32:53,176 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2020-11-29 19:32:53,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 19:32:53,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 34 transitions. [2020-11-29 19:32:53,178 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-11-29 19:32:53,178 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 34 transitions. [2020-11-29 19:32:53,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-11-29 19:32:53,179 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-11-29 19:32:53,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 34 transitions. [2020-11-29 19:32:53,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 19:32:53,179 INFO L691 BuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2020-11-29 19:32:53,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 34 transitions. [2020-11-29 19:32:53,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2020-11-29 19:32:53,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-11-29 19:32:53,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2020-11-29 19:32:53,181 INFO L714 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2020-11-29 19:32:53,181 INFO L594 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2020-11-29 19:32:53,181 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-11-29 19:32:53,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 29 transitions. [2020-11-29 19:32:53,182 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-11-29 19:32:53,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:32:53,182 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:32:53,183 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2020-11-29 19:32:53,183 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2020-11-29 19:32:53,183 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-11-29 19:32:53,183 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-11-29 19:32:53,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:32:53,183 INFO L82 PathProgramCache]: Analyzing trace with hash -697316795, now seen corresponding path program 1 times [2020-11-29 19:32:53,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:32:53,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720377791] [2020-11-29 19:32:53,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:32:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:32:53,203 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:32:53,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:32:53,232 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:32:53,237 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:32:53,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:32:53,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1088312668, now seen corresponding path program 2 times [2020-11-29 19:32:53,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:32:53,242 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977483061] [2020-11-29 19:32:53,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:32:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:32:53,252 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:32:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:32:53,262 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:32:53,268 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:32:53,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:32:53,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1710122080, now seen corresponding path program 1 times [2020-11-29 19:32:53,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:32:53,275 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488430901] [2020-11-29 19:32:53,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:32:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:32:53,459 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-11-29 19:32:53,459 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488430901] [2020-11-29 19:32:53,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419446355] [2020-11-29 19:32:53,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/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-11-29 19:32:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:32:53,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 20 conjunts are in the unsatisfiable core [2020-11-29 19:32:53,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:32:53,550 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:32:53,550 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-11-29 19:32:53,551 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:32:53,558 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:32:53,558 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 19:32:53,558 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2020-11-29 19:32:53,585 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-11-29 19:32:53,586 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:32:53,592 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:32:53,592 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 19:32:53,593 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2020-11-29 19:32:53,619 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-11-29 19:32:53,619 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:32:53,628 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:32:53,629 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-11-29 19:32:53,629 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2020-11-29 19:32:53,669 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-11-29 19:32:53,670 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:32:53,681 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:32:53,682 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-11-29 19:32:53,682 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:34 [2020-11-29 19:32:53,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 19:32:53,755 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-11-29 19:32:53,760 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:32:53,775 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:32:53,776 INFO L545 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 19:32:53,776 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:49, output treesize:3 [2020-11-29 19:32:53,780 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-11-29 19:32:53,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:32:53,781 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2020-11-29 19:32:53,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803164906] [2020-11-29 19:32:54,101 WARN L193 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 84 [2020-11-29 19:32:54,183 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:32:54,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 19:32:54,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-11-29 19:32:54,184 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. cyclomatic complexity: 8 Second operand 12 states. [2020-11-29 19:32:54,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:32:54,344 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2020-11-29 19:32:54,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 19:32:54,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 37 transitions. [2020-11-29 19:32:54,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-11-29 19:32:54,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 37 transitions. [2020-11-29 19:32:54,346 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-11-29 19:32:54,346 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-11-29 19:32:54,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 37 transitions. [2020-11-29 19:32:54,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 19:32:54,346 INFO L691 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2020-11-29 19:32:54,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 37 transitions. [2020-11-29 19:32:54,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-11-29 19:32:54,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-11-29 19:32:54,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2020-11-29 19:32:54,349 INFO L714 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2020-11-29 19:32:54,349 INFO L594 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2020-11-29 19:32:54,349 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-11-29 19:32:54,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2020-11-29 19:32:54,350 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-11-29 19:32:54,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:32:54,350 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:32:54,351 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2020-11-29 19:32:54,351 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2020-11-29 19:32:54,351 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-11-29 19:32:54,351 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-11-29 19:32:54,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:32:54,351 INFO L82 PathProgramCache]: Analyzing trace with hash -697316795, now seen corresponding path program 2 times [2020-11-29 19:32:54,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:32:54,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453947189] [2020-11-29 19:32:54,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:32:54,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:32:54,368 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:32:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:32:54,383 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:32:54,388 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:32:54,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:32:54,388 INFO L82 PathProgramCache]: Analyzing trace with hash 278966042, now seen corresponding path program 1 times [2020-11-29 19:32:54,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:32:54,389 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154543333] [2020-11-29 19:32:54,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:32:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:32:54,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-29 19:32:54,437 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154543333] [2020-11-29 19:32:54,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:32:54,438 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:32:54,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389655056] [2020-11-29 19:32:54,438 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-29 19:32:54,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:32:54,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 19:32:54,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 19:32:54,439 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-11-29 19:32:54,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:32:54,484 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2020-11-29 19:32:54,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 19:32:54,484 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 38 transitions. [2020-11-29 19:32:54,485 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-11-29 19:32:54,485 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 31 states and 36 transitions. [2020-11-29 19:32:54,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-11-29 19:32:54,486 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-11-29 19:32:54,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 36 transitions. [2020-11-29 19:32:54,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 19:32:54,486 INFO L691 BuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2020-11-29 19:32:54,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 36 transitions. [2020-11-29 19:32:54,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-11-29 19:32:54,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-11-29 19:32:54,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2020-11-29 19:32:54,489 INFO L714 BuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2020-11-29 19:32:54,489 INFO L594 BuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2020-11-29 19:32:54,489 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-11-29 19:32:54,489 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 36 transitions. [2020-11-29 19:32:54,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-11-29 19:32:54,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:32:54,489 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:32:54,490 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2020-11-29 19:32:54,490 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 2, 2, 1, 1, 1] [2020-11-29 19:32:54,490 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-11-29 19:32:54,491 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-11-29 19:32:54,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:32:54,491 INFO L82 PathProgramCache]: Analyzing trace with hash -697316795, now seen corresponding path program 3 times [2020-11-29 19:32:54,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:32:54,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797834451] [2020-11-29 19:32:54,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:32:54,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:32:54,513 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:32:54,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:32:54,540 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:32:54,546 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:32:54,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:32:54,547 INFO L82 PathProgramCache]: Analyzing trace with hash 2047759866, now seen corresponding path program 1 times [2020-11-29 19:32:54,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:32:54,548 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243518016] [2020-11-29 19:32:54,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:32:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:32:54,564 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:32:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:32:54,574 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:32:54,579 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:32:54,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:32:54,580 INFO L82 PathProgramCache]: Analyzing trace with hash 462437174, now seen corresponding path program 2 times [2020-11-29 19:32:54,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:32:54,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239324754] [2020-11-29 19:32:54,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:32:54,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:32:54,613 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:32:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:32:54,641 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:32:54,650 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:32:55,374 WARN L193 SmtUtils]: Spent 720.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 117 [2020-11-29 19:32:55,533 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-11-29 19:32:57,934 WARN L193 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 195 DAG size of output: 153 [2020-11-29 19:32:58,367 WARN L193 SmtUtils]: Spent 430.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-11-29 19:32:58,378 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 19:32:58,379 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 19:32:58,379 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 19:32:58,379 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 19:32:58,379 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-29 19:32:58,379 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:32:58,379 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 19:32:58,379 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 19:32:58,379 INFO L133 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration9_Lasso [2020-11-29 19:32:58,379 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 19:32:58,379 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 19:32:58,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:32:58,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:32:58,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:32:59,115 WARN L193 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 80 [2020-11-29 19:32:59,352 WARN L193 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2020-11-29 19:32:59,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:32:59,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:32:59,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:32:59,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:32:59,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:32:59,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:32:59,649 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2020-11-29 19:33:00,076 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-29 19:33:00,076 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/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-11-29 19:33:00,087 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-11-29 19:33:00,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:33:00,088 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:33:00,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:33:00,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:33:00,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:33:00,089 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:33:00,089 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:33:00,092 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/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-11-29 19:33:00,113 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-11-29 19:33:00,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:33:00,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:33:00,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:33:00,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:33:00,116 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:33:00,116 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:33:00,118 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/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-11-29 19:33:00,143 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-11-29 19:33:00,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:33:00,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:33:00,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:33:00,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:33:00,154 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:33:00,154 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:33:00,176 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/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-11-29 19:33:00,201 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-11-29 19:33:00,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:33:00,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:33:00,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:33:00,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:33:00,204 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:33:00,204 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:33:00,207 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/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-11-29 19:33:00,230 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-11-29 19:33:00,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:33:00,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:33:00,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:33:00,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:33:00,234 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:33:00,234 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:33:00,242 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/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-11-29 19:33:00,268 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-11-29 19:33:00,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:33:00,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:33:00,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:33:00,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:33:00,272 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:33:00,272 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:33:00,276 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/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-11-29 19:33:00,301 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-11-29 19:33:00,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:33:00,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:33:00,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:33:00,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:33:00,307 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:33:00,307 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:33:00,312 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/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-11-29 19:33:00,338 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-11-29 19:33:00,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:33:00,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:33:00,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:33:00,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:33:00,341 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:33:00,341 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:33:00,344 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/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-11-29 19:33:00,368 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-11-29 19:33:00,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:33:00,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:33:00,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:33:00,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:33:00,371 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:33:00,372 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:33:00,390 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:33:00,421 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-11-29 19:33:00,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:33:00,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:33:00,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:33:00,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:33:00,427 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:33:00,427 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:33:00,436 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:33:00,475 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-11-29 19:33:00,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:33:00,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:33:00,477 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:33:00,477 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:33:00,479 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:33:00,479 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:33:00,483 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:33:00,512 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-11-29 19:33:00,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:33:00,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:33:00,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:33:00,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:33:00,527 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:33:00,527 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:33:00,544 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/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-11-29 19:33:00,567 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-11-29 19:33:00,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:33:00,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:33:00,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:33:00,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:33:00,573 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:33:00,573 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:33:00,582 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-29 19:33:00,590 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-11-29 19:33:00,590 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/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-11-29 19:33:00,595 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-29 19:33:00,598 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-29 19:33:00,598 INFO L510 LassoAnalysis]: Proved termination. [2020-11-29 19:33:00,599 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-11-29 19:33:00,875 INFO L297 tatePredicateManager]: 42 out of 42 supporting invariants were superfluous and have been removed [2020-11-29 19:33:00,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:33:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:33:00,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-29 19:33:00,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:33:00,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:33:00,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-29 19:33:00,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:33:01,002 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-11-29 19:33:01,002 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:33:01,009 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:33:01,009 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 19:33:01,010 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2020-11-29 19:33:01,073 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:33:01,074 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-11-29 19:33:01,074 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-29 19:33:01,076 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:33:01,113 INFO L625 ElimStorePlain]: treesize reduction 24, result has 57.9 percent of original size [2020-11-29 19:33:01,114 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 19:33:01,114 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:33 [2020-11-29 19:33:01,173 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-11-29 19:33:01,176 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:33:01,201 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:33:01,202 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-11-29 19:33:01,204 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 19:33:01,251 INFO L625 ElimStorePlain]: treesize reduction 40, result has 43.7 percent of original size [2020-11-29 19:33:01,252 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 19:33:01,252 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:93, output treesize:31 [2020-11-29 19:33:01,426 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2020-11-29 19:33:01,427 INFO L350 Elim1Store]: treesize reduction 12, result has 87.9 percent of original size [2020-11-29 19:33:01,427 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-11-29 19:33:01,428 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-29 19:33:01,429 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-29 19:33:01,437 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:33:01,490 INFO L625 ElimStorePlain]: treesize reduction 68, result has 41.4 percent of original size [2020-11-29 19:33:01,491 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 19:33:01,491 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:48 [2020-11-29 19:33:01,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:33:01,596 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:33:01,597 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-11-29 19:33:01,597 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:33:01,610 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-11-29 19:33:01,612 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 19:33:01,635 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:33:01,635 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-11-29 19:33:01,641 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-29 19:33:01,716 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:33:01,716 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-11-29 19:33:01,717 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-29 19:33:01,957 WARN L193 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 37 [2020-11-29 19:33:01,958 INFO L625 ElimStorePlain]: treesize reduction 182, result has 32.8 percent of original size [2020-11-29 19:33:01,958 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-11-29 19:33:01,958 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:183, output treesize:89 [2020-11-29 19:33:02,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:33:02,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:33:02,082 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:33:02,082 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-11-29 19:33:02,083 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:33:02,142 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:33:02,142 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-11-29 19:33:02,143 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 19:33:02,207 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:33:02,207 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-11-29 19:33:02,208 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-29 19:33:02,238 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:33:02,238 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-11-29 19:33:02,239 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-29 19:33:02,331 INFO L625 ElimStorePlain]: treesize reduction 166, result has 34.4 percent of original size [2020-11-29 19:33:02,332 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:33:02,333 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-11-29 19:33:02,333 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:201, output treesize:87 [2020-11-29 19:33:02,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:33:02,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:33:02,801 WARN L193 SmtUtils]: Spent 441.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2020-11-29 19:33:02,801 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:33:02,802 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-11-29 19:33:02,802 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 8 Second operand 9 states. [2020-11-29 19:33:04,264 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-11-29 19:33:04,265 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-11-29 19:33:04,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-11-29 19:33:04,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 33 transitions. [2020-11-29 19:33:04,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 33 transitions. Stem has 16 letters. Loop has 15 letters. [2020-11-29 19:33:04,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:33:04,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 33 transitions. Stem has 31 letters. Loop has 15 letters. [2020-11-29 19:33:04,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:33:04,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 33 transitions. Stem has 16 letters. Loop has 30 letters. [2020-11-29 19:33:04,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:33:04,267 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 71 transitions. [2020-11-29 19:33:04,268 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-11-29 19:33:04,268 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 46 states and 51 transitions. [2020-11-29 19:33:04,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-11-29 19:33:04,268 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-11-29 19:33:04,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 51 transitions. [2020-11-29 19:33:04,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 19:33:04,269 INFO L691 BuchiCegarLoop]: Abstraction has 46 states and 51 transitions. [2020-11-29 19:33:04,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 51 transitions. [2020-11-29 19:33:04,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2020-11-29 19:33:04,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-11-29 19:33:04,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2020-11-29 19:33:04,271 INFO L714 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2020-11-29 19:33:04,271 INFO L594 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2020-11-29 19:33:04,271 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-11-29 19:33:04,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 44 transitions. [2020-11-29 19:33:04,271 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-11-29 19:33:04,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:33:04,271 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:33:04,272 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1, 1] [2020-11-29 19:33:04,272 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2020-11-29 19:33:04,272 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-11-29 19:33:04,272 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-11-29 19:33:04,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:33:04,272 INFO L82 PathProgramCache]: Analyzing trace with hash -141984140, now seen corresponding path program 3 times [2020-11-29 19:33:04,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:33:04,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607488027] [2020-11-29 19:33:04,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:33:04,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:33:04,288 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:33:04,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:33:04,300 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:33:04,304 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:33:04,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:33:04,304 INFO L82 PathProgramCache]: Analyzing trace with hash -276975247, now seen corresponding path program 2 times [2020-11-29 19:33:04,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:33:04,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781727205] [2020-11-29 19:33:04,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:33:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:33:04,309 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:33:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:33:04,312 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:33:04,313 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:33:04,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:33:04,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1710122082, now seen corresponding path program 4 times [2020-11-29 19:33:04,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:33:04,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773718816] [2020-11-29 19:33:04,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:33:04,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:33:04,331 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:33:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:33:04,344 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:33:04,348 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:33:04,494 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2020-11-29 19:33:07,454 WARN L193 SmtUtils]: Spent 2.92 s on a formula simplification. DAG size of input: 200 DAG size of output: 153 [2020-11-29 19:33:08,027 WARN L193 SmtUtils]: Spent 567.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-11-29 19:33:08,031 INFO L210 LassoAnalysis]: Preferences: [2020-11-29 19:33:08,031 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-29 19:33:08,031 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-29 19:33:08,031 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-29 19:33:08,031 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-29 19:33:08,031 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:33:08,031 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-29 19:33:08,031 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-29 19:33:08,031 INFO L133 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration10_Lasso [2020-11-29 19:33:08,031 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-29 19:33:08,031 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-29 19:33:08,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:33:08,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:33:08,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:33:08,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:33:08,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-11-29 19:33:08,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:33:08,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:33:08,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:33:08,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:33:08,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-29 19:33:08,630 WARN L193 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2020-11-29 19:33:08,767 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2020-11-29 19:33:09,344 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-29 19:33:09,344 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/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-11-29 19:33:09,351 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-11-29 19:33:09,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:33:09,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:33:09,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:33:09,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:33:09,355 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:33:09,355 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:33:09,357 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/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-11-29 19:33:09,378 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-11-29 19:33:09,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:33:09,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:33:09,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:33:09,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:33:09,383 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:33:09,383 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:33:09,386 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/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-11-29 19:33:09,406 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-11-29 19:33:09,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:33:09,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:33:09,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:33:09,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:33:09,409 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:33:09,409 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:33:09,411 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/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-11-29 19:33:09,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-11-29 19:33:09,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:33:09,434 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:33:09,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:33:09,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:33:09,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:33:09,434 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:33:09,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:33:09,435 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/z3 Starting monitored process 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-29 19:33:09,457 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-11-29 19:33:09,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:33:09,459 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:33:09,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:33:09,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:33:09,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:33:09,459 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:33:09,459 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:33:09,460 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/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-11-29 19:33:09,482 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-11-29 19:33:09,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:33:09,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:33:09,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:33:09,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:33:09,485 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:33:09,485 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:33:09,487 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/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-11-29 19:33:09,509 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-11-29 19:33:09,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:33:09,510 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:33:09,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:33:09,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:33:09,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:33:09,511 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:33:09,511 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:33:09,512 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/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-11-29 19:33:09,534 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-11-29 19:33:09,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:33:09,535 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:33:09,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:33:09,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:33:09,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:33:09,536 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:33:09,536 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:33:09,537 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/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-11-29 19:33:09,559 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-11-29 19:33:09,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:33:09,560 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-29 19:33:09,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:33:09,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:33:09,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:33:09,561 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-29 19:33:09,561 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-29 19:33:09,562 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/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-11-29 19:33:09,586 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-11-29 19:33:09,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-29 19:33:09,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-29 19:33:09,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-29 19:33:09,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-29 19:33:09,589 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-29 19:33:09,589 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-29 19:33:09,593 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-29 19:33:09,604 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-11-29 19:33:09,604 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/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-11-29 19:33:09,606 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-29 19:33:09,608 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-29 19:33:09,609 INFO L510 LassoAnalysis]: Proved termination. [2020-11-29 19:33:09,609 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-11-29 19:33:09,756 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2020-11-29 19:33:09,757 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-29 19:33:09,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:33:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:33:09,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-29 19:33:09,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:33:09,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:33:09,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-29 19:33:09,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:33:09,903 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:33:09,904 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-11-29 19:33:09,905 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-29 19:33:09,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:33:09,906 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-29 19:33:09,908 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:33:09,954 INFO L625 ElimStorePlain]: treesize reduction 32, result has 59.0 percent of original size [2020-11-29 19:33:09,954 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 19:33:09,954 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:46 [2020-11-29 19:33:09,985 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:33:09,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:33:10,037 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:33:10,037 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-11-29 19:33:10,039 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:33:10,052 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-11-29 19:33:10,053 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 19:33:10,060 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-11-29 19:33:10,061 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-29 19:33:10,115 INFO L625 ElimStorePlain]: treesize reduction 34, result has 60.0 percent of original size [2020-11-29 19:33:10,116 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-11-29 19:33:10,116 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:118, output treesize:51 [2020-11-29 19:33:10,166 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:33:10,167 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-11-29 19:33:10,167 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 44 transitions. cyclomatic complexity: 9 Second operand 6 states. [2020-11-29 19:33:10,321 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-11-29 19:33:10,325 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-11-29 19:33:10,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-11-29 19:33:10,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2020-11-29 19:33:10,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 17 letters. Loop has 7 letters. [2020-11-29 19:33:10,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:33:10,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 24 letters. Loop has 7 letters. [2020-11-29 19:33:10,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:33:10,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 17 letters. Loop has 14 letters. [2020-11-29 19:33:10,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-29 19:33:10,327 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 86 transitions. [2020-11-29 19:33:10,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-11-29 19:33:10,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 59 states and 64 transitions. [2020-11-29 19:33:10,328 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-11-29 19:33:10,328 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-11-29 19:33:10,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 64 transitions. [2020-11-29 19:33:10,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-29 19:33:10,329 INFO L691 BuchiCegarLoop]: Abstraction has 59 states and 64 transitions. [2020-11-29 19:33:10,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 64 transitions. [2020-11-29 19:33:10,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2020-11-29 19:33:10,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-11-29 19:33:10,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2020-11-29 19:33:10,333 INFO L714 BuchiCegarLoop]: Abstraction has 53 states and 58 transitions. [2020-11-29 19:33:10,333 INFO L594 BuchiCegarLoop]: Abstraction has 53 states and 58 transitions. [2020-11-29 19:33:10,333 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-11-29 19:33:10,333 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 58 transitions. [2020-11-29 19:33:10,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-11-29 19:33:10,334 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-29 19:33:10,334 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-29 19:33:10,336 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 4, 4, 2, 2, 2, 1, 1] [2020-11-29 19:33:10,336 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2020-11-29 19:33:10,336 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-11-29 19:33:10,337 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-11-29 19:33:10,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:33:10,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1450650531, now seen corresponding path program 5 times [2020-11-29 19:33:10,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:33:10,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697537235] [2020-11-29 19:33:10,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:33:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:33:10,643 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 35 proven. 43 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-11-29 19:33:10,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697537235] [2020-11-29 19:33:10,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114429330] [2020-11-29 19:33:10,643 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a0f062-4721-441a-87fa-1ab3cba9d6c0/bin/uautomizer/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-11-29 19:33:10,736 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2020-11-29 19:33:10,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 19:33:10,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 25 conjunts are in the unsatisfiable core [2020-11-29 19:33:10,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:33:10,790 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-11-29 19:33:10,790 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:33:10,815 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:33:10,815 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 19:33:10,815 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2020-11-29 19:33:10,919 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:33:10,920 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-11-29 19:33:10,921 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:33:10,923 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:33:10,966 INFO L625 ElimStorePlain]: treesize reduction 16, result has 63.6 percent of original size [2020-11-29 19:33:10,966 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 19:33:10,966 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:28 [2020-11-29 19:33:11,012 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-11-29 19:33:11,013 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:33:11,057 INFO L625 ElimStorePlain]: treesize reduction 4, result has 88.6 percent of original size [2020-11-29 19:33:11,058 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 19:33:11,058 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:31 [2020-11-29 19:33:11,163 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:33:11,164 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-11-29 19:33:11,165 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:33:11,165 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:33:11,167 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:33:11,276 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 26 [2020-11-29 19:33:11,277 INFO L625 ElimStorePlain]: treesize reduction 42, result has 48.1 percent of original size [2020-11-29 19:33:11,277 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 19:33:11,277 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:39 [2020-11-29 19:33:11,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:33:11,395 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:33:11,396 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-11-29 19:33:11,396 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:33:11,405 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-11-29 19:33:11,406 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 19:33:11,522 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2020-11-29 19:33:11,523 INFO L625 ElimStorePlain]: treesize reduction 68, result has 36.4 percent of original size [2020-11-29 19:33:11,523 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 19:33:11,523 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:89, output treesize:39 [2020-11-29 19:33:11,609 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:33:11,609 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-11-29 19:33:11,610 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:33:11,651 INFO L625 ElimStorePlain]: treesize reduction 16, result has 69.2 percent of original size [2020-11-29 19:33:11,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:33:11,652 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-11-29 19:33:11,652 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:36 [2020-11-29 19:33:11,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:33:11,698 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:33:11,699 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:33:11,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:33:11,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 19:33:11,711 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-11-29 19:33:11,712 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 19:33:11,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 19:33:11,724 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 19:33:11,725 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-11-29 19:33:11,725 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 19:33:11,737 INFO L625 ElimStorePlain]: treesize reduction 17, result has 32.0 percent of original size [2020-11-29 19:33:11,737 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 19:33:11,738 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:76, output treesize:3 [2020-11-29 19:33:11,758 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 59 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-11-29 19:33:11,758 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 19:33:11,758 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2020-11-29 19:33:11,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629223237] [2020-11-29 19:33:11,759 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-29 19:33:11,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:33:11,759 INFO L82 PathProgramCache]: Analyzing trace with hash -276975247, now seen corresponding path program 3 times [2020-11-29 19:33:11,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:33:11,759 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393918403] [2020-11-29 19:33:11,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:33:11,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:33:11,763 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:33:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:33:11,766 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:33:11,768 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:33:11,981 WARN L193 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2020-11-29 19:33:12,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:33:12,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-29 19:33:12,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2020-11-29 19:33:12,041 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. cyclomatic complexity: 10 Second operand 20 states. [2020-11-29 19:33:12,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:33:12,793 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2020-11-29 19:33:12,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-29 19:33:12,793 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 41 transitions. [2020-11-29 19:33:12,794 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-29 19:33:12,794 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 0 states and 0 transitions. [2020-11-29 19:33:12,794 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-11-29 19:33:12,794 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-11-29 19:33:12,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-11-29 19:33:12,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-29 19:33:12,794 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 19:33:12,794 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 19:33:12,794 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 19:33:12,795 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-11-29 19:33:12,795 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-11-29 19:33:12,795 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-11-29 19:33:12,795 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-11-29 19:33:12,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 07:33:12 BoogieIcfgContainer [2020-11-29 19:33:12,800 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-11-29 19:33:12,801 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 19:33:12,801 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 19:33:12,801 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 19:33:12,801 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:32:14" (3/4) ... [2020-11-29 19:33:12,805 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-29 19:33:12,805 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 19:33:12,806 INFO L168 Benchmark]: Toolchain (without parser) took 58947.62 ms. Allocated memory was 81.8 MB in the beginning and 211.8 MB in the end (delta: 130.0 MB). Free memory was 52.5 MB in the beginning and 90.3 MB in the end (delta: -37.8 MB). Peak memory consumption was 92.7 MB. Max. memory is 16.1 GB. [2020-11-29 19:33:12,806 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 81.8 MB. Free memory was 41.8 MB in the beginning and 41.7 MB in the end (delta: 39.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 19:33:12,806 INFO L168 Benchmark]: CACSL2BoogieTranslator took 220.63 ms. Allocated memory was 81.8 MB in the beginning and 100.7 MB in the end (delta: 18.9 MB). Free memory was 52.2 MB in the beginning and 80.2 MB in the end (delta: -28.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-29 19:33:12,806 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.95 ms. Allocated memory is still 100.7 MB. Free memory was 79.7 MB in the beginning and 78.6 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 19:33:12,807 INFO L168 Benchmark]: Boogie Preprocessor took 53.58 ms. Allocated memory is still 100.7 MB. Free memory was 78.6 MB in the beginning and 77.6 MB in the end (delta: 1.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 19:33:12,807 INFO L168 Benchmark]: RCFGBuilder took 437.24 ms. Allocated memory is still 100.7 MB. Free memory was 77.6 MB in the beginning and 64.0 MB in the end (delta: 13.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-29 19:33:12,808 INFO L168 Benchmark]: BuchiAutomizer took 58150.99 ms. Allocated memory was 100.7 MB in the beginning and 211.8 MB in the end (delta: 111.1 MB). Free memory was 63.5 MB in the beginning and 90.3 MB in the end (delta: -26.8 MB). Peak memory consumption was 87.4 MB. Max. memory is 16.1 GB. [2020-11-29 19:33:12,809 INFO L168 Benchmark]: Witness Printer took 3.94 ms. Allocated memory is still 211.8 MB. Free memory is still 90.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 19:33:12,811 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.27 ms. Allocated memory is still 81.8 MB. Free memory was 41.8 MB in the beginning and 41.7 MB in the end (delta: 39.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 220.63 ms. Allocated memory was 81.8 MB in the beginning and 100.7 MB in the end (delta: 18.9 MB). Free memory was 52.2 MB in the beginning and 80.2 MB in the end (delta: -28.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 74.95 ms. Allocated memory is still 100.7 MB. Free memory was 79.7 MB in the beginning and 78.6 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 53.58 ms. Allocated memory is still 100.7 MB. Free memory was 78.6 MB in the beginning and 77.6 MB in the end (delta: 1.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 437.24 ms. Allocated memory is still 100.7 MB. Free memory was 77.6 MB in the beginning and 64.0 MB in the end (delta: 13.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 58150.99 ms. Allocated memory was 100.7 MB in the beginning and 211.8 MB in the end (delta: 111.1 MB). Free memory was 63.5 MB in the beginning and 90.3 MB in the end (delta: -26.8 MB). Peak memory consumption was 87.4 MB. Max. memory is 16.1 GB. * Witness Printer took 3.94 ms. Allocated memory is still 211.8 MB. Free memory is still 90.3 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 58.0s and 12 iterations. TraceHistogramMax:8. Analysis of lassos took 25.8s. Construction of modules took 25.9s. Büchi inclusion checks took 6.1s. 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.9s 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: 42ms 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...