./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd0c358d-a0ed-42f8-bd4f-aa78c71b86a9/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd0c358d-a0ed-42f8-bd4f-aa78c71b86a9/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd0c358d-a0ed-42f8-bd4f-aa78c71b86a9/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd0c358d-a0ed-42f8-bd4f-aa78c71b86a9/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_10.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd0c358d-a0ed-42f8-bd4f-aa78c71b86a9/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd0c358d-a0ed-42f8-bd4f-aa78c71b86a9/bin/uautomizer-verify-BQ2R08f2Ya --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 c861265e1e1e27fe23877e47c41012b82996e1c7e91f362716a115cbf38b786b --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:58:57,126 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:58:57,192 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd0c358d-a0ed-42f8-bd4f-aa78c71b86a9/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-29 01:58:57,197 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:58:57,198 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:58:57,222 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:58:57,222 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:58:57,223 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:58:57,224 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:58:57,224 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:58:57,225 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:58:57,226 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:58:57,226 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:58:57,227 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-29 01:58:57,227 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-29 01:58:57,228 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-29 01:58:57,228 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-29 01:58:57,229 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-29 01:58:57,229 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-29 01:58:57,230 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:58:57,230 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-29 01:58:57,233 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:58:57,233 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:58:57,233 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:58:57,234 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:58:57,234 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-29 01:58:57,234 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-29 01:58:57,235 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-29 01:58:57,235 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 01:58:57,236 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:58:57,236 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:58:57,236 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-29 01:58:57,237 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:58:57,237 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:58:57,237 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:58:57,237 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:58:57,238 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:58:57,238 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-29 01:58:57,238 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_dd0c358d-a0ed-42f8-bd4f-aa78c71b86a9/bin/uautomizer-verify-BQ2R08f2Ya/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_dd0c358d-a0ed-42f8-bd4f-aa78c71b86a9/bin/uautomizer-verify-BQ2R08f2Ya 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 -> c861265e1e1e27fe23877e47c41012b82996e1c7e91f362716a115cbf38b786b [2023-11-29 01:58:57,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:58:57,493 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:58:57,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:58:57,496 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:58:57,497 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:58:57,498 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd0c358d-a0ed-42f8-bd4f-aa78c71b86a9/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/locks/test_locks_10.c [2023-11-29 01:59:00,307 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:59:00,486 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:59:00,487 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd0c358d-a0ed-42f8-bd4f-aa78c71b86a9/sv-benchmarks/c/locks/test_locks_10.c [2023-11-29 01:59:00,495 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd0c358d-a0ed-42f8-bd4f-aa78c71b86a9/bin/uautomizer-verify-BQ2R08f2Ya/data/07b88915d/7b600996506b4c05939d5c062684358f/FLAGa5e32b9f9 [2023-11-29 01:59:00,511 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd0c358d-a0ed-42f8-bd4f-aa78c71b86a9/bin/uautomizer-verify-BQ2R08f2Ya/data/07b88915d/7b600996506b4c05939d5c062684358f [2023-11-29 01:59:00,513 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:59:00,515 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:59:00,517 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:59:00,517 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:59:00,523 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:59:00,523 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:59:00" (1/1) ... [2023-11-29 01:59:00,524 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@414fce85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:59:00, skipping insertion in model container [2023-11-29 01:59:00,525 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:59:00" (1/1) ... [2023-11-29 01:59:00,552 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:59:00,710 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:59:00,721 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:59:00,747 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:59:00,759 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:59:00,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:59:00 WrapperNode [2023-11-29 01:59:00,760 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:59:00,761 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:59:00,761 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:59:00,761 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:59:00,769 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:59:00" (1/1) ... [2023-11-29 01:59:00,777 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:59:00" (1/1) ... [2023-11-29 01:59:00,800 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 138 [2023-11-29 01:59:00,800 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:59:00,801 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:59:00,801 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:59:00,801 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:59:00,812 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:59:00" (1/1) ... [2023-11-29 01:59:00,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:59:00" (1/1) ... [2023-11-29 01:59:00,814 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:59:00" (1/1) ... [2023-11-29 01:59:00,826 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 01:59:00,827 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:59:00" (1/1) ... [2023-11-29 01:59:00,827 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:59:00" (1/1) ... [2023-11-29 01:59:00,832 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:59:00" (1/1) ... [2023-11-29 01:59:00,837 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:59:00" (1/1) ... [2023-11-29 01:59:00,838 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:59:00" (1/1) ... [2023-11-29 01:59:00,840 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:59:00" (1/1) ... [2023-11-29 01:59:00,842 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:59:00,843 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:59:00,843 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:59:00,843 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:59:00,844 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:59:00" (1/1) ... [2023-11-29 01:59:00,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:59:00,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd0c358d-a0ed-42f8-bd4f-aa78c71b86a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:59:00,878 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd0c358d-a0ed-42f8-bd4f-aa78c71b86a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:59:00,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd0c358d-a0ed-42f8-bd4f-aa78c71b86a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-29 01:59:00,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:59:00,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:59:00,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:59:00,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 01:59:00,977 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:59:00,979 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:59:01,169 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:59:01,179 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:59:01,180 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 01:59:01,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:59:01 BoogieIcfgContainer [2023-11-29 01:59:01,182 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:59:01,183 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-29 01:59:01,183 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-29 01:59:01,187 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-29 01:59:01,188 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 01:59:01,188 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 01:59:00" (1/3) ... [2023-11-29 01:59:01,189 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42af87e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 01:59:01, skipping insertion in model container [2023-11-29 01:59:01,189 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 01:59:01,189 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:59:00" (2/3) ... [2023-11-29 01:59:01,189 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42af87e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 01:59:01, skipping insertion in model container [2023-11-29 01:59:01,190 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 01:59:01,190 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:59:01" (3/3) ... [2023-11-29 01:59:01,191 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_10.c [2023-11-29 01:59:01,245 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-29 01:59:01,246 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-29 01:59:01,246 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-29 01:59:01,246 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-29 01:59:01,246 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-29 01:59:01,246 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-29 01:59:01,247 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-29 01:59:01,247 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-29 01:59:01,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 40 states, 39 states have (on average 1.8461538461538463) internal successors, (72), 39 states have internal predecessors, (72), 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-29 01:59:01,269 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2023-11-29 01:59:01,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:59:01,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:59:01,274 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-29 01:59:01,284 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:59:01,285 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-29 01:59:01,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 40 states, 39 states have (on average 1.8461538461538463) internal successors, (72), 39 states have internal predecessors, (72), 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-29 01:59:01,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2023-11-29 01:59:01,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:59:01,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:59:01,295 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-29 01:59:01,295 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:59:01,304 INFO L748 eck$LassoCheckResult]: Stem: 38#$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(16, 2);call #Ultimate.allocInit(12, 3); 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 28#L155-1true [2023-11-29 01:59:01,305 INFO L750 eck$LassoCheckResult]: Loop: 28#L155-1true assume !false;havoc main_#t~nondet14#1;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 25#L43true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 29#L68true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 9#L68-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 3#L72-1true assume !(0 != main_~p3~0#1); 19#L76-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 18#L80-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 30#L84-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 20#L88-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 6#L92-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 4#L96-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 7#L100-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 39#L104-1true assume !(0 != main_~p1~0#1); 23#L110-1true assume !(0 != main_~p2~0#1); 33#L115-1true assume !(0 != main_~p3~0#1); 17#L120-1true assume !(0 != main_~p4~0#1); 27#L125-1true assume !(0 != main_~p5~0#1); 36#L130-1true assume !(0 != main_~p6~0#1); 15#L135-1true assume !(0 != main_~p7~0#1); 13#L140-1true assume !(0 != main_~p8~0#1); 40#L145-1true assume !(0 != main_~p9~0#1); 10#L150-1true assume !(0 != main_~p10~0#1); 28#L155-1true [2023-11-29 01:59:01,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:59:01,312 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-11-29 01:59:01,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:59:01,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041667686] [2023-11-29 01:59:01,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:59:01,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:59:01,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:59:01,422 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:59:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:59:01,453 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:59:01,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:59:01,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1693159719, now seen corresponding path program 1 times [2023-11-29 01:59:01,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:59:01,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430364012] [2023-11-29 01:59:01,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:59:01,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:59:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:59:01,572 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-29 01:59:01,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:59:01,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430364012] [2023-11-29 01:59:01,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430364012] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:59:01,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:59:01,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:59:01,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561305603] [2023-11-29 01:59:01,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:59:01,581 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 01:59:01,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:59:01,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:59:01,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:59:01,624 INFO L87 Difference]: Start difference. First operand has 40 states, 39 states have (on average 1.8461538461538463) internal successors, (72), 39 states have internal predecessors, (72), 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 7.333333333333333) internal successors, (22), 3 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-29 01:59:01,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:59:01,664 INFO L93 Difference]: Finished difference Result 73 states and 129 transitions. [2023-11-29 01:59:01,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 129 transitions. [2023-11-29 01:59:01,670 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 63 [2023-11-29 01:59:01,675 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 65 states and 103 transitions. [2023-11-29 01:59:01,677 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2023-11-29 01:59:01,677 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2023-11-29 01:59:01,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 103 transitions. [2023-11-29 01:59:01,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:59:01,679 INFO L218 hiAutomatonCegarLoop]: Abstraction has 65 states and 103 transitions. [2023-11-29 01:59:01,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 103 transitions. [2023-11-29 01:59:01,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2023-11-29 01:59:01,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.5846153846153845) internal successors, (103), 64 states have internal predecessors, (103), 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-29 01:59:01,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 103 transitions. [2023-11-29 01:59:01,714 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 103 transitions. [2023-11-29 01:59:01,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:59:01,719 INFO L428 stractBuchiCegarLoop]: Abstraction has 65 states and 103 transitions. [2023-11-29 01:59:01,720 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-29 01:59:01,720 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 103 transitions. [2023-11-29 01:59:01,722 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 63 [2023-11-29 01:59:01,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:59:01,723 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:59:01,723 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-29 01:59:01,724 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:59:01,724 INFO L748 eck$LassoCheckResult]: Stem: 159#$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(16, 2);call #Ultimate.allocInit(12, 3); 130#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 131#L155-1 [2023-11-29 01:59:01,724 INFO L750 eck$LassoCheckResult]: Loop: 131#L155-1 assume !false;havoc main_#t~nondet14#1;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 170#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 169#L68 assume !(0 != main_~p1~0#1); 168#L68-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 167#L72-1 assume !(0 != main_~p3~0#1); 166#L76-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 165#L80-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 164#L84-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 147#L88-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 128#L92-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 124#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 125#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 129#L104-1 assume !(0 != main_~p1~0#1); 150#L110-1 assume !(0 != main_~p2~0#1); 151#L115-1 assume !(0 != main_~p3~0#1); 144#L120-1 assume !(0 != main_~p4~0#1); 127#L125-1 assume !(0 != main_~p5~0#1); 137#L130-1 assume !(0 != main_~p6~0#1); 143#L135-1 assume !(0 != main_~p7~0#1); 142#L140-1 assume !(0 != main_~p8~0#1); 174#L145-1 assume !(0 != main_~p9~0#1); 172#L150-1 assume !(0 != main_~p10~0#1); 131#L155-1 [2023-11-29 01:59:01,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:59:01,725 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2023-11-29 01:59:01,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:59:01,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198838088] [2023-11-29 01:59:01,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:59:01,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:59:01,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:59:01,734 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:59:01,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:59:01,742 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:59:01,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:59:01,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1784159127, now seen corresponding path program 1 times [2023-11-29 01:59:01,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:59:01,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807217743] [2023-11-29 01:59:01,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:59:01,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:59:01,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:59:01,794 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-29 01:59:01,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:59:01,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807217743] [2023-11-29 01:59:01,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807217743] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:59:01,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:59:01,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:59:01,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553415269] [2023-11-29 01:59:01,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:59:01,796 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 01:59:01,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:59:01,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:59:01,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:59:01,797 INFO L87 Difference]: Start difference. First operand 65 states and 103 transitions. cyclomatic complexity: 40 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-29 01:59:01,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:59:01,819 INFO L93 Difference]: Finished difference Result 126 states and 198 transitions. [2023-11-29 01:59:01,819 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 198 transitions. [2023-11-29 01:59:01,823 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 124 [2023-11-29 01:59:01,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 126 states and 198 transitions. [2023-11-29 01:59:01,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2023-11-29 01:59:01,826 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2023-11-29 01:59:01,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 198 transitions. [2023-11-29 01:59:01,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:59:01,827 INFO L218 hiAutomatonCegarLoop]: Abstraction has 126 states and 198 transitions. [2023-11-29 01:59:01,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 198 transitions. [2023-11-29 01:59:01,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2023-11-29 01:59:01,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.5714285714285714) internal successors, (198), 125 states have internal predecessors, (198), 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-29 01:59:01,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 198 transitions. [2023-11-29 01:59:01,839 INFO L240 hiAutomatonCegarLoop]: Abstraction has 126 states and 198 transitions. [2023-11-29 01:59:01,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:59:01,840 INFO L428 stractBuchiCegarLoop]: Abstraction has 126 states and 198 transitions. [2023-11-29 01:59:01,840 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-29 01:59:01,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 198 transitions. [2023-11-29 01:59:01,843 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 124 [2023-11-29 01:59:01,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:59:01,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:59:01,844 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-29 01:59:01,844 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:59:01,844 INFO L748 eck$LassoCheckResult]: Stem: 359#$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(16, 2);call #Ultimate.allocInit(12, 3); 327#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 328#L155-1 [2023-11-29 01:59:01,844 INFO L750 eck$LassoCheckResult]: Loop: 328#L155-1 assume !false;havoc main_#t~nondet14#1;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 388#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 386#L68 assume !(0 != main_~p1~0#1); 384#L68-2 assume !(0 != main_~p2~0#1); 382#L72-1 assume !(0 != main_~p3~0#1); 380#L76-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 378#L80-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 376#L84-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 374#L88-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 372#L92-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 370#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 368#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 366#L104-1 assume !(0 != main_~p1~0#1); 362#L110-1 assume !(0 != main_~p2~0#1); 363#L115-1 assume !(0 != main_~p3~0#1); 419#L120-1 assume !(0 != main_~p4~0#1); 415#L125-1 assume !(0 != main_~p5~0#1); 411#L130-1 assume !(0 != main_~p6~0#1); 405#L135-1 assume !(0 != main_~p7~0#1); 401#L140-1 assume !(0 != main_~p8~0#1); 397#L145-1 assume !(0 != main_~p9~0#1); 393#L150-1 assume !(0 != main_~p10~0#1); 328#L155-1 [2023-11-29 01:59:01,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:59:01,845 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2023-11-29 01:59:01,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:59:01,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846782968] [2023-11-29 01:59:01,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:59:01,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:59:01,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:59:01,852 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:59:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:59:01,859 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:59:01,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:59:01,859 INFO L85 PathProgramCache]: Analyzing trace with hash 95215385, now seen corresponding path program 1 times [2023-11-29 01:59:01,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:59:01,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023987160] [2023-11-29 01:59:01,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:59:01,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:59:01,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:59:01,899 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-29 01:59:01,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:59:01,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023987160] [2023-11-29 01:59:01,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023987160] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:59:01,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:59:01,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:59:01,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482138067] [2023-11-29 01:59:01,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:59:01,901 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 01:59:01,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:59:01,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:59:01,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:59:01,902 INFO L87 Difference]: Start difference. First operand 126 states and 198 transitions. cyclomatic complexity: 76 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-29 01:59:01,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:59:01,922 INFO L93 Difference]: Finished difference Result 246 states and 382 transitions. [2023-11-29 01:59:01,922 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 246 states and 382 transitions. [2023-11-29 01:59:01,926 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 244 [2023-11-29 01:59:01,929 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 246 states to 246 states and 382 transitions. [2023-11-29 01:59:01,929 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 246 [2023-11-29 01:59:01,930 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 246 [2023-11-29 01:59:01,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 246 states and 382 transitions. [2023-11-29 01:59:01,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:59:01,932 INFO L218 hiAutomatonCegarLoop]: Abstraction has 246 states and 382 transitions. [2023-11-29 01:59:01,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states and 382 transitions. [2023-11-29 01:59:01,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2023-11-29 01:59:01,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 246 states have (on average 1.5528455284552845) internal successors, (382), 245 states have internal predecessors, (382), 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-29 01:59:01,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 382 transitions. [2023-11-29 01:59:01,949 INFO L240 hiAutomatonCegarLoop]: Abstraction has 246 states and 382 transitions. [2023-11-29 01:59:01,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:59:01,950 INFO L428 stractBuchiCegarLoop]: Abstraction has 246 states and 382 transitions. [2023-11-29 01:59:01,950 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-29 01:59:01,950 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 246 states and 382 transitions. [2023-11-29 01:59:01,953 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 244 [2023-11-29 01:59:01,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:59:01,953 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:59:01,953 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-29 01:59:01,954 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:59:01,954 INFO L748 eck$LassoCheckResult]: Stem: 739#$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(16, 2);call #Ultimate.allocInit(12, 3); 706#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 707#L155-1 [2023-11-29 01:59:01,954 INFO L750 eck$LassoCheckResult]: Loop: 707#L155-1 assume !false;havoc main_#t~nondet14#1;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 794#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 790#L68 assume !(0 != main_~p1~0#1); 785#L68-2 assume !(0 != main_~p2~0#1); 779#L72-1 assume !(0 != main_~p3~0#1); 775#L76-1 assume !(0 != main_~p4~0#1); 768#L80-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 769#L84-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 761#L88-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 762#L92-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 754#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 751#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 747#L104-1 assume !(0 != main_~p1~0#1); 748#L110-1 assume !(0 != main_~p2~0#1); 853#L115-1 assume !(0 != main_~p3~0#1); 851#L120-1 assume !(0 != main_~p4~0#1); 849#L125-1 assume !(0 != main_~p5~0#1); 845#L130-1 assume !(0 != main_~p6~0#1); 841#L135-1 assume !(0 != main_~p7~0#1); 837#L140-1 assume !(0 != main_~p8~0#1); 833#L145-1 assume !(0 != main_~p9~0#1); 829#L150-1 assume !(0 != main_~p10~0#1); 707#L155-1 [2023-11-29 01:59:01,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:59:01,955 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2023-11-29 01:59:01,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:59:01,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530039614] [2023-11-29 01:59:01,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:59:01,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:59:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:59:01,962 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:59:01,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:59:01,969 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:59:01,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:59:01,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1493132517, now seen corresponding path program 1 times [2023-11-29 01:59:01,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:59:01,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300250550] [2023-11-29 01:59:01,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:59:01,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:59:01,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:59:02,006 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-29 01:59:02,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:59:02,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300250550] [2023-11-29 01:59:02,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300250550] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:59:02,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:59:02,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:59:02,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951451263] [2023-11-29 01:59:02,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:59:02,008 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 01:59:02,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:59:02,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:59:02,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:59:02,009 INFO L87 Difference]: Start difference. First operand 246 states and 382 transitions. cyclomatic complexity: 144 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-29 01:59:02,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:59:02,026 INFO L93 Difference]: Finished difference Result 482 states and 738 transitions. [2023-11-29 01:59:02,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 482 states and 738 transitions. [2023-11-29 01:59:02,032 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 480 [2023-11-29 01:59:02,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 482 states to 482 states and 738 transitions. [2023-11-29 01:59:02,037 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 482 [2023-11-29 01:59:02,038 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 482 [2023-11-29 01:59:02,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 482 states and 738 transitions. [2023-11-29 01:59:02,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:59:02,040 INFO L218 hiAutomatonCegarLoop]: Abstraction has 482 states and 738 transitions. [2023-11-29 01:59:02,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states and 738 transitions. [2023-11-29 01:59:02,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2023-11-29 01:59:02,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 482 states have (on average 1.5311203319502074) internal successors, (738), 481 states have internal predecessors, (738), 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-29 01:59:02,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 738 transitions. [2023-11-29 01:59:02,060 INFO L240 hiAutomatonCegarLoop]: Abstraction has 482 states and 738 transitions. [2023-11-29 01:59:02,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:59:02,061 INFO L428 stractBuchiCegarLoop]: Abstraction has 482 states and 738 transitions. [2023-11-29 01:59:02,061 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-29 01:59:02,061 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 482 states and 738 transitions. [2023-11-29 01:59:02,065 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 480 [2023-11-29 01:59:02,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:59:02,065 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:59:02,066 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-29 01:59:02,066 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:59:02,066 INFO L748 eck$LassoCheckResult]: Stem: 1472#$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(16, 2);call #Ultimate.allocInit(12, 3); 1440#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 1441#L155-1 [2023-11-29 01:59:02,066 INFO L750 eck$LassoCheckResult]: Loop: 1441#L155-1 assume !false;havoc main_#t~nondet14#1;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 1524#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 1519#L68 assume !(0 != main_~p1~0#1); 1511#L68-2 assume !(0 != main_~p2~0#1); 1504#L72-1 assume !(0 != main_~p3~0#1); 1500#L76-1 assume !(0 != main_~p4~0#1); 1493#L80-1 assume !(0 != main_~p5~0#1); 1494#L84-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1606#L88-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1604#L92-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1602#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1600#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1596#L104-1 assume !(0 != main_~p1~0#1); 1584#L110-1 assume !(0 != main_~p2~0#1); 1583#L115-1 assume !(0 != main_~p3~0#1); 1577#L120-1 assume !(0 != main_~p4~0#1); 1573#L125-1 assume !(0 != main_~p5~0#1); 1571#L130-1 assume !(0 != main_~p6~0#1); 1567#L135-1 assume !(0 != main_~p7~0#1); 1563#L140-1 assume !(0 != main_~p8~0#1); 1559#L145-1 assume !(0 != main_~p9~0#1); 1555#L150-1 assume !(0 != main_~p10~0#1); 1441#L155-1 [2023-11-29 01:59:02,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:59:02,067 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2023-11-29 01:59:02,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:59:02,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205995619] [2023-11-29 01:59:02,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:59:02,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:59:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:59:02,073 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:59:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:59:02,079 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:59:02,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:59:02,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1780766425, now seen corresponding path program 1 times [2023-11-29 01:59:02,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:59:02,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448489107] [2023-11-29 01:59:02,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:59:02,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:59:02,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:59:02,108 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-29 01:59:02,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:59:02,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448489107] [2023-11-29 01:59:02,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448489107] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:59:02,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:59:02,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:59:02,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70411676] [2023-11-29 01:59:02,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:59:02,110 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 01:59:02,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:59:02,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:59:02,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:59:02,111 INFO L87 Difference]: Start difference. First operand 482 states and 738 transitions. cyclomatic complexity: 272 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-29 01:59:02,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:59:02,129 INFO L93 Difference]: Finished difference Result 946 states and 1426 transitions. [2023-11-29 01:59:02,130 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 946 states and 1426 transitions. [2023-11-29 01:59:02,139 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 944 [2023-11-29 01:59:02,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 946 states to 946 states and 1426 transitions. [2023-11-29 01:59:02,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 946 [2023-11-29 01:59:02,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 946 [2023-11-29 01:59:02,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 946 states and 1426 transitions. [2023-11-29 01:59:02,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:59:02,150 INFO L218 hiAutomatonCegarLoop]: Abstraction has 946 states and 1426 transitions. [2023-11-29 01:59:02,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states and 1426 transitions. [2023-11-29 01:59:02,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 946. [2023-11-29 01:59:02,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 946 states have (on average 1.507399577167019) internal successors, (1426), 945 states have internal predecessors, (1426), 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-29 01:59:02,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1426 transitions. [2023-11-29 01:59:02,192 INFO L240 hiAutomatonCegarLoop]: Abstraction has 946 states and 1426 transitions. [2023-11-29 01:59:02,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:59:02,193 INFO L428 stractBuchiCegarLoop]: Abstraction has 946 states and 1426 transitions. [2023-11-29 01:59:02,193 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-29 01:59:02,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 946 states and 1426 transitions. [2023-11-29 01:59:02,198 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 944 [2023-11-29 01:59:02,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:59:02,198 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:59:02,199 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-29 01:59:02,199 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:59:02,199 INFO L748 eck$LassoCheckResult]: Stem: 2910#$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(16, 2);call #Ultimate.allocInit(12, 3); 2873#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 2874#L155-1 [2023-11-29 01:59:02,199 INFO L750 eck$LassoCheckResult]: Loop: 2874#L155-1 assume !false;havoc main_#t~nondet14#1;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 3066#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 3064#L68 assume !(0 != main_~p1~0#1); 3062#L68-2 assume !(0 != main_~p2~0#1); 3061#L72-1 assume !(0 != main_~p3~0#1); 3060#L76-1 assume !(0 != main_~p4~0#1); 3058#L80-1 assume !(0 != main_~p5~0#1); 3056#L84-1 assume !(0 != main_~p6~0#1); 3050#L88-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 3051#L92-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 3043#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 3044#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 3030#L104-1 assume !(0 != main_~p1~0#1); 3031#L110-1 assume !(0 != main_~p2~0#1); 3018#L115-1 assume !(0 != main_~p3~0#1); 3017#L120-1 assume !(0 != main_~p4~0#1); 3002#L125-1 assume !(0 != main_~p5~0#1); 3003#L130-1 assume !(0 != main_~p6~0#1); 3074#L135-1 assume !(0 != main_~p7~0#1); 3072#L140-1 assume !(0 != main_~p8~0#1); 3070#L145-1 assume !(0 != main_~p9~0#1); 3068#L150-1 assume !(0 != main_~p10~0#1); 2874#L155-1 [2023-11-29 01:59:02,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:59:02,200 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2023-11-29 01:59:02,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:59:02,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235128365] [2023-11-29 01:59:02,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:59:02,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:59:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:59:02,205 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:59:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:59:02,210 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:59:02,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:59:02,211 INFO L85 PathProgramCache]: Analyzing trace with hash 500902747, now seen corresponding path program 1 times [2023-11-29 01:59:02,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:59:02,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975135374] [2023-11-29 01:59:02,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:59:02,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:59:02,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:59:02,236 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-29 01:59:02,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:59:02,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975135374] [2023-11-29 01:59:02,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975135374] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:59:02,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:59:02,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:59:02,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798931303] [2023-11-29 01:59:02,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:59:02,237 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 01:59:02,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:59:02,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:59:02,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:59:02,238 INFO L87 Difference]: Start difference. First operand 946 states and 1426 transitions. cyclomatic complexity: 512 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-29 01:59:02,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:59:02,258 INFO L93 Difference]: Finished difference Result 1858 states and 2754 transitions. [2023-11-29 01:59:02,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1858 states and 2754 transitions. [2023-11-29 01:59:02,279 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1856 [2023-11-29 01:59:02,295 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1858 states to 1858 states and 2754 transitions. [2023-11-29 01:59:02,295 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1858 [2023-11-29 01:59:02,297 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1858 [2023-11-29 01:59:02,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1858 states and 2754 transitions. [2023-11-29 01:59:02,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:59:02,300 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1858 states and 2754 transitions. [2023-11-29 01:59:02,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states and 2754 transitions. [2023-11-29 01:59:02,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1858. [2023-11-29 01:59:02,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1858 states have (on average 1.4822389666307858) internal successors, (2754), 1857 states have internal predecessors, (2754), 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-29 01:59:02,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2754 transitions. [2023-11-29 01:59:02,343 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1858 states and 2754 transitions. [2023-11-29 01:59:02,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:59:02,345 INFO L428 stractBuchiCegarLoop]: Abstraction has 1858 states and 2754 transitions. [2023-11-29 01:59:02,345 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-29 01:59:02,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1858 states and 2754 transitions. [2023-11-29 01:59:02,358 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1856 [2023-11-29 01:59:02,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:59:02,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:59:02,359 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-29 01:59:02,359 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:59:02,360 INFO L748 eck$LassoCheckResult]: Stem: 5722#$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(16, 2);call #Ultimate.allocInit(12, 3); 5683#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 5684#L155-1 [2023-11-29 01:59:02,360 INFO L750 eck$LassoCheckResult]: Loop: 5684#L155-1 assume !false;havoc main_#t~nondet14#1;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 5881#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 5878#L68 assume !(0 != main_~p1~0#1); 5874#L68-2 assume !(0 != main_~p2~0#1); 5871#L72-1 assume !(0 != main_~p3~0#1); 5869#L76-1 assume !(0 != main_~p4~0#1); 5861#L80-1 assume !(0 != main_~p5~0#1); 5863#L84-1 assume !(0 != main_~p6~0#1); 5850#L88-1 assume !(0 != main_~p7~0#1); 5852#L92-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 5840#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 5841#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 5827#L104-1 assume !(0 != main_~p1~0#1); 5828#L110-1 assume !(0 != main_~p2~0#1); 5804#L115-1 assume !(0 != main_~p3~0#1); 5803#L120-1 assume !(0 != main_~p4~0#1); 5899#L125-1 assume !(0 != main_~p5~0#1); 5897#L130-1 assume !(0 != main_~p6~0#1); 5895#L135-1 assume !(0 != main_~p7~0#1); 5894#L140-1 assume !(0 != main_~p8~0#1); 5890#L145-1 assume !(0 != main_~p9~0#1); 5886#L150-1 assume !(0 != main_~p10~0#1); 5684#L155-1 [2023-11-29 01:59:02,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:59:02,361 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2023-11-29 01:59:02,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:59:02,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496704969] [2023-11-29 01:59:02,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:59:02,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:59:02,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:59:02,367 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:59:02,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:59:02,372 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:59:02,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:59:02,373 INFO L85 PathProgramCache]: Analyzing trace with hash -510214503, now seen corresponding path program 1 times [2023-11-29 01:59:02,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:59:02,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923756443] [2023-11-29 01:59:02,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:59:02,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:59:02,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:59:02,394 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-29 01:59:02,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:59:02,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923756443] [2023-11-29 01:59:02,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923756443] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:59:02,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:59:02,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:59:02,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552727928] [2023-11-29 01:59:02,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:59:02,396 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 01:59:02,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:59:02,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:59:02,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:59:02,397 INFO L87 Difference]: Start difference. First operand 1858 states and 2754 transitions. cyclomatic complexity: 960 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-29 01:59:02,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:59:02,424 INFO L93 Difference]: Finished difference Result 3650 states and 5314 transitions. [2023-11-29 01:59:02,425 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3650 states and 5314 transitions. [2023-11-29 01:59:02,455 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3648 [2023-11-29 01:59:02,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3650 states to 3650 states and 5314 transitions. [2023-11-29 01:59:02,479 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3650 [2023-11-29 01:59:02,481 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3650 [2023-11-29 01:59:02,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3650 states and 5314 transitions. [2023-11-29 01:59:02,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:59:02,486 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3650 states and 5314 transitions. [2023-11-29 01:59:02,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3650 states and 5314 transitions. [2023-11-29 01:59:02,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3650 to 3650. [2023-11-29 01:59:02,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3650 states, 3650 states have (on average 1.4558904109589041) internal successors, (5314), 3649 states have internal predecessors, (5314), 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-29 01:59:02,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3650 states to 3650 states and 5314 transitions. [2023-11-29 01:59:02,593 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3650 states and 5314 transitions. [2023-11-29 01:59:02,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:59:02,595 INFO L428 stractBuchiCegarLoop]: Abstraction has 3650 states and 5314 transitions. [2023-11-29 01:59:02,595 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-29 01:59:02,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3650 states and 5314 transitions. [2023-11-29 01:59:02,619 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3648 [2023-11-29 01:59:02,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:59:02,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:59:02,619 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-29 01:59:02,620 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:59:02,620 INFO L748 eck$LassoCheckResult]: Stem: 11234#$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(16, 2);call #Ultimate.allocInit(12, 3); 11198#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 11199#L155-1 [2023-11-29 01:59:02,620 INFO L750 eck$LassoCheckResult]: Loop: 11199#L155-1 assume !false;havoc main_#t~nondet14#1;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 11423#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 11420#L68 assume !(0 != main_~p1~0#1); 11416#L68-2 assume !(0 != main_~p2~0#1); 11413#L72-1 assume !(0 != main_~p3~0#1); 11411#L76-1 assume !(0 != main_~p4~0#1); 11401#L80-1 assume !(0 != main_~p5~0#1); 11403#L84-1 assume !(0 != main_~p6~0#1); 11386#L88-1 assume !(0 != main_~p7~0#1); 11388#L92-1 assume !(0 != main_~p8~0#1); 11370#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 11371#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 11349#L104-1 assume !(0 != main_~p1~0#1); 11350#L110-1 assume !(0 != main_~p2~0#1); 11325#L115-1 assume !(0 != main_~p3~0#1); 11324#L120-1 assume !(0 != main_~p4~0#1); 11441#L125-1 assume !(0 != main_~p5~0#1); 11439#L130-1 assume !(0 != main_~p6~0#1); 11437#L135-1 assume !(0 != main_~p7~0#1); 11435#L140-1 assume !(0 != main_~p8~0#1); 11432#L145-1 assume !(0 != main_~p9~0#1); 11428#L150-1 assume !(0 != main_~p10~0#1); 11199#L155-1 [2023-11-29 01:59:02,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:59:02,620 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2023-11-29 01:59:02,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:59:02,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222833668] [2023-11-29 01:59:02,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:59:02,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:59:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:59:02,626 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:59:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:59:02,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:59:02,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:59:02,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1097020517, now seen corresponding path program 1 times [2023-11-29 01:59:02,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:59:02,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870987445] [2023-11-29 01:59:02,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:59:02,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:59:02,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:59:02,651 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-29 01:59:02,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:59:02,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870987445] [2023-11-29 01:59:02,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870987445] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:59:02,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:59:02,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:59:02,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784871855] [2023-11-29 01:59:02,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:59:02,652 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 01:59:02,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:59:02,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:59:02,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:59:02,653 INFO L87 Difference]: Start difference. First operand 3650 states and 5314 transitions. cyclomatic complexity: 1792 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-29 01:59:02,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:59:02,696 INFO L93 Difference]: Finished difference Result 7170 states and 10242 transitions. [2023-11-29 01:59:02,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7170 states and 10242 transitions. [2023-11-29 01:59:02,751 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7168 [2023-11-29 01:59:02,807 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7170 states to 7170 states and 10242 transitions. [2023-11-29 01:59:02,808 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7170 [2023-11-29 01:59:02,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7170 [2023-11-29 01:59:02,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7170 states and 10242 transitions. [2023-11-29 01:59:02,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:59:02,826 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7170 states and 10242 transitions. [2023-11-29 01:59:02,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7170 states and 10242 transitions. [2023-11-29 01:59:03,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7170 to 7170. [2023-11-29 01:59:03,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7170 states, 7170 states have (on average 1.4284518828451882) internal successors, (10242), 7169 states have internal predecessors, (10242), 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-29 01:59:03,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7170 states to 7170 states and 10242 transitions. [2023-11-29 01:59:03,073 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7170 states and 10242 transitions. [2023-11-29 01:59:03,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:59:03,075 INFO L428 stractBuchiCegarLoop]: Abstraction has 7170 states and 10242 transitions. [2023-11-29 01:59:03,075 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-11-29 01:59:03,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7170 states and 10242 transitions. [2023-11-29 01:59:03,103 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7168 [2023-11-29 01:59:03,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:59:03,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:59:03,104 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-29 01:59:03,104 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:59:03,104 INFO L748 eck$LassoCheckResult]: Stem: 22058#$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(16, 2);call #Ultimate.allocInit(12, 3); 22023#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 22024#L155-1 [2023-11-29 01:59:03,105 INFO L750 eck$LassoCheckResult]: Loop: 22024#L155-1 assume !false;havoc main_#t~nondet14#1;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 22197#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 22193#L68 assume !(0 != main_~p1~0#1); 22189#L68-2 assume !(0 != main_~p2~0#1); 22186#L72-1 assume !(0 != main_~p3~0#1); 22182#L76-1 assume !(0 != main_~p4~0#1); 22116#L80-1 assume !(0 != main_~p5~0#1); 22117#L84-1 assume !(0 != main_~p6~0#1); 22316#L88-1 assume !(0 != main_~p7~0#1); 22332#L92-1 assume !(0 != main_~p8~0#1); 22324#L96-1 assume !(0 != main_~p9~0#1); 22289#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 22286#L104-1 assume !(0 != main_~p1~0#1); 22284#L110-1 assume !(0 != main_~p2~0#1); 22281#L115-1 assume !(0 != main_~p3~0#1); 22278#L120-1 assume !(0 != main_~p4~0#1); 22257#L125-1 assume !(0 != main_~p5~0#1); 22258#L130-1 assume !(0 != main_~p6~0#1); 22272#L135-1 assume !(0 != main_~p7~0#1); 22232#L140-1 assume !(0 != main_~p8~0#1); 22230#L145-1 assume !(0 != main_~p9~0#1); 22202#L150-1 assume !(0 != main_~p10~0#1); 22024#L155-1 [2023-11-29 01:59:03,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:59:03,105 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2023-11-29 01:59:03,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:59:03,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692683435] [2023-11-29 01:59:03,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:59:03,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:59:03,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:59:03,110 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:59:03,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:59:03,115 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:59:03,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:59:03,116 INFO L85 PathProgramCache]: Analyzing trace with hash -838855079, now seen corresponding path program 1 times [2023-11-29 01:59:03,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:59:03,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532881579] [2023-11-29 01:59:03,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:59:03,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:59:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:59:03,137 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-29 01:59:03,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:59:03,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532881579] [2023-11-29 01:59:03,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532881579] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:59:03,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:59:03,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:59:03,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948700601] [2023-11-29 01:59:03,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:59:03,139 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 01:59:03,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:59:03,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:59:03,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:59:03,140 INFO L87 Difference]: Start difference. First operand 7170 states and 10242 transitions. cyclomatic complexity: 3328 Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 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-29 01:59:03,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:59:03,261 INFO L93 Difference]: Finished difference Result 14082 states and 19714 transitions. [2023-11-29 01:59:03,261 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14082 states and 19714 transitions. [2023-11-29 01:59:03,336 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 14080 [2023-11-29 01:59:03,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14082 states to 14082 states and 19714 transitions. [2023-11-29 01:59:03,447 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14082 [2023-11-29 01:59:03,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14082 [2023-11-29 01:59:03,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14082 states and 19714 transitions. [2023-11-29 01:59:03,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:59:03,478 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14082 states and 19714 transitions. [2023-11-29 01:59:03,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14082 states and 19714 transitions. [2023-11-29 01:59:03,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14082 to 14082. [2023-11-29 01:59:03,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14082 states, 14082 states have (on average 1.3999431898878) internal successors, (19714), 14081 states have internal predecessors, (19714), 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-29 01:59:03,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14082 states to 14082 states and 19714 transitions. [2023-11-29 01:59:03,824 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14082 states and 19714 transitions. [2023-11-29 01:59:03,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:59:03,825 INFO L428 stractBuchiCegarLoop]: Abstraction has 14082 states and 19714 transitions. [2023-11-29 01:59:03,825 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-11-29 01:59:03,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14082 states and 19714 transitions. [2023-11-29 01:59:03,890 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 14080 [2023-11-29 01:59:03,890 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:59:03,890 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:59:03,891 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-29 01:59:03,891 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:59:03,891 INFO L748 eck$LassoCheckResult]: Stem: 43314#$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(16, 2);call #Ultimate.allocInit(12, 3); 43281#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 43282#L155-1 [2023-11-29 01:59:03,891 INFO L750 eck$LassoCheckResult]: Loop: 43282#L155-1 assume !false;havoc main_#t~nondet14#1;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 43404#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 43402#L68 assume !(0 != main_~p1~0#1); 43398#L68-2 assume !(0 != main_~p2~0#1); 43396#L72-1 assume !(0 != main_~p3~0#1); 43392#L76-1 assume !(0 != main_~p4~0#1); 43388#L80-1 assume !(0 != main_~p5~0#1); 43384#L84-1 assume !(0 != main_~p6~0#1); 43380#L88-1 assume !(0 != main_~p7~0#1); 43376#L92-1 assume !(0 != main_~p8~0#1); 43372#L96-1 assume !(0 != main_~p9~0#1); 43368#L100-1 assume !(0 != main_~p10~0#1); 43365#L104-1 assume !(0 != main_~p1~0#1); 43366#L110-1 assume !(0 != main_~p2~0#1); 43436#L115-1 assume !(0 != main_~p3~0#1); 43431#L120-1 assume !(0 != main_~p4~0#1); 43427#L125-1 assume !(0 != main_~p5~0#1); 43423#L130-1 assume !(0 != main_~p6~0#1); 43419#L135-1 assume !(0 != main_~p7~0#1); 43415#L140-1 assume !(0 != main_~p8~0#1); 43411#L145-1 assume !(0 != main_~p9~0#1); 43407#L150-1 assume !(0 != main_~p10~0#1); 43282#L155-1 [2023-11-29 01:59:03,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:59:03,892 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2023-11-29 01:59:03,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:59:03,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088540171] [2023-11-29 01:59:03,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:59:03,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:59:03,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:59:03,897 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:59:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:59:03,902 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:59:03,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:59:03,902 INFO L85 PathProgramCache]: Analyzing trace with hash -137790501, now seen corresponding path program 1 times [2023-11-29 01:59:03,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:59:03,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610777341] [2023-11-29 01:59:03,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:59:03,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:59:03,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:59:03,909 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:59:03,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:59:03,918 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:59:03,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:59:03,918 INFO L85 PathProgramCache]: Analyzing trace with hash -970235363, now seen corresponding path program 1 times [2023-11-29 01:59:03,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:59:03,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927907951] [2023-11-29 01:59:03,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:59:03,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:59:03,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:59:03,927 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:59:03,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:59:03,936 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:59:04,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:59:04,447 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:59:04,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:59:04,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 01:59:04 BoogieIcfgContainer [2023-11-29 01:59:04,485 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-11-29 01:59:04,485 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 01:59:04,486 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 01:59:04,486 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 01:59:04,486 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:59:01" (3/4) ... [2023-11-29 01:59:04,488 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2023-11-29 01:59:04,531 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd0c358d-a0ed-42f8-bd4f-aa78c71b86a9/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 01:59:04,531 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 01:59:04,532 INFO L158 Benchmark]: Toolchain (without parser) took 4016.59ms. Allocated memory was 144.7MB in the beginning and 266.3MB in the end (delta: 121.6MB). Free memory was 107.8MB in the beginning and 118.7MB in the end (delta: -10.9MB). Peak memory consumption was 112.6MB. Max. memory is 16.1GB. [2023-11-29 01:59:04,532 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 111.1MB. Free memory is still 58.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:59:04,532 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.26ms. Allocated memory is still 144.7MB. Free memory was 107.4MB in the beginning and 96.5MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 01:59:04,533 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.65ms. Allocated memory is still 144.7MB. Free memory was 96.5MB in the beginning and 94.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 01:59:04,533 INFO L158 Benchmark]: Boogie Preprocessor took 41.26ms. Allocated memory is still 144.7MB. Free memory was 94.8MB in the beginning and 92.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 01:59:04,533 INFO L158 Benchmark]: RCFGBuilder took 338.73ms. Allocated memory is still 144.7MB. Free memory was 92.7MB in the beginning and 80.4MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 01:59:04,534 INFO L158 Benchmark]: BuchiAutomizer took 3302.03ms. Allocated memory was 144.7MB in the beginning and 266.3MB in the end (delta: 121.6MB). Free memory was 80.0MB in the beginning and 120.7MB in the end (delta: -40.7MB). Peak memory consumption was 83.3MB. Max. memory is 16.1GB. [2023-11-29 01:59:04,534 INFO L158 Benchmark]: Witness Printer took 45.49ms. Allocated memory is still 266.3MB. Free memory was 120.7MB in the beginning and 118.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 01:59:04,536 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 111.1MB. Free memory is still 58.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 243.26ms. Allocated memory is still 144.7MB. Free memory was 107.4MB in the beginning and 96.5MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.65ms. Allocated memory is still 144.7MB. Free memory was 96.5MB in the beginning and 94.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.26ms. Allocated memory is still 144.7MB. Free memory was 94.8MB in the beginning and 92.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 338.73ms. Allocated memory is still 144.7MB. Free memory was 92.7MB in the beginning and 80.4MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 3302.03ms. Allocated memory was 144.7MB in the beginning and 266.3MB in the end (delta: 121.6MB). Free memory was 80.0MB in the beginning and 120.7MB in the end (delta: -40.7MB). Peak memory consumption was 83.3MB. Max. memory is 16.1GB. * Witness Printer took 45.49ms. Allocated memory is still 266.3MB. Free memory was 120.7MB in the beginning and 118.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (9 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.9 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 14082 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 10 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.0s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 0. Minimization of det autom 9. Minimization of nondet autom 0. Automata minimization 0.9s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.4s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 372 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 372 mSDsluCounter, 1165 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 444 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 47 IncrementalHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 721 mSDtfsCounter, 47 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI9 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 41]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L39] int cond; Loop: [L41] COND TRUE 1 [L42] cond = __VERIFIER_nondet_int() [L43] COND FALSE !(cond == 0) [L46] lk1 = 0 [L48] lk2 = 0 [L50] lk3 = 0 [L52] lk4 = 0 [L54] lk5 = 0 [L56] lk6 = 0 [L58] lk7 = 0 [L60] lk8 = 0 [L62] lk9 = 0 [L64] lk10 = 0 [L68] COND FALSE !(p1 != 0) [L72] COND FALSE !(p2 != 0) [L76] COND FALSE !(p3 != 0) [L80] COND FALSE !(p4 != 0) [L84] COND FALSE !(p5 != 0) [L88] COND FALSE !(p6 != 0) [L92] COND FALSE !(p7 != 0) [L96] COND FALSE !(p8 != 0) [L100] COND FALSE !(p9 != 0) [L104] COND FALSE !(p10 != 0) [L110] COND FALSE !(p1 != 0) [L115] COND FALSE !(p2 != 0) [L120] COND FALSE !(p3 != 0) [L125] COND FALSE !(p4 != 0) [L130] COND FALSE !(p5 != 0) [L135] COND FALSE !(p6 != 0) [L140] COND FALSE !(p7 != 0) [L145] COND FALSE !(p8 != 0) [L150] COND FALSE !(p9 != 0) [L155] COND FALSE !(p10 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 41]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L39] int cond; Loop: [L41] COND TRUE 1 [L42] cond = __VERIFIER_nondet_int() [L43] COND FALSE !(cond == 0) [L46] lk1 = 0 [L48] lk2 = 0 [L50] lk3 = 0 [L52] lk4 = 0 [L54] lk5 = 0 [L56] lk6 = 0 [L58] lk7 = 0 [L60] lk8 = 0 [L62] lk9 = 0 [L64] lk10 = 0 [L68] COND FALSE !(p1 != 0) [L72] COND FALSE !(p2 != 0) [L76] COND FALSE !(p3 != 0) [L80] COND FALSE !(p4 != 0) [L84] COND FALSE !(p5 != 0) [L88] COND FALSE !(p6 != 0) [L92] COND FALSE !(p7 != 0) [L96] COND FALSE !(p8 != 0) [L100] COND FALSE !(p9 != 0) [L104] COND FALSE !(p10 != 0) [L110] COND FALSE !(p1 != 0) [L115] COND FALSE !(p2 != 0) [L120] COND FALSE !(p3 != 0) [L125] COND FALSE !(p4 != 0) [L130] COND FALSE !(p5 != 0) [L135] COND FALSE !(p6 != 0) [L140] COND FALSE !(p7 != 0) [L145] COND FALSE !(p8 != 0) [L150] COND FALSE !(p9 != 0) [L155] COND FALSE !(p10 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2023-11-29 01:59:04,563 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd0c358d-a0ed-42f8-bd4f-aa78c71b86a9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)