./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg --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 7e4d89645739beae47f9c52ff5003bd634bd856a7fdd28a03c9ca1afb29cead1 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-28 09:41:44,689 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 09:41:44,692 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 09:41:44,731 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 09:41:44,732 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 09:41:44,733 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 09:41:44,735 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 09:41:44,738 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 09:41:44,740 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 09:41:44,742 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 09:41:44,743 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 09:41:44,745 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 09:41:44,746 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 09:41:44,747 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 09:41:44,749 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 09:41:44,751 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 09:41:44,752 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 09:41:44,754 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 09:41:44,757 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 09:41:44,760 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 09:41:44,762 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 09:41:44,764 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 09:41:44,766 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 09:41:44,767 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 09:41:44,771 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 09:41:44,772 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 09:41:44,773 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 09:41:44,774 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 09:41:44,775 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 09:41:44,776 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 09:41:44,777 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 09:41:44,778 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 09:41:44,779 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 09:41:44,780 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 09:41:44,782 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 09:41:44,783 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 09:41:44,784 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 09:41:44,784 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 09:41:44,785 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 09:41:44,786 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 09:41:44,787 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 09:41:44,790 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-10-28 09:41:44,839 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 09:41:44,842 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 09:41:44,842 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 09:41:44,843 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 09:41:44,844 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 09:41:44,845 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 09:41:44,845 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 09:41:44,845 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-10-28 09:41:44,845 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-10-28 09:41:44,846 INFO L138 SettingsManager]: * Use old map elimination=false [2021-10-28 09:41:44,847 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-10-28 09:41:44,847 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-10-28 09:41:44,847 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-10-28 09:41:44,848 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 09:41:44,848 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-28 09:41:44,848 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 09:41:44,848 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 09:41:44,848 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-10-28 09:41:44,849 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-10-28 09:41:44,849 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-10-28 09:41:44,849 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 09:41:44,849 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-10-28 09:41:44,850 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 09:41:44,850 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-10-28 09:41:44,850 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 09:41:44,850 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 09:41:44,851 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 09:41:44,851 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 09:41:44,851 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 09:41:44,852 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-10-28 09:41:44,853 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_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/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_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg 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 -> 7e4d89645739beae47f9c52ff5003bd634bd856a7fdd28a03c9ca1afb29cead1 [2021-10-28 09:41:45,135 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 09:41:45,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 09:41:45,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 09:41:45,167 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 09:41:45,168 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 09:41:45,169 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/../../sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca.i [2021-10-28 09:41:45,273 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/data/da62515af/cb7bfdfde0d54d36ae3b909f682d7115/FLAGe3f9ef91f [2021-10-28 09:41:45,824 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 09:41:45,825 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca.i [2021-10-28 09:41:45,842 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/data/da62515af/cb7bfdfde0d54d36ae3b909f682d7115/FLAGe3f9ef91f [2021-10-28 09:41:46,216 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/data/da62515af/cb7bfdfde0d54d36ae3b909f682d7115 [2021-10-28 09:41:46,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 09:41:46,220 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 09:41:46,222 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 09:41:46,222 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 09:41:46,225 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 09:41:46,226 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 09:41:46" (1/1) ... [2021-10-28 09:41:46,227 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76348bf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:41:46, skipping insertion in model container [2021-10-28 09:41:46,228 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 09:41:46" (1/1) ... [2021-10-28 09:41:46,234 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 09:41:46,266 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 09:41:46,543 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 09:41:46,563 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 09:41:46,617 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 09:41:46,653 INFO L208 MainTranslator]: Completed translation [2021-10-28 09:41:46,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:41:46 WrapperNode [2021-10-28 09:41:46,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 09:41:46,655 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 09:41:46,655 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 09:41:46,655 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 09:41:46,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:41:46" (1/1) ... [2021-10-28 09:41:46,685 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:41:46" (1/1) ... [2021-10-28 09:41:46,709 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 09:41:46,711 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 09:41:46,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 09:41:46,711 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 09:41:46,719 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:41:46" (1/1) ... [2021-10-28 09:41:46,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:41:46" (1/1) ... [2021-10-28 09:41:46,739 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:41:46" (1/1) ... [2021-10-28 09:41:46,740 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:41:46" (1/1) ... [2021-10-28 09:41:46,743 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:41:46" (1/1) ... [2021-10-28 09:41:46,748 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:41:46" (1/1) ... [2021-10-28 09:41:46,749 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:41:46" (1/1) ... [2021-10-28 09:41:46,751 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 09:41:46,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 09:41:46,752 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 09:41:46,753 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 09:41:46,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:41:46" (1/1) ... [2021-10-28 09:41:46,760 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 09:41:46,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:41:46,782 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 09:41:46,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-10-28 09:41:46,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-28 09:41:46,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-28 09:41:46,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 09:41:46,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-28 09:41:46,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 09:41:46,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 09:41:47,024 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 09:41:47,025 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-10-28 09:41:47,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:41:47 BoogieIcfgContainer [2021-10-28 09:41:47,027 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 09:41:47,028 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-10-28 09:41:47,028 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-10-28 09:41:47,031 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-10-28 09:41:47,032 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-28 09:41:47,032 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.10 09:41:46" (1/3) ... [2021-10-28 09:41:47,033 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ce053c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.10 09:41:47, skipping insertion in model container [2021-10-28 09:41:47,033 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-28 09:41:47,033 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:41:46" (2/3) ... [2021-10-28 09:41:47,034 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ce053c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.10 09:41:47, skipping insertion in model container [2021-10-28 09:41:47,034 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-28 09:41:47,034 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:41:47" (3/3) ... [2021-10-28 09:41:47,035 INFO L389 chiAutomizerObserver]: Analyzing ICFG Urban-2013WST-Fig2-alloca.i [2021-10-28 09:41:47,094 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-10-28 09:41:47,095 INFO L360 BuchiCegarLoop]: Hoare is false [2021-10-28 09:41:47,095 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-10-28 09:41:47,095 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-28 09:41:47,095 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-28 09:41:47,095 INFO L364 BuchiCegarLoop]: Difference is false [2021-10-28 09:41:47,095 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-28 09:41:47,096 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-10-28 09:41:47,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:41:47,139 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-10-28 09:41:47,140 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 09:41:47,140 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 09:41:47,145 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 09:41:47,146 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-10-28 09:41:47,146 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-10-28 09:41:47,146 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:41:47,148 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-10-28 09:41:47,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 09:41:47,149 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 09:41:47,149 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 09:41:47,149 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-10-28 09:41:47,157 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 11#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 7#L549-3true [2021-10-28 09:41:47,158 INFO L793 eck$LassoCheckResult]: Loop: 7#L549-3true call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 3#L549-1true assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 8#L551-3true assume !true; 12#L551-4true call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 7#L549-3true [2021-10-28 09:41:47,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:41:47,176 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-10-28 09:41:47,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:41:47,189 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901881004] [2021-10-28 09:41:47,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:41:47,192 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:41:47,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:41:47,284 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 09:41:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:41:47,325 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 09:41:47,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:41:47,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1144360, now seen corresponding path program 1 times [2021-10-28 09:41:47,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:41:47,329 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728600694] [2021-10-28 09:41:47,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:41:47,330 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:41:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:41:47,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:41:47,426 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:41:47,427 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728600694] [2021-10-28 09:41:47,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728600694] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:41:47,428 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:41:47,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 09:41:47,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468973824] [2021-10-28 09:41:47,444 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-28 09:41:47,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:41:47,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-28 09:41:47,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-28 09:41:47,469 INFO L87 Difference]: Start difference. First operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:41:47,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:41:47,474 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2021-10-28 09:41:47,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-28 09:41:47,476 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2021-10-28 09:41:47,478 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-10-28 09:41:47,481 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 7 states and 8 transitions. [2021-10-28 09:41:47,482 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2021-10-28 09:41:47,482 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-10-28 09:41:47,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2021-10-28 09:41:47,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:41:47,483 INFO L681 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2021-10-28 09:41:47,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2021-10-28 09:41:47,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2021-10-28 09:41:47,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:41:47,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2021-10-28 09:41:47,508 INFO L704 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2021-10-28 09:41:47,508 INFO L587 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2021-10-28 09:41:47,508 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-10-28 09:41:47,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2021-10-28 09:41:47,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-10-28 09:41:47,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 09:41:47,510 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 09:41:47,510 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 09:41:47,511 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-10-28 09:41:47,511 INFO L791 eck$LassoCheckResult]: Stem: 32#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 33#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 34#L549-3 [2021-10-28 09:41:47,512 INFO L793 eck$LassoCheckResult]: Loop: 34#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 30#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 31#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 35#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 36#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 34#L549-3 [2021-10-28 09:41:47,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:41:47,513 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-10-28 09:41:47,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:41:47,514 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90155408] [2021-10-28 09:41:47,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:41:47,515 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:41:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:41:47,535 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 09:41:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:41:47,562 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 09:41:47,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:41:47,563 INFO L85 PathProgramCache]: Analyzing trace with hash 35468273, now seen corresponding path program 1 times [2021-10-28 09:41:47,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:41:47,564 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030033507] [2021-10-28 09:41:47,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:41:47,564 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:41:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:41:47,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:41:47,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:41:47,670 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030033507] [2021-10-28 09:41:47,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030033507] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:41:47,671 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:41:47,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:41:47,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799409319] [2021-10-28 09:41:47,671 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-28 09:41:47,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:41:47,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:41:47,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:41:47,673 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:41:47,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:41:47,767 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2021-10-28 09:41:47,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 09:41:47,768 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2021-10-28 09:41:47,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-10-28 09:41:47,769 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2021-10-28 09:41:47,770 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-10-28 09:41:47,770 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-10-28 09:41:47,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2021-10-28 09:41:47,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:41:47,770 INFO L681 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2021-10-28 09:41:47,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2021-10-28 09:41:47,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2021-10-28 09:41:47,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:41:47,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2021-10-28 09:41:47,772 INFO L704 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2021-10-28 09:41:47,772 INFO L587 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2021-10-28 09:41:47,772 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-10-28 09:41:47,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2021-10-28 09:41:47,790 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-10-28 09:41:47,791 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 09:41:47,791 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 09:41:47,791 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 09:41:47,791 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2021-10-28 09:41:47,792 INFO L791 eck$LassoCheckResult]: Stem: 57#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 58#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 59#L549-3 [2021-10-28 09:41:47,792 INFO L793 eck$LassoCheckResult]: Loop: 59#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 55#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 56#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 60#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 61#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 63#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 62#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 59#L549-3 [2021-10-28 09:41:47,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:41:47,792 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-10-28 09:41:47,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:41:47,793 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199331982] [2021-10-28 09:41:47,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:41:47,794 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:41:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:41:47,805 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 09:41:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:41:47,827 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 09:41:47,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:41:47,829 INFO L85 PathProgramCache]: Analyzing trace with hash -274676436, now seen corresponding path program 1 times [2021-10-28 09:41:47,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:41:47,829 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806029451] [2021-10-28 09:41:47,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:41:47,830 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:41:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:41:47,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:41:47,936 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:41:47,936 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806029451] [2021-10-28 09:41:47,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806029451] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 09:41:47,937 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418004915] [2021-10-28 09:41:47,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:41:47,937 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 09:41:47,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:41:47,939 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 09:41:47,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-28 09:41:47,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:41:48,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-28 09:41:48,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 09:41:48,045 INFO L388 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 [2021-10-28 09:41:48,072 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:48,101 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-10-28 09:41:48,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:41:48,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418004915] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 09:41:48,110 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 09:41:48,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2021-10-28 09:41:48,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666616818] [2021-10-28 09:41:48,110 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-28 09:41:48,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:41:48,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 09:41:48,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-10-28 09:41:48,112 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:41:48,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:41:48,148 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2021-10-28 09:41:48,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 09:41:48,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2021-10-28 09:41:48,150 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2021-10-28 09:41:48,150 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2021-10-28 09:41:48,150 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-10-28 09:41:48,150 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-10-28 09:41:48,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2021-10-28 09:41:48,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:41:48,151 INFO L681 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2021-10-28 09:41:48,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2021-10-28 09:41:48,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2021-10-28 09:41:48,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:41:48,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2021-10-28 09:41:48,153 INFO L704 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2021-10-28 09:41:48,153 INFO L587 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2021-10-28 09:41:48,153 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-10-28 09:41:48,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2021-10-28 09:41:48,154 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2021-10-28 09:41:48,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 09:41:48,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 09:41:48,154 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 09:41:48,154 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1, 1, 1, 1] [2021-10-28 09:41:48,155 INFO L791 eck$LassoCheckResult]: Stem: 107#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 108#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 109#L549-3 [2021-10-28 09:41:48,155 INFO L793 eck$LassoCheckResult]: Loop: 109#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 105#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 106#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 110#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 111#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 115#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 114#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 113#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 112#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 109#L549-3 [2021-10-28 09:41:48,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:41:48,155 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-10-28 09:41:48,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:41:48,156 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985757697] [2021-10-28 09:41:48,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:41:48,156 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:41:48,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:41:48,164 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 09:41:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:41:48,172 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 09:41:48,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:41:48,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1970998361, now seen corresponding path program 2 times [2021-10-28 09:41:48,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:41:48,173 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443519783] [2021-10-28 09:41:48,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:41:48,174 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:41:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:41:48,259 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:41:48,260 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:41:48,260 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443519783] [2021-10-28 09:41:48,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443519783] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 09:41:48,261 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015998850] [2021-10-28 09:41:48,261 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-28 09:41:48,261 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 09:41:48,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:41:48,263 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 09:41:48,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-28 09:41:48,316 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-10-28 09:41:48,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-28 09:41:48,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-28 09:41:48,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 09:41:48,327 INFO L388 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 [2021-10-28 09:41:48,346 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:48,371 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:48,392 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-10-28 09:41:48,399 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:41:48,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015998850] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 09:41:48,400 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 09:41:48,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10 [2021-10-28 09:41:48,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002480236] [2021-10-28 09:41:48,400 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-28 09:41:48,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:41:48,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-28 09:41:48,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-10-28 09:41:48,402 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 2 Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:41:48,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:41:48,466 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2021-10-28 09:41:48,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-28 09:41:48,467 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2021-10-28 09:41:48,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2021-10-28 09:41:48,468 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2021-10-28 09:41:48,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2021-10-28 09:41:48,468 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2021-10-28 09:41:48,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2021-10-28 09:41:48,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:41:48,469 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2021-10-28 09:41:48,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2021-10-28 09:41:48,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-10-28 09:41:48,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:41:48,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2021-10-28 09:41:48,471 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2021-10-28 09:41:48,471 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2021-10-28 09:41:48,471 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-10-28 09:41:48,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2021-10-28 09:41:48,472 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2021-10-28 09:41:48,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 09:41:48,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 09:41:48,472 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 09:41:48,472 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 1, 1, 1, 1] [2021-10-28 09:41:48,472 INFO L791 eck$LassoCheckResult]: Stem: 172#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 173#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 174#L549-3 [2021-10-28 09:41:48,473 INFO L793 eck$LassoCheckResult]: Loop: 174#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 170#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 171#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 175#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 176#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 177#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 182#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 181#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 180#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 179#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 178#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 174#L549-3 [2021-10-28 09:41:48,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:41:48,473 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-10-28 09:41:48,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:41:48,474 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429896934] [2021-10-28 09:41:48,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:41:48,474 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:41:48,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:41:48,480 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 09:41:48,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:41:48,487 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 09:41:48,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:41:48,488 INFO L85 PathProgramCache]: Analyzing trace with hash -48795806, now seen corresponding path program 3 times [2021-10-28 09:41:48,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:41:48,488 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549943749] [2021-10-28 09:41:48,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:41:48,489 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:41:48,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:41:48,591 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:41:48,591 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:41:48,591 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549943749] [2021-10-28 09:41:48,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549943749] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 09:41:48,592 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166825180] [2021-10-28 09:41:48,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-28 09:41:48,592 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 09:41:48,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:41:48,630 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 09:41:48,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-28 09:41:48,689 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-10-28 09:41:48,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-28 09:41:48,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-28 09:41:48,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 09:41:48,702 INFO L388 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 [2021-10-28 09:41:48,720 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:48,759 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:48,790 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:48,823 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-10-28 09:41:48,830 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:41:48,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166825180] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 09:41:48,831 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 09:41:48,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 13 [2021-10-28 09:41:48,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561126792] [2021-10-28 09:41:48,833 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-28 09:41:48,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:41:48,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-28 09:41:48,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-10-28 09:41:48,837 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. cyclomatic complexity: 2 Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:41:48,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:41:48,941 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2021-10-28 09:41:48,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-28 09:41:48,942 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2021-10-28 09:41:48,944 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2021-10-28 09:41:48,946 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions. [2021-10-28 09:41:48,946 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-10-28 09:41:48,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2021-10-28 09:41:48,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions. [2021-10-28 09:41:48,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:41:48,947 INFO L681 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2021-10-28 09:41:48,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions. [2021-10-28 09:41:48,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-10-28 09:41:48,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:41:48,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2021-10-28 09:41:48,950 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2021-10-28 09:41:48,950 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2021-10-28 09:41:48,950 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-10-28 09:41:48,951 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2021-10-28 09:41:48,952 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2021-10-28 09:41:48,952 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 09:41:48,952 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 09:41:48,953 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 09:41:48,953 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 1, 1, 1, 1] [2021-10-28 09:41:48,953 INFO L791 eck$LassoCheckResult]: Stem: 252#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 253#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 254#L549-3 [2021-10-28 09:41:48,954 INFO L793 eck$LassoCheckResult]: Loop: 254#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 250#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 251#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 257#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 255#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 256#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 264#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 263#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 262#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 261#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 260#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 259#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 258#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 254#L549-3 [2021-10-28 09:41:48,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:41:48,954 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-10-28 09:41:48,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:41:48,958 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665546930] [2021-10-28 09:41:48,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:41:48,959 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:41:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:41:48,984 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 09:41:49,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:41:49,011 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 09:41:49,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:41:49,013 INFO L85 PathProgramCache]: Analyzing trace with hash 351922269, now seen corresponding path program 4 times [2021-10-28 09:41:49,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:41:49,018 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6668662] [2021-10-28 09:41:49,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:41:49,018 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:41:49,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:41:49,174 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:41:49,174 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:41:49,174 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6668662] [2021-10-28 09:41:49,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6668662] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 09:41:49,175 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442317501] [2021-10-28 09:41:49,175 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-28 09:41:49,175 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 09:41:49,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:41:49,177 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 09:41:49,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-28 09:41:49,255 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-28 09:41:49,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-28 09:41:49,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-28 09:41:49,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 09:41:49,267 INFO L388 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 [2021-10-28 09:41:49,296 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:49,331 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:49,358 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:49,384 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:49,406 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-10-28 09:41:49,412 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:41:49,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442317501] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 09:41:49,413 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 09:41:49,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 16 [2021-10-28 09:41:49,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478622866] [2021-10-28 09:41:49,414 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-28 09:41:49,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:41:49,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-28 09:41:49,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2021-10-28 09:41:49,415 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 2 Second operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:41:49,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:41:49,537 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2021-10-28 09:41:49,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-28 09:41:49,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2021-10-28 09:41:49,544 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2021-10-28 09:41:49,545 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2021-10-28 09:41:49,545 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-10-28 09:41:49,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-10-28 09:41:49,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2021-10-28 09:41:49,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:41:49,547 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2021-10-28 09:41:49,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2021-10-28 09:41:49,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-10-28 09:41:49,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:41:49,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2021-10-28 09:41:49,550 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2021-10-28 09:41:49,550 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2021-10-28 09:41:49,550 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-10-28 09:41:49,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2021-10-28 09:41:49,551 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2021-10-28 09:41:49,551 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 09:41:49,551 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 09:41:49,552 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 09:41:49,552 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 1, 1, 1, 1] [2021-10-28 09:41:49,552 INFO L791 eck$LassoCheckResult]: Stem: 347#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 348#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 349#L549-3 [2021-10-28 09:41:49,552 INFO L793 eck$LassoCheckResult]: Loop: 349#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 345#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 346#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 352#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 350#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 351#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 361#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 360#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 359#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 358#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 357#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 356#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 355#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 354#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 353#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 349#L549-3 [2021-10-28 09:41:49,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:41:49,553 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2021-10-28 09:41:49,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:41:49,555 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055928462] [2021-10-28 09:41:49,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:41:49,556 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:41:49,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:41:49,564 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 09:41:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:41:49,575 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 09:41:49,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:41:49,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1105064296, now seen corresponding path program 5 times [2021-10-28 09:41:49,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:41:49,581 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678678489] [2021-10-28 09:41:49,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:41:49,583 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:41:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:41:49,750 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:41:49,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:41:49,750 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678678489] [2021-10-28 09:41:49,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678678489] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 09:41:49,751 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566256172] [2021-10-28 09:41:49,751 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-10-28 09:41:49,751 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 09:41:49,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:41:49,753 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 09:41:49,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-10-28 09:41:49,834 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-10-28 09:41:49,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-28 09:41:49,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-28 09:41:49,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 09:41:49,850 INFO L388 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 [2021-10-28 09:41:49,862 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:49,883 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:49,903 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:49,931 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:49,956 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:49,981 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-10-28 09:41:49,986 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:41:49,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566256172] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 09:41:49,987 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 09:41:49,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 19 [2021-10-28 09:41:49,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529975022] [2021-10-28 09:41:49,988 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-28 09:41:49,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:41:49,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-10-28 09:41:49,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2021-10-28 09:41:49,989 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. cyclomatic complexity: 2 Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:41:50,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:41:50,145 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2021-10-28 09:41:50,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-28 09:41:50,146 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 20 transitions. [2021-10-28 09:41:50,148 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2021-10-28 09:41:50,173 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 20 transitions. [2021-10-28 09:41:50,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-10-28 09:41:50,173 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-10-28 09:41:50,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 20 transitions. [2021-10-28 09:41:50,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:41:50,174 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2021-10-28 09:41:50,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 20 transitions. [2021-10-28 09:41:50,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-10-28 09:41:50,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:41:50,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2021-10-28 09:41:50,175 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2021-10-28 09:41:50,175 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2021-10-28 09:41:50,175 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-10-28 09:41:50,176 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2021-10-28 09:41:50,176 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2021-10-28 09:41:50,176 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 09:41:50,176 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 09:41:50,177 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 09:41:50,177 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [7, 6, 1, 1, 1, 1] [2021-10-28 09:41:50,177 INFO L791 eck$LassoCheckResult]: Stem: 457#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 458#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 459#L549-3 [2021-10-28 09:41:50,177 INFO L793 eck$LassoCheckResult]: Loop: 459#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 455#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 456#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 462#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 460#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 461#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 473#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 472#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 471#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 470#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 469#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 468#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 467#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 466#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 465#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 464#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 463#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 459#L549-3 [2021-10-28 09:41:50,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:41:50,177 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2021-10-28 09:41:50,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:41:50,177 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199581483] [2021-10-28 09:41:50,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:41:50,178 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:41:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:41:50,196 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 09:41:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:41:50,203 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 09:41:50,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:41:50,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1109814765, now seen corresponding path program 6 times [2021-10-28 09:41:50,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:41:50,206 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991622895] [2021-10-28 09:41:50,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:41:50,206 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:41:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:41:50,380 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:41:50,380 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:41:50,380 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991622895] [2021-10-28 09:41:50,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991622895] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 09:41:50,381 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360076241] [2021-10-28 09:41:50,381 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-10-28 09:41:50,381 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 09:41:50,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:41:50,385 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 09:41:50,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-10-28 09:41:50,479 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2021-10-28 09:41:50,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-28 09:41:50,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2021-10-28 09:41:50,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 09:41:50,490 INFO L388 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 [2021-10-28 09:41:50,504 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:50,526 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:50,559 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:50,585 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:50,608 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:50,628 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:50,647 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-10-28 09:41:50,652 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:41:50,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360076241] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 09:41:50,653 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 09:41:50,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 22 [2021-10-28 09:41:50,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018587797] [2021-10-28 09:41:50,653 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-28 09:41:50,654 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:41:50,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-10-28 09:41:50,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2021-10-28 09:41:50,655 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. cyclomatic complexity: 2 Second operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:41:50,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:41:50,817 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2021-10-28 09:41:50,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-28 09:41:50,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2021-10-28 09:41:50,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2021-10-28 09:41:50,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 22 transitions. [2021-10-28 09:41:50,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2021-10-28 09:41:50,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2021-10-28 09:41:50,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 22 transitions. [2021-10-28 09:41:50,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:41:50,823 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2021-10-28 09:41:50,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 22 transitions. [2021-10-28 09:41:50,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-10-28 09:41:50,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:41:50,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2021-10-28 09:41:50,825 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2021-10-28 09:41:50,825 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2021-10-28 09:41:50,825 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-10-28 09:41:50,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 22 transitions. [2021-10-28 09:41:50,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2021-10-28 09:41:50,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 09:41:50,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 09:41:50,826 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 09:41:50,826 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 1, 1, 1, 1] [2021-10-28 09:41:50,826 INFO L791 eck$LassoCheckResult]: Stem: 582#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 583#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 584#L549-3 [2021-10-28 09:41:50,826 INFO L793 eck$LassoCheckResult]: Loop: 584#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 580#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 581#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 585#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 586#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 587#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 600#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 599#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 598#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 597#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 596#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 595#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 594#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 593#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 592#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 591#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 590#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 589#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 588#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 584#L549-3 [2021-10-28 09:41:50,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:41:50,827 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2021-10-28 09:41:50,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:41:50,827 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796945900] [2021-10-28 09:41:50,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:41:50,827 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:41:50,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:41:50,833 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 09:41:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:41:50,837 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 09:41:50,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:41:50,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1380048178, now seen corresponding path program 7 times [2021-10-28 09:41:50,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:41:50,839 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010309639] [2021-10-28 09:41:50,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:41:50,839 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:41:50,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:41:51,063 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:41:51,063 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:41:51,064 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010309639] [2021-10-28 09:41:51,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010309639] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 09:41:51,064 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678930691] [2021-10-28 09:41:51,064 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-10-28 09:41:51,064 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 09:41:51,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:41:51,066 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 09:41:51,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-10-28 09:41:51,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:41:51,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-28 09:41:51,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 09:41:51,189 INFO L388 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 [2021-10-28 09:41:51,208 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:51,232 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:51,254 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:51,278 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:51,303 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:51,325 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:51,347 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:51,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-10-28 09:41:51,377 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:41:51,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678930691] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 09:41:51,378 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 09:41:51,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 25 [2021-10-28 09:41:51,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266595400] [2021-10-28 09:41:51,380 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-28 09:41:51,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:41:51,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-28 09:41:51,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2021-10-28 09:41:51,384 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. cyclomatic complexity: 2 Second operand has 25 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:41:51,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:41:51,573 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2021-10-28 09:41:51,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-28 09:41:51,574 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 24 transitions. [2021-10-28 09:41:51,578 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2021-10-28 09:41:51,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 24 transitions. [2021-10-28 09:41:51,579 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2021-10-28 09:41:51,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2021-10-28 09:41:51,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 24 transitions. [2021-10-28 09:41:51,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:41:51,580 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2021-10-28 09:41:51,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 24 transitions. [2021-10-28 09:41:51,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-10-28 09:41:51,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:41:51,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2021-10-28 09:41:51,589 INFO L704 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2021-10-28 09:41:51,589 INFO L587 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2021-10-28 09:41:51,589 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-10-28 09:41:51,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 24 transitions. [2021-10-28 09:41:51,590 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2021-10-28 09:41:51,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 09:41:51,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 09:41:51,591 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 09:41:51,591 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [9, 8, 1, 1, 1, 1] [2021-10-28 09:41:51,591 INFO L791 eck$LassoCheckResult]: Stem: 722#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 723#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 724#L549-3 [2021-10-28 09:41:51,591 INFO L793 eck$LassoCheckResult]: Loop: 724#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 720#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 721#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 725#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 726#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 727#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 742#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 741#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 740#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 739#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 738#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 737#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 736#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 735#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 734#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 733#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 732#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 731#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 730#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 729#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 728#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 724#L549-3 [2021-10-28 09:41:51,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:41:51,591 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2021-10-28 09:41:51,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:41:51,592 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618059449] [2021-10-28 09:41:51,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:41:51,592 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:41:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:41:51,597 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 09:41:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:41:51,601 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 09:41:51,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:41:51,602 INFO L85 PathProgramCache]: Analyzing trace with hash 918646985, now seen corresponding path program 8 times [2021-10-28 09:41:51,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:41:51,602 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461778329] [2021-10-28 09:41:51,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:41:51,603 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:41:51,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:41:51,853 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:41:51,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:41:51,853 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461778329] [2021-10-28 09:41:51,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461778329] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 09:41:51,853 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256482447] [2021-10-28 09:41:51,853 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-28 09:41:51,854 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 09:41:51,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:41:51,856 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 09:41:51,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-10-28 09:41:51,957 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-10-28 09:41:51,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-28 09:41:51,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 11 conjunts are in the unsatisfiable core [2021-10-28 09:41:51,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 09:41:51,967 INFO L388 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 [2021-10-28 09:41:51,983 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:52,010 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:52,032 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:52,055 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:52,078 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:52,100 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:52,119 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:52,168 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:52,211 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-10-28 09:41:52,217 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:41:52,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256482447] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 09:41:52,218 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 09:41:52,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12] total 28 [2021-10-28 09:41:52,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005938948] [2021-10-28 09:41:52,219 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-28 09:41:52,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:41:52,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-10-28 09:41:52,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=551, Unknown=0, NotChecked=0, Total=756 [2021-10-28 09:41:52,226 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. cyclomatic complexity: 2 Second operand has 28 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:41:52,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:41:52,496 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2021-10-28 09:41:52,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-28 09:41:52,496 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2021-10-28 09:41:52,497 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2021-10-28 09:41:52,497 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 26 transitions. [2021-10-28 09:41:52,498 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2021-10-28 09:41:52,498 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2021-10-28 09:41:52,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 26 transitions. [2021-10-28 09:41:52,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:41:52,498 INFO L681 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2021-10-28 09:41:52,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 26 transitions. [2021-10-28 09:41:52,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-10-28 09:41:52,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.04) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:41:52,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2021-10-28 09:41:52,500 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2021-10-28 09:41:52,501 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2021-10-28 09:41:52,501 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-10-28 09:41:52,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2021-10-28 09:41:52,501 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2021-10-28 09:41:52,501 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 09:41:52,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 09:41:52,502 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 09:41:52,502 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [10, 9, 1, 1, 1, 1] [2021-10-28 09:41:52,502 INFO L791 eck$LassoCheckResult]: Stem: 877#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 878#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 879#L549-3 [2021-10-28 09:41:52,502 INFO L793 eck$LassoCheckResult]: Loop: 879#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 875#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 876#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 882#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 880#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 881#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 899#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 898#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 897#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 896#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 895#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 894#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 893#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 892#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 891#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 890#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 889#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 888#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 887#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 886#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 885#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 884#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 883#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 879#L549-3 [2021-10-28 09:41:52,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:41:52,503 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2021-10-28 09:41:52,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:41:52,503 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921628804] [2021-10-28 09:41:52,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:41:52,504 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:41:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:41:52,509 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 09:41:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:41:52,514 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 09:41:52,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:41:52,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1943458812, now seen corresponding path program 9 times [2021-10-28 09:41:52,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:41:52,515 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108282317] [2021-10-28 09:41:52,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:41:52,515 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:41:52,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:41:52,537 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 09:41:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:41:52,559 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 09:41:52,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:41:52,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1979445758, now seen corresponding path program 1 times [2021-10-28 09:41:52,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:41:52,560 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156759622] [2021-10-28 09:41:52,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:41:52,560 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:41:52,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:41:52,587 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 09:41:52,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:41:52,641 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 09:41:56,519 INFO L210 LassoAnalysis]: Preferences: [2021-10-28 09:41:56,519 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-28 09:41:56,520 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-28 09:41:56,520 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-28 09:41:56,520 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-10-28 09:41:56,520 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 09:41:56,520 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-28 09:41:56,520 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-28 09:41:56,520 INFO L133 ssoRankerPreferences]: Filename of dumped script: Urban-2013WST-Fig2-alloca.i_Iteration11_Lasso [2021-10-28 09:41:56,520 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-28 09:41:56,520 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-10-28 09:41:56,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 09:41:56,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 09:41:56,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 09:41:56,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 09:41:56,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 09:41:56,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 09:41:56,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 09:41:56,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 09:41:56,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 09:41:56,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 09:41:56,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 09:41:57,009 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-10-28 09:41:57,014 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-10-28 09:41:57,015 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 09:41:57,016 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:41:57,022 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 09:41:57,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-10-28 09:41:57,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 09:41:57,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 09:41:57,038 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-28 09:41:57,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 09:41:57,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 09:41:57,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 09:41:57,040 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-28 09:41:57,040 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-28 09:41:57,042 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-28 09:41:57,066 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-10-28 09:41:57,066 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 09:41:57,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:41:57,067 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 09:41:57,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-10-28 09:41:57,073 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 09:41:57,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 09:41:57,080 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-28 09:41:57,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 09:41:57,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 09:41:57,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 09:41:57,081 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-28 09:41:57,081 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-28 09:41:57,083 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-28 09:41:57,107 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-10-28 09:41:57,108 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 09:41:57,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:41:57,109 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 09:41:57,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-10-28 09:41:57,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 09:41:57,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 09:41:57,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 09:41:57,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 09:41:57,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 09:41:57,124 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-28 09:41:57,125 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-28 09:41:57,153 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-28 09:41:57,186 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-10-28 09:41:57,187 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 09:41:57,187 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:41:57,188 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 09:41:57,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 09:41:57,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 09:41:57,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 09:41:57,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 09:41:57,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 09:41:57,211 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-28 09:41:57,211 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-28 09:41:57,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-10-28 09:41:57,220 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-28 09:41:57,244 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-10-28 09:41:57,244 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 09:41:57,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:41:57,245 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 09:41:57,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-10-28 09:41:57,250 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 09:41:57,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 09:41:57,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 09:41:57,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 09:41:57,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 09:41:57,260 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-28 09:41:57,260 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-28 09:41:57,291 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-28 09:41:57,313 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-10-28 09:41:57,314 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 09:41:57,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:41:57,315 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 09:41:57,324 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 09:41:57,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 09:41:57,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 09:41:57,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 09:41:57,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 09:41:57,343 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-28 09:41:57,343 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-28 09:41:57,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-10-28 09:41:57,365 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-28 09:41:57,406 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-10-28 09:41:57,407 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 09:41:57,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:41:57,409 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 09:41:57,413 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 09:41:57,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 09:41:57,422 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-28 09:41:57,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 09:41:57,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 09:41:57,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 09:41:57,424 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-28 09:41:57,424 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-28 09:41:57,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-10-28 09:41:57,427 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-28 09:41:57,451 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2021-10-28 09:41:57,451 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 09:41:57,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:41:57,452 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 09:41:57,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-10-28 09:41:57,455 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 09:41:57,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 09:41:57,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-28 09:41:57,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 09:41:57,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 09:41:57,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 09:41:57,464 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-28 09:41:57,464 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-28 09:41:57,488 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-10-28 09:41:57,493 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-10-28 09:41:57,493 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-10-28 09:41:57,494 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 09:41:57,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:41:57,498 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 09:41:57,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-10-28 09:41:57,499 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-10-28 09:41:57,499 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-10-28 09:41:57,499 INFO L513 LassoAnalysis]: Proved termination. [2021-10-28 09:41:57,500 INFO L515 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)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_1 + 21 Supporting invariants [] [2021-10-28 09:41:57,527 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-10-28 09:41:57,567 INFO L297 tatePredicateManager]: 9 out of 11 supporting invariants were superfluous and have been removed [2021-10-28 09:41:57,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:41:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:41:57,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-28 09:41:57,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 09:41:57,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:41:57,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 18 conjunts are in the unsatisfiable core [2021-10-28 09:41:57,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 09:41:57,723 INFO L388 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 30 treesize of output 25 [2021-10-28 09:41:57,786 INFO L388 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 43 treesize of output 30 [2021-10-28 09:41:57,850 INFO L388 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 43 treesize of output 30 [2021-10-28 09:41:57,944 INFO L388 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 43 treesize of output 30 [2021-10-28 09:41:58,031 INFO L388 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 43 treesize of output 30 [2021-10-28 09:41:58,124 INFO L388 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 43 treesize of output 30 [2021-10-28 09:41:58,211 INFO L388 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 43 treesize of output 30 [2021-10-28 09:41:58,327 INFO L388 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 43 treesize of output 30 [2021-10-28 09:41:58,375 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-10-28 09:41:58,413 INFO L388 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 43 treesize of output 30 [2021-10-28 09:41:58,487 INFO L388 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 43 treesize of output 30 [2021-10-28 09:41:58,593 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:41:58,596 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 12 loop predicates [2021-10-28 09:41:58,597 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 26 transitions. cyclomatic complexity: 2 Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:41:58,962 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 26 transitions. cyclomatic complexity: 2. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 57 states and 62 transitions. Complement of second has 26 states. [2021-10-28 09:41:58,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2021-10-28 09:41:58,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:41:58,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 31 transitions. [2021-10-28 09:41:58,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 31 transitions. Stem has 2 letters. Loop has 23 letters. [2021-10-28 09:41:58,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-28 09:41:58,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 31 transitions. Stem has 25 letters. Loop has 23 letters. [2021-10-28 09:41:58,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-28 09:41:58,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 31 transitions. Stem has 2 letters. Loop has 46 letters. [2021-10-28 09:41:58,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-28 09:41:58,967 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 62 transitions. [2021-10-28 09:41:58,968 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2021-10-28 09:41:58,969 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 56 states and 61 transitions. [2021-10-28 09:41:58,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2021-10-28 09:41:58,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2021-10-28 09:41:58,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 61 transitions. [2021-10-28 09:41:58,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-28 09:41:58,969 INFO L681 BuchiCegarLoop]: Abstraction has 56 states and 61 transitions. [2021-10-28 09:41:58,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 61 transitions. [2021-10-28 09:41:58,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2021-10-28 09:41:58,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 54 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:41:58,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2021-10-28 09:41:58,973 INFO L704 BuchiCegarLoop]: Abstraction has 55 states and 60 transitions. [2021-10-28 09:41:58,973 INFO L587 BuchiCegarLoop]: Abstraction has 55 states and 60 transitions. [2021-10-28 09:41:58,973 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-10-28 09:41:58,973 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 60 transitions. [2021-10-28 09:41:58,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2021-10-28 09:41:58,974 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 09:41:58,974 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 09:41:58,974 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2021-10-28 09:41:58,974 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [11, 10, 1, 1, 1, 1] [2021-10-28 09:41:58,975 INFO L791 eck$LassoCheckResult]: Stem: 1148#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1149#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 1158#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1144#L549-1 [2021-10-28 09:41:58,975 INFO L793 eck$LassoCheckResult]: Loop: 1144#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 1145#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1156#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1152#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1153#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1178#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1177#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1176#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1175#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1174#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1173#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1172#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1171#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1170#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1169#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1168#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1167#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1166#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1165#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1164#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1163#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1162#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1161#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 1159#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 1150#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1144#L549-1 [2021-10-28 09:41:58,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:41:58,975 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2021-10-28 09:41:58,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:41:58,975 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692919341] [2021-10-28 09:41:58,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:41:58,976 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:41:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:41:58,983 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 09:41:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:41:58,988 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 09:41:58,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:41:58,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1726515181, now seen corresponding path program 10 times [2021-10-28 09:41:58,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:41:58,989 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695322112] [2021-10-28 09:41:58,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:41:58,990 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:41:59,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:41:59,330 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 84 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:41:59,330 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:41:59,330 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695322112] [2021-10-28 09:41:59,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695322112] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 09:41:59,330 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171128613] [2021-10-28 09:41:59,331 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-28 09:41:59,331 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 09:41:59,331 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:41:59,333 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 09:41:59,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-10-28 09:41:59,479 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-28 09:41:59,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-28 09:41:59,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 12 conjunts are in the unsatisfiable core [2021-10-28 09:41:59,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 09:41:59,486 INFO L388 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 [2021-10-28 09:41:59,497 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:59,526 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:59,558 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:59,592 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:59,624 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:59,682 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:59,716 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:59,751 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:59,787 INFO L388 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 25 treesize of output 13 [2021-10-28 09:41:59,821 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-10-28 09:41:59,834 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 20 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:41:59,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171128613] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 09:41:59,834 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 09:41:59,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12] total 30 [2021-10-28 09:41:59,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437959902] [2021-10-28 09:41:59,835 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-28 09:41:59,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:41:59,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-10-28 09:41:59,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=725, Unknown=0, NotChecked=0, Total=930 [2021-10-28 09:41:59,836 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. cyclomatic complexity: 7 Second operand has 31 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 30 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:42:00,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:42:00,168 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2021-10-28 09:42:00,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-10-28 09:42:00,168 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 50 transitions. [2021-10-28 09:42:00,169 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-10-28 09:42:00,169 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 0 states and 0 transitions. [2021-10-28 09:42:00,169 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-10-28 09:42:00,169 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-10-28 09:42:00,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-10-28 09:42:00,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:42:00,170 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-28 09:42:00,170 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-28 09:42:00,170 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-28 09:42:00,170 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-10-28 09:42:00,170 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-10-28 09:42:00,170 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-10-28 09:42:00,170 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-10-28 09:42:00,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.10 09:42:00 BoogieIcfgContainer [2021-10-28 09:42:00,175 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-10-28 09:42:00,175 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 09:42:00,175 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 09:42:00,175 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 09:42:00,176 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:41:47" (3/4) ... [2021-10-28 09:42:00,179 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-10-28 09:42:00,180 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 09:42:00,182 INFO L168 Benchmark]: Toolchain (without parser) took 13960.02 ms. Allocated memory was 104.9 MB in the beginning and 169.9 MB in the end (delta: 65.0 MB). Free memory was 69.3 MB in the beginning and 100.1 MB in the end (delta: -30.8 MB). Peak memory consumption was 33.5 MB. Max. memory is 16.1 GB. [2021-10-28 09:42:00,183 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 104.9 MB. Free memory was 75.6 MB in the beginning and 75.6 MB in the end (delta: 30.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 09:42:00,184 INFO L168 Benchmark]: CACSL2BoogieTranslator took 432.17 ms. Allocated memory is still 104.9 MB. Free memory was 69.3 MB in the beginning and 75.0 MB in the end (delta: -5.7 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-28 09:42:00,184 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.79 ms. Allocated memory is still 104.9 MB. Free memory was 75.0 MB in the beginning and 73.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 09:42:00,185 INFO L168 Benchmark]: Boogie Preprocessor took 40.76 ms. Allocated memory is still 104.9 MB. Free memory was 73.3 MB in the beginning and 72.2 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 09:42:00,185 INFO L168 Benchmark]: RCFGBuilder took 274.59 ms. Allocated memory is still 104.9 MB. Free memory was 72.2 MB in the beginning and 62.4 MB in the end (delta: 9.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-28 09:42:00,185 INFO L168 Benchmark]: BuchiAutomizer took 13147.20 ms. Allocated memory was 104.9 MB in the beginning and 169.9 MB in the end (delta: 65.0 MB). Free memory was 62.4 MB in the beginning and 100.1 MB in the end (delta: -37.7 MB). Peak memory consumption was 29.8 MB. Max. memory is 16.1 GB. [2021-10-28 09:42:00,185 INFO L168 Benchmark]: Witness Printer took 4.58 ms. Allocated memory is still 169.9 MB. Free memory is still 100.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 09:42:00,188 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 104.9 MB. Free memory was 75.6 MB in the beginning and 75.6 MB in the end (delta: 30.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 432.17 ms. Allocated memory is still 104.9 MB. Free memory was 69.3 MB in the beginning and 75.0 MB in the end (delta: -5.7 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 54.79 ms. Allocated memory is still 104.9 MB. Free memory was 75.0 MB in the beginning and 73.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 40.76 ms. Allocated memory is still 104.9 MB. Free memory was 73.3 MB in the beginning and 72.2 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 274.59 ms. Allocated memory is still 104.9 MB. Free memory was 72.2 MB in the beginning and 62.4 MB in the end (delta: 9.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 13147.20 ms. Allocated memory was 104.9 MB in the beginning and 169.9 MB in the end (delta: 65.0 MB). Free memory was 62.4 MB in the beginning and 100.1 MB in the end (delta: -37.7 MB). Peak memory consumption was 29.8 MB. Max. memory is 16.1 GB. * Witness Printer took 4.58 ms. Allocated memory is still 169.9 MB. Free memory is still 100.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (11 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 21 + -2 * unknown-#memory_int-unknown[x1][x1] and consists of 14 locations. 11 modules have a trivial ranking function, the largest among these consists of 31 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.1s and 13 iterations. TraceHistogramMax:11. Analysis of lassos took 9.8s. Construction of modules took 0.8s. Büchi inclusion checks took 2.0s. Highest rank in rank-based complementation 3. Minimization of det autom 11. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 55 states and ocurred in iteration 11. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/90 HoareTripleCheckerStatistics: 73 SDtfs, 115 SDslu, 123 SDs, 0 SdLazy, 1381 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time LassoAnalysisResults: nont0 unkn0 SFLI11 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital153 mio100 ax111 hnf100 lsp85 ukn72 mio100 lsp44 div100 bol100 ite100 ukn100 eq191 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 44ms VariablesStem: 2 VariablesLoop: 2 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! [2021-10-28 09:42:00,219 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-10-28 09:42:00,421 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-10-28 09:42:00,623 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-10-28 09:42:00,822 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-10-28 09:42:01,022 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-10-28 09:42:01,223 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-10-28 09:42:01,422 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-28 09:42:01,623 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-28 09:42:01,823 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-28 09:42:02,024 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08e3b1a7-027b-438a-bbbf-af09aa9c9e4f/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...