./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loop-acceleration/array_4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 527bcce2 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loop-acceleration/array_4.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx --witnessprinter.witness.filename witness --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 32bit --witnessprinter.graph.data.programhash e8c27e61ac5d5a22c0e00a5dbac1b872460567877a501387ed9d5bda89096498 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 22:17:26,645 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:17:26,773 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-21 22:17:26,780 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:17:26,781 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:17:26,821 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:17:26,822 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:17:26,823 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:17:26,824 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-21 22:17:26,829 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-21 22:17:26,831 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:17:26,831 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:17:26,832 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:17:26,834 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-21 22:17:26,835 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-21 22:17:26,836 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-21 22:17:26,836 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-21 22:17:26,837 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-21 22:17:26,837 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-21 22:17:26,838 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:17:26,838 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-21 22:17:26,839 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:17:26,840 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:17:26,840 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:17:26,841 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:17:26,841 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-21 22:17:26,842 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-21 22:17:26,842 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-21 22:17:26,843 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 22:17:26,843 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:17:26,845 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 22:17:26,845 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-21 22:17:26,846 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:17:26,846 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:17:26,846 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:17:26,847 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:17:26,847 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 22:17:26,848 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-21 22:17:26,848 INFO L153 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_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/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_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e8c27e61ac5d5a22c0e00a5dbac1b872460567877a501387ed9d5bda89096498 [2023-11-21 22:17:27,180 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:17:27,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:17:27,205 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:17:27,207 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:17:27,207 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:17:27,209 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/loop-acceleration/array_4.i [2023-11-21 22:17:30,390 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:17:30,651 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:17:30,652 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/sv-benchmarks/c/loop-acceleration/array_4.i [2023-11-21 22:17:30,661 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/data/edd3c1e20/827bdf72f6804341ba35c43eae81c403/FLAGed94d253e [2023-11-21 22:17:30,679 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/data/edd3c1e20/827bdf72f6804341ba35c43eae81c403 [2023-11-21 22:17:30,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:17:30,689 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:17:30,697 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:17:30,698 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:17:30,703 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:17:30,704 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:17:30" (1/1) ... [2023-11-21 22:17:30,705 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3738872b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:17:30, skipping insertion in model container [2023-11-21 22:17:30,706 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:17:30" (1/1) ... [2023-11-21 22:17:30,733 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:17:30,912 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:17:30,923 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:17:30,941 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:17:30,958 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:17:30,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:17:30 WrapperNode [2023-11-21 22:17:30,959 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:17:30,961 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:17:30,961 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:17:30,961 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:17:30,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:17:30" (1/1) ... [2023-11-21 22:17:30,979 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:17:30" (1/1) ... [2023-11-21 22:17:31,001 INFO L138 Inliner]: procedures = 16, calls = 13, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 45 [2023-11-21 22:17:31,001 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:17:31,001 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:17:31,002 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:17:31,002 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:17:31,012 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:17:30" (1/1) ... [2023-11-21 22:17:31,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:17:30" (1/1) ... [2023-11-21 22:17:31,014 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:17:30" (1/1) ... [2023-11-21 22:17:31,025 INFO L187 HeapSplitter]: Split 5 memory accesses to 2 slices as follows [2, 3] [2023-11-21 22:17:31,025 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:17:30" (1/1) ... [2023-11-21 22:17:31,026 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:17:30" (1/1) ... [2023-11-21 22:17:31,032 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:17:30" (1/1) ... [2023-11-21 22:17:31,035 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:17:30" (1/1) ... [2023-11-21 22:17:31,037 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:17:30" (1/1) ... [2023-11-21 22:17:31,038 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:17:30" (1/1) ... [2023-11-21 22:17:31,041 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:17:31,042 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:17:31,042 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:17:31,042 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:17:31,043 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:17:30" (1/1) ... [2023-11-21 22:17:31,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:17:31,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:31,086 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:17:31,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-21 22:17:31,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 22:17:31,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-21 22:17:31,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-21 22:17:31,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 22:17:31,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-21 22:17:31,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-21 22:17:31,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:17:31,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:17:31,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-21 22:17:31,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-21 22:17:31,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 22:17:31,231 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:17:31,234 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:17:31,382 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:17:31,391 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:17:31,392 INFO L308 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-21 22:17:31,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:17:31 BoogieIcfgContainer [2023-11-21 22:17:31,394 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:17:31,395 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-21 22:17:31,395 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-21 22:17:31,400 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-21 22:17:31,401 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-21 22:17:31,401 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.11 10:17:30" (1/3) ... [2023-11-21 22:17:31,402 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@49b1b864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.11 10:17:31, skipping insertion in model container [2023-11-21 22:17:31,403 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-21 22:17:31,403 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:17:30" (2/3) ... [2023-11-21 22:17:31,403 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@49b1b864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.11 10:17:31, skipping insertion in model container [2023-11-21 22:17:31,404 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-21 22:17:31,404 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:17:31" (3/3) ... [2023-11-21 22:17:31,405 INFO L332 chiAutomizerObserver]: Analyzing ICFG array_4.i [2023-11-21 22:17:31,481 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-21 22:17:31,486 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-21 22:17:31,487 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-21 22:17:31,487 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-21 22:17:31,487 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-21 22:17:31,489 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-21 22:17:31,490 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-21 22:17:31,490 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-21 22:17:31,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 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) [2023-11-21 22:17:31,517 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2023-11-21 22:17:31,517 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:17:31,517 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:17:31,523 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-21 22:17:31,523 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-21 22:17:31,523 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-21 22:17:31,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 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) [2023-11-21 22:17:31,529 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2023-11-21 22:17:31,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:17:31,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:17:31,530 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-21 22:17:31,530 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-21 22:17:31,538 INFO L748 eck$LassoCheckResult]: Stem: 13#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~post3#1, main_#t~mem4#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~i~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4096);havoc main_~i~0#1;main_~i~0#1 := 0; 6#L25-3true [2023-11-21 22:17:31,539 INFO L750 eck$LassoCheckResult]: Loop: 6#L25-3true assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 9#L25-2true main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 6#L25-3true [2023-11-21 22:17:31,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:17:31,552 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-11-21 22:17:31,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:17:31,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775955529] [2023-11-21 22:17:31,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:17:31,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:17:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:31,709 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:17:31,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:31,754 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:17:31,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:17:31,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2023-11-21 22:17:31,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:17:31,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143424861] [2023-11-21 22:17:31,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:17:31,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:17:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:31,778 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:17:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:31,787 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:17:31,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:17:31,793 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2023-11-21 22:17:31,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:17:31,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210815146] [2023-11-21 22:17:31,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:17:31,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:17:31,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:31,832 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:17:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:31,850 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:17:32,258 INFO L210 LassoAnalysis]: Preferences: [2023-11-21 22:17:32,258 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-21 22:17:32,259 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-21 22:17:32,259 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-21 22:17:32,259 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-21 22:17:32,259 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:17:32,259 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-21 22:17:32,260 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-21 22:17:32,260 INFO L133 ssoRankerPreferences]: Filename of dumped script: array_4.i_Iteration1_Lasso [2023-11-21 22:17:32,260 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-21 22:17:32,260 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-21 22:17:32,280 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:32,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:32,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:32,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:32,314 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:32,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:32,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:32,732 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-21 22:17:32,737 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-21 22:17:32,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:17:32,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:32,744 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:17:32,767 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 [2023-11-21 22:17:32,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-11-21 22:17:32,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:17:32,780 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:17:32,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:17:32,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:17:32,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:17:32,784 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:17:32,785 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:17:32,795 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:17:32,820 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-11-21 22:17:32,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:17:32,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:32,824 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:17:32,837 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 [2023-11-21 22:17:32,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:17:32,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:17:32,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:17:32,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:17:32,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-11-21 22:17:32,869 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:17:32,870 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:17:32,888 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:17:32,916 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-11-21 22:17:32,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:17:32,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:32,918 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:17:32,926 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 [2023-11-21 22:17:32,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:17:32,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:17:32,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:17:32,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:17:32,943 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:17:32,943 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:17:32,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-11-21 22:17:32,972 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:17:32,991 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-11-21 22:17:32,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:17:32,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:32,994 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:17:33,000 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 [2023-11-21 22:17:33,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:17:33,013 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:17:33,013 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:17:33,013 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:17:33,013 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:17:33,015 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:17:33,016 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:17:33,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-11-21 22:17:33,019 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:17:33,036 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-11-21 22:17:33,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:17:33,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:33,038 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:17:33,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-11-21 22:17:33,045 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 [2023-11-21 22:17:33,055 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:17:33,055 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:17:33,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:17:33,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:17:33,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:17:33,057 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:17:33,057 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:17:33,108 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:17:33,133 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-11-21 22:17:33,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:17:33,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:33,135 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:17:33,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-11-21 22:17:33,137 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 [2023-11-21 22:17:33,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:17:33,147 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:17:33,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:17:33,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:17:33,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:17:33,150 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:17:33,150 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:17:33,161 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:17:33,184 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-11-21 22:17:33,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:17:33,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:33,186 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:17:33,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-11-21 22:17:33,191 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 [2023-11-21 22:17:33,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:17:33,202 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:17:33,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:17:33,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:17:33,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:17:33,203 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:17:33,203 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:17:33,211 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:17:33,234 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-11-21 22:17:33,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:17:33,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:33,238 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:17:33,253 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 [2023-11-21 22:17:33,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:17:33,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:17:33,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:17:33,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:17:33,270 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:17:33,270 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:17:33,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-11-21 22:17:33,283 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:17:33,306 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-11-21 22:17:33,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:17:33,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:33,309 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:17:33,317 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 [2023-11-21 22:17:33,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:17:33,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:17:33,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:17:33,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:17:33,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-11-21 22:17:33,338 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:17:33,338 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:17:33,352 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-21 22:17:33,393 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2023-11-21 22:17:33,393 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2023-11-21 22:17:33,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:17:33,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:33,442 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:17:33,444 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-21 22:17:33,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-11-21 22:17:33,463 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-21 22:17:33,463 INFO L513 LassoAnalysis]: Proved termination. [2023-11-21 22:17:33,464 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~#A~0#1.base)_1) = -8*ULTIMATE.start_main_~i~0#1 + 2045*v_rep(select #length ULTIMATE.start_main_~#A~0#1.base)_1 Supporting invariants [] [2023-11-21 22:17:33,483 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-11-21 22:17:33,502 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2023-11-21 22:17:33,512 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[~#A~0!base] could not be translated [2023-11-21 22:17:33,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:17:33,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:17:33,551 INFO L262 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-21 22:17:33,552 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:17:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:17:33,568 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-21 22:17:33,569 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:17:33,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:17:33,663 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-11-21 22:17:33,666 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 17 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) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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) [2023-11-21 22:17:33,729 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 17 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). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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) Result 33 states and 45 transitions. Complement of second has 8 states. [2023-11-21 22:17:33,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-21 22:17:33,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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) [2023-11-21 22:17:33,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2023-11-21 22:17:33,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 2 letters. Loop has 2 letters. [2023-11-21 22:17:33,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:17:33,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 4 letters. Loop has 2 letters. [2023-11-21 22:17:33,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:17:33,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 2 letters. Loop has 4 letters. [2023-11-21 22:17:33,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:17:33,741 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 45 transitions. [2023-11-21 22:17:33,748 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-11-21 22:17:33,751 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 9 states and 11 transitions. [2023-11-21 22:17:33,752 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2023-11-21 22:17:33,752 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2023-11-21 22:17:33,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2023-11-21 22:17:33,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:17:33,753 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 11 transitions. [2023-11-21 22:17:33,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2023-11-21 22:17:33,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2023-11-21 22:17:33,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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) [2023-11-21 22:17:33,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2023-11-21 22:17:33,780 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 11 transitions. [2023-11-21 22:17:33,781 INFO L428 stractBuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2023-11-21 22:17:33,781 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-21 22:17:33,781 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2023-11-21 22:17:33,781 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-11-21 22:17:33,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:17:33,782 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:17:33,782 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-11-21 22:17:33,782 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-21 22:17:33,782 INFO L748 eck$LassoCheckResult]: Stem: 112#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 113#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~post3#1, main_#t~mem4#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~i~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4096);havoc main_~i~0#1;main_~i~0#1 := 0; 109#L25-3 assume !(main_~i~0#1 < 1023); 110#L25-4 call write~int#1(0, main_~#A~0#1.base, 4092 + main_~#A~0#1.offset, 4);main_~i~0#1 := 0; 111#L30-4 [2023-11-21 22:17:33,782 INFO L750 eck$LassoCheckResult]: Loop: 111#L30-4 call main_#t~mem4#1 := read~int#1(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4); 105#L30-1 assume !!(0 != main_#t~mem4#1);havoc main_#t~mem4#1; 106#L30-3 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 111#L30-4 [2023-11-21 22:17:33,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:17:33,783 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2023-11-21 22:17:33,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:17:33,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198257152] [2023-11-21 22:17:33,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:17:33,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:17:33,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:17:33,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:17:33,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:17:33,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198257152] [2023-11-21 22:17:33,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198257152] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:17:33,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:17:33,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:17:33,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824521440] [2023-11-21 22:17:33,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:17:33,888 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 22:17:33,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:17:33,890 INFO L85 PathProgramCache]: Analyzing trace with hash 49813, now seen corresponding path program 1 times [2023-11-21 22:17:33,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:17:33,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094594888] [2023-11-21 22:17:33,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:17:33,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:17:33,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:33,908 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:17:33,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:33,918 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:17:33,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:17:33,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:17:33,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:17:33,975 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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) [2023-11-21 22:17:33,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:17:33,996 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2023-11-21 22:17:33,996 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2023-11-21 22:17:33,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-11-21 22:17:33,997 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2023-11-21 22:17:33,998 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2023-11-21 22:17:33,998 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2023-11-21 22:17:33,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2023-11-21 22:17:33,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:17:33,998 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 14 transitions. [2023-11-21 22:17:33,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2023-11-21 22:17:33,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 9. [2023-11-21 22:17:33,999 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) [2023-11-21 22:17:34,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2023-11-21 22:17:34,000 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2023-11-21 22:17:34,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:17:34,001 INFO L428 stractBuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2023-11-21 22:17:34,001 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-21 22:17:34,002 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2023-11-21 22:17:34,002 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-11-21 22:17:34,002 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:17:34,002 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:17:34,003 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-11-21 22:17:34,003 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-21 22:17:34,003 INFO L748 eck$LassoCheckResult]: Stem: 140#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 141#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~post3#1, main_#t~mem4#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~i~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4096);havoc main_~i~0#1;main_~i~0#1 := 0; 137#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 135#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 136#L25-3 assume !(main_~i~0#1 < 1023); 138#L25-4 call write~int#1(0, main_~#A~0#1.base, 4092 + main_~#A~0#1.offset, 4);main_~i~0#1 := 0; 139#L30-4 [2023-11-21 22:17:34,003 INFO L750 eck$LassoCheckResult]: Loop: 139#L30-4 call main_#t~mem4#1 := read~int#1(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4); 133#L30-1 assume !!(0 != main_#t~mem4#1);havoc main_#t~mem4#1; 134#L30-3 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 139#L30-4 [2023-11-21 22:17:34,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:17:34,004 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2023-11-21 22:17:34,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:17:34,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438189174] [2023-11-21 22:17:34,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:17:34,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:17:34,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:17:34,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:17:34,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:17:34,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438189174] [2023-11-21 22:17:34,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438189174] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:17:34,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693037133] [2023-11-21 22:17:34,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:17:34,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:17:34,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:34,124 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:17:34,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-21 22:17:34,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:17:34,177 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-21 22:17:34,178 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:17:34,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:17:34,219 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:17:34,244 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-11-21 22:17:34,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:17:34,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693037133] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:17:34,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:17:34,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-11-21 22:17:34,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478027673] [2023-11-21 22:17:34,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:17:34,257 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 22:17:34,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:17:34,258 INFO L85 PathProgramCache]: Analyzing trace with hash 49813, now seen corresponding path program 2 times [2023-11-21 22:17:34,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:17:34,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915291875] [2023-11-21 22:17:34,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:17:34,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:17:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:34,268 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:17:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:34,279 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:17:34,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:17:34,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 22:17:34,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-21 22:17:34,323 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 3 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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) [2023-11-21 22:17:34,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:17:34,386 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2023-11-21 22:17:34,386 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 28 transitions. [2023-11-21 22:17:34,388 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-11-21 22:17:34,394 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 28 transitions. [2023-11-21 22:17:34,394 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2023-11-21 22:17:34,395 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2023-11-21 22:17:34,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 28 transitions. [2023-11-21 22:17:34,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:17:34,396 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 28 transitions. [2023-11-21 22:17:34,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 28 transitions. [2023-11-21 22:17:34,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 15. [2023-11-21 22:17:34,398 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) [2023-11-21 22:17:34,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2023-11-21 22:17:34,403 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 16 transitions. [2023-11-21 22:17:34,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:17:34,405 INFO L428 stractBuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2023-11-21 22:17:34,405 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-21 22:17:34,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2023-11-21 22:17:34,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-11-21 22:17:34,408 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:17:34,408 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:17:34,409 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2023-11-21 22:17:34,409 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-21 22:17:34,409 INFO L748 eck$LassoCheckResult]: Stem: 217#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 218#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~post3#1, main_#t~mem4#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~i~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4096);havoc main_~i~0#1;main_~i~0#1 := 0; 213#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 211#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 212#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 214#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 223#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 222#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 221#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 220#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 219#L25-3 assume !(main_~i~0#1 < 1023); 215#L25-4 call write~int#1(0, main_~#A~0#1.base, 4092 + main_~#A~0#1.offset, 4);main_~i~0#1 := 0; 216#L30-4 [2023-11-21 22:17:34,409 INFO L750 eck$LassoCheckResult]: Loop: 216#L30-4 call main_#t~mem4#1 := read~int#1(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4); 209#L30-1 assume !!(0 != main_#t~mem4#1);havoc main_#t~mem4#1; 210#L30-3 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 216#L30-4 [2023-11-21 22:17:34,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:17:34,410 INFO L85 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times [2023-11-21 22:17:34,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:17:34,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893929763] [2023-11-21 22:17:34,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:17:34,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:17:34,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:17:34,534 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:17:34,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:17:34,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893929763] [2023-11-21 22:17:34,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893929763] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:17:34,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10090198] [2023-11-21 22:17:34,535 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 22:17:34,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:17:34,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:34,536 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:17:34,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-21 22:17:34,614 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 22:17:34,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:17:34,615 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-21 22:17:34,617 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:17:34,651 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:17:34,651 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:17:34,729 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:17:34,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10090198] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:17:34,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:17:34,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-11-21 22:17:34,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796567094] [2023-11-21 22:17:34,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:17:34,730 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 22:17:34,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:17:34,731 INFO L85 PathProgramCache]: Analyzing trace with hash 49813, now seen corresponding path program 3 times [2023-11-21 22:17:34,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:17:34,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852416057] [2023-11-21 22:17:34,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:17:34,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:17:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:34,736 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:17:34,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:34,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:17:34,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:17:34,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-21 22:17:34,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-11-21 22:17:34,777 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 3 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) [2023-11-21 22:17:34,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:17:34,870 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2023-11-21 22:17:34,870 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 58 transitions. [2023-11-21 22:17:34,874 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-11-21 22:17:34,875 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 58 transitions. [2023-11-21 22:17:34,876 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2023-11-21 22:17:34,877 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2023-11-21 22:17:34,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 58 transitions. [2023-11-21 22:17:34,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:17:34,878 INFO L218 hiAutomatonCegarLoop]: Abstraction has 57 states and 58 transitions. [2023-11-21 22:17:34,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 58 transitions. [2023-11-21 22:17:34,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 27. [2023-11-21 22:17:34,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.037037037037037) internal successors, (28), 26 states have internal predecessors, (28), 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) [2023-11-21 22:17:34,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2023-11-21 22:17:34,885 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 28 transitions. [2023-11-21 22:17:34,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-21 22:17:34,888 INFO L428 stractBuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2023-11-21 22:17:34,888 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-21 22:17:34,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 28 transitions. [2023-11-21 22:17:34,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-11-21 22:17:34,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:17:34,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:17:34,894 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2023-11-21 22:17:34,894 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-21 22:17:34,894 INFO L748 eck$LassoCheckResult]: Stem: 371#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 372#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~post3#1, main_#t~mem4#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~i~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4096);havoc main_~i~0#1;main_~i~0#1 := 0; 367#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 365#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 366#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 368#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 389#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 388#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 387#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 386#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 385#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 384#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 383#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 382#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 381#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 380#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 379#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 378#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 377#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 376#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 375#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 374#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 373#L25-3 assume !(main_~i~0#1 < 1023); 369#L25-4 call write~int#1(0, main_~#A~0#1.base, 4092 + main_~#A~0#1.offset, 4);main_~i~0#1 := 0; 370#L30-4 [2023-11-21 22:17:34,894 INFO L750 eck$LassoCheckResult]: Loop: 370#L30-4 call main_#t~mem4#1 := read~int#1(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4); 363#L30-1 assume !!(0 != main_#t~mem4#1);havoc main_#t~mem4#1; 364#L30-3 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 370#L30-4 [2023-11-21 22:17:34,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:17:34,895 INFO L85 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 3 times [2023-11-21 22:17:34,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:17:34,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741750856] [2023-11-21 22:17:34,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:17:34,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:17:34,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:17:35,169 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:17:35,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:17:35,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741750856] [2023-11-21 22:17:35,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741750856] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:17:35,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277312719] [2023-11-21 22:17:35,170 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-21 22:17:35,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:17:35,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:35,172 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:17:35,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-21 22:17:35,393 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-11-21 22:17:35,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:17:35,395 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-21 22:17:35,397 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:17:35,452 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:17:35,452 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:17:35,711 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:17:35,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277312719] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:17:35,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:17:35,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2023-11-21 22:17:35,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088346075] [2023-11-21 22:17:35,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:17:35,712 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 22:17:35,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:17:35,713 INFO L85 PathProgramCache]: Analyzing trace with hash 49813, now seen corresponding path program 4 times [2023-11-21 22:17:35,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:17:35,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941975177] [2023-11-21 22:17:35,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:17:35,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:17:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:35,718 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:17:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:35,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:17:35,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:17:35,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-21 22:17:35,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2023-11-21 22:17:35,759 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. cyclomatic complexity: 3 Second operand has 25 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 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) [2023-11-21 22:17:36,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:17:36,010 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2023-11-21 22:17:36,010 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 118 transitions. [2023-11-21 22:17:36,030 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-11-21 22:17:36,033 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 117 states and 118 transitions. [2023-11-21 22:17:36,034 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2023-11-21 22:17:36,034 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2023-11-21 22:17:36,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 118 transitions. [2023-11-21 22:17:36,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:17:36,036 INFO L218 hiAutomatonCegarLoop]: Abstraction has 117 states and 118 transitions. [2023-11-21 22:17:36,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 118 transitions. [2023-11-21 22:17:36,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 51. [2023-11-21 22:17:36,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 50 states have internal predecessors, (52), 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) [2023-11-21 22:17:36,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2023-11-21 22:17:36,049 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 52 transitions. [2023-11-21 22:17:36,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-21 22:17:36,053 INFO L428 stractBuchiCegarLoop]: Abstraction has 51 states and 52 transitions. [2023-11-21 22:17:36,056 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-21 22:17:36,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 52 transitions. [2023-11-21 22:17:36,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-11-21 22:17:36,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:17:36,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:17:36,062 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 1, 1, 1, 1] [2023-11-21 22:17:36,063 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-21 22:17:36,063 INFO L748 eck$LassoCheckResult]: Stem: 681#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 682#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~post3#1, main_#t~mem4#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~i~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4096);havoc main_~i~0#1;main_~i~0#1 := 0; 677#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 675#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 676#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 678#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 723#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 722#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 721#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 720#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 719#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 718#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 717#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 716#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 715#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 714#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 713#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 712#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 711#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 710#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 709#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 708#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 707#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 706#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 705#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 704#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 703#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 702#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 701#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 700#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 699#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 698#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 697#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 696#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 695#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 694#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 693#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 692#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 691#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 690#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 689#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 688#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 687#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 686#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 685#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 684#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 683#L25-3 assume !(main_~i~0#1 < 1023); 679#L25-4 call write~int#1(0, main_~#A~0#1.base, 4092 + main_~#A~0#1.offset, 4);main_~i~0#1 := 0; 680#L30-4 [2023-11-21 22:17:36,064 INFO L750 eck$LassoCheckResult]: Loop: 680#L30-4 call main_#t~mem4#1 := read~int#1(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4); 673#L30-1 assume !!(0 != main_#t~mem4#1);havoc main_#t~mem4#1; 674#L30-3 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 680#L30-4 [2023-11-21 22:17:36,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:17:36,064 INFO L85 PathProgramCache]: Analyzing trace with hash 828161207, now seen corresponding path program 4 times [2023-11-21 22:17:36,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:17:36,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832734833] [2023-11-21 22:17:36,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:17:36,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:17:36,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:17:36,927 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:17:36,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:17:36,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832734833] [2023-11-21 22:17:36,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832734833] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:17:36,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846443336] [2023-11-21 22:17:36,928 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-21 22:17:36,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:17:36,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:36,930 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:17:36,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-21 22:17:37,057 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-21 22:17:37,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:17:37,060 INFO L262 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-21 22:17:37,064 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:17:37,194 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:17:37,194 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:17:38,117 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:17:38,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846443336] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:17:38,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:17:38,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2023-11-21 22:17:38,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488342543] [2023-11-21 22:17:38,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:17:38,119 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 22:17:38,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:17:38,119 INFO L85 PathProgramCache]: Analyzing trace with hash 49813, now seen corresponding path program 5 times [2023-11-21 22:17:38,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:17:38,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073117079] [2023-11-21 22:17:38,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:17:38,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:17:38,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:38,124 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:17:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:38,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:17:38,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:17:38,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-11-21 22:17:38,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2023-11-21 22:17:38,179 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. cyclomatic complexity: 3 Second operand has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 49 states have internal predecessors, (97), 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) [2023-11-21 22:17:38,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:17:38,708 INFO L93 Difference]: Finished difference Result 237 states and 238 transitions. [2023-11-21 22:17:38,708 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 237 states and 238 transitions. [2023-11-21 22:17:38,711 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-11-21 22:17:38,713 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 237 states to 237 states and 238 transitions. [2023-11-21 22:17:38,713 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 145 [2023-11-21 22:17:38,714 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 145 [2023-11-21 22:17:38,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 237 states and 238 transitions. [2023-11-21 22:17:38,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:17:38,716 INFO L218 hiAutomatonCegarLoop]: Abstraction has 237 states and 238 transitions. [2023-11-21 22:17:38,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states and 238 transitions. [2023-11-21 22:17:38,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 99. [2023-11-21 22:17:38,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 99 states have (on average 1.0101010101010102) internal successors, (100), 98 states have internal predecessors, (100), 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) [2023-11-21 22:17:38,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2023-11-21 22:17:38,724 INFO L240 hiAutomatonCegarLoop]: Abstraction has 99 states and 100 transitions. [2023-11-21 22:17:38,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-11-21 22:17:38,725 INFO L428 stractBuchiCegarLoop]: Abstraction has 99 states and 100 transitions. [2023-11-21 22:17:38,725 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-21 22:17:38,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 100 transitions. [2023-11-21 22:17:38,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-11-21 22:17:38,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:17:38,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:17:38,730 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 46, 1, 1, 1, 1] [2023-11-21 22:17:38,730 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-21 22:17:38,730 INFO L748 eck$LassoCheckResult]: Stem: 1303#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 1304#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_#t~post3#1, main_#t~mem4#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~i~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4096);havoc main_~i~0#1;main_~i~0#1 := 0; 1299#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1297#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1298#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1300#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1393#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1392#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1391#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1390#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1389#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1388#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1387#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1386#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1385#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1384#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1383#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1382#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1381#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1380#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1379#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1378#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1377#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1376#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1375#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1374#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1373#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1372#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1371#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1370#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1369#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1368#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1367#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1366#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1365#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1364#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1363#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1362#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1361#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1360#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1359#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1358#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1357#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1356#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1355#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1354#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1353#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1352#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1351#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1350#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1349#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1348#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1347#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1346#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1345#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1344#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1343#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1342#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1341#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1340#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1339#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1338#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1337#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1336#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1335#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1334#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1333#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1332#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1331#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1330#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1329#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1328#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1327#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1326#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1325#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1324#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1323#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1322#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1321#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1320#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1319#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1318#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1317#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1316#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1315#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1314#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1313#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1312#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1311#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1310#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1309#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1308#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1307#L25-3 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1306#L25-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1305#L25-3 assume !(main_~i~0#1 < 1023); 1301#L25-4 call write~int#1(0, main_~#A~0#1.base, 4092 + main_~#A~0#1.offset, 4);main_~i~0#1 := 0; 1302#L30-4 [2023-11-21 22:17:38,731 INFO L750 eck$LassoCheckResult]: Loop: 1302#L30-4 call main_#t~mem4#1 := read~int#1(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4); 1295#L30-1 assume !!(0 != main_#t~mem4#1);havoc main_#t~mem4#1; 1296#L30-3 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1302#L30-4 [2023-11-21 22:17:38,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:17:38,731 INFO L85 PathProgramCache]: Analyzing trace with hash 830581479, now seen corresponding path program 5 times [2023-11-21 22:17:38,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:17:38,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629244882] [2023-11-21 22:17:38,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:17:38,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:17:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:17:41,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:17:41,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:17:41,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629244882] [2023-11-21 22:17:41,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629244882] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:17:41,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645251363] [2023-11-21 22:17:41,468 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-21 22:17:41,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:17:41,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:41,476 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:17:41,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07b189fa-04c1-4920-a6e0-e15c8eb8aefa/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-21 22:18:33,806 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2023-11-21 22:18:33,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:18:33,834 INFO L262 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-21 22:18:33,840 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:18:34,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:18:34,031 INFO L327 TraceCheckSpWp]: Computing backward predicates...