./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec13_product32.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec13_product32.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 e7c9485412041f5ced738777edbcc586e5ce326d6f265b136a50fe41e5db19fb --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-15 00:43:41,453 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 00:43:41,523 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-15 00:43:41,536 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 00:43:41,537 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 00:43:41,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 00:43:41,570 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 00:43:41,570 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 00:43:41,571 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 00:43:41,575 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 00:43:41,575 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 00:43:41,576 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 00:43:41,576 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 00:43:41,576 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-15 00:43:41,576 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-15 00:43:41,577 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-15 00:43:41,577 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-15 00:43:41,577 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-15 00:43:41,577 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-15 00:43:41,578 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 00:43:41,578 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-15 00:43:41,580 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 00:43:41,580 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 00:43:41,580 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 00:43:41,580 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 00:43:41,581 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-15 00:43:41,581 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-15 00:43:41,581 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-15 00:43:41,581 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 00:43:41,582 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-15 00:43:41,582 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 00:43:41,582 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 00:43:41,583 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-15 00:43:41,583 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 00:43:41,583 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 00:43:41,584 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 00:43:41,584 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 00:43:41,584 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 00:43:41,585 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-15 00:43:41,585 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> e7c9485412041f5ced738777edbcc586e5ce326d6f265b136a50fe41e5db19fb [2024-10-15 00:43:41,865 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 00:43:41,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 00:43:41,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 00:43:41,895 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 00:43:41,896 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 00:43:41,897 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec13_product32.cil.c [2024-10-15 00:43:43,310 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 00:43:43,669 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 00:43:43,670 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec13_product32.cil.c [2024-10-15 00:43:43,702 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ac3170d4/630c7df0408e45ca9e9848043c542863/FLAG70a4bdd4b [2024-10-15 00:43:43,718 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ac3170d4/630c7df0408e45ca9e9848043c542863 [2024-10-15 00:43:43,722 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 00:43:43,723 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 00:43:43,726 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 00:43:43,726 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 00:43:43,731 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 00:43:43,732 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:43:43" (1/1) ... [2024-10-15 00:43:43,733 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70095f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:43, skipping insertion in model container [2024-10-15 00:43:43,733 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:43:43" (1/1) ... [2024-10-15 00:43:43,802 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 00:43:44,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:43:44,324 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 00:43:44,334 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [48] [2024-10-15 00:43:44,336 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [57] [2024-10-15 00:43:44,336 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification13_spec.i","") [160] [2024-10-15 00:43:44,337 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [251] [2024-10-15 00:43:44,338 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [604] [2024-10-15 00:43:44,338 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1271] [2024-10-15 00:43:44,339 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1391] [2024-10-15 00:43:44,339 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1426] [2024-10-15 00:43:44,342 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1792] [2024-10-15 00:43:44,342 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [3453] [2024-10-15 00:43:44,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:43:44,525 INFO L204 MainTranslator]: Completed translation [2024-10-15 00:43:44,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:44 WrapperNode [2024-10-15 00:43:44,525 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 00:43:44,526 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 00:43:44,527 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 00:43:44,527 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 00:43:44,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:44" (1/1) ... [2024-10-15 00:43:44,574 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:44" (1/1) ... [2024-10-15 00:43:45,344 INFO L138 Inliner]: procedures = 97, calls = 355, calls flagged for inlining = 207, calls inlined = 2065, statements flattened = 69873 [2024-10-15 00:43:45,345 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 00:43:45,346 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 00:43:45,346 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 00:43:45,346 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 00:43:45,356 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:44" (1/1) ... [2024-10-15 00:43:45,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:44" (1/1) ... [2024-10-15 00:43:45,679 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:44" (1/1) ... [2024-10-15 00:43:45,908 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2024-10-15 00:43:45,909 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:44" (1/1) ... [2024-10-15 00:43:45,909 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:44" (1/1) ... [2024-10-15 00:43:46,517 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:44" (1/1) ... [2024-10-15 00:43:46,874 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:44" (1/1) ... [2024-10-15 00:43:46,949 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:44" (1/1) ... [2024-10-15 00:43:47,122 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:44" (1/1) ... [2024-10-15 00:43:47,292 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 00:43:47,294 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 00:43:47,294 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 00:43:47,294 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 00:43:47,295 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:44" (1/1) ... [2024-10-15 00:43:47,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:43:47,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:43:47,327 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:43:47,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-15 00:43:47,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 00:43:47,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 00:43:47,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-15 00:43:47,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-15 00:43:47,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-15 00:43:47,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-15 00:43:47,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-15 00:43:47,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-15 00:43:47,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-15 00:43:47,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-15 00:43:47,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-15 00:43:47,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-15 00:43:47,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-15 00:43:47,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-15 00:43:47,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-15 00:43:47,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-15 00:43:47,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-15 00:43:47,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-15 00:43:47,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-15 00:43:47,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-15 00:43:47,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-15 00:43:47,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 00:43:47,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 00:43:47,629 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 00:43:47,631 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 00:44:12,282 INFO L? ?]: Removed 30382 outVars from TransFormulas that were not future-live. [2024-10-15 00:44:12,283 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 00:44:12,654 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 00:44:12,655 INFO L314 CfgBuilder]: Removed 61 assume(true) statements. [2024-10-15 00:44:12,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:44:12 BoogieIcfgContainer [2024-10-15 00:44:12,655 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 00:44:12,657 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-15 00:44:12,657 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-15 00:44:12,661 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-15 00:44:12,661 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:44:12,662 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.10 12:43:43" (1/3) ... [2024-10-15 00:44:12,662 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c68859b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:44:12, skipping insertion in model container [2024-10-15 00:44:12,663 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:44:12,663 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:43:44" (2/3) ... [2024-10-15 00:44:12,663 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c68859b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:44:12, skipping insertion in model container [2024-10-15 00:44:12,664 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:44:12,664 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:44:12" (3/3) ... [2024-10-15 00:44:12,665 INFO L332 chiAutomizerObserver]: Analyzing ICFG elevator_spec13_product32.cil.c [2024-10-15 00:44:12,946 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-15 00:44:12,946 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-15 00:44:12,946 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-15 00:44:12,946 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-15 00:44:12,946 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-15 00:44:12,946 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-15 00:44:12,947 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-15 00:44:12,947 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-15 00:44:13,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18492 states, 18491 states have (on average 1.8741549943215619) internal successors, (34655), 18491 states have internal predecessors, (34655), 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) [2024-10-15 00:44:13,333 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4184 [2024-10-15 00:44:13,333 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:44:13,333 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:44:13,343 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:44:13,343 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:44:13,343 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-15 00:44:13,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18492 states, 18491 states have (on average 1.8741549943215619) internal successors, (34655), 18491 states have internal predecessors, (34655), 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) [2024-10-15 00:44:13,607 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4184 [2024-10-15 00:44:13,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:44:13,608 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:44:13,611 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:44:13,611 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:44:13,621 INFO L745 eck$LassoCheckResult]: Stem: 4896#$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(32, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(10, 16);call #Ultimate.allocInit(4, 17);call write~init~int#5(91, 17, 0, 1);call write~init~int#5(95, 17, 1, 1);call write~init~int#5(93, 17, 2, 1);call write~init~int#5(0, 17, 3, 1);call #Ultimate.allocInit(4, 18);call write~init~int#6(91, 18, 0, 1);call write~init~int#6(93, 18, 1, 1);call write~init~int#6(32, 18, 2, 1);call write~init~int#6(0, 18, 3, 1);call #Ultimate.allocInit(5, 19);call write~init~int#7(32, 19, 0, 1);call write~init~int#7(97, 19, 1, 1);call write~init~int#7(116, 19, 2, 1);call write~init~int#7(32, 19, 3, 1);call write~init~int#7(0, 19, 4, 1);call #Ultimate.allocInit(3, 20);call write~init~int#8(37, 20, 0, 1);call write~init~int#8(105, 20, 1, 1);call write~init~int#8(0, 20, 2, 1);call #Ultimate.allocInit(10, 21);call #Ultimate.allocInit(3, 22);call write~init~int#9(117, 22, 0, 1);call write~init~int#9(112, 22, 1, 1);call write~init~int#9(0, 22, 2, 1);call #Ultimate.allocInit(5, 23);call write~init~int#10(100, 23, 0, 1);call write~init~int#10(111, 23, 1, 1);call write~init~int#10(119, 23, 2, 1);call write~init~int#10(110, 23, 3, 1);call write~init~int#10(0, 23, 4, 1);call #Ultimate.allocInit(7, 24);call write~init~int#11(32, 24, 0, 1);call write~init~int#11(73, 24, 1, 1);call write~init~int#11(76, 24, 2, 1);call write~init~int#11(95, 24, 3, 1);call write~init~int#11(112, 24, 4, 1);call write~init~int#11(58, 24, 5, 1);call write~init~int#11(0, 24, 6, 1);call #Ultimate.allocInit(4, 25);call write~init~int#12(32, 25, 0, 1);call write~init~int#12(37, 25, 1, 1);call write~init~int#12(105, 25, 2, 1);call write~init~int#12(0, 25, 3, 1);call #Ultimate.allocInit(4, 26);call write~init~int#13(32, 26, 0, 1);call write~init~int#13(37, 26, 1, 1);call write~init~int#13(105, 26, 2, 1);call write~init~int#13(0, 26, 3, 1);call #Ultimate.allocInit(4, 27);call write~init~int#14(32, 27, 0, 1);call write~init~int#14(37, 27, 1, 1);call write~init~int#14(105, 27, 2, 1);call write~init~int#14(0, 27, 3, 1);call #Ultimate.allocInit(4, 28);call write~init~int#15(32, 28, 0, 1);call write~init~int#15(37, 28, 1, 1);call write~init~int#15(105, 28, 2, 1);call write~init~int#15(0, 28, 3, 1);call #Ultimate.allocInit(4, 29);call write~init~int#16(32, 29, 0, 1);call write~init~int#16(37, 29, 1, 1);call write~init~int#16(105, 29, 2, 1);call write~init~int#16(0, 29, 3, 1);call #Ultimate.allocInit(6, 30);call write~init~int#17(32, 30, 0, 1);call write~init~int#17(70, 30, 1, 1);call write~init~int#17(95, 30, 2, 1);call write~init~int#17(112, 30, 3, 1);call write~init~int#17(58, 30, 4, 1);call write~init~int#17(0, 30, 5, 1);call #Ultimate.allocInit(4, 31);call write~init~int#18(32, 31, 0, 1);call write~init~int#18(37, 31, 1, 1);call write~init~int#18(105, 31, 2, 1);call write~init~int#18(0, 31, 3, 1);call #Ultimate.allocInit(4, 32);call write~init~int#19(32, 32, 0, 1);call write~init~int#19(37, 32, 1, 1);call write~init~int#19(105, 32, 2, 1);call write~init~int#19(0, 32, 3, 1);call #Ultimate.allocInit(4, 33);call write~init~int#1(32, 33, 0, 1);call write~init~int#1(37, 33, 1, 1);call write~init~int#1(105, 33, 2, 1);call write~init~int#1(0, 33, 3, 1);call #Ultimate.allocInit(4, 34);call write~init~int#2(32, 34, 0, 1);call write~init~int#2(37, 34, 1, 1);call write~init~int#2(105, 34, 2, 1);call write~init~int#2(0, 34, 3, 1);call #Ultimate.allocInit(4, 35);call write~init~int#3(32, 35, 0, 1);call write~init~int#3(37, 35, 1, 1);call write~init~int#3(105, 35, 2, 1);call write~init~int#3(0, 35, 3, 1);call #Ultimate.allocInit(2, 36);call write~init~int#4(10, 36, 0, 1);call write~init~int#4(0, 36, 1, 1);call #Ultimate.allocInit(9, 37);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~cleanupTimeShifts~0 := 12;~prevDir~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0; 4611#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret30#1, main_~retValue_acc~1#1, main_~tmp~11#1;havoc main_~retValue_acc~1#1;havoc main_~tmp~11#1;assume { :begin_inline_select_helpers } true; 17129#select_helpers_returnLabel#1true assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 16827#select_features_returnLabel#1true assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1; 9996#valid_product_returnLabel#1true main_#t~ret30#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;assume { :end_inline_valid_product } true;main_~tmp~11#1 := main_#t~ret30#1;havoc main_#t~ret30#1; 3998#L591true assume 0 != main_~tmp~11#1;assume { :begin_inline_setup } true; 10852#setup_returnLabel#1true assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;havoc aliceCall_~tmp~4#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1; 6768#L1317true assume 0 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 4;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1; 2574#getOrigin_returnLabel#1true aliceCall_#t~ret19#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~4#1 := aliceCall_#t~ret19#1;havoc aliceCall_#t~ret19#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~4#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 13503#L964true assume 0 == initPersonOnFloor_~floor#1; 17894#L965true assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_0~0 := 1; 390#L1072-1true assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 13212#L756true assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1; 11224#L768-2true havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true; 10324#initPersonOnFloor_returnLabel#1true havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true; 16771#aliceCall_returnLabel#1true havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;havoc angelinaCall_~tmp~5#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1; 14637#L1317-1true assume 0 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 4;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1; 9702#getOrigin_returnLabel#2true angelinaCall_#t~ret20#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~5#1 := angelinaCall_#t~ret20#1;havoc angelinaCall_#t~ret20#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~5#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 817#L964-1true assume 0 == initPersonOnFloor_~floor#1; 6155#L965-2true assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_0~0 := 1; 5687#L1072-3true assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 10102#L756-2true assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1; 6970#L768-5true havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true; 3389#initPersonOnFloor_returnLabel#2true havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true; 7683#angelinaCall_returnLabel#1true havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret115#1, timeShift_~tmp~29#1;havoc timeShift_~tmp~29#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;havoc getCurrentHeading_~retValue_acc~17#1;getCurrentHeading_~retValue_acc~17#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~17#1; 7100#getCurrentHeading_returnLabel#1true __utac_acc__Specification13_spec__1_#t~ret10#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret10#1;havoc __utac_acc__Specification13_spec__1_#t~ret10#1; 12920#__utac_acc__Specification13_spec__1_returnLabel#1true havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;havoc areDoorsOpen_~retValue_acc~15#1;areDoorsOpen_~retValue_acc~15#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~15#1; 14708#areDoorsOpen_returnLabel#1true timeShift_#t~ret115#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~29#1 := timeShift_#t~ret115#1;havoc timeShift_#t~ret115#1; 978#L3060true assume 0 != timeShift_~tmp~29#1; 9983#L3061true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 9254#L3060-1true assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret11#1, __utac_acc__Specification13_spec__2_#t~ret12#1, __utac_acc__Specification13_spec__2_#t~ret13#1, __utac_acc__Specification13_spec__2_#t~ret14#1, __utac_acc__Specification13_spec__2_#t~ret15#1, __utac_acc__Specification13_spec__2_#t~ret16#1, __utac_acc__Specification13_spec__2_~tmp~2#1, __utac_acc__Specification13_spec__2_~tmp___0~2#1, __utac_acc__Specification13_spec__2_~tmp___1~2#1, __utac_acc__Specification13_spec__2_~tmp___2~0#1, __utac_acc__Specification13_spec__2_~tmp___3~0#1, __utac_acc__Specification13_spec__2_~tmp___4~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;havoc __utac_acc__Specification13_spec__2_~tmp~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~0#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3); 17953#L188true assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1; 7645#L189true assume 1 == ~prevDir~0;assume { :begin_inline_existInLiftCallsInDirection } true;existInLiftCallsInDirection_#in~d#1 := 0;havoc existInLiftCallsInDirection_#res#1;havoc existInLiftCallsInDirection_~d#1, existInLiftCallsInDirection_~retValue_acc~29#1, existInLiftCallsInDirection_~i~3#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~29#1;havoc existInLiftCallsInDirection_~i~3#1;havoc existInLiftCallsInDirection_~i___0~0#1; 2919#L3280true assume 1 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i~3#1 := 0;existInLiftCallsInDirection_~i~3#1 := 1 + ~currentFloorID~0; 15186#L3284-2true [2024-10-15 00:44:13,622 INFO L747 eck$LassoCheckResult]: Loop: 15186#L3284-2true assume !false; 3452#L3285true assume existInLiftCallsInDirection_~i~3#1 < 5; 5594#L3286true assume !(0 == existInLiftCallsInDirection_~i~3#1); 12435#$Ultimate##7260true assume !(1 == existInLiftCallsInDirection_~i~3#1); 10042#$Ultimate##7264true assume !(2 == existInLiftCallsInDirection_~i~3#1); 4094#$Ultimate##7268true assume !(3 == existInLiftCallsInDirection_~i~3#1); 11120#$Ultimate##7272true assume !(4 == existInLiftCallsInDirection_~i~3#1); 3560#L3327-1true existInLiftCallsInDirection_~i~3#1 := 1 + existInLiftCallsInDirection_~i~3#1; 15186#L3284-2true [2024-10-15 00:44:13,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:44:13,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1516016117, now seen corresponding path program 1 times [2024-10-15 00:44:13,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:44:13,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743599351] [2024-10-15 00:44:13,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:44:13,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:44:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:44:14,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:44:14,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:44:14,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743599351] [2024-10-15 00:44:14,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743599351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:44:14,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:44:14,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 00:44:14,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409970406] [2024-10-15 00:44:14,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:44:14,153 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:44:14,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:44:14,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1774605181, now seen corresponding path program 1 times [2024-10-15 00:44:14,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:44:14,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904064250] [2024-10-15 00:44:14,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:44:14,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:44:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:44:14,186 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:44:14,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:44:14,228 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:44:14,291 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:44:14,292 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:44:14,293 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:44:14,293 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:44:14,293 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 00:44:14,293 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:44:14,293 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:44:14,294 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:44:14,294 INFO L132 ssoRankerPreferences]: Filename of dumped script: elevator_spec13_product32.cil.c_Iteration1_Loop [2024-10-15 00:44:14,294 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:44:14,294 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:44:14,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:44:14,401 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:44:14,402 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 00:44:14,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:44:14,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:44:14,406 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:44:14,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-15 00:44:14,410 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:44:14,411 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:44:14,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-15 00:44:14,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:44:14,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:44:14,447 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:44:14,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-15 00:44:14,449 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:44:14,450 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:44:14,484 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-15 00:44:14,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-15 00:44:14,490 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:44:14,490 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:44:14,490 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:44:14,491 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:44:14,491 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:44:14,491 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:44:14,491 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:44:14,491 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:44:14,491 INFO L132 ssoRankerPreferences]: Filename of dumped script: elevator_spec13_product32.cil.c_Iteration1_Loop [2024-10-15 00:44:14,491 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:44:14,491 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:44:14,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:44:14,543 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:44:14,547 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:44:14,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:44:14,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:44:14,551 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:44:14,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-15 00:44:14,553 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:44:14,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:44:14,566 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:44:14,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:44:14,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:44:14,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:44:14,569 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:44:14,569 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:44:14,572 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:44:14,577 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-15 00:44:14,578 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-15 00:44:14,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:44:14,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:44:14,583 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:44:14,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-15 00:44:14,586 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:44:14,587 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 00:44:14,587 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:44:14,588 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_existInLiftCallsInDirection_~i~3#1) = -1*ULTIMATE.start_existInLiftCallsInDirection_~i~3#1 Supporting invariants [] [2024-10-15 00:44:14,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-15 00:44:14,606 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 00:44:14,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:44:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:44:14,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:44:14,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:44:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:44:14,860 WARN L253 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 00:44:14,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:44:15,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:44:15,082 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2024-10-15 00:44:15,129 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 18492 states, 18491 states have (on average 1.8741549943215619) internal successors, (34655), 18491 states have internal predecessors, (34655), 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 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 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) [2024-10-15 00:44:17,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-15 00:44:17,625 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 18492 states, 18491 states have (on average 1.8741549943215619) internal successors, (34655), 18491 states have internal predecessors, (34655), 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 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 48202 states and 90276 transitions. Complement of second has 18 states. [2024-10-15 00:44:17,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2024-10-15 00:44:17,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 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) [2024-10-15 00:44:17,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62485 transitions. [2024-10-15 00:44:17,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 62485 transitions. Stem has 34 letters. Loop has 8 letters. [2024-10-15 00:44:17,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:44:17,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 62485 transitions. Stem has 42 letters. Loop has 8 letters. [2024-10-15 00:44:17,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:44:17,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 62485 transitions. Stem has 34 letters. Loop has 16 letters. [2024-10-15 00:44:17,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:44:17,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48202 states and 90276 transitions. [2024-10-15 00:44:18,280 INFO L131 ngComponentsAnalysis]: Automaton has 60 accepting balls. 8286 [2024-10-15 00:44:18,509 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48202 states to 33271 states and 62229 transitions. [2024-10-15 00:44:18,511 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33241 [2024-10-15 00:44:18,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33242 [2024-10-15 00:44:18,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33271 states and 62229 transitions. [2024-10-15 00:44:18,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:44:18,566 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33271 states and 62229 transitions. [2024-10-15 00:44:18,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33271 states and 62229 transitions. [2024-10-15 00:44:19,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33271 to 33245. [2024-10-15 00:44:19,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33245 states, 33245 states have (on average 1.8706572416904799) internal successors, (62190), 33244 states have internal predecessors, (62190), 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) [2024-10-15 00:44:19,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33245 states to 33245 states and 62190 transitions. [2024-10-15 00:44:19,638 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33245 states and 62190 transitions. [2024-10-15 00:44:19,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:44:19,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 00:44:19,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 00:44:19,648 INFO L87 Difference]: Start difference. First operand 33245 states and 62190 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:44:20,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:44:20,772 INFO L93 Difference]: Finished difference Result 33227 states and 62059 transitions. [2024-10-15 00:44:20,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33227 states and 62059 transitions. [2024-10-15 00:44:21,167 INFO L131 ngComponentsAnalysis]: Automaton has 60 accepting balls. 8270 [2024-10-15 00:44:21,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33227 states to 33218 states and 62050 transitions. [2024-10-15 00:44:21,328 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33199 [2024-10-15 00:44:21,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33199 [2024-10-15 00:44:21,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33218 states and 62050 transitions. [2024-10-15 00:44:21,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:44:21,374 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33218 states and 62050 transitions. [2024-10-15 00:44:21,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33218 states and 62050 transitions. [2024-10-15 00:44:21,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33218 to 18479. [2024-10-15 00:44:21,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18479 states, 18479 states have (on average 1.8680123383299962) internal successors, (34519), 18478 states have internal predecessors, (34519), 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) [2024-10-15 00:44:21,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18479 states to 18479 states and 34519 transitions. [2024-10-15 00:44:21,825 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18479 states and 34519 transitions. [2024-10-15 00:44:21,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 00:44:21,827 INFO L425 stractBuchiCegarLoop]: Abstraction has 18479 states and 34519 transitions. [2024-10-15 00:44:21,827 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-15 00:44:21,827 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18479 states and 34519 transitions. [2024-10-15 00:44:22,048 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4182 [2024-10-15 00:44:22,049 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:44:22,049 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:44:22,055 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:44:22,055 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:44:22,055 INFO L745 eck$LassoCheckResult]: Stem: 142833#$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(32, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(10, 16);call #Ultimate.allocInit(4, 17);call write~init~int#5(91, 17, 0, 1);call write~init~int#5(95, 17, 1, 1);call write~init~int#5(93, 17, 2, 1);call write~init~int#5(0, 17, 3, 1);call #Ultimate.allocInit(4, 18);call write~init~int#6(91, 18, 0, 1);call write~init~int#6(93, 18, 1, 1);call write~init~int#6(32, 18, 2, 1);call write~init~int#6(0, 18, 3, 1);call #Ultimate.allocInit(5, 19);call write~init~int#7(32, 19, 0, 1);call write~init~int#7(97, 19, 1, 1);call write~init~int#7(116, 19, 2, 1);call write~init~int#7(32, 19, 3, 1);call write~init~int#7(0, 19, 4, 1);call #Ultimate.allocInit(3, 20);call write~init~int#8(37, 20, 0, 1);call write~init~int#8(105, 20, 1, 1);call write~init~int#8(0, 20, 2, 1);call #Ultimate.allocInit(10, 21);call #Ultimate.allocInit(3, 22);call write~init~int#9(117, 22, 0, 1);call write~init~int#9(112, 22, 1, 1);call write~init~int#9(0, 22, 2, 1);call #Ultimate.allocInit(5, 23);call write~init~int#10(100, 23, 0, 1);call write~init~int#10(111, 23, 1, 1);call write~init~int#10(119, 23, 2, 1);call write~init~int#10(110, 23, 3, 1);call write~init~int#10(0, 23, 4, 1);call #Ultimate.allocInit(7, 24);call write~init~int#11(32, 24, 0, 1);call write~init~int#11(73, 24, 1, 1);call write~init~int#11(76, 24, 2, 1);call write~init~int#11(95, 24, 3, 1);call write~init~int#11(112, 24, 4, 1);call write~init~int#11(58, 24, 5, 1);call write~init~int#11(0, 24, 6, 1);call #Ultimate.allocInit(4, 25);call write~init~int#12(32, 25, 0, 1);call write~init~int#12(37, 25, 1, 1);call write~init~int#12(105, 25, 2, 1);call write~init~int#12(0, 25, 3, 1);call #Ultimate.allocInit(4, 26);call write~init~int#13(32, 26, 0, 1);call write~init~int#13(37, 26, 1, 1);call write~init~int#13(105, 26, 2, 1);call write~init~int#13(0, 26, 3, 1);call #Ultimate.allocInit(4, 27);call write~init~int#14(32, 27, 0, 1);call write~init~int#14(37, 27, 1, 1);call write~init~int#14(105, 27, 2, 1);call write~init~int#14(0, 27, 3, 1);call #Ultimate.allocInit(4, 28);call write~init~int#15(32, 28, 0, 1);call write~init~int#15(37, 28, 1, 1);call write~init~int#15(105, 28, 2, 1);call write~init~int#15(0, 28, 3, 1);call #Ultimate.allocInit(4, 29);call write~init~int#16(32, 29, 0, 1);call write~init~int#16(37, 29, 1, 1);call write~init~int#16(105, 29, 2, 1);call write~init~int#16(0, 29, 3, 1);call #Ultimate.allocInit(6, 30);call write~init~int#17(32, 30, 0, 1);call write~init~int#17(70, 30, 1, 1);call write~init~int#17(95, 30, 2, 1);call write~init~int#17(112, 30, 3, 1);call write~init~int#17(58, 30, 4, 1);call write~init~int#17(0, 30, 5, 1);call #Ultimate.allocInit(4, 31);call write~init~int#18(32, 31, 0, 1);call write~init~int#18(37, 31, 1, 1);call write~init~int#18(105, 31, 2, 1);call write~init~int#18(0, 31, 3, 1);call #Ultimate.allocInit(4, 32);call write~init~int#19(32, 32, 0, 1);call write~init~int#19(37, 32, 1, 1);call write~init~int#19(105, 32, 2, 1);call write~init~int#19(0, 32, 3, 1);call #Ultimate.allocInit(4, 33);call write~init~int#1(32, 33, 0, 1);call write~init~int#1(37, 33, 1, 1);call write~init~int#1(105, 33, 2, 1);call write~init~int#1(0, 33, 3, 1);call #Ultimate.allocInit(4, 34);call write~init~int#2(32, 34, 0, 1);call write~init~int#2(37, 34, 1, 1);call write~init~int#2(105, 34, 2, 1);call write~init~int#2(0, 34, 3, 1);call #Ultimate.allocInit(4, 35);call write~init~int#3(32, 35, 0, 1);call write~init~int#3(37, 35, 1, 1);call write~init~int#3(105, 35, 2, 1);call write~init~int#3(0, 35, 3, 1);call #Ultimate.allocInit(2, 36);call write~init~int#4(10, 36, 0, 1);call write~init~int#4(0, 36, 1, 1);call #Ultimate.allocInit(9, 37);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~cleanupTimeShifts~0 := 12;~prevDir~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0; 142398#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret30#1, main_~retValue_acc~1#1, main_~tmp~11#1;havoc main_~retValue_acc~1#1;havoc main_~tmp~11#1;assume { :begin_inline_select_helpers } true; 142399#select_helpers_returnLabel#1 assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 151692#select_features_returnLabel#1 assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1; 148389#valid_product_returnLabel#1 main_#t~ret30#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;assume { :end_inline_valid_product } true;main_~tmp~11#1 := main_#t~ret30#1;havoc main_#t~ret30#1; 141423#L591 assume 0 != main_~tmp~11#1;assume { :begin_inline_setup } true; 141424#setup_returnLabel#1 assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;havoc aliceCall_~tmp~4#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1; 145275#L1317 assume !(0 == getOrigin_~person#1); 144711#L1321 assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1; 139006#getOrigin_returnLabel#1 aliceCall_#t~ret19#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~4#1 := aliceCall_#t~ret19#1;havoc aliceCall_#t~ret19#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~4#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 139007#L964 assume 0 == initPersonOnFloor_~floor#1; 150706#L965 assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_0~0 := 1; 134376#L1072-1 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 134377#L756 assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1; 134694#L768-2 havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true; 148658#initPersonOnFloor_returnLabel#1 havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true; 148659#aliceCall_returnLabel#1 havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;havoc angelinaCall_~tmp~5#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1; 151176#L1317-1 assume !(0 == getOrigin_~person#1); 145096#L1321-1 assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1; 143557#getOrigin_returnLabel#2 angelinaCall_#t~ret20#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~5#1 := angelinaCall_#t~ret20#1;havoc angelinaCall_#t~ret20#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~5#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 135419#L964-1 assume 0 == initPersonOnFloor_~floor#1; 135420#L965-2 assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_0~0 := 1; 133347#L1072-3 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 143905#L756-2 assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1; 140543#L768-5 havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true; 140421#initPersonOnFloor_returnLabel#2 havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true; 140422#angelinaCall_returnLabel#1 havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret115#1, timeShift_~tmp~29#1;havoc timeShift_~tmp~29#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;havoc getCurrentHeading_~retValue_acc~17#1;getCurrentHeading_~retValue_acc~17#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~17#1; 145650#getCurrentHeading_returnLabel#1 __utac_acc__Specification13_spec__1_#t~ret10#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret10#1;havoc __utac_acc__Specification13_spec__1_#t~ret10#1; 145651#__utac_acc__Specification13_spec__1_returnLabel#1 havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;havoc areDoorsOpen_~retValue_acc~15#1;areDoorsOpen_~retValue_acc~15#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~15#1; 150399#areDoorsOpen_returnLabel#1 timeShift_#t~ret115#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~29#1 := timeShift_#t~ret115#1;havoc timeShift_#t~ret115#1; 135792#L3060 assume 0 != timeShift_~tmp~29#1; 135794#L3061 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 147777#L3060-1 assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret11#1, __utac_acc__Specification13_spec__2_#t~ret12#1, __utac_acc__Specification13_spec__2_#t~ret13#1, __utac_acc__Specification13_spec__2_#t~ret14#1, __utac_acc__Specification13_spec__2_#t~ret15#1, __utac_acc__Specification13_spec__2_#t~ret16#1, __utac_acc__Specification13_spec__2_~tmp~2#1, __utac_acc__Specification13_spec__2_~tmp___0~2#1, __utac_acc__Specification13_spec__2_~tmp___1~2#1, __utac_acc__Specification13_spec__2_~tmp___2~0#1, __utac_acc__Specification13_spec__2_~tmp___3~0#1, __utac_acc__Specification13_spec__2_~tmp___4~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;havoc __utac_acc__Specification13_spec__2_~tmp~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~0#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3); 147778#L188 assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1; 146235#L189 assume !(1 == ~prevDir~0); 146236#L215 assume 0 == ~prevDir~0;assume { :begin_inline_existInLiftCallsInDirection } true;existInLiftCallsInDirection_#in~d#1 := 1;havoc existInLiftCallsInDirection_#res#1;havoc existInLiftCallsInDirection_~d#1, existInLiftCallsInDirection_~retValue_acc~29#1, existInLiftCallsInDirection_~i~3#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~29#1;havoc existInLiftCallsInDirection_~i~3#1;havoc existInLiftCallsInDirection_~i___0~0#1; 137153#L3280-2 assume 1 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i~3#1 := 0;existInLiftCallsInDirection_~i~3#1 := 1 + ~currentFloorID~0; 137154#L3284-8 [2024-10-15 00:44:22,056 INFO L747 eck$LassoCheckResult]: Loop: 137154#L3284-8 assume !false; 145316#L3285-2 assume existInLiftCallsInDirection_~i~3#1 < 5; 145317#L3286-2 assume !(0 == existInLiftCallsInDirection_~i~3#1); 146582#$Ultimate##7416 assume !(1 == existInLiftCallsInDirection_~i~3#1); 135058#$Ultimate##7420 assume !(2 == existInLiftCallsInDirection_~i~3#1); 135122#$Ultimate##7424 assume !(3 == existInLiftCallsInDirection_~i~3#1); 139693#$Ultimate##7428 assume !(4 == existInLiftCallsInDirection_~i~3#1); 150737#L3327-5 existInLiftCallsInDirection_~i~3#1 := 1 + existInLiftCallsInDirection_~i~3#1; 137154#L3284-8 [2024-10-15 00:44:22,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:44:22,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1974371470, now seen corresponding path program 1 times [2024-10-15 00:44:22,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:44:22,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270226351] [2024-10-15 00:44:22,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:44:22,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:44:22,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:44:22,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:44:22,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:44:22,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270226351] [2024-10-15 00:44:22,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270226351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:44:22,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:44:22,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-15 00:44:22,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679846269] [2024-10-15 00:44:22,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:44:22,282 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:44:22,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:44:22,283 INFO L85 PathProgramCache]: Analyzing trace with hash 581704573, now seen corresponding path program 1 times [2024-10-15 00:44:22,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:44:22,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957155173] [2024-10-15 00:44:22,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:44:22,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:44:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:44:22,308 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:44:22,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:44:22,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:44:22,374 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:44:22,374 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:44:22,374 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:44:22,374 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:44:22,375 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 00:44:22,375 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:44:22,375 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:44:22,375 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:44:22,375 INFO L132 ssoRankerPreferences]: Filename of dumped script: elevator_spec13_product32.cil.c_Iteration2_Loop [2024-10-15 00:44:22,375 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:44:22,375 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:44:22,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:44:22,433 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:44:22,433 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 00:44:22,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:44:22,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:44:22,436 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:44:22,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-15 00:44:22,439 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:44:22,439 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:44:22,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-15 00:44:22,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:44:22,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:44:22,474 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:44:22,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-15 00:44:22,477 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:44:22,477 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:44:22,512 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-15 00:44:22,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-15 00:44:22,517 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:44:22,521 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:44:22,521 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:44:22,521 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:44:22,521 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:44:22,521 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:44:22,521 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:44:22,521 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:44:22,521 INFO L132 ssoRankerPreferences]: Filename of dumped script: elevator_spec13_product32.cil.c_Iteration2_Loop [2024-10-15 00:44:22,522 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:44:22,522 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:44:22,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:44:22,576 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:44:22,577 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:44:22,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:44:22,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:44:22,579 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:44:22,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-15 00:44:22,581 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:44:22,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:44:22,593 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:44:22,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:44:22,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:44:22,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:44:22,595 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:44:22,595 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:44:22,599 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:44:22,604 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-15 00:44:22,604 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-15 00:44:22,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:44:22,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:44:22,606 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:44:22,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-15 00:44:22,608 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:44:22,608 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 00:44:22,608 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:44:22,609 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_existInLiftCallsInDirection_~i~3#1) = -1*ULTIMATE.start_existInLiftCallsInDirection_~i~3#1 Supporting invariants [] [2024-10-15 00:44:22,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-15 00:44:22,624 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 00:44:22,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:44:22,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:44:22,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:44:22,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:44:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:44:22,810 WARN L253 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-15 00:44:22,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:44:22,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:44:22,985 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2024-10-15 00:44:22,986 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18479 states and 34519 transitions. cyclomatic complexity: 16074 Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 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) [2024-10-15 00:44:23,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-10-15 00:44:24,475 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18479 states and 34519 transitions. cyclomatic complexity: 16074. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 33274 states and 62133 transitions. Complement of second has 17 states. [2024-10-15 00:44:24,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2024-10-15 00:44:24,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 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) [2024-10-15 00:44:24,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34506 transitions. [2024-10-15 00:44:24,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 34506 transitions. Stem has 37 letters. Loop has 8 letters. [2024-10-15 00:44:24,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:44:24,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 34506 transitions. Stem has 45 letters. Loop has 8 letters. [2024-10-15 00:44:24,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:44:24,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 34506 transitions. Stem has 37 letters. Loop has 16 letters. [2024-10-15 00:44:24,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:44:24,517 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33274 states and 62133 transitions. [2024-10-15 00:44:24,692 INFO L131 ngComponentsAnalysis]: Automaton has 60 accepting balls. 8284 [2024-10-15 00:44:24,835 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33274 states to 33268 states and 62127 transitions. [2024-10-15 00:44:24,836 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33219 [2024-10-15 00:44:24,891 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33220 [2024-10-15 00:44:24,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33268 states and 62127 transitions. [2024-10-15 00:44:24,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:44:24,892 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33268 states and 62127 transitions. [2024-10-15 00:44:24,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33268 states and 62127 transitions. [2024-10-15 00:44:25,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33268 to 18503. [2024-10-15 00:44:25,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18503 states, 18503 states have (on average 1.8676430849051504) internal successors, (34557), 18502 states have internal predecessors, (34557), 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) [2024-10-15 00:44:25,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18503 states to 18503 states and 34557 transitions. [2024-10-15 00:44:25,487 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18503 states and 34557 transitions. [2024-10-15 00:44:25,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:44:25,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-15 00:44:25,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-15 00:44:25,489 INFO L87 Difference]: Start difference. First operand 18503 states and 34557 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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) [2024-10-15 00:44:26,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:44:26,235 INFO L93 Difference]: Finished difference Result 18521 states and 34575 transitions. [2024-10-15 00:44:26,235 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18521 states and 34575 transitions. [2024-10-15 00:44:26,345 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4186 [2024-10-15 00:44:26,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18521 states to 18521 states and 34575 transitions. [2024-10-15 00:44:26,442 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18483 [2024-10-15 00:44:26,461 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18483 [2024-10-15 00:44:26,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18521 states and 34575 transitions. [2024-10-15 00:44:26,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:44:26,462 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18521 states and 34575 transitions. [2024-10-15 00:44:26,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18521 states and 34575 transitions. [2024-10-15 00:44:26,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18521 to 18518. [2024-10-15 00:44:26,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18518 states, 18518 states have (on average 1.8669402743276813) internal successors, (34572), 18517 states have internal predecessors, (34572), 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) [2024-10-15 00:44:26,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18518 states to 18518 states and 34572 transitions. [2024-10-15 00:44:26,851 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18518 states and 34572 transitions. [2024-10-15 00:44:26,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-15 00:44:26,852 INFO L425 stractBuchiCegarLoop]: Abstraction has 18518 states and 34572 transitions. [2024-10-15 00:44:26,852 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-15 00:44:26,852 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18518 states and 34572 transitions. [2024-10-15 00:44:26,949 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4186 [2024-10-15 00:44:26,949 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:44:26,950 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:44:26,952 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:44:26,952 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:44:26,953 INFO L745 eck$LassoCheckResult]: Stem: 231792#$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(32, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(10, 16);call #Ultimate.allocInit(4, 17);call write~init~int#5(91, 17, 0, 1);call write~init~int#5(95, 17, 1, 1);call write~init~int#5(93, 17, 2, 1);call write~init~int#5(0, 17, 3, 1);call #Ultimate.allocInit(4, 18);call write~init~int#6(91, 18, 0, 1);call write~init~int#6(93, 18, 1, 1);call write~init~int#6(32, 18, 2, 1);call write~init~int#6(0, 18, 3, 1);call #Ultimate.allocInit(5, 19);call write~init~int#7(32, 19, 0, 1);call write~init~int#7(97, 19, 1, 1);call write~init~int#7(116, 19, 2, 1);call write~init~int#7(32, 19, 3, 1);call write~init~int#7(0, 19, 4, 1);call #Ultimate.allocInit(3, 20);call write~init~int#8(37, 20, 0, 1);call write~init~int#8(105, 20, 1, 1);call write~init~int#8(0, 20, 2, 1);call #Ultimate.allocInit(10, 21);call #Ultimate.allocInit(3, 22);call write~init~int#9(117, 22, 0, 1);call write~init~int#9(112, 22, 1, 1);call write~init~int#9(0, 22, 2, 1);call #Ultimate.allocInit(5, 23);call write~init~int#10(100, 23, 0, 1);call write~init~int#10(111, 23, 1, 1);call write~init~int#10(119, 23, 2, 1);call write~init~int#10(110, 23, 3, 1);call write~init~int#10(0, 23, 4, 1);call #Ultimate.allocInit(7, 24);call write~init~int#11(32, 24, 0, 1);call write~init~int#11(73, 24, 1, 1);call write~init~int#11(76, 24, 2, 1);call write~init~int#11(95, 24, 3, 1);call write~init~int#11(112, 24, 4, 1);call write~init~int#11(58, 24, 5, 1);call write~init~int#11(0, 24, 6, 1);call #Ultimate.allocInit(4, 25);call write~init~int#12(32, 25, 0, 1);call write~init~int#12(37, 25, 1, 1);call write~init~int#12(105, 25, 2, 1);call write~init~int#12(0, 25, 3, 1);call #Ultimate.allocInit(4, 26);call write~init~int#13(32, 26, 0, 1);call write~init~int#13(37, 26, 1, 1);call write~init~int#13(105, 26, 2, 1);call write~init~int#13(0, 26, 3, 1);call #Ultimate.allocInit(4, 27);call write~init~int#14(32, 27, 0, 1);call write~init~int#14(37, 27, 1, 1);call write~init~int#14(105, 27, 2, 1);call write~init~int#14(0, 27, 3, 1);call #Ultimate.allocInit(4, 28);call write~init~int#15(32, 28, 0, 1);call write~init~int#15(37, 28, 1, 1);call write~init~int#15(105, 28, 2, 1);call write~init~int#15(0, 28, 3, 1);call #Ultimate.allocInit(4, 29);call write~init~int#16(32, 29, 0, 1);call write~init~int#16(37, 29, 1, 1);call write~init~int#16(105, 29, 2, 1);call write~init~int#16(0, 29, 3, 1);call #Ultimate.allocInit(6, 30);call write~init~int#17(32, 30, 0, 1);call write~init~int#17(70, 30, 1, 1);call write~init~int#17(95, 30, 2, 1);call write~init~int#17(112, 30, 3, 1);call write~init~int#17(58, 30, 4, 1);call write~init~int#17(0, 30, 5, 1);call #Ultimate.allocInit(4, 31);call write~init~int#18(32, 31, 0, 1);call write~init~int#18(37, 31, 1, 1);call write~init~int#18(105, 31, 2, 1);call write~init~int#18(0, 31, 3, 1);call #Ultimate.allocInit(4, 32);call write~init~int#19(32, 32, 0, 1);call write~init~int#19(37, 32, 1, 1);call write~init~int#19(105, 32, 2, 1);call write~init~int#19(0, 32, 3, 1);call #Ultimate.allocInit(4, 33);call write~init~int#1(32, 33, 0, 1);call write~init~int#1(37, 33, 1, 1);call write~init~int#1(105, 33, 2, 1);call write~init~int#1(0, 33, 3, 1);call #Ultimate.allocInit(4, 34);call write~init~int#2(32, 34, 0, 1);call write~init~int#2(37, 34, 1, 1);call write~init~int#2(105, 34, 2, 1);call write~init~int#2(0, 34, 3, 1);call #Ultimate.allocInit(4, 35);call write~init~int#3(32, 35, 0, 1);call write~init~int#3(37, 35, 1, 1);call write~init~int#3(105, 35, 2, 1);call write~init~int#3(0, 35, 3, 1);call #Ultimate.allocInit(2, 36);call write~init~int#4(10, 36, 0, 1);call write~init~int#4(0, 36, 1, 1);call #Ultimate.allocInit(9, 37);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~cleanupTimeShifts~0 := 12;~prevDir~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0; 231358#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret30#1, main_~retValue_acc~1#1, main_~tmp~11#1;havoc main_~retValue_acc~1#1;havoc main_~tmp~11#1;assume { :begin_inline_select_helpers } true; 231359#select_helpers_returnLabel#1 assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 240661#select_features_returnLabel#1 assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1; 237355#valid_product_returnLabel#1 main_#t~ret30#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;assume { :end_inline_valid_product } true;main_~tmp~11#1 := main_#t~ret30#1;havoc main_#t~ret30#1; 230382#L591 assume 0 != main_~tmp~11#1;assume { :begin_inline_setup } true; 230383#setup_returnLabel#1 assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;havoc aliceCall_~tmp~4#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1; 234235#L1317 assume !(0 == getOrigin_~person#1); 233672#L1321 assume !(1 == getOrigin_~person#1); 233673#L1325 assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1; 231230#getOrigin_returnLabel#1 aliceCall_#t~ret19#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~4#1 := aliceCall_#t~ret19#1;havoc aliceCall_#t~ret19#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~4#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 240791#L964 assume 0 == initPersonOnFloor_~floor#1; 240772#L965 assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_0~0 := 1; 223330#L1072-1 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 223331#L756 assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1; 223648#L768-2 havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true; 237623#initPersonOnFloor_returnLabel#1 havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true; 237624#aliceCall_returnLabel#1 havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;havoc angelinaCall_~tmp~5#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1; 240142#L1317-1 assume !(0 == getOrigin_~person#1); 234057#L1321-1 assume !(1 == getOrigin_~person#1); 232517#L1325-1 assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1; 232518#getOrigin_returnLabel#2 angelinaCall_#t~ret20#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~5#1 := angelinaCall_#t~ret20#1;havoc angelinaCall_#t~ret20#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~5#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 240800#L964-1 assume 0 == initPersonOnFloor_~floor#1; 233482#L965-2 assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_0~0 := 1; 222302#L1072-3 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 232864#L756-2 assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1; 229502#L768-5 havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true; 229379#initPersonOnFloor_returnLabel#2 havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true; 229380#angelinaCall_returnLabel#1 havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret115#1, timeShift_~tmp~29#1;havoc timeShift_~tmp~29#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;havoc getCurrentHeading_~retValue_acc~17#1;getCurrentHeading_~retValue_acc~17#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~17#1; 234614#getCurrentHeading_returnLabel#1 __utac_acc__Specification13_spec__1_#t~ret10#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret10#1;havoc __utac_acc__Specification13_spec__1_#t~ret10#1; 234615#__utac_acc__Specification13_spec__1_returnLabel#1 havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;havoc areDoorsOpen_~retValue_acc~15#1;areDoorsOpen_~retValue_acc~15#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~15#1; 239365#areDoorsOpen_returnLabel#1 timeShift_#t~ret115#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~29#1 := timeShift_#t~ret115#1;havoc timeShift_#t~ret115#1; 224750#L3060 assume 0 != timeShift_~tmp~29#1; 224752#L3061 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 236743#L3060-1 assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret11#1, __utac_acc__Specification13_spec__2_#t~ret12#1, __utac_acc__Specification13_spec__2_#t~ret13#1, __utac_acc__Specification13_spec__2_#t~ret14#1, __utac_acc__Specification13_spec__2_#t~ret15#1, __utac_acc__Specification13_spec__2_#t~ret16#1, __utac_acc__Specification13_spec__2_~tmp~2#1, __utac_acc__Specification13_spec__2_~tmp___0~2#1, __utac_acc__Specification13_spec__2_~tmp___1~2#1, __utac_acc__Specification13_spec__2_~tmp___2~0#1, __utac_acc__Specification13_spec__2_~tmp___3~0#1, __utac_acc__Specification13_spec__2_~tmp___4~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;havoc __utac_acc__Specification13_spec__2_~tmp~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~0#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3); 236744#L188 assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1; 235197#L189 assume 1 == ~prevDir~0;assume { :begin_inline_existInLiftCallsInDirection } true;existInLiftCallsInDirection_#in~d#1 := 0;havoc existInLiftCallsInDirection_#res#1;havoc existInLiftCallsInDirection_~d#1, existInLiftCallsInDirection_~retValue_acc~29#1, existInLiftCallsInDirection_~i~3#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~29#1;havoc existInLiftCallsInDirection_~i~3#1;havoc existInLiftCallsInDirection_~i___0~0#1; 228565#L3280 assume 1 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i~3#1 := 0;existInLiftCallsInDirection_~i~3#1 := 1 + ~currentFloorID~0; 228566#L3284-2 assume !false; 229487#L3285 [2024-10-15 00:44:26,954 INFO L747 eck$LassoCheckResult]: Loop: 229487#L3285 assume existInLiftCallsInDirection_~i~3#1 < 5; 229489#L3286 assume !(0 == existInLiftCallsInDirection_~i~3#1); 232743#$Ultimate##7260 assume 1 == existInLiftCallsInDirection_~i~3#1; 233334#L3301 assume !(0 != ~floorButtons_1~0); 233335#$Ultimate##7264 assume !(2 == existInLiftCallsInDirection_~i~3#1); 230986#$Ultimate##7268 assume !(3 == existInLiftCallsInDirection_~i~3#1); 232607#$Ultimate##7272 assume !(4 == existInLiftCallsInDirection_~i~3#1); 229684#L3327-1 existInLiftCallsInDirection_~i~3#1 := 1 + existInLiftCallsInDirection_~i~3#1; 229685#L3284-2 assume !false; 229487#L3285 [2024-10-15 00:44:26,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:44:26,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1800201023, now seen corresponding path program 1 times [2024-10-15 00:44:26,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:44:26,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377747510] [2024-10-15 00:44:26,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:44:26,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:44:26,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:44:27,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:44:27,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:44:27,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377747510] [2024-10-15 00:44:27,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377747510] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:44:27,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:44:27,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 00:44:27,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526747504] [2024-10-15 00:44:27,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:44:27,062 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:44:27,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:44:27,062 INFO L85 PathProgramCache]: Analyzing trace with hash 917806602, now seen corresponding path program 1 times [2024-10-15 00:44:27,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:44:27,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643351256] [2024-10-15 00:44:27,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:44:27,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:44:27,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:44:27,086 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:44:27,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:44:27,108 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:44:27,137 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:44:27,138 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:44:27,138 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:44:27,138 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:44:27,138 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 00:44:27,138 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:44:27,139 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:44:27,139 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:44:27,139 INFO L132 ssoRankerPreferences]: Filename of dumped script: elevator_spec13_product32.cil.c_Iteration3_Loop [2024-10-15 00:44:27,139 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:44:27,139 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:44:27,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:44:27,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:44:27,358 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:44:27,358 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 00:44:27,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:44:27,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:44:27,360 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:44:27,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-15 00:44:27,364 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:44:27,364 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:44:27,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-10-15 00:44:27,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:44:27,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:44:27,397 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:44:27,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-15 00:44:27,400 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:44:27,400 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:44:27,418 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-15 00:44:27,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-10-15 00:44:27,434 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:44:27,434 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:44:27,434 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:44:27,434 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:44:27,434 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:44:27,434 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:44:27,434 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:44:27,434 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:44:27,434 INFO L132 ssoRankerPreferences]: Filename of dumped script: elevator_spec13_product32.cil.c_Iteration3_Loop [2024-10-15 00:44:27,434 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:44:27,434 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:44:27,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:44:27,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:44:27,470 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:44:27,471 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:44:27,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:44:27,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:44:27,472 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:44:27,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-15 00:44:27,474 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:44:27,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:44:27,484 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:44:27,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:44:27,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:44:27,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:44:27,485 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:44:27,485 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:44:27,487 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:44:27,488 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-15 00:44:27,488 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-15 00:44:27,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:44:27,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:44:27,490 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:44:27,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-15 00:44:27,492 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:44:27,492 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 00:44:27,492 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:44:27,492 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_existInLiftCallsInDirection_~i~3#1) = -2*ULTIMATE.start_existInLiftCallsInDirection_~i~3#1 + 3 Supporting invariants [] [2024-10-15 00:44:27,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-10-15 00:44:27,503 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 00:44:27,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:44:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:44:27,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:44:27,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:44:27,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:44:27,673 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:44:27,674 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:44:27,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:44:27,750 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-15 00:44:27,750 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18518 states and 34572 transitions. cyclomatic complexity: 16089 Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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) [2024-10-15 00:44:28,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-15 00:44:29,305 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18518 states and 34572 transitions. cyclomatic complexity: 16089. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 48103 states and 89794 transitions. Complement of second has 8 states. [2024-10-15 00:44:29,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-15 00:44:29,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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) [2024-10-15 00:44:29,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62047 transitions. [2024-10-15 00:44:29,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 62047 transitions. Stem has 39 letters. Loop has 9 letters. [2024-10-15 00:44:29,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:44:29,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 62047 transitions. Stem has 48 letters. Loop has 9 letters. [2024-10-15 00:44:29,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:44:29,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 62047 transitions. Stem has 39 letters. Loop has 18 letters. [2024-10-15 00:44:29,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:44:29,361 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48103 states and 89794 transitions. [2024-10-15 00:44:29,552 INFO L131 ngComponentsAnalysis]: Automaton has 60 accepting balls. 8270 [2024-10-15 00:44:29,982 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48103 states to 33309 states and 62171 transitions. [2024-10-15 00:44:29,983 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33227 [2024-10-15 00:44:30,009 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33230 [2024-10-15 00:44:30,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33309 states and 62171 transitions. [2024-10-15 00:44:30,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:44:30,048 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33309 states and 62171 transitions. [2024-10-15 00:44:30,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33309 states and 62171 transitions. [2024-10-15 00:44:30,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33309 to 18560. [2024-10-15 00:44:30,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18560 states, 18560 states have (on average 1.8657327586206895) internal successors, (34628), 18559 states have internal predecessors, (34628), 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) [2024-10-15 00:44:30,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18560 states to 18560 states and 34628 transitions. [2024-10-15 00:44:30,516 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18560 states and 34628 transitions. [2024-10-15 00:44:30,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:44:30,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:44:30,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:44:30,517 INFO L87 Difference]: Start difference. First operand 18560 states and 34628 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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) [2024-10-15 00:44:30,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:44:30,913 INFO L93 Difference]: Finished difference Result 18526 states and 34560 transitions. [2024-10-15 00:44:30,913 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18526 states and 34560 transitions. [2024-10-15 00:44:31,024 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4182 [2024-10-15 00:44:31,100 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18526 states to 18526 states and 34560 transitions. [2024-10-15 00:44:31,100 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18447 [2024-10-15 00:44:31,121 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18447 [2024-10-15 00:44:31,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18526 states and 34560 transitions. [2024-10-15 00:44:31,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:44:31,122 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18526 states and 34560 transitions. [2024-10-15 00:44:31,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18526 states and 34560 transitions. [2024-10-15 00:44:31,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18526 to 18526. [2024-10-15 00:44:31,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18526 states, 18526 states have (on average 1.865486343517219) internal successors, (34560), 18525 states have internal predecessors, (34560), 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) [2024-10-15 00:44:31,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18526 states to 18526 states and 34560 transitions. [2024-10-15 00:44:31,736 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18526 states and 34560 transitions. [2024-10-15 00:44:31,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:44:31,737 INFO L425 stractBuchiCegarLoop]: Abstraction has 18526 states and 34560 transitions. [2024-10-15 00:44:31,737 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-15 00:44:31,737 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18526 states and 34560 transitions. [2024-10-15 00:44:31,803 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4182 [2024-10-15 00:44:31,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:44:31,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:44:31,805 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:44:31,805 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-15 00:44:31,806 INFO L745 eck$LassoCheckResult]: Stem: 335656#$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(32, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(10, 16);call #Ultimate.allocInit(4, 17);call write~init~int#5(91, 17, 0, 1);call write~init~int#5(95, 17, 1, 1);call write~init~int#5(93, 17, 2, 1);call write~init~int#5(0, 17, 3, 1);call #Ultimate.allocInit(4, 18);call write~init~int#6(91, 18, 0, 1);call write~init~int#6(93, 18, 1, 1);call write~init~int#6(32, 18, 2, 1);call write~init~int#6(0, 18, 3, 1);call #Ultimate.allocInit(5, 19);call write~init~int#7(32, 19, 0, 1);call write~init~int#7(97, 19, 1, 1);call write~init~int#7(116, 19, 2, 1);call write~init~int#7(32, 19, 3, 1);call write~init~int#7(0, 19, 4, 1);call #Ultimate.allocInit(3, 20);call write~init~int#8(37, 20, 0, 1);call write~init~int#8(105, 20, 1, 1);call write~init~int#8(0, 20, 2, 1);call #Ultimate.allocInit(10, 21);call #Ultimate.allocInit(3, 22);call write~init~int#9(117, 22, 0, 1);call write~init~int#9(112, 22, 1, 1);call write~init~int#9(0, 22, 2, 1);call #Ultimate.allocInit(5, 23);call write~init~int#10(100, 23, 0, 1);call write~init~int#10(111, 23, 1, 1);call write~init~int#10(119, 23, 2, 1);call write~init~int#10(110, 23, 3, 1);call write~init~int#10(0, 23, 4, 1);call #Ultimate.allocInit(7, 24);call write~init~int#11(32, 24, 0, 1);call write~init~int#11(73, 24, 1, 1);call write~init~int#11(76, 24, 2, 1);call write~init~int#11(95, 24, 3, 1);call write~init~int#11(112, 24, 4, 1);call write~init~int#11(58, 24, 5, 1);call write~init~int#11(0, 24, 6, 1);call #Ultimate.allocInit(4, 25);call write~init~int#12(32, 25, 0, 1);call write~init~int#12(37, 25, 1, 1);call write~init~int#12(105, 25, 2, 1);call write~init~int#12(0, 25, 3, 1);call #Ultimate.allocInit(4, 26);call write~init~int#13(32, 26, 0, 1);call write~init~int#13(37, 26, 1, 1);call write~init~int#13(105, 26, 2, 1);call write~init~int#13(0, 26, 3, 1);call #Ultimate.allocInit(4, 27);call write~init~int#14(32, 27, 0, 1);call write~init~int#14(37, 27, 1, 1);call write~init~int#14(105, 27, 2, 1);call write~init~int#14(0, 27, 3, 1);call #Ultimate.allocInit(4, 28);call write~init~int#15(32, 28, 0, 1);call write~init~int#15(37, 28, 1, 1);call write~init~int#15(105, 28, 2, 1);call write~init~int#15(0, 28, 3, 1);call #Ultimate.allocInit(4, 29);call write~init~int#16(32, 29, 0, 1);call write~init~int#16(37, 29, 1, 1);call write~init~int#16(105, 29, 2, 1);call write~init~int#16(0, 29, 3, 1);call #Ultimate.allocInit(6, 30);call write~init~int#17(32, 30, 0, 1);call write~init~int#17(70, 30, 1, 1);call write~init~int#17(95, 30, 2, 1);call write~init~int#17(112, 30, 3, 1);call write~init~int#17(58, 30, 4, 1);call write~init~int#17(0, 30, 5, 1);call #Ultimate.allocInit(4, 31);call write~init~int#18(32, 31, 0, 1);call write~init~int#18(37, 31, 1, 1);call write~init~int#18(105, 31, 2, 1);call write~init~int#18(0, 31, 3, 1);call #Ultimate.allocInit(4, 32);call write~init~int#19(32, 32, 0, 1);call write~init~int#19(37, 32, 1, 1);call write~init~int#19(105, 32, 2, 1);call write~init~int#19(0, 32, 3, 1);call #Ultimate.allocInit(4, 33);call write~init~int#1(32, 33, 0, 1);call write~init~int#1(37, 33, 1, 1);call write~init~int#1(105, 33, 2, 1);call write~init~int#1(0, 33, 3, 1);call #Ultimate.allocInit(4, 34);call write~init~int#2(32, 34, 0, 1);call write~init~int#2(37, 34, 1, 1);call write~init~int#2(105, 34, 2, 1);call write~init~int#2(0, 34, 3, 1);call #Ultimate.allocInit(4, 35);call write~init~int#3(32, 35, 0, 1);call write~init~int#3(37, 35, 1, 1);call write~init~int#3(105, 35, 2, 1);call write~init~int#3(0, 35, 3, 1);call #Ultimate.allocInit(2, 36);call write~init~int#4(10, 36, 0, 1);call write~init~int#4(0, 36, 1, 1);call #Ultimate.allocInit(9, 37);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~cleanupTimeShifts~0 := 12;~prevDir~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0; 335222#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret30#1, main_~retValue_acc~1#1, main_~tmp~11#1;havoc main_~retValue_acc~1#1;havoc main_~tmp~11#1;assume { :begin_inline_select_helpers } true; 335223#select_helpers_returnLabel#1 assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 344515#select_features_returnLabel#1 assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1; 341214#valid_product_returnLabel#1 main_#t~ret30#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;assume { :end_inline_valid_product } true;main_~tmp~11#1 := main_#t~ret30#1;havoc main_#t~ret30#1; 334252#L591 assume 0 != main_~tmp~11#1;assume { :begin_inline_setup } true; 334253#setup_returnLabel#1 assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;havoc aliceCall_~tmp~4#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1; 338095#L1317 assume !(0 == getOrigin_~person#1); 337534#L1321 assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1; 331835#getOrigin_returnLabel#1 aliceCall_#t~ret19#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~4#1 := aliceCall_#t~ret19#1;havoc aliceCall_#t~ret19#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~4#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 331836#L964 assume !(0 == initPersonOnFloor_~floor#1); 343525#L991 assume !(1 == initPersonOnFloor_~floor#1); 335551#L1018 assume !(2 == initPersonOnFloor_~floor#1); 330073#L1045 assume 3 == initPersonOnFloor_~floor#1; 330074#L1046 assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_3~0 := 1; 327205#L1072-1 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 327206#L756 assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1; 327523#L768-2 havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true; 341482#initPersonOnFloor_returnLabel#1 havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true; 341483#aliceCall_returnLabel#1 havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;havoc angelinaCall_~tmp~5#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1; 343995#L1317-1 assume !(0 == getOrigin_~person#1); 337918#L1321-1 assume !(1 == getOrigin_~person#1); 336378#L1325-1 assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1; 336379#getOrigin_returnLabel#2 angelinaCall_#t~ret20#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~5#1 := angelinaCall_#t~ret20#1;havoc angelinaCall_#t~ret20#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~5#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 344651#L964-1 assume 0 == initPersonOnFloor_~floor#1; 337345#L965-2 assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_0~0 := 1; 326177#L1072-3 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 336728#L756-2 assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1; 333372#L768-5 havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true; 333250#initPersonOnFloor_returnLabel#2 havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true; 333251#angelinaCall_returnLabel#1 havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret115#1, timeShift_~tmp~29#1;havoc timeShift_~tmp~29#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;havoc getCurrentHeading_~retValue_acc~17#1;getCurrentHeading_~retValue_acc~17#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~17#1; 338473#getCurrentHeading_returnLabel#1 __utac_acc__Specification13_spec__1_#t~ret10#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret10#1;havoc __utac_acc__Specification13_spec__1_#t~ret10#1; 338474#__utac_acc__Specification13_spec__1_returnLabel#1 havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;havoc areDoorsOpen_~retValue_acc~15#1;areDoorsOpen_~retValue_acc~15#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~15#1; 343218#areDoorsOpen_returnLabel#1 timeShift_#t~ret115#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~29#1 := timeShift_#t~ret115#1;havoc timeShift_#t~ret115#1; 328625#L3060 assume 0 != timeShift_~tmp~29#1; 328627#L3061 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 340602#L3060-1 assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret11#1, __utac_acc__Specification13_spec__2_#t~ret12#1, __utac_acc__Specification13_spec__2_#t~ret13#1, __utac_acc__Specification13_spec__2_#t~ret14#1, __utac_acc__Specification13_spec__2_#t~ret15#1, __utac_acc__Specification13_spec__2_#t~ret16#1, __utac_acc__Specification13_spec__2_~tmp~2#1, __utac_acc__Specification13_spec__2_~tmp___0~2#1, __utac_acc__Specification13_spec__2_~tmp___1~2#1, __utac_acc__Specification13_spec__2_~tmp___2~0#1, __utac_acc__Specification13_spec__2_~tmp___3~0#1, __utac_acc__Specification13_spec__2_~tmp___4~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;havoc __utac_acc__Specification13_spec__2_~tmp~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~0#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3); 340603#L188 assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1; 339056#L189 assume 1 == ~prevDir~0;assume { :begin_inline_existInLiftCallsInDirection } true;existInLiftCallsInDirection_#in~d#1 := 0;havoc existInLiftCallsInDirection_#res#1;havoc existInLiftCallsInDirection_~d#1, existInLiftCallsInDirection_~retValue_acc~29#1, existInLiftCallsInDirection_~i~3#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~29#1;havoc existInLiftCallsInDirection_~i~3#1;havoc existInLiftCallsInDirection_~i___0~0#1; 332438#L3280 assume !(1 == existInLiftCallsInDirection_~d#1); 332440#L3346 assume 0 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i___0~0#1 := 0;existInLiftCallsInDirection_~i___0~0#1 := ~currentFloorID~0 - 1; 336408#L3350-2 [2024-10-15 00:44:31,806 INFO L747 eck$LassoCheckResult]: Loop: 336408#L3350-2 assume !false; 344552#L3351 assume existInLiftCallsInDirection_~i___0~0#1 >= 0; 342750#L3352 existInLiftCallsInDirection_~i___0~0#1 := 1 + ~currentFloorID~0; 342751#L3359-2 assume !false; 329716#L3360 assume !(existInLiftCallsInDirection_~i___0~0#1 < 5); 329717#L3418 existInLiftCallsInDirection_~i___0~0#1 := existInLiftCallsInDirection_~i___0~0#1 - 1; 336408#L3350-2 [2024-10-15 00:44:31,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:44:31,807 INFO L85 PathProgramCache]: Analyzing trace with hash 790460044, now seen corresponding path program 1 times [2024-10-15 00:44:31,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:44:31,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332044689] [2024-10-15 00:44:31,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:44:31,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:44:31,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:44:31,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:44:31,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:44:31,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332044689] [2024-10-15 00:44:31,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332044689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:44:31,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:44:31,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 00:44:31,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208301015] [2024-10-15 00:44:31,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:44:31,934 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:44:31,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:44:31,934 INFO L85 PathProgramCache]: Analyzing trace with hash -2025047829, now seen corresponding path program 1 times [2024-10-15 00:44:31,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:44:31,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092843380] [2024-10-15 00:44:31,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:44:31,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:44:31,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:44:31,949 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:44:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:44:31,965 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:44:31,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:44:31,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 00:44:31,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 00:44:31,989 INFO L87 Difference]: Start difference. First operand 18526 states and 34560 transitions. cyclomatic complexity: 16071 Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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) [2024-10-15 00:44:32,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:44:32,898 INFO L93 Difference]: Finished difference Result 18534 states and 34567 transitions. [2024-10-15 00:44:32,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18534 states and 34567 transitions. [2024-10-15 00:44:32,953 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4182 [2024-10-15 00:44:33,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18534 states to 18534 states and 34567 transitions. [2024-10-15 00:44:33,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18455 [2024-10-15 00:44:33,026 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18455 [2024-10-15 00:44:33,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18534 states and 34567 transitions. [2024-10-15 00:44:33,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:44:33,031 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18534 states and 34567 transitions. [2024-10-15 00:44:33,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18534 states and 34567 transitions. [2024-10-15 00:44:33,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18534 to 18526. [2024-10-15 00:44:33,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18526 states, 18526 states have (on average 1.8651624743603583) internal successors, (34554), 18525 states have internal predecessors, (34554), 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) [2024-10-15 00:44:33,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18526 states to 18526 states and 34554 transitions. [2024-10-15 00:44:33,317 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18526 states and 34554 transitions. [2024-10-15 00:44:33,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 00:44:33,318 INFO L425 stractBuchiCegarLoop]: Abstraction has 18526 states and 34554 transitions. [2024-10-15 00:44:33,319 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-15 00:44:33,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18526 states and 34554 transitions. [2024-10-15 00:44:33,383 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4182 [2024-10-15 00:44:33,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:44:33,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:44:33,384 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:44:33,384 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-15 00:44:33,384 INFO L745 eck$LassoCheckResult]: Stem: 372724#$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(32, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(10, 16);call #Ultimate.allocInit(4, 17);call write~init~int#5(91, 17, 0, 1);call write~init~int#5(95, 17, 1, 1);call write~init~int#5(93, 17, 2, 1);call write~init~int#5(0, 17, 3, 1);call #Ultimate.allocInit(4, 18);call write~init~int#6(91, 18, 0, 1);call write~init~int#6(93, 18, 1, 1);call write~init~int#6(32, 18, 2, 1);call write~init~int#6(0, 18, 3, 1);call #Ultimate.allocInit(5, 19);call write~init~int#7(32, 19, 0, 1);call write~init~int#7(97, 19, 1, 1);call write~init~int#7(116, 19, 2, 1);call write~init~int#7(32, 19, 3, 1);call write~init~int#7(0, 19, 4, 1);call #Ultimate.allocInit(3, 20);call write~init~int#8(37, 20, 0, 1);call write~init~int#8(105, 20, 1, 1);call write~init~int#8(0, 20, 2, 1);call #Ultimate.allocInit(10, 21);call #Ultimate.allocInit(3, 22);call write~init~int#9(117, 22, 0, 1);call write~init~int#9(112, 22, 1, 1);call write~init~int#9(0, 22, 2, 1);call #Ultimate.allocInit(5, 23);call write~init~int#10(100, 23, 0, 1);call write~init~int#10(111, 23, 1, 1);call write~init~int#10(119, 23, 2, 1);call write~init~int#10(110, 23, 3, 1);call write~init~int#10(0, 23, 4, 1);call #Ultimate.allocInit(7, 24);call write~init~int#11(32, 24, 0, 1);call write~init~int#11(73, 24, 1, 1);call write~init~int#11(76, 24, 2, 1);call write~init~int#11(95, 24, 3, 1);call write~init~int#11(112, 24, 4, 1);call write~init~int#11(58, 24, 5, 1);call write~init~int#11(0, 24, 6, 1);call #Ultimate.allocInit(4, 25);call write~init~int#12(32, 25, 0, 1);call write~init~int#12(37, 25, 1, 1);call write~init~int#12(105, 25, 2, 1);call write~init~int#12(0, 25, 3, 1);call #Ultimate.allocInit(4, 26);call write~init~int#13(32, 26, 0, 1);call write~init~int#13(37, 26, 1, 1);call write~init~int#13(105, 26, 2, 1);call write~init~int#13(0, 26, 3, 1);call #Ultimate.allocInit(4, 27);call write~init~int#14(32, 27, 0, 1);call write~init~int#14(37, 27, 1, 1);call write~init~int#14(105, 27, 2, 1);call write~init~int#14(0, 27, 3, 1);call #Ultimate.allocInit(4, 28);call write~init~int#15(32, 28, 0, 1);call write~init~int#15(37, 28, 1, 1);call write~init~int#15(105, 28, 2, 1);call write~init~int#15(0, 28, 3, 1);call #Ultimate.allocInit(4, 29);call write~init~int#16(32, 29, 0, 1);call write~init~int#16(37, 29, 1, 1);call write~init~int#16(105, 29, 2, 1);call write~init~int#16(0, 29, 3, 1);call #Ultimate.allocInit(6, 30);call write~init~int#17(32, 30, 0, 1);call write~init~int#17(70, 30, 1, 1);call write~init~int#17(95, 30, 2, 1);call write~init~int#17(112, 30, 3, 1);call write~init~int#17(58, 30, 4, 1);call write~init~int#17(0, 30, 5, 1);call #Ultimate.allocInit(4, 31);call write~init~int#18(32, 31, 0, 1);call write~init~int#18(37, 31, 1, 1);call write~init~int#18(105, 31, 2, 1);call write~init~int#18(0, 31, 3, 1);call #Ultimate.allocInit(4, 32);call write~init~int#19(32, 32, 0, 1);call write~init~int#19(37, 32, 1, 1);call write~init~int#19(105, 32, 2, 1);call write~init~int#19(0, 32, 3, 1);call #Ultimate.allocInit(4, 33);call write~init~int#1(32, 33, 0, 1);call write~init~int#1(37, 33, 1, 1);call write~init~int#1(105, 33, 2, 1);call write~init~int#1(0, 33, 3, 1);call #Ultimate.allocInit(4, 34);call write~init~int#2(32, 34, 0, 1);call write~init~int#2(37, 34, 1, 1);call write~init~int#2(105, 34, 2, 1);call write~init~int#2(0, 34, 3, 1);call #Ultimate.allocInit(4, 35);call write~init~int#3(32, 35, 0, 1);call write~init~int#3(37, 35, 1, 1);call write~init~int#3(105, 35, 2, 1);call write~init~int#3(0, 35, 3, 1);call #Ultimate.allocInit(2, 36);call write~init~int#4(10, 36, 0, 1);call write~init~int#4(0, 36, 1, 1);call #Ultimate.allocInit(9, 37);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~cleanupTimeShifts~0 := 12;~prevDir~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0; 372290#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret30#1, main_~retValue_acc~1#1, main_~tmp~11#1;havoc main_~retValue_acc~1#1;havoc main_~tmp~11#1;assume { :begin_inline_select_helpers } true; 372291#select_helpers_returnLabel#1 assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 381580#select_features_returnLabel#1 assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1; 378281#valid_product_returnLabel#1 main_#t~ret30#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;assume { :end_inline_valid_product } true;main_~tmp~11#1 := main_#t~ret30#1;havoc main_#t~ret30#1; 371319#L591 assume 0 != main_~tmp~11#1;assume { :begin_inline_setup } true; 371320#setup_returnLabel#1 assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;havoc aliceCall_~tmp~4#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1; 375164#L1317 assume !(0 == getOrigin_~person#1); 374601#L1321 assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1; 368903#getOrigin_returnLabel#1 aliceCall_#t~ret19#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~4#1 := aliceCall_#t~ret19#1;havoc aliceCall_#t~ret19#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~4#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 368904#L964 assume !(0 == initPersonOnFloor_~floor#1); 380592#L991 assume !(1 == initPersonOnFloor_~floor#1); 372619#L1018 assume !(2 == initPersonOnFloor_~floor#1); 367141#L1045 assume 3 == initPersonOnFloor_~floor#1; 367142#L1046 assume !(0 == initPersonOnFloor_~person#1); 380860#L1049 assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_3~0 := 1; 364273#L1072-1 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 364274#L756 assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1; 364591#L768-2 havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true; 378550#initPersonOnFloor_returnLabel#1 havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true; 378551#aliceCall_returnLabel#1 havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;havoc angelinaCall_~tmp~5#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1; 381060#L1317-1 assume !(0 == getOrigin_~person#1); 374985#L1321-1 assume !(1 == getOrigin_~person#1); 373446#L1325-1 assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1; 373447#getOrigin_returnLabel#2 angelinaCall_#t~ret20#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~5#1 := angelinaCall_#t~ret20#1;havoc angelinaCall_#t~ret20#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~5#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 381716#L964-1 assume 0 == initPersonOnFloor_~floor#1; 374412#L965-2 assume !(0 == initPersonOnFloor_~person#1); 374413#L968-2 assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_0~0 := 1; 363245#L1072-3 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 373796#L756-2 assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1; 370439#L768-5 havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true; 370318#initPersonOnFloor_returnLabel#2 havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true; 370319#angelinaCall_returnLabel#1 havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret115#1, timeShift_~tmp~29#1;havoc timeShift_~tmp~29#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;havoc getCurrentHeading_~retValue_acc~17#1;getCurrentHeading_~retValue_acc~17#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~17#1; 375540#getCurrentHeading_returnLabel#1 __utac_acc__Specification13_spec__1_#t~ret10#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret10#1;havoc __utac_acc__Specification13_spec__1_#t~ret10#1; 375541#__utac_acc__Specification13_spec__1_returnLabel#1 havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;havoc areDoorsOpen_~retValue_acc~15#1;areDoorsOpen_~retValue_acc~15#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~15#1; 380285#areDoorsOpen_returnLabel#1 timeShift_#t~ret115#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~29#1 := timeShift_#t~ret115#1;havoc timeShift_#t~ret115#1; 365693#L3060 assume 0 != timeShift_~tmp~29#1; 365695#L3061 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 377669#L3060-1 assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret11#1, __utac_acc__Specification13_spec__2_#t~ret12#1, __utac_acc__Specification13_spec__2_#t~ret13#1, __utac_acc__Specification13_spec__2_#t~ret14#1, __utac_acc__Specification13_spec__2_#t~ret15#1, __utac_acc__Specification13_spec__2_#t~ret16#1, __utac_acc__Specification13_spec__2_~tmp~2#1, __utac_acc__Specification13_spec__2_~tmp___0~2#1, __utac_acc__Specification13_spec__2_~tmp___1~2#1, __utac_acc__Specification13_spec__2_~tmp___2~0#1, __utac_acc__Specification13_spec__2_~tmp___3~0#1, __utac_acc__Specification13_spec__2_~tmp___4~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;havoc __utac_acc__Specification13_spec__2_~tmp~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~0#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3); 377670#L188 assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1; 376125#L189 assume 1 == ~prevDir~0;assume { :begin_inline_existInLiftCallsInDirection } true;existInLiftCallsInDirection_#in~d#1 := 0;havoc existInLiftCallsInDirection_#res#1;havoc existInLiftCallsInDirection_~d#1, existInLiftCallsInDirection_~retValue_acc~29#1, existInLiftCallsInDirection_~i~3#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~29#1;havoc existInLiftCallsInDirection_~i~3#1;havoc existInLiftCallsInDirection_~i___0~0#1; 369506#L3280 assume !(1 == existInLiftCallsInDirection_~d#1); 369508#L3346 assume 0 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i___0~0#1 := 0;existInLiftCallsInDirection_~i___0~0#1 := ~currentFloorID~0 - 1; 373476#L3350-2 [2024-10-15 00:44:33,386 INFO L747 eck$LassoCheckResult]: Loop: 373476#L3350-2 assume !false; 381617#L3351 assume existInLiftCallsInDirection_~i___0~0#1 >= 0; 379818#L3352 existInLiftCallsInDirection_~i___0~0#1 := 1 + ~currentFloorID~0; 379819#L3359-2 assume !false; 366784#L3360 assume !(existInLiftCallsInDirection_~i___0~0#1 < 5); 366785#L3418 existInLiftCallsInDirection_~i___0~0#1 := existInLiftCallsInDirection_~i___0~0#1 - 1; 373476#L3350-2 [2024-10-15 00:44:33,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:44:33,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1011904592, now seen corresponding path program 1 times [2024-10-15 00:44:33,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:44:33,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573338260] [2024-10-15 00:44:33,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:44:33,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:44:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:44:33,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:44:33,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:44:33,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573338260] [2024-10-15 00:44:33,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573338260] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:44:33,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:44:33,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-15 00:44:33,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359964257] [2024-10-15 00:44:33,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:44:33,479 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:44:33,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:44:33,479 INFO L85 PathProgramCache]: Analyzing trace with hash -2025047829, now seen corresponding path program 2 times [2024-10-15 00:44:33,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:44:33,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856491591] [2024-10-15 00:44:33,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:44:33,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:44:33,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:44:33,497 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:44:33,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:44:33,519 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:44:33,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:44:33,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-15 00:44:33,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-15 00:44:33,544 INFO L87 Difference]: Start difference. First operand 18526 states and 34554 transitions. cyclomatic complexity: 16065 Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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) [2024-10-15 00:44:34,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:44:34,051 INFO L93 Difference]: Finished difference Result 18530 states and 34557 transitions. [2024-10-15 00:44:34,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18530 states and 34557 transitions. [2024-10-15 00:44:34,120 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4182 [2024-10-15 00:44:34,173 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18530 states to 18530 states and 34557 transitions. [2024-10-15 00:44:34,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18451 [2024-10-15 00:44:34,188 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18451 [2024-10-15 00:44:34,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18530 states and 34557 transitions. [2024-10-15 00:44:34,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:44:34,203 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18530 states and 34557 transitions. [2024-10-15 00:44:34,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18530 states and 34557 transitions. [2024-10-15 00:44:34,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18530 to 18530. [2024-10-15 00:44:34,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18530 states, 18530 states have (on average 1.8649217485159202) internal successors, (34557), 18529 states have internal predecessors, (34557), 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) [2024-10-15 00:44:34,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18530 states to 18530 states and 34557 transitions. [2024-10-15 00:44:34,494 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18530 states and 34557 transitions. [2024-10-15 00:44:34,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-15 00:44:34,495 INFO L425 stractBuchiCegarLoop]: Abstraction has 18530 states and 34557 transitions. [2024-10-15 00:44:34,496 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-15 00:44:34,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18530 states and 34557 transitions. [2024-10-15 00:44:34,703 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4182 [2024-10-15 00:44:34,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:44:34,704 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:44:34,704 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:44:34,704 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-15 00:44:34,705 INFO L745 eck$LassoCheckResult]: Stem: 409788#$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(32, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(10, 16);call #Ultimate.allocInit(4, 17);call write~init~int#5(91, 17, 0, 1);call write~init~int#5(95, 17, 1, 1);call write~init~int#5(93, 17, 2, 1);call write~init~int#5(0, 17, 3, 1);call #Ultimate.allocInit(4, 18);call write~init~int#6(91, 18, 0, 1);call write~init~int#6(93, 18, 1, 1);call write~init~int#6(32, 18, 2, 1);call write~init~int#6(0, 18, 3, 1);call #Ultimate.allocInit(5, 19);call write~init~int#7(32, 19, 0, 1);call write~init~int#7(97, 19, 1, 1);call write~init~int#7(116, 19, 2, 1);call write~init~int#7(32, 19, 3, 1);call write~init~int#7(0, 19, 4, 1);call #Ultimate.allocInit(3, 20);call write~init~int#8(37, 20, 0, 1);call write~init~int#8(105, 20, 1, 1);call write~init~int#8(0, 20, 2, 1);call #Ultimate.allocInit(10, 21);call #Ultimate.allocInit(3, 22);call write~init~int#9(117, 22, 0, 1);call write~init~int#9(112, 22, 1, 1);call write~init~int#9(0, 22, 2, 1);call #Ultimate.allocInit(5, 23);call write~init~int#10(100, 23, 0, 1);call write~init~int#10(111, 23, 1, 1);call write~init~int#10(119, 23, 2, 1);call write~init~int#10(110, 23, 3, 1);call write~init~int#10(0, 23, 4, 1);call #Ultimate.allocInit(7, 24);call write~init~int#11(32, 24, 0, 1);call write~init~int#11(73, 24, 1, 1);call write~init~int#11(76, 24, 2, 1);call write~init~int#11(95, 24, 3, 1);call write~init~int#11(112, 24, 4, 1);call write~init~int#11(58, 24, 5, 1);call write~init~int#11(0, 24, 6, 1);call #Ultimate.allocInit(4, 25);call write~init~int#12(32, 25, 0, 1);call write~init~int#12(37, 25, 1, 1);call write~init~int#12(105, 25, 2, 1);call write~init~int#12(0, 25, 3, 1);call #Ultimate.allocInit(4, 26);call write~init~int#13(32, 26, 0, 1);call write~init~int#13(37, 26, 1, 1);call write~init~int#13(105, 26, 2, 1);call write~init~int#13(0, 26, 3, 1);call #Ultimate.allocInit(4, 27);call write~init~int#14(32, 27, 0, 1);call write~init~int#14(37, 27, 1, 1);call write~init~int#14(105, 27, 2, 1);call write~init~int#14(0, 27, 3, 1);call #Ultimate.allocInit(4, 28);call write~init~int#15(32, 28, 0, 1);call write~init~int#15(37, 28, 1, 1);call write~init~int#15(105, 28, 2, 1);call write~init~int#15(0, 28, 3, 1);call #Ultimate.allocInit(4, 29);call write~init~int#16(32, 29, 0, 1);call write~init~int#16(37, 29, 1, 1);call write~init~int#16(105, 29, 2, 1);call write~init~int#16(0, 29, 3, 1);call #Ultimate.allocInit(6, 30);call write~init~int#17(32, 30, 0, 1);call write~init~int#17(70, 30, 1, 1);call write~init~int#17(95, 30, 2, 1);call write~init~int#17(112, 30, 3, 1);call write~init~int#17(58, 30, 4, 1);call write~init~int#17(0, 30, 5, 1);call #Ultimate.allocInit(4, 31);call write~init~int#18(32, 31, 0, 1);call write~init~int#18(37, 31, 1, 1);call write~init~int#18(105, 31, 2, 1);call write~init~int#18(0, 31, 3, 1);call #Ultimate.allocInit(4, 32);call write~init~int#19(32, 32, 0, 1);call write~init~int#19(37, 32, 1, 1);call write~init~int#19(105, 32, 2, 1);call write~init~int#19(0, 32, 3, 1);call #Ultimate.allocInit(4, 33);call write~init~int#1(32, 33, 0, 1);call write~init~int#1(37, 33, 1, 1);call write~init~int#1(105, 33, 2, 1);call write~init~int#1(0, 33, 3, 1);call #Ultimate.allocInit(4, 34);call write~init~int#2(32, 34, 0, 1);call write~init~int#2(37, 34, 1, 1);call write~init~int#2(105, 34, 2, 1);call write~init~int#2(0, 34, 3, 1);call #Ultimate.allocInit(4, 35);call write~init~int#3(32, 35, 0, 1);call write~init~int#3(37, 35, 1, 1);call write~init~int#3(105, 35, 2, 1);call write~init~int#3(0, 35, 3, 1);call #Ultimate.allocInit(2, 36);call write~init~int#4(10, 36, 0, 1);call write~init~int#4(0, 36, 1, 1);call #Ultimate.allocInit(9, 37);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~cleanupTimeShifts~0 := 12;~prevDir~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0; 409354#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret30#1, main_~retValue_acc~1#1, main_~tmp~11#1;havoc main_~retValue_acc~1#1;havoc main_~tmp~11#1;assume { :begin_inline_select_helpers } true; 409355#select_helpers_returnLabel#1 assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 418648#select_features_returnLabel#1 assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1; 415343#valid_product_returnLabel#1 main_#t~ret30#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;assume { :end_inline_valid_product } true;main_~tmp~11#1 := main_#t~ret30#1;havoc main_#t~ret30#1; 408384#L591 assume 0 != main_~tmp~11#1;assume { :begin_inline_setup } true; 408385#setup_returnLabel#1 assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;havoc aliceCall_~tmp~4#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1; 412226#L1317 assume !(0 == getOrigin_~person#1); 411663#L1321 assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1; 405965#getOrigin_returnLabel#1 aliceCall_#t~ret19#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~4#1 := aliceCall_#t~ret19#1;havoc aliceCall_#t~ret19#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~4#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 405966#L964 assume !(0 == initPersonOnFloor_~floor#1); 417657#L991 assume !(1 == initPersonOnFloor_~floor#1); 409683#L1018 assume !(2 == initPersonOnFloor_~floor#1); 404204#L1045 assume 3 == initPersonOnFloor_~floor#1; 404205#L1046 assume !(0 == initPersonOnFloor_~person#1); 417926#L1049 assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_3~0 := 1; 401336#L1072-1 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 401337#L756 assume !(0 == callOnFloor_~floorID#1); 401653#L759 assume 1 == callOnFloor_~floorID#1;~calls_1~0 := 1; 401654#L768-2 havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true; 415613#initPersonOnFloor_returnLabel#1 havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true; 415614#aliceCall_returnLabel#1 havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;havoc angelinaCall_~tmp~5#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1; 418127#L1317-1 assume !(0 == getOrigin_~person#1); 412047#L1321-1 assume !(1 == getOrigin_~person#1); 410510#L1325-1 assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1; 410511#getOrigin_returnLabel#2 angelinaCall_#t~ret20#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~5#1 := angelinaCall_#t~ret20#1;havoc angelinaCall_#t~ret20#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~5#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 418784#L964-1 assume 0 == initPersonOnFloor_~floor#1; 411474#L965-2 assume !(0 == initPersonOnFloor_~person#1); 411475#L968-2 assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_0~0 := 1; 417011#L1072-3 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 418786#L756-2 assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1; 407503#L768-5 havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true; 407381#initPersonOnFloor_returnLabel#2 havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true; 407382#angelinaCall_returnLabel#1 havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret115#1, timeShift_~tmp~29#1;havoc timeShift_~tmp~29#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;havoc getCurrentHeading_~retValue_acc~17#1;getCurrentHeading_~retValue_acc~17#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~17#1; 412604#getCurrentHeading_returnLabel#1 __utac_acc__Specification13_spec__1_#t~ret10#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret10#1;havoc __utac_acc__Specification13_spec__1_#t~ret10#1; 412605#__utac_acc__Specification13_spec__1_returnLabel#1 havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;havoc areDoorsOpen_~retValue_acc~15#1;areDoorsOpen_~retValue_acc~15#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~15#1; 417350#areDoorsOpen_returnLabel#1 timeShift_#t~ret115#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~29#1 := timeShift_#t~ret115#1;havoc timeShift_#t~ret115#1; 402756#L3060 assume 0 != timeShift_~tmp~29#1; 402758#L3061 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 414731#L3060-1 assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret11#1, __utac_acc__Specification13_spec__2_#t~ret12#1, __utac_acc__Specification13_spec__2_#t~ret13#1, __utac_acc__Specification13_spec__2_#t~ret14#1, __utac_acc__Specification13_spec__2_#t~ret15#1, __utac_acc__Specification13_spec__2_#t~ret16#1, __utac_acc__Specification13_spec__2_~tmp~2#1, __utac_acc__Specification13_spec__2_~tmp___0~2#1, __utac_acc__Specification13_spec__2_~tmp___1~2#1, __utac_acc__Specification13_spec__2_~tmp___2~0#1, __utac_acc__Specification13_spec__2_~tmp___3~0#1, __utac_acc__Specification13_spec__2_~tmp___4~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;havoc __utac_acc__Specification13_spec__2_~tmp~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~0#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3); 414732#L188 assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1; 413187#L189 assume 1 == ~prevDir~0;assume { :begin_inline_existInLiftCallsInDirection } true;existInLiftCallsInDirection_#in~d#1 := 0;havoc existInLiftCallsInDirection_#res#1;havoc existInLiftCallsInDirection_~d#1, existInLiftCallsInDirection_~retValue_acc~29#1, existInLiftCallsInDirection_~i~3#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~29#1;havoc existInLiftCallsInDirection_~i~3#1;havoc existInLiftCallsInDirection_~i___0~0#1; 406568#L3280 assume !(1 == existInLiftCallsInDirection_~d#1); 406570#L3346 assume 0 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i___0~0#1 := 0;existInLiftCallsInDirection_~i___0~0#1 := ~currentFloorID~0 - 1; 410540#L3350-2 [2024-10-15 00:44:34,705 INFO L747 eck$LassoCheckResult]: Loop: 410540#L3350-2 assume !false; 418685#L3351 assume existInLiftCallsInDirection_~i___0~0#1 >= 0; 416882#L3352 existInLiftCallsInDirection_~i___0~0#1 := 1 + ~currentFloorID~0; 416883#L3359-2 assume !false; 403847#L3360 assume !(existInLiftCallsInDirection_~i___0~0#1 < 5); 403848#L3418 existInLiftCallsInDirection_~i___0~0#1 := existInLiftCallsInDirection_~i___0~0#1 - 1; 410540#L3350-2 [2024-10-15 00:44:34,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:44:34,706 INFO L85 PathProgramCache]: Analyzing trace with hash -793620309, now seen corresponding path program 1 times [2024-10-15 00:44:34,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:44:34,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030462933] [2024-10-15 00:44:34,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:44:34,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:44:34,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:44:34,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:44:34,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:44:34,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030462933] [2024-10-15 00:44:34,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030462933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:44:34,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:44:34,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-15 00:44:34,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922966111] [2024-10-15 00:44:34,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:44:34,875 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:44:34,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:44:34,875 INFO L85 PathProgramCache]: Analyzing trace with hash -2025047829, now seen corresponding path program 3 times [2024-10-15 00:44:34,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:44:34,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126598194] [2024-10-15 00:44:34,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:44:34,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:44:34,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:44:34,899 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:44:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:44:34,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:44:34,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:44:34,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-15 00:44:34,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-15 00:44:34,932 INFO L87 Difference]: Start difference. First operand 18530 states and 34557 transitions. cyclomatic complexity: 16064 Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:44:35,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:44:35,348 INFO L93 Difference]: Finished difference Result 18536 states and 34562 transitions. [2024-10-15 00:44:35,348 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18536 states and 34562 transitions. [2024-10-15 00:44:35,440 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4182 [2024-10-15 00:44:35,500 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18536 states to 18536 states and 34562 transitions. [2024-10-15 00:44:35,500 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18457 [2024-10-15 00:44:35,518 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18457 [2024-10-15 00:44:35,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18536 states and 34562 transitions. [2024-10-15 00:44:35,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:44:35,539 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18536 states and 34562 transitions. [2024-10-15 00:44:35,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18536 states and 34562 transitions. [2024-10-15 00:44:35,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18536 to 18536. [2024-10-15 00:44:35,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18536 states, 18536 states have (on average 1.8645878290893396) internal successors, (34562), 18535 states have internal predecessors, (34562), 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) [2024-10-15 00:44:35,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18536 states to 18536 states and 34562 transitions. [2024-10-15 00:44:35,897 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18536 states and 34562 transitions. [2024-10-15 00:44:35,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-15 00:44:35,898 INFO L425 stractBuchiCegarLoop]: Abstraction has 18536 states and 34562 transitions. [2024-10-15 00:44:35,899 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-15 00:44:35,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18536 states and 34562 transitions. [2024-10-15 00:44:36,049 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4182 [2024-10-15 00:44:36,049 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:44:36,049 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:44:36,050 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:44:36,050 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-15 00:44:36,050 INFO L745 eck$LassoCheckResult]: Stem: 446863#$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(32, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(10, 16);call #Ultimate.allocInit(4, 17);call write~init~int#5(91, 17, 0, 1);call write~init~int#5(95, 17, 1, 1);call write~init~int#5(93, 17, 2, 1);call write~init~int#5(0, 17, 3, 1);call #Ultimate.allocInit(4, 18);call write~init~int#6(91, 18, 0, 1);call write~init~int#6(93, 18, 1, 1);call write~init~int#6(32, 18, 2, 1);call write~init~int#6(0, 18, 3, 1);call #Ultimate.allocInit(5, 19);call write~init~int#7(32, 19, 0, 1);call write~init~int#7(97, 19, 1, 1);call write~init~int#7(116, 19, 2, 1);call write~init~int#7(32, 19, 3, 1);call write~init~int#7(0, 19, 4, 1);call #Ultimate.allocInit(3, 20);call write~init~int#8(37, 20, 0, 1);call write~init~int#8(105, 20, 1, 1);call write~init~int#8(0, 20, 2, 1);call #Ultimate.allocInit(10, 21);call #Ultimate.allocInit(3, 22);call write~init~int#9(117, 22, 0, 1);call write~init~int#9(112, 22, 1, 1);call write~init~int#9(0, 22, 2, 1);call #Ultimate.allocInit(5, 23);call write~init~int#10(100, 23, 0, 1);call write~init~int#10(111, 23, 1, 1);call write~init~int#10(119, 23, 2, 1);call write~init~int#10(110, 23, 3, 1);call write~init~int#10(0, 23, 4, 1);call #Ultimate.allocInit(7, 24);call write~init~int#11(32, 24, 0, 1);call write~init~int#11(73, 24, 1, 1);call write~init~int#11(76, 24, 2, 1);call write~init~int#11(95, 24, 3, 1);call write~init~int#11(112, 24, 4, 1);call write~init~int#11(58, 24, 5, 1);call write~init~int#11(0, 24, 6, 1);call #Ultimate.allocInit(4, 25);call write~init~int#12(32, 25, 0, 1);call write~init~int#12(37, 25, 1, 1);call write~init~int#12(105, 25, 2, 1);call write~init~int#12(0, 25, 3, 1);call #Ultimate.allocInit(4, 26);call write~init~int#13(32, 26, 0, 1);call write~init~int#13(37, 26, 1, 1);call write~init~int#13(105, 26, 2, 1);call write~init~int#13(0, 26, 3, 1);call #Ultimate.allocInit(4, 27);call write~init~int#14(32, 27, 0, 1);call write~init~int#14(37, 27, 1, 1);call write~init~int#14(105, 27, 2, 1);call write~init~int#14(0, 27, 3, 1);call #Ultimate.allocInit(4, 28);call write~init~int#15(32, 28, 0, 1);call write~init~int#15(37, 28, 1, 1);call write~init~int#15(105, 28, 2, 1);call write~init~int#15(0, 28, 3, 1);call #Ultimate.allocInit(4, 29);call write~init~int#16(32, 29, 0, 1);call write~init~int#16(37, 29, 1, 1);call write~init~int#16(105, 29, 2, 1);call write~init~int#16(0, 29, 3, 1);call #Ultimate.allocInit(6, 30);call write~init~int#17(32, 30, 0, 1);call write~init~int#17(70, 30, 1, 1);call write~init~int#17(95, 30, 2, 1);call write~init~int#17(112, 30, 3, 1);call write~init~int#17(58, 30, 4, 1);call write~init~int#17(0, 30, 5, 1);call #Ultimate.allocInit(4, 31);call write~init~int#18(32, 31, 0, 1);call write~init~int#18(37, 31, 1, 1);call write~init~int#18(105, 31, 2, 1);call write~init~int#18(0, 31, 3, 1);call #Ultimate.allocInit(4, 32);call write~init~int#19(32, 32, 0, 1);call write~init~int#19(37, 32, 1, 1);call write~init~int#19(105, 32, 2, 1);call write~init~int#19(0, 32, 3, 1);call #Ultimate.allocInit(4, 33);call write~init~int#1(32, 33, 0, 1);call write~init~int#1(37, 33, 1, 1);call write~init~int#1(105, 33, 2, 1);call write~init~int#1(0, 33, 3, 1);call #Ultimate.allocInit(4, 34);call write~init~int#2(32, 34, 0, 1);call write~init~int#2(37, 34, 1, 1);call write~init~int#2(105, 34, 2, 1);call write~init~int#2(0, 34, 3, 1);call #Ultimate.allocInit(4, 35);call write~init~int#3(32, 35, 0, 1);call write~init~int#3(37, 35, 1, 1);call write~init~int#3(105, 35, 2, 1);call write~init~int#3(0, 35, 3, 1);call #Ultimate.allocInit(2, 36);call write~init~int#4(10, 36, 0, 1);call write~init~int#4(0, 36, 1, 1);call #Ultimate.allocInit(9, 37);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~cleanupTimeShifts~0 := 12;~prevDir~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0; 446429#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret30#1, main_~retValue_acc~1#1, main_~tmp~11#1;havoc main_~retValue_acc~1#1;havoc main_~tmp~11#1;assume { :begin_inline_select_helpers } true; 446430#select_helpers_returnLabel#1 assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 455722#select_features_returnLabel#1 assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1; 452420#valid_product_returnLabel#1 main_#t~ret30#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;assume { :end_inline_valid_product } true;main_~tmp~11#1 := main_#t~ret30#1;havoc main_#t~ret30#1; 445459#L591 assume 0 != main_~tmp~11#1;assume { :begin_inline_setup } true; 445460#setup_returnLabel#1 assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;havoc aliceCall_~tmp~4#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1; 449303#L1317 assume !(0 == getOrigin_~person#1); 448740#L1321 assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1; 443040#getOrigin_returnLabel#1 aliceCall_#t~ret19#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~4#1 := aliceCall_#t~ret19#1;havoc aliceCall_#t~ret19#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~4#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 443041#L964 assume !(0 == initPersonOnFloor_~floor#1); 454730#L991 assume !(1 == initPersonOnFloor_~floor#1); 446758#L1018 assume !(2 == initPersonOnFloor_~floor#1); 441278#L1045 assume 3 == initPersonOnFloor_~floor#1; 441279#L1046 assume !(0 == initPersonOnFloor_~person#1); 454999#L1049 assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_3~0 := 1; 438409#L1072-1 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 438410#L756 assume !(0 == callOnFloor_~floorID#1); 438726#L759 assume !(1 == callOnFloor_~floorID#1); 438727#L762 assume 2 == callOnFloor_~floorID#1;~calls_2~0 := 1; 438886#L768-2 havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true; 452688#initPersonOnFloor_returnLabel#1 havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true; 452689#aliceCall_returnLabel#1 havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;havoc angelinaCall_~tmp~5#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1; 455201#L1317-1 assume !(0 == getOrigin_~person#1); 449124#L1321-1 assume !(1 == getOrigin_~person#1); 447585#L1325-1 assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1; 447586#getOrigin_returnLabel#2 angelinaCall_#t~ret20#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~5#1 := angelinaCall_#t~ret20#1;havoc angelinaCall_#t~ret20#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~5#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 455858#L964-1 assume 0 == initPersonOnFloor_~floor#1; 448551#L965-2 assume !(0 == initPersonOnFloor_~person#1); 448552#L968-2 assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_0~0 := 1; 454084#L1072-3 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 455863#L756-2 assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1; 444578#L768-5 havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true; 444456#initPersonOnFloor_returnLabel#2 havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true; 444457#angelinaCall_returnLabel#1 havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret115#1, timeShift_~tmp~29#1;havoc timeShift_~tmp~29#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;havoc getCurrentHeading_~retValue_acc~17#1;getCurrentHeading_~retValue_acc~17#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~17#1; 449681#getCurrentHeading_returnLabel#1 __utac_acc__Specification13_spec__1_#t~ret10#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret10#1;havoc __utac_acc__Specification13_spec__1_#t~ret10#1; 449682#__utac_acc__Specification13_spec__1_returnLabel#1 havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;havoc areDoorsOpen_~retValue_acc~15#1;areDoorsOpen_~retValue_acc~15#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~15#1; 454423#areDoorsOpen_returnLabel#1 timeShift_#t~ret115#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~29#1 := timeShift_#t~ret115#1;havoc timeShift_#t~ret115#1; 439829#L3060 assume 0 != timeShift_~tmp~29#1; 439831#L3061 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 451808#L3060-1 assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret11#1, __utac_acc__Specification13_spec__2_#t~ret12#1, __utac_acc__Specification13_spec__2_#t~ret13#1, __utac_acc__Specification13_spec__2_#t~ret14#1, __utac_acc__Specification13_spec__2_#t~ret15#1, __utac_acc__Specification13_spec__2_#t~ret16#1, __utac_acc__Specification13_spec__2_~tmp~2#1, __utac_acc__Specification13_spec__2_~tmp___0~2#1, __utac_acc__Specification13_spec__2_~tmp___1~2#1, __utac_acc__Specification13_spec__2_~tmp___2~0#1, __utac_acc__Specification13_spec__2_~tmp___3~0#1, __utac_acc__Specification13_spec__2_~tmp___4~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;havoc __utac_acc__Specification13_spec__2_~tmp~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~0#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3); 451809#L188 assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1; 450264#L189 assume 1 == ~prevDir~0;assume { :begin_inline_existInLiftCallsInDirection } true;existInLiftCallsInDirection_#in~d#1 := 0;havoc existInLiftCallsInDirection_#res#1;havoc existInLiftCallsInDirection_~d#1, existInLiftCallsInDirection_~retValue_acc~29#1, existInLiftCallsInDirection_~i~3#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~29#1;havoc existInLiftCallsInDirection_~i~3#1;havoc existInLiftCallsInDirection_~i___0~0#1; 443643#L3280 assume !(1 == existInLiftCallsInDirection_~d#1); 443645#L3346 assume 0 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i___0~0#1 := 0;existInLiftCallsInDirection_~i___0~0#1 := ~currentFloorID~0 - 1; 447615#L3350-2 [2024-10-15 00:44:36,050 INFO L747 eck$LassoCheckResult]: Loop: 447615#L3350-2 assume !false; 455759#L3351 assume existInLiftCallsInDirection_~i___0~0#1 >= 0; 453955#L3352 existInLiftCallsInDirection_~i___0~0#1 := 1 + ~currentFloorID~0; 453956#L3359-2 assume !false; 440921#L3360 assume !(existInLiftCallsInDirection_~i___0~0#1 < 5); 440922#L3418 existInLiftCallsInDirection_~i___0~0#1 := existInLiftCallsInDirection_~i___0~0#1 - 1; 447615#L3350-2 [2024-10-15 00:44:36,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:44:36,051 INFO L85 PathProgramCache]: Analyzing trace with hash -775218357, now seen corresponding path program 1 times [2024-10-15 00:44:36,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:44:36,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787699428] [2024-10-15 00:44:36,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:44:36,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:44:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:44:36,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:44:36,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:44:36,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787699428] [2024-10-15 00:44:36,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787699428] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:44:36,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:44:36,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-15 00:44:36,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165961858] [2024-10-15 00:44:36,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:44:36,155 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:44:36,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:44:36,155 INFO L85 PathProgramCache]: Analyzing trace with hash -2025047829, now seen corresponding path program 4 times [2024-10-15 00:44:36,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:44:36,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524767610] [2024-10-15 00:44:36,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:44:36,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:44:36,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:44:36,172 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:44:36,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:44:36,185 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:44:36,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:44:36,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-15 00:44:36,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-15 00:44:36,206 INFO L87 Difference]: Start difference. First operand 18536 states and 34562 transitions. cyclomatic complexity: 16063 Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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) [2024-10-15 00:44:36,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:44:36,491 INFO L93 Difference]: Finished difference Result 18544 states and 34569 transitions. [2024-10-15 00:44:36,491 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18544 states and 34569 transitions. [2024-10-15 00:44:36,556 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4182 [2024-10-15 00:44:36,605 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18544 states to 18544 states and 34569 transitions. [2024-10-15 00:44:36,606 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18465 [2024-10-15 00:44:36,620 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18465 [2024-10-15 00:44:36,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18544 states and 34569 transitions. [2024-10-15 00:44:36,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:44:36,640 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18544 states and 34569 transitions. [2024-10-15 00:44:36,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18544 states and 34569 transitions. [2024-10-15 00:44:36,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18544 to 18544. [2024-10-15 00:44:36,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18544 states, 18544 states have (on average 1.8641609145815359) internal successors, (34569), 18543 states have internal predecessors, (34569), 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) [2024-10-15 00:44:36,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18544 states to 18544 states and 34569 transitions. [2024-10-15 00:44:36,889 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18544 states and 34569 transitions. [2024-10-15 00:44:36,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-15 00:44:36,890 INFO L425 stractBuchiCegarLoop]: Abstraction has 18544 states and 34569 transitions. [2024-10-15 00:44:36,890 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-15 00:44:36,890 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18544 states and 34569 transitions. [2024-10-15 00:44:37,027 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4182 [2024-10-15 00:44:37,027 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:44:37,027 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:44:37,027 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:44:37,027 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-15 00:44:37,028 INFO L745 eck$LassoCheckResult]: Stem: 483952#$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(32, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(10, 16);call #Ultimate.allocInit(4, 17);call write~init~int#5(91, 17, 0, 1);call write~init~int#5(95, 17, 1, 1);call write~init~int#5(93, 17, 2, 1);call write~init~int#5(0, 17, 3, 1);call #Ultimate.allocInit(4, 18);call write~init~int#6(91, 18, 0, 1);call write~init~int#6(93, 18, 1, 1);call write~init~int#6(32, 18, 2, 1);call write~init~int#6(0, 18, 3, 1);call #Ultimate.allocInit(5, 19);call write~init~int#7(32, 19, 0, 1);call write~init~int#7(97, 19, 1, 1);call write~init~int#7(116, 19, 2, 1);call write~init~int#7(32, 19, 3, 1);call write~init~int#7(0, 19, 4, 1);call #Ultimate.allocInit(3, 20);call write~init~int#8(37, 20, 0, 1);call write~init~int#8(105, 20, 1, 1);call write~init~int#8(0, 20, 2, 1);call #Ultimate.allocInit(10, 21);call #Ultimate.allocInit(3, 22);call write~init~int#9(117, 22, 0, 1);call write~init~int#9(112, 22, 1, 1);call write~init~int#9(0, 22, 2, 1);call #Ultimate.allocInit(5, 23);call write~init~int#10(100, 23, 0, 1);call write~init~int#10(111, 23, 1, 1);call write~init~int#10(119, 23, 2, 1);call write~init~int#10(110, 23, 3, 1);call write~init~int#10(0, 23, 4, 1);call #Ultimate.allocInit(7, 24);call write~init~int#11(32, 24, 0, 1);call write~init~int#11(73, 24, 1, 1);call write~init~int#11(76, 24, 2, 1);call write~init~int#11(95, 24, 3, 1);call write~init~int#11(112, 24, 4, 1);call write~init~int#11(58, 24, 5, 1);call write~init~int#11(0, 24, 6, 1);call #Ultimate.allocInit(4, 25);call write~init~int#12(32, 25, 0, 1);call write~init~int#12(37, 25, 1, 1);call write~init~int#12(105, 25, 2, 1);call write~init~int#12(0, 25, 3, 1);call #Ultimate.allocInit(4, 26);call write~init~int#13(32, 26, 0, 1);call write~init~int#13(37, 26, 1, 1);call write~init~int#13(105, 26, 2, 1);call write~init~int#13(0, 26, 3, 1);call #Ultimate.allocInit(4, 27);call write~init~int#14(32, 27, 0, 1);call write~init~int#14(37, 27, 1, 1);call write~init~int#14(105, 27, 2, 1);call write~init~int#14(0, 27, 3, 1);call #Ultimate.allocInit(4, 28);call write~init~int#15(32, 28, 0, 1);call write~init~int#15(37, 28, 1, 1);call write~init~int#15(105, 28, 2, 1);call write~init~int#15(0, 28, 3, 1);call #Ultimate.allocInit(4, 29);call write~init~int#16(32, 29, 0, 1);call write~init~int#16(37, 29, 1, 1);call write~init~int#16(105, 29, 2, 1);call write~init~int#16(0, 29, 3, 1);call #Ultimate.allocInit(6, 30);call write~init~int#17(32, 30, 0, 1);call write~init~int#17(70, 30, 1, 1);call write~init~int#17(95, 30, 2, 1);call write~init~int#17(112, 30, 3, 1);call write~init~int#17(58, 30, 4, 1);call write~init~int#17(0, 30, 5, 1);call #Ultimate.allocInit(4, 31);call write~init~int#18(32, 31, 0, 1);call write~init~int#18(37, 31, 1, 1);call write~init~int#18(105, 31, 2, 1);call write~init~int#18(0, 31, 3, 1);call #Ultimate.allocInit(4, 32);call write~init~int#19(32, 32, 0, 1);call write~init~int#19(37, 32, 1, 1);call write~init~int#19(105, 32, 2, 1);call write~init~int#19(0, 32, 3, 1);call #Ultimate.allocInit(4, 33);call write~init~int#1(32, 33, 0, 1);call write~init~int#1(37, 33, 1, 1);call write~init~int#1(105, 33, 2, 1);call write~init~int#1(0, 33, 3, 1);call #Ultimate.allocInit(4, 34);call write~init~int#2(32, 34, 0, 1);call write~init~int#2(37, 34, 1, 1);call write~init~int#2(105, 34, 2, 1);call write~init~int#2(0, 34, 3, 1);call #Ultimate.allocInit(4, 35);call write~init~int#3(32, 35, 0, 1);call write~init~int#3(37, 35, 1, 1);call write~init~int#3(105, 35, 2, 1);call write~init~int#3(0, 35, 3, 1);call #Ultimate.allocInit(2, 36);call write~init~int#4(10, 36, 0, 1);call write~init~int#4(0, 36, 1, 1);call #Ultimate.allocInit(9, 37);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~cleanupTimeShifts~0 := 12;~prevDir~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0; 483518#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret30#1, main_~retValue_acc~1#1, main_~tmp~11#1;havoc main_~retValue_acc~1#1;havoc main_~tmp~11#1;assume { :begin_inline_select_helpers } true; 483519#select_helpers_returnLabel#1 assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 492812#select_features_returnLabel#1 assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1; 489509#valid_product_returnLabel#1 main_#t~ret30#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;assume { :end_inline_valid_product } true;main_~tmp~11#1 := main_#t~ret30#1;havoc main_#t~ret30#1; 482548#L591 assume 0 != main_~tmp~11#1;assume { :begin_inline_setup } true; 482549#setup_returnLabel#1 assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;havoc aliceCall_~tmp~4#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1; 486392#L1317 assume !(0 == getOrigin_~person#1); 485829#L1321 assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1; 480129#getOrigin_returnLabel#1 aliceCall_#t~ret19#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~4#1 := aliceCall_#t~ret19#1;havoc aliceCall_#t~ret19#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~4#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 480130#L964 assume !(0 == initPersonOnFloor_~floor#1); 491819#L991 assume !(1 == initPersonOnFloor_~floor#1); 483847#L1018 assume !(2 == initPersonOnFloor_~floor#1); 478366#L1045 assume 3 == initPersonOnFloor_~floor#1; 478367#L1046 assume !(0 == initPersonOnFloor_~person#1); 492089#L1049 assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_3~0 := 1; 475496#L1072-1 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 475497#L756 assume !(0 == callOnFloor_~floorID#1); 475813#L759 assume !(1 == callOnFloor_~floorID#1); 475814#L762 assume !(2 == callOnFloor_~floorID#1); 475972#L765 assume 3 == callOnFloor_~floorID#1;~calls_3~0 := 1; 475973#L768-2 havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true; 489777#initPersonOnFloor_returnLabel#1 havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true; 489778#aliceCall_returnLabel#1 havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;havoc angelinaCall_~tmp~5#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1; 492291#L1317-1 assume !(0 == getOrigin_~person#1); 486213#L1321-1 assume !(1 == getOrigin_~person#1); 484674#L1325-1 assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1; 484675#getOrigin_returnLabel#2 angelinaCall_#t~ret20#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~5#1 := angelinaCall_#t~ret20#1;havoc angelinaCall_#t~ret20#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~5#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 492948#L964-1 assume 0 == initPersonOnFloor_~floor#1; 485640#L965-2 assume !(0 == initPersonOnFloor_~person#1); 485641#L968-2 assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_0~0 := 1; 491173#L1072-3 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 492957#L756-2 assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1; 481667#L768-5 havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true; 481545#initPersonOnFloor_returnLabel#2 havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true; 481546#angelinaCall_returnLabel#1 havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret115#1, timeShift_~tmp~29#1;havoc timeShift_~tmp~29#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;havoc getCurrentHeading_~retValue_acc~17#1;getCurrentHeading_~retValue_acc~17#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~17#1; 486770#getCurrentHeading_returnLabel#1 __utac_acc__Specification13_spec__1_#t~ret10#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret10#1;havoc __utac_acc__Specification13_spec__1_#t~ret10#1; 486771#__utac_acc__Specification13_spec__1_returnLabel#1 havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;havoc areDoorsOpen_~retValue_acc~15#1;areDoorsOpen_~retValue_acc~15#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~15#1; 491513#areDoorsOpen_returnLabel#1 timeShift_#t~ret115#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~29#1 := timeShift_#t~ret115#1;havoc timeShift_#t~ret115#1; 476916#L3060 assume 0 != timeShift_~tmp~29#1; 476918#L3061 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 488897#L3060-1 assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret11#1, __utac_acc__Specification13_spec__2_#t~ret12#1, __utac_acc__Specification13_spec__2_#t~ret13#1, __utac_acc__Specification13_spec__2_#t~ret14#1, __utac_acc__Specification13_spec__2_#t~ret15#1, __utac_acc__Specification13_spec__2_#t~ret16#1, __utac_acc__Specification13_spec__2_~tmp~2#1, __utac_acc__Specification13_spec__2_~tmp___0~2#1, __utac_acc__Specification13_spec__2_~tmp___1~2#1, __utac_acc__Specification13_spec__2_~tmp___2~0#1, __utac_acc__Specification13_spec__2_~tmp___3~0#1, __utac_acc__Specification13_spec__2_~tmp___4~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;havoc __utac_acc__Specification13_spec__2_~tmp~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~0#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3); 488898#L188 assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1; 487353#L189 assume 1 == ~prevDir~0;assume { :begin_inline_existInLiftCallsInDirection } true;existInLiftCallsInDirection_#in~d#1 := 0;havoc existInLiftCallsInDirection_#res#1;havoc existInLiftCallsInDirection_~d#1, existInLiftCallsInDirection_~retValue_acc~29#1, existInLiftCallsInDirection_~i~3#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~29#1;havoc existInLiftCallsInDirection_~i~3#1;havoc existInLiftCallsInDirection_~i___0~0#1; 480732#L3280 assume !(1 == existInLiftCallsInDirection_~d#1); 480734#L3346 assume 0 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i___0~0#1 := 0;existInLiftCallsInDirection_~i___0~0#1 := ~currentFloorID~0 - 1; 484704#L3350-2 [2024-10-15 00:44:37,028 INFO L747 eck$LassoCheckResult]: Loop: 484704#L3350-2 assume !false; 492849#L3351 assume existInLiftCallsInDirection_~i___0~0#1 >= 0; 491044#L3352 existInLiftCallsInDirection_~i___0~0#1 := 1 + ~currentFloorID~0; 491045#L3359-2 assume !false; 478008#L3360 assume !(existInLiftCallsInDirection_~i___0~0#1 < 5); 478009#L3418 existInLiftCallsInDirection_~i___0~0#1 := existInLiftCallsInDirection_~i___0~0#1 - 1; 484704#L3350-2 [2024-10-15 00:44:37,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:44:37,028 INFO L85 PathProgramCache]: Analyzing trace with hash -49658810, now seen corresponding path program 1 times [2024-10-15 00:44:37,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:44:37,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244122382] [2024-10-15 00:44:37,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:44:37,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:44:37,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:44:37,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:44:37,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:44:37,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244122382] [2024-10-15 00:44:37,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244122382] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:44:37,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:44:37,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 00:44:37,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631544257] [2024-10-15 00:44:37,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:44:37,163 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:44:37,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:44:37,163 INFO L85 PathProgramCache]: Analyzing trace with hash -2025047829, now seen corresponding path program 5 times [2024-10-15 00:44:37,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:44:37,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364645446] [2024-10-15 00:44:37,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:44:37,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:44:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:44:37,180 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:44:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:44:37,190 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:44:37,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:44:37,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 00:44:37,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 00:44:37,212 INFO L87 Difference]: Start difference. First operand 18544 states and 34569 transitions. cyclomatic complexity: 16062 Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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) [2024-10-15 00:44:37,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:44:37,667 INFO L93 Difference]: Finished difference Result 18530 states and 34543 transitions. [2024-10-15 00:44:37,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18530 states and 34543 transitions. [2024-10-15 00:44:37,737 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4182 [2024-10-15 00:44:37,787 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18530 states to 18530 states and 34543 transitions. [2024-10-15 00:44:37,787 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18451 [2024-10-15 00:44:37,803 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18451 [2024-10-15 00:44:37,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18530 states and 34543 transitions. [2024-10-15 00:44:37,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:44:37,804 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18530 states and 34543 transitions. [2024-10-15 00:44:37,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18530 states and 34543 transitions. [2024-10-15 00:44:38,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18530 to 18530. [2024-10-15 00:44:38,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18530 states, 18530 states have (on average 1.8641662169454938) internal successors, (34543), 18529 states have internal predecessors, (34543), 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) [2024-10-15 00:44:38,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18530 states to 18530 states and 34543 transitions. [2024-10-15 00:44:38,267 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18530 states and 34543 transitions. [2024-10-15 00:44:38,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 00:44:38,268 INFO L425 stractBuchiCegarLoop]: Abstraction has 18530 states and 34543 transitions. [2024-10-15 00:44:38,268 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-15 00:44:38,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18530 states and 34543 transitions. [2024-10-15 00:44:38,313 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4182 [2024-10-15 00:44:38,313 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:44:38,313 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:44:38,314 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:44:38,314 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-15 00:44:38,314 INFO L745 eck$LassoCheckResult]: Stem: 521035#$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(32, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(10, 16);call #Ultimate.allocInit(4, 17);call write~init~int#5(91, 17, 0, 1);call write~init~int#5(95, 17, 1, 1);call write~init~int#5(93, 17, 2, 1);call write~init~int#5(0, 17, 3, 1);call #Ultimate.allocInit(4, 18);call write~init~int#6(91, 18, 0, 1);call write~init~int#6(93, 18, 1, 1);call write~init~int#6(32, 18, 2, 1);call write~init~int#6(0, 18, 3, 1);call #Ultimate.allocInit(5, 19);call write~init~int#7(32, 19, 0, 1);call write~init~int#7(97, 19, 1, 1);call write~init~int#7(116, 19, 2, 1);call write~init~int#7(32, 19, 3, 1);call write~init~int#7(0, 19, 4, 1);call #Ultimate.allocInit(3, 20);call write~init~int#8(37, 20, 0, 1);call write~init~int#8(105, 20, 1, 1);call write~init~int#8(0, 20, 2, 1);call #Ultimate.allocInit(10, 21);call #Ultimate.allocInit(3, 22);call write~init~int#9(117, 22, 0, 1);call write~init~int#9(112, 22, 1, 1);call write~init~int#9(0, 22, 2, 1);call #Ultimate.allocInit(5, 23);call write~init~int#10(100, 23, 0, 1);call write~init~int#10(111, 23, 1, 1);call write~init~int#10(119, 23, 2, 1);call write~init~int#10(110, 23, 3, 1);call write~init~int#10(0, 23, 4, 1);call #Ultimate.allocInit(7, 24);call write~init~int#11(32, 24, 0, 1);call write~init~int#11(73, 24, 1, 1);call write~init~int#11(76, 24, 2, 1);call write~init~int#11(95, 24, 3, 1);call write~init~int#11(112, 24, 4, 1);call write~init~int#11(58, 24, 5, 1);call write~init~int#11(0, 24, 6, 1);call #Ultimate.allocInit(4, 25);call write~init~int#12(32, 25, 0, 1);call write~init~int#12(37, 25, 1, 1);call write~init~int#12(105, 25, 2, 1);call write~init~int#12(0, 25, 3, 1);call #Ultimate.allocInit(4, 26);call write~init~int#13(32, 26, 0, 1);call write~init~int#13(37, 26, 1, 1);call write~init~int#13(105, 26, 2, 1);call write~init~int#13(0, 26, 3, 1);call #Ultimate.allocInit(4, 27);call write~init~int#14(32, 27, 0, 1);call write~init~int#14(37, 27, 1, 1);call write~init~int#14(105, 27, 2, 1);call write~init~int#14(0, 27, 3, 1);call #Ultimate.allocInit(4, 28);call write~init~int#15(32, 28, 0, 1);call write~init~int#15(37, 28, 1, 1);call write~init~int#15(105, 28, 2, 1);call write~init~int#15(0, 28, 3, 1);call #Ultimate.allocInit(4, 29);call write~init~int#16(32, 29, 0, 1);call write~init~int#16(37, 29, 1, 1);call write~init~int#16(105, 29, 2, 1);call write~init~int#16(0, 29, 3, 1);call #Ultimate.allocInit(6, 30);call write~init~int#17(32, 30, 0, 1);call write~init~int#17(70, 30, 1, 1);call write~init~int#17(95, 30, 2, 1);call write~init~int#17(112, 30, 3, 1);call write~init~int#17(58, 30, 4, 1);call write~init~int#17(0, 30, 5, 1);call #Ultimate.allocInit(4, 31);call write~init~int#18(32, 31, 0, 1);call write~init~int#18(37, 31, 1, 1);call write~init~int#18(105, 31, 2, 1);call write~init~int#18(0, 31, 3, 1);call #Ultimate.allocInit(4, 32);call write~init~int#19(32, 32, 0, 1);call write~init~int#19(37, 32, 1, 1);call write~init~int#19(105, 32, 2, 1);call write~init~int#19(0, 32, 3, 1);call #Ultimate.allocInit(4, 33);call write~init~int#1(32, 33, 0, 1);call write~init~int#1(37, 33, 1, 1);call write~init~int#1(105, 33, 2, 1);call write~init~int#1(0, 33, 3, 1);call #Ultimate.allocInit(4, 34);call write~init~int#2(32, 34, 0, 1);call write~init~int#2(37, 34, 1, 1);call write~init~int#2(105, 34, 2, 1);call write~init~int#2(0, 34, 3, 1);call #Ultimate.allocInit(4, 35);call write~init~int#3(32, 35, 0, 1);call write~init~int#3(37, 35, 1, 1);call write~init~int#3(105, 35, 2, 1);call write~init~int#3(0, 35, 3, 1);call #Ultimate.allocInit(2, 36);call write~init~int#4(10, 36, 0, 1);call write~init~int#4(0, 36, 1, 1);call #Ultimate.allocInit(9, 37);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~cleanupTimeShifts~0 := 12;~prevDir~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0; 520601#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret30#1, main_~retValue_acc~1#1, main_~tmp~11#1;havoc main_~retValue_acc~1#1;havoc main_~tmp~11#1;assume { :begin_inline_select_helpers } true; 520602#select_helpers_returnLabel#1 assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 529884#select_features_returnLabel#1 assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1; 526587#valid_product_returnLabel#1 main_#t~ret30#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;assume { :end_inline_valid_product } true;main_~tmp~11#1 := main_#t~ret30#1;havoc main_#t~ret30#1; 519630#L591 assume 0 != main_~tmp~11#1;assume { :begin_inline_setup } true; 519631#setup_returnLabel#1 assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;havoc aliceCall_~tmp~4#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1; 523468#L1317 assume !(0 == getOrigin_~person#1); 522909#L1321 assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1; 517213#getOrigin_returnLabel#1 aliceCall_#t~ret19#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~4#1 := aliceCall_#t~ret19#1;havoc aliceCall_#t~ret19#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~4#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 517214#L964 assume !(0 == initPersonOnFloor_~floor#1); 528896#L991 assume !(1 == initPersonOnFloor_~floor#1); 520930#L1018 assume !(2 == initPersonOnFloor_~floor#1); 515449#L1045 assume 3 == initPersonOnFloor_~floor#1; 515450#L1046 assume !(0 == initPersonOnFloor_~person#1); 529165#L1049 assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_3~0 := 1; 512579#L1072-1 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 512580#L756 assume !(0 == callOnFloor_~floorID#1); 512896#L759 assume !(1 == callOnFloor_~floorID#1); 512897#L762 assume !(2 == callOnFloor_~floorID#1); 513055#L765 assume 3 == callOnFloor_~floorID#1;~calls_3~0 := 1; 513056#L768-2 havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true; 526856#initPersonOnFloor_returnLabel#1 havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true; 526857#aliceCall_returnLabel#1 havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;havoc angelinaCall_~tmp~5#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1; 529364#L1317-1 assume !(0 == getOrigin_~person#1); 523293#L1321-1 assume !(1 == getOrigin_~person#1); 521757#L1325-1 assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1; 521758#getOrigin_returnLabel#2 angelinaCall_#t~ret20#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~5#1 := angelinaCall_#t~ret20#1;havoc angelinaCall_#t~ret20#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~5#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 513627#L964-1 assume !(0 == initPersonOnFloor_~floor#1); 512163#L991-1 assume 1 == initPersonOnFloor_~floor#1; 512164#L992-2 assume !(0 == initPersonOnFloor_~person#1); 518485#L995-2 assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_1~0 := 1; 511550#L1072-3 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 530025#L756-2 assume !(0 == callOnFloor_~floorID#1); 530022#L759-2 assume 1 == callOnFloor_~floorID#1;~calls_1~0 := 1; 518749#L768-5 havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true; 518629#initPersonOnFloor_returnLabel#2 havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true; 518630#angelinaCall_returnLabel#1 havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret115#1, timeShift_~tmp~29#1;havoc timeShift_~tmp~29#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;havoc getCurrentHeading_~retValue_acc~17#1;getCurrentHeading_~retValue_acc~17#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~17#1; 523846#getCurrentHeading_returnLabel#1 __utac_acc__Specification13_spec__1_#t~ret10#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret10#1;havoc __utac_acc__Specification13_spec__1_#t~ret10#1; 523847#__utac_acc__Specification13_spec__1_returnLabel#1 havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;havoc areDoorsOpen_~retValue_acc~15#1;areDoorsOpen_~retValue_acc~15#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~15#1; 528589#areDoorsOpen_returnLabel#1 timeShift_#t~ret115#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~29#1 := timeShift_#t~ret115#1;havoc timeShift_#t~ret115#1; 513999#L3060 assume 0 != timeShift_~tmp~29#1; 514001#L3061 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 525975#L3060-1 assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret11#1, __utac_acc__Specification13_spec__2_#t~ret12#1, __utac_acc__Specification13_spec__2_#t~ret13#1, __utac_acc__Specification13_spec__2_#t~ret14#1, __utac_acc__Specification13_spec__2_#t~ret15#1, __utac_acc__Specification13_spec__2_#t~ret16#1, __utac_acc__Specification13_spec__2_~tmp~2#1, __utac_acc__Specification13_spec__2_~tmp___0~2#1, __utac_acc__Specification13_spec__2_~tmp___1~2#1, __utac_acc__Specification13_spec__2_~tmp___2~0#1, __utac_acc__Specification13_spec__2_~tmp___3~0#1, __utac_acc__Specification13_spec__2_~tmp___4~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;havoc __utac_acc__Specification13_spec__2_~tmp~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~0#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3); 525976#L188 assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1; 524429#L189 assume 1 == ~prevDir~0;assume { :begin_inline_existInLiftCallsInDirection } true;existInLiftCallsInDirection_#in~d#1 := 0;havoc existInLiftCallsInDirection_#res#1;havoc existInLiftCallsInDirection_~d#1, existInLiftCallsInDirection_~retValue_acc~29#1, existInLiftCallsInDirection_~i~3#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~29#1;havoc existInLiftCallsInDirection_~i~3#1;havoc existInLiftCallsInDirection_~i___0~0#1; 517816#L3280 assume !(1 == existInLiftCallsInDirection_~d#1); 517818#L3346 assume 0 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i___0~0#1 := 0;existInLiftCallsInDirection_~i___0~0#1 := ~currentFloorID~0 - 1; 521786#L3350-2 [2024-10-15 00:44:38,315 INFO L747 eck$LassoCheckResult]: Loop: 521786#L3350-2 assume !false; 529921#L3351 assume existInLiftCallsInDirection_~i___0~0#1 >= 0; 528124#L3352 existInLiftCallsInDirection_~i___0~0#1 := 1 + ~currentFloorID~0; 528125#L3359-2 assume !false; 515091#L3360 assume !(existInLiftCallsInDirection_~i___0~0#1 < 5); 515092#L3418 existInLiftCallsInDirection_~i___0~0#1 := existInLiftCallsInDirection_~i___0~0#1 - 1; 521786#L3350-2 [2024-10-15 00:44:38,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:44:38,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1777575836, now seen corresponding path program 1 times [2024-10-15 00:44:38,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:44:38,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579826227] [2024-10-15 00:44:38,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:44:38,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:44:38,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:44:38,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:44:38,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:44:38,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579826227] [2024-10-15 00:44:38,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579826227] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:44:38,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:44:38,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 00:44:38,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955447248] [2024-10-15 00:44:38,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:44:38,422 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:44:38,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:44:38,423 INFO L85 PathProgramCache]: Analyzing trace with hash -2025047829, now seen corresponding path program 6 times [2024-10-15 00:44:38,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:44:38,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278352245] [2024-10-15 00:44:38,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:44:38,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:44:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:44:38,439 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:44:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:44:38,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:44:38,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:44:38,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 00:44:38,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 00:44:38,471 INFO L87 Difference]: Start difference. First operand 18530 states and 34543 transitions. cyclomatic complexity: 16050 Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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) [2024-10-15 00:44:38,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:44:38,840 INFO L93 Difference]: Finished difference Result 18524 states and 34530 transitions. [2024-10-15 00:44:38,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18524 states and 34530 transitions. [2024-10-15 00:44:38,911 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4182 [2024-10-15 00:44:39,217 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18524 states to 18524 states and 34530 transitions. [2024-10-15 00:44:39,217 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18445 [2024-10-15 00:44:39,232 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18445 [2024-10-15 00:44:39,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18524 states and 34530 transitions. [2024-10-15 00:44:39,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:44:39,233 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18524 states and 34530 transitions. [2024-10-15 00:44:39,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18524 states and 34530 transitions. [2024-10-15 00:44:39,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18524 to 18524. [2024-10-15 00:44:39,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18524 states, 18524 states have (on average 1.8640682358022025) internal successors, (34530), 18523 states have internal predecessors, (34530), 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) [2024-10-15 00:44:39,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18524 states to 18524 states and 34530 transitions. [2024-10-15 00:44:39,479 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18524 states and 34530 transitions. [2024-10-15 00:44:39,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 00:44:39,480 INFO L425 stractBuchiCegarLoop]: Abstraction has 18524 states and 34530 transitions. [2024-10-15 00:44:39,480 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-15 00:44:39,480 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18524 states and 34530 transitions. [2024-10-15 00:44:39,543 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4182 [2024-10-15 00:44:39,544 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:44:39,544 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:44:39,544 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:44:39,544 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-15 00:44:39,545 INFO L745 eck$LassoCheckResult]: Stem: 558091#$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(32, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(10, 16);call #Ultimate.allocInit(4, 17);call write~init~int#5(91, 17, 0, 1);call write~init~int#5(95, 17, 1, 1);call write~init~int#5(93, 17, 2, 1);call write~init~int#5(0, 17, 3, 1);call #Ultimate.allocInit(4, 18);call write~init~int#6(91, 18, 0, 1);call write~init~int#6(93, 18, 1, 1);call write~init~int#6(32, 18, 2, 1);call write~init~int#6(0, 18, 3, 1);call #Ultimate.allocInit(5, 19);call write~init~int#7(32, 19, 0, 1);call write~init~int#7(97, 19, 1, 1);call write~init~int#7(116, 19, 2, 1);call write~init~int#7(32, 19, 3, 1);call write~init~int#7(0, 19, 4, 1);call #Ultimate.allocInit(3, 20);call write~init~int#8(37, 20, 0, 1);call write~init~int#8(105, 20, 1, 1);call write~init~int#8(0, 20, 2, 1);call #Ultimate.allocInit(10, 21);call #Ultimate.allocInit(3, 22);call write~init~int#9(117, 22, 0, 1);call write~init~int#9(112, 22, 1, 1);call write~init~int#9(0, 22, 2, 1);call #Ultimate.allocInit(5, 23);call write~init~int#10(100, 23, 0, 1);call write~init~int#10(111, 23, 1, 1);call write~init~int#10(119, 23, 2, 1);call write~init~int#10(110, 23, 3, 1);call write~init~int#10(0, 23, 4, 1);call #Ultimate.allocInit(7, 24);call write~init~int#11(32, 24, 0, 1);call write~init~int#11(73, 24, 1, 1);call write~init~int#11(76, 24, 2, 1);call write~init~int#11(95, 24, 3, 1);call write~init~int#11(112, 24, 4, 1);call write~init~int#11(58, 24, 5, 1);call write~init~int#11(0, 24, 6, 1);call #Ultimate.allocInit(4, 25);call write~init~int#12(32, 25, 0, 1);call write~init~int#12(37, 25, 1, 1);call write~init~int#12(105, 25, 2, 1);call write~init~int#12(0, 25, 3, 1);call #Ultimate.allocInit(4, 26);call write~init~int#13(32, 26, 0, 1);call write~init~int#13(37, 26, 1, 1);call write~init~int#13(105, 26, 2, 1);call write~init~int#13(0, 26, 3, 1);call #Ultimate.allocInit(4, 27);call write~init~int#14(32, 27, 0, 1);call write~init~int#14(37, 27, 1, 1);call write~init~int#14(105, 27, 2, 1);call write~init~int#14(0, 27, 3, 1);call #Ultimate.allocInit(4, 28);call write~init~int#15(32, 28, 0, 1);call write~init~int#15(37, 28, 1, 1);call write~init~int#15(105, 28, 2, 1);call write~init~int#15(0, 28, 3, 1);call #Ultimate.allocInit(4, 29);call write~init~int#16(32, 29, 0, 1);call write~init~int#16(37, 29, 1, 1);call write~init~int#16(105, 29, 2, 1);call write~init~int#16(0, 29, 3, 1);call #Ultimate.allocInit(6, 30);call write~init~int#17(32, 30, 0, 1);call write~init~int#17(70, 30, 1, 1);call write~init~int#17(95, 30, 2, 1);call write~init~int#17(112, 30, 3, 1);call write~init~int#17(58, 30, 4, 1);call write~init~int#17(0, 30, 5, 1);call #Ultimate.allocInit(4, 31);call write~init~int#18(32, 31, 0, 1);call write~init~int#18(37, 31, 1, 1);call write~init~int#18(105, 31, 2, 1);call write~init~int#18(0, 31, 3, 1);call #Ultimate.allocInit(4, 32);call write~init~int#19(32, 32, 0, 1);call write~init~int#19(37, 32, 1, 1);call write~init~int#19(105, 32, 2, 1);call write~init~int#19(0, 32, 3, 1);call #Ultimate.allocInit(4, 33);call write~init~int#1(32, 33, 0, 1);call write~init~int#1(37, 33, 1, 1);call write~init~int#1(105, 33, 2, 1);call write~init~int#1(0, 33, 3, 1);call #Ultimate.allocInit(4, 34);call write~init~int#2(32, 34, 0, 1);call write~init~int#2(37, 34, 1, 1);call write~init~int#2(105, 34, 2, 1);call write~init~int#2(0, 34, 3, 1);call #Ultimate.allocInit(4, 35);call write~init~int#3(32, 35, 0, 1);call write~init~int#3(37, 35, 1, 1);call write~init~int#3(105, 35, 2, 1);call write~init~int#3(0, 35, 3, 1);call #Ultimate.allocInit(2, 36);call write~init~int#4(10, 36, 0, 1);call write~init~int#4(0, 36, 1, 1);call #Ultimate.allocInit(9, 37);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~cleanupTimeShifts~0 := 12;~prevDir~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0; 557657#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret30#1, main_~retValue_acc~1#1, main_~tmp~11#1;havoc main_~retValue_acc~1#1;havoc main_~tmp~11#1;assume { :begin_inline_select_helpers } true; 557658#select_helpers_returnLabel#1 assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 566944#select_features_returnLabel#1 assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1; 563644#valid_product_returnLabel#1 main_#t~ret30#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;assume { :end_inline_valid_product } true;main_~tmp~11#1 := main_#t~ret30#1;havoc main_#t~ret30#1; 556686#L591 assume 0 != main_~tmp~11#1;assume { :begin_inline_setup } true; 556687#setup_returnLabel#1 assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;havoc aliceCall_~tmp~4#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1; 560525#L1317 assume !(0 == getOrigin_~person#1); 559966#L1321 assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1; 554270#getOrigin_returnLabel#1 aliceCall_#t~ret19#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~4#1 := aliceCall_#t~ret19#1;havoc aliceCall_#t~ret19#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~4#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 554271#L964 assume !(0 == initPersonOnFloor_~floor#1); 565954#L991 assume !(1 == initPersonOnFloor_~floor#1); 557986#L1018 assume !(2 == initPersonOnFloor_~floor#1); 552507#L1045 assume 3 == initPersonOnFloor_~floor#1; 552508#L1046 assume !(0 == initPersonOnFloor_~person#1); 566223#L1049 assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_3~0 := 1; 549637#L1072-1 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 549638#L756 assume !(0 == callOnFloor_~floorID#1); 549954#L759 assume !(1 == callOnFloor_~floorID#1); 549955#L762 assume !(2 == callOnFloor_~floorID#1); 550113#L765 assume 3 == callOnFloor_~floorID#1;~calls_3~0 := 1; 550114#L768-2 havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true; 563914#initPersonOnFloor_returnLabel#1 havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true; 563915#aliceCall_returnLabel#1 havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;havoc angelinaCall_~tmp~5#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1; 566424#L1317-1 assume !(0 == getOrigin_~person#1); 560350#L1321-1 assume !(1 == getOrigin_~person#1); 558814#L1325-1 assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1; 558815#getOrigin_returnLabel#2 angelinaCall_#t~ret20#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~5#1 := angelinaCall_#t~ret20#1;havoc angelinaCall_#t~ret20#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~5#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 550685#L964-1 assume !(0 == initPersonOnFloor_~floor#1); 549222#L991-1 assume !(1 == initPersonOnFloor_~floor#1); 549223#L1018-1 assume 2 == initPersonOnFloor_~floor#1; 559983#L1019-2 assume !(0 == initPersonOnFloor_~person#1); 553026#L1022-2 assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_2~0 := 1; 553027#L1072-3 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 567084#L756-2 assume !(0 == callOnFloor_~floorID#1); 567083#L759-2 assume !(1 == callOnFloor_~floorID#1); 567082#L762-2 assume 2 == callOnFloor_~floorID#1;~calls_2~0 := 1; 555805#L768-5 havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true; 555684#initPersonOnFloor_returnLabel#2 havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true; 555685#angelinaCall_returnLabel#1 havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret115#1, timeShift_~tmp~29#1;havoc timeShift_~tmp~29#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;havoc getCurrentHeading_~retValue_acc~17#1;getCurrentHeading_~retValue_acc~17#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~17#1; 560903#getCurrentHeading_returnLabel#1 __utac_acc__Specification13_spec__1_#t~ret10#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret10#1;havoc __utac_acc__Specification13_spec__1_#t~ret10#1; 560904#__utac_acc__Specification13_spec__1_returnLabel#1 havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;havoc areDoorsOpen_~retValue_acc~15#1;areDoorsOpen_~retValue_acc~15#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~15#1; 565647#areDoorsOpen_returnLabel#1 timeShift_#t~ret115#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~29#1 := timeShift_#t~ret115#1;havoc timeShift_#t~ret115#1; 551057#L3060 assume 0 != timeShift_~tmp~29#1; 551059#L3061 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 563032#L3060-1 assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret11#1, __utac_acc__Specification13_spec__2_#t~ret12#1, __utac_acc__Specification13_spec__2_#t~ret13#1, __utac_acc__Specification13_spec__2_#t~ret14#1, __utac_acc__Specification13_spec__2_#t~ret15#1, __utac_acc__Specification13_spec__2_#t~ret16#1, __utac_acc__Specification13_spec__2_~tmp~2#1, __utac_acc__Specification13_spec__2_~tmp___0~2#1, __utac_acc__Specification13_spec__2_~tmp___1~2#1, __utac_acc__Specification13_spec__2_~tmp___2~0#1, __utac_acc__Specification13_spec__2_~tmp___3~0#1, __utac_acc__Specification13_spec__2_~tmp___4~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;havoc __utac_acc__Specification13_spec__2_~tmp~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~0#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3); 563033#L188 assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1; 561486#L189 assume 1 == ~prevDir~0;assume { :begin_inline_existInLiftCallsInDirection } true;existInLiftCallsInDirection_#in~d#1 := 0;havoc existInLiftCallsInDirection_#res#1;havoc existInLiftCallsInDirection_~d#1, existInLiftCallsInDirection_~retValue_acc~29#1, existInLiftCallsInDirection_~i~3#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~29#1;havoc existInLiftCallsInDirection_~i~3#1;havoc existInLiftCallsInDirection_~i___0~0#1; 554873#L3280 assume !(1 == existInLiftCallsInDirection_~d#1); 554875#L3346 assume 0 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i___0~0#1 := 0;existInLiftCallsInDirection_~i___0~0#1 := ~currentFloorID~0 - 1; 558843#L3350-2 [2024-10-15 00:44:39,545 INFO L747 eck$LassoCheckResult]: Loop: 558843#L3350-2 assume !false; 566981#L3351 assume existInLiftCallsInDirection_~i___0~0#1 >= 0; 565182#L3352 existInLiftCallsInDirection_~i___0~0#1 := 1 + ~currentFloorID~0; 565183#L3359-2 assume !false; 552149#L3360 assume !(existInLiftCallsInDirection_~i___0~0#1 < 5); 552150#L3418 existInLiftCallsInDirection_~i___0~0#1 := existInLiftCallsInDirection_~i___0~0#1 - 1; 558843#L3350-2 [2024-10-15 00:44:39,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:44:39,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1937928637, now seen corresponding path program 1 times [2024-10-15 00:44:39,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:44:39,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104448663] [2024-10-15 00:44:39,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:44:39,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:44:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:44:39,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:44:39,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:44:39,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104448663] [2024-10-15 00:44:39,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104448663] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:44:39,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:44:39,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-15 00:44:39,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845416551] [2024-10-15 00:44:39,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:44:39,639 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:44:39,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:44:39,643 INFO L85 PathProgramCache]: Analyzing trace with hash -2025047829, now seen corresponding path program 7 times [2024-10-15 00:44:39,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:44:39,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518809261] [2024-10-15 00:44:39,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:44:39,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:44:39,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:44:39,663 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:44:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:44:39,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:44:39,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:44:39,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-15 00:44:39,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-15 00:44:39,696 INFO L87 Difference]: Start difference. First operand 18524 states and 34530 transitions. cyclomatic complexity: 16043 Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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) [2024-10-15 00:44:40,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:44:40,197 INFO L93 Difference]: Finished difference Result 18540 states and 34542 transitions. [2024-10-15 00:44:40,197 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18540 states and 34542 transitions. [2024-10-15 00:44:40,282 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4182 [2024-10-15 00:44:40,338 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18540 states to 18540 states and 34542 transitions. [2024-10-15 00:44:40,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18461 [2024-10-15 00:44:40,657 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18461 [2024-10-15 00:44:40,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18540 states and 34542 transitions. [2024-10-15 00:44:40,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:44:40,657 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18540 states and 34542 transitions. [2024-10-15 00:44:40,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18540 states and 34542 transitions. [2024-10-15 00:44:40,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18540 to 18524. [2024-10-15 00:44:40,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18524 states, 18524 states have (on average 1.8636363636363635) internal successors, (34522), 18523 states have internal predecessors, (34522), 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) [2024-10-15 00:44:40,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18524 states to 18524 states and 34522 transitions. [2024-10-15 00:44:40,845 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18524 states and 34522 transitions. [2024-10-15 00:44:40,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-15 00:44:40,846 INFO L425 stractBuchiCegarLoop]: Abstraction has 18524 states and 34522 transitions. [2024-10-15 00:44:40,846 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-15 00:44:40,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18524 states and 34522 transitions. [2024-10-15 00:44:40,893 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4182 [2024-10-15 00:44:40,893 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:44:40,893 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:44:40,893 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:44:40,894 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-15 00:44:40,894 INFO L745 eck$LassoCheckResult]: Stem: 595160#$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(32, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(10, 16);call #Ultimate.allocInit(4, 17);call write~init~int#5(91, 17, 0, 1);call write~init~int#5(95, 17, 1, 1);call write~init~int#5(93, 17, 2, 1);call write~init~int#5(0, 17, 3, 1);call #Ultimate.allocInit(4, 18);call write~init~int#6(91, 18, 0, 1);call write~init~int#6(93, 18, 1, 1);call write~init~int#6(32, 18, 2, 1);call write~init~int#6(0, 18, 3, 1);call #Ultimate.allocInit(5, 19);call write~init~int#7(32, 19, 0, 1);call write~init~int#7(97, 19, 1, 1);call write~init~int#7(116, 19, 2, 1);call write~init~int#7(32, 19, 3, 1);call write~init~int#7(0, 19, 4, 1);call #Ultimate.allocInit(3, 20);call write~init~int#8(37, 20, 0, 1);call write~init~int#8(105, 20, 1, 1);call write~init~int#8(0, 20, 2, 1);call #Ultimate.allocInit(10, 21);call #Ultimate.allocInit(3, 22);call write~init~int#9(117, 22, 0, 1);call write~init~int#9(112, 22, 1, 1);call write~init~int#9(0, 22, 2, 1);call #Ultimate.allocInit(5, 23);call write~init~int#10(100, 23, 0, 1);call write~init~int#10(111, 23, 1, 1);call write~init~int#10(119, 23, 2, 1);call write~init~int#10(110, 23, 3, 1);call write~init~int#10(0, 23, 4, 1);call #Ultimate.allocInit(7, 24);call write~init~int#11(32, 24, 0, 1);call write~init~int#11(73, 24, 1, 1);call write~init~int#11(76, 24, 2, 1);call write~init~int#11(95, 24, 3, 1);call write~init~int#11(112, 24, 4, 1);call write~init~int#11(58, 24, 5, 1);call write~init~int#11(0, 24, 6, 1);call #Ultimate.allocInit(4, 25);call write~init~int#12(32, 25, 0, 1);call write~init~int#12(37, 25, 1, 1);call write~init~int#12(105, 25, 2, 1);call write~init~int#12(0, 25, 3, 1);call #Ultimate.allocInit(4, 26);call write~init~int#13(32, 26, 0, 1);call write~init~int#13(37, 26, 1, 1);call write~init~int#13(105, 26, 2, 1);call write~init~int#13(0, 26, 3, 1);call #Ultimate.allocInit(4, 27);call write~init~int#14(32, 27, 0, 1);call write~init~int#14(37, 27, 1, 1);call write~init~int#14(105, 27, 2, 1);call write~init~int#14(0, 27, 3, 1);call #Ultimate.allocInit(4, 28);call write~init~int#15(32, 28, 0, 1);call write~init~int#15(37, 28, 1, 1);call write~init~int#15(105, 28, 2, 1);call write~init~int#15(0, 28, 3, 1);call #Ultimate.allocInit(4, 29);call write~init~int#16(32, 29, 0, 1);call write~init~int#16(37, 29, 1, 1);call write~init~int#16(105, 29, 2, 1);call write~init~int#16(0, 29, 3, 1);call #Ultimate.allocInit(6, 30);call write~init~int#17(32, 30, 0, 1);call write~init~int#17(70, 30, 1, 1);call write~init~int#17(95, 30, 2, 1);call write~init~int#17(112, 30, 3, 1);call write~init~int#17(58, 30, 4, 1);call write~init~int#17(0, 30, 5, 1);call #Ultimate.allocInit(4, 31);call write~init~int#18(32, 31, 0, 1);call write~init~int#18(37, 31, 1, 1);call write~init~int#18(105, 31, 2, 1);call write~init~int#18(0, 31, 3, 1);call #Ultimate.allocInit(4, 32);call write~init~int#19(32, 32, 0, 1);call write~init~int#19(37, 32, 1, 1);call write~init~int#19(105, 32, 2, 1);call write~init~int#19(0, 32, 3, 1);call #Ultimate.allocInit(4, 33);call write~init~int#1(32, 33, 0, 1);call write~init~int#1(37, 33, 1, 1);call write~init~int#1(105, 33, 2, 1);call write~init~int#1(0, 33, 3, 1);call #Ultimate.allocInit(4, 34);call write~init~int#2(32, 34, 0, 1);call write~init~int#2(37, 34, 1, 1);call write~init~int#2(105, 34, 2, 1);call write~init~int#2(0, 34, 3, 1);call #Ultimate.allocInit(4, 35);call write~init~int#3(32, 35, 0, 1);call write~init~int#3(37, 35, 1, 1);call write~init~int#3(105, 35, 2, 1);call write~init~int#3(0, 35, 3, 1);call #Ultimate.allocInit(2, 36);call write~init~int#4(10, 36, 0, 1);call write~init~int#4(0, 36, 1, 1);call #Ultimate.allocInit(9, 37);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~cleanupTimeShifts~0 := 12;~prevDir~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0; 594726#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret30#1, main_~retValue_acc~1#1, main_~tmp~11#1;havoc main_~retValue_acc~1#1;havoc main_~tmp~11#1;assume { :begin_inline_select_helpers } true; 594727#select_helpers_returnLabel#1 assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 604012#select_features_returnLabel#1 assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1; 600714#valid_product_returnLabel#1 main_#t~ret30#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;assume { :end_inline_valid_product } true;main_~tmp~11#1 := main_#t~ret30#1;havoc main_#t~ret30#1; 593756#L591 assume 0 != main_~tmp~11#1;assume { :begin_inline_setup } true; 593757#setup_returnLabel#1 assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;havoc aliceCall_~tmp~4#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1; 597594#L1317 assume !(0 == getOrigin_~person#1); 597035#L1321 assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1; 591339#getOrigin_returnLabel#1 aliceCall_#t~ret19#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~4#1 := aliceCall_#t~ret19#1;havoc aliceCall_#t~ret19#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~4#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 591340#L964 assume !(0 == initPersonOnFloor_~floor#1); 603024#L991 assume !(1 == initPersonOnFloor_~floor#1); 595055#L1018 assume !(2 == initPersonOnFloor_~floor#1); 589577#L1045 assume 3 == initPersonOnFloor_~floor#1; 589578#L1046 assume !(0 == initPersonOnFloor_~person#1); 603293#L1049 assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_3~0 := 1; 586707#L1072-1 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 586708#L756 assume !(0 == callOnFloor_~floorID#1); 587024#L759 assume !(1 == callOnFloor_~floorID#1); 587025#L762 assume !(2 == callOnFloor_~floorID#1); 587183#L765 assume 3 == callOnFloor_~floorID#1;~calls_3~0 := 1; 587184#L768-2 havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true; 600984#initPersonOnFloor_returnLabel#1 havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true; 600985#aliceCall_returnLabel#1 havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;havoc angelinaCall_~tmp~5#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1; 603493#L1317-1 assume !(0 == getOrigin_~person#1); 597419#L1321-1 assume !(1 == getOrigin_~person#1); 595883#L1325-1 assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1; 595884#getOrigin_returnLabel#2 angelinaCall_#t~ret20#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~5#1 := angelinaCall_#t~ret20#1;havoc angelinaCall_#t~ret20#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~5#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 587755#L964-1 assume !(0 == initPersonOnFloor_~floor#1); 586292#L991-1 assume !(1 == initPersonOnFloor_~floor#1); 586293#L1018-1 assume 2 == initPersonOnFloor_~floor#1; 597052#L1019-2 assume !(0 == initPersonOnFloor_~person#1); 590096#L1022-2 assume !(1 == initPersonOnFloor_~person#1); 590097#L1025-2 assume 2 == initPersonOnFloor_~person#1;~personOnFloor_2_2~0 := 1; 599165#L1072-3 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 604199#L756-2 assume !(0 == callOnFloor_~floorID#1); 604198#L759-2 assume !(1 == callOnFloor_~floorID#1); 604197#L762-2 assume 2 == callOnFloor_~floorID#1;~calls_2~0 := 1; 592875#L768-5 havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true; 592754#initPersonOnFloor_returnLabel#2 havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true; 592755#angelinaCall_returnLabel#1 havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret115#1, timeShift_~tmp~29#1;havoc timeShift_~tmp~29#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;havoc getCurrentHeading_~retValue_acc~17#1;getCurrentHeading_~retValue_acc~17#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~17#1; 597972#getCurrentHeading_returnLabel#1 __utac_acc__Specification13_spec__1_#t~ret10#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret10#1;havoc __utac_acc__Specification13_spec__1_#t~ret10#1; 597973#__utac_acc__Specification13_spec__1_returnLabel#1 havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;havoc areDoorsOpen_~retValue_acc~15#1;areDoorsOpen_~retValue_acc~15#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~15#1; 602717#areDoorsOpen_returnLabel#1 timeShift_#t~ret115#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~29#1 := timeShift_#t~ret115#1;havoc timeShift_#t~ret115#1; 588127#L3060 assume 0 != timeShift_~tmp~29#1; 588129#L3061 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 600102#L3060-1 assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret11#1, __utac_acc__Specification13_spec__2_#t~ret12#1, __utac_acc__Specification13_spec__2_#t~ret13#1, __utac_acc__Specification13_spec__2_#t~ret14#1, __utac_acc__Specification13_spec__2_#t~ret15#1, __utac_acc__Specification13_spec__2_#t~ret16#1, __utac_acc__Specification13_spec__2_~tmp~2#1, __utac_acc__Specification13_spec__2_~tmp___0~2#1, __utac_acc__Specification13_spec__2_~tmp___1~2#1, __utac_acc__Specification13_spec__2_~tmp___2~0#1, __utac_acc__Specification13_spec__2_~tmp___3~0#1, __utac_acc__Specification13_spec__2_~tmp___4~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;havoc __utac_acc__Specification13_spec__2_~tmp~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~0#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3); 600103#L188 assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1; 598555#L189 assume 1 == ~prevDir~0;assume { :begin_inline_existInLiftCallsInDirection } true;existInLiftCallsInDirection_#in~d#1 := 0;havoc existInLiftCallsInDirection_#res#1;havoc existInLiftCallsInDirection_~d#1, existInLiftCallsInDirection_~retValue_acc~29#1, existInLiftCallsInDirection_~i~3#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~29#1;havoc existInLiftCallsInDirection_~i~3#1;havoc existInLiftCallsInDirection_~i___0~0#1; 591943#L3280 assume !(1 == existInLiftCallsInDirection_~d#1); 591945#L3346 assume 0 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i___0~0#1 := 0;existInLiftCallsInDirection_~i___0~0#1 := ~currentFloorID~0 - 1; 595912#L3350-2 [2024-10-15 00:44:40,894 INFO L747 eck$LassoCheckResult]: Loop: 595912#L3350-2 assume !false; 604049#L3351 assume existInLiftCallsInDirection_~i___0~0#1 >= 0; 602253#L3352 existInLiftCallsInDirection_~i___0~0#1 := 1 + ~currentFloorID~0; 602254#L3359-2 assume !false; 589219#L3360 assume !(existInLiftCallsInDirection_~i___0~0#1 < 5); 589220#L3418 existInLiftCallsInDirection_~i___0~0#1 := existInLiftCallsInDirection_~i___0~0#1 - 1; 595912#L3350-2 [2024-10-15 00:44:40,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:44:40,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1066971836, now seen corresponding path program 1 times [2024-10-15 00:44:40,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:44:40,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294188387] [2024-10-15 00:44:40,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:44:40,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:44:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:44:41,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:44:41,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:44:41,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294188387] [2024-10-15 00:44:41,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294188387] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:44:41,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:44:41,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-15 00:44:41,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142291506] [2024-10-15 00:44:41,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:44:41,011 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:44:41,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:44:41,011 INFO L85 PathProgramCache]: Analyzing trace with hash -2025047829, now seen corresponding path program 8 times [2024-10-15 00:44:41,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:44:41,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175757878] [2024-10-15 00:44:41,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:44:41,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:44:41,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:44:41,026 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:44:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:44:41,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:44:41,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:44:41,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:44:41,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:44:41,057 INFO L87 Difference]: Start difference. First operand 18524 states and 34522 transitions. cyclomatic complexity: 16035 Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 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) [2024-10-15 00:44:41,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:44:41,781 INFO L93 Difference]: Finished difference Result 34520 states and 64494 transitions. [2024-10-15 00:44:41,781 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34520 states and 64494 transitions. [2024-10-15 00:44:42,233 INFO L131 ngComponentsAnalysis]: Automaton has 66 accepting balls. 7224 [2024-10-15 00:44:42,319 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34520 states to 34520 states and 64494 transitions. [2024-10-15 00:44:42,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34362 [2024-10-15 00:44:42,347 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34362 [2024-10-15 00:44:42,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34520 states and 64494 transitions. [2024-10-15 00:44:42,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:44:42,348 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34520 states and 64494 transitions. [2024-10-15 00:44:42,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34520 states and 64494 transitions. [2024-10-15 00:44:42,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34520 to 29508. [2024-10-15 00:44:42,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29508 states, 29508 states have (on average 1.8641046495865528) internal successors, (55006), 29507 states have internal predecessors, (55006), 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) [2024-10-15 00:44:42,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29508 states to 29508 states and 55006 transitions. [2024-10-15 00:44:42,716 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29508 states and 55006 transitions. [2024-10-15 00:44:42,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:44:42,716 INFO L425 stractBuchiCegarLoop]: Abstraction has 29508 states and 55006 transitions. [2024-10-15 00:44:42,717 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-15 00:44:42,717 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29508 states and 55006 transitions. [2024-10-15 00:44:42,789 INFO L131 ngComponentsAnalysis]: Automaton has 66 accepting balls. 7224 [2024-10-15 00:44:42,789 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:44:42,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:44:42,790 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:44:42,790 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-15 00:44:42,791 INFO L745 eck$LassoCheckResult]: Stem: 648276#$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(32, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(10, 16);call #Ultimate.allocInit(4, 17);call write~init~int#5(91, 17, 0, 1);call write~init~int#5(95, 17, 1, 1);call write~init~int#5(93, 17, 2, 1);call write~init~int#5(0, 17, 3, 1);call #Ultimate.allocInit(4, 18);call write~init~int#6(91, 18, 0, 1);call write~init~int#6(93, 18, 1, 1);call write~init~int#6(32, 18, 2, 1);call write~init~int#6(0, 18, 3, 1);call #Ultimate.allocInit(5, 19);call write~init~int#7(32, 19, 0, 1);call write~init~int#7(97, 19, 1, 1);call write~init~int#7(116, 19, 2, 1);call write~init~int#7(32, 19, 3, 1);call write~init~int#7(0, 19, 4, 1);call #Ultimate.allocInit(3, 20);call write~init~int#8(37, 20, 0, 1);call write~init~int#8(105, 20, 1, 1);call write~init~int#8(0, 20, 2, 1);call #Ultimate.allocInit(10, 21);call #Ultimate.allocInit(3, 22);call write~init~int#9(117, 22, 0, 1);call write~init~int#9(112, 22, 1, 1);call write~init~int#9(0, 22, 2, 1);call #Ultimate.allocInit(5, 23);call write~init~int#10(100, 23, 0, 1);call write~init~int#10(111, 23, 1, 1);call write~init~int#10(119, 23, 2, 1);call write~init~int#10(110, 23, 3, 1);call write~init~int#10(0, 23, 4, 1);call #Ultimate.allocInit(7, 24);call write~init~int#11(32, 24, 0, 1);call write~init~int#11(73, 24, 1, 1);call write~init~int#11(76, 24, 2, 1);call write~init~int#11(95, 24, 3, 1);call write~init~int#11(112, 24, 4, 1);call write~init~int#11(58, 24, 5, 1);call write~init~int#11(0, 24, 6, 1);call #Ultimate.allocInit(4, 25);call write~init~int#12(32, 25, 0, 1);call write~init~int#12(37, 25, 1, 1);call write~init~int#12(105, 25, 2, 1);call write~init~int#12(0, 25, 3, 1);call #Ultimate.allocInit(4, 26);call write~init~int#13(32, 26, 0, 1);call write~init~int#13(37, 26, 1, 1);call write~init~int#13(105, 26, 2, 1);call write~init~int#13(0, 26, 3, 1);call #Ultimate.allocInit(4, 27);call write~init~int#14(32, 27, 0, 1);call write~init~int#14(37, 27, 1, 1);call write~init~int#14(105, 27, 2, 1);call write~init~int#14(0, 27, 3, 1);call #Ultimate.allocInit(4, 28);call write~init~int#15(32, 28, 0, 1);call write~init~int#15(37, 28, 1, 1);call write~init~int#15(105, 28, 2, 1);call write~init~int#15(0, 28, 3, 1);call #Ultimate.allocInit(4, 29);call write~init~int#16(32, 29, 0, 1);call write~init~int#16(37, 29, 1, 1);call write~init~int#16(105, 29, 2, 1);call write~init~int#16(0, 29, 3, 1);call #Ultimate.allocInit(6, 30);call write~init~int#17(32, 30, 0, 1);call write~init~int#17(70, 30, 1, 1);call write~init~int#17(95, 30, 2, 1);call write~init~int#17(112, 30, 3, 1);call write~init~int#17(58, 30, 4, 1);call write~init~int#17(0, 30, 5, 1);call #Ultimate.allocInit(4, 31);call write~init~int#18(32, 31, 0, 1);call write~init~int#18(37, 31, 1, 1);call write~init~int#18(105, 31, 2, 1);call write~init~int#18(0, 31, 3, 1);call #Ultimate.allocInit(4, 32);call write~init~int#19(32, 32, 0, 1);call write~init~int#19(37, 32, 1, 1);call write~init~int#19(105, 32, 2, 1);call write~init~int#19(0, 32, 3, 1);call #Ultimate.allocInit(4, 33);call write~init~int#1(32, 33, 0, 1);call write~init~int#1(37, 33, 1, 1);call write~init~int#1(105, 33, 2, 1);call write~init~int#1(0, 33, 3, 1);call #Ultimate.allocInit(4, 34);call write~init~int#2(32, 34, 0, 1);call write~init~int#2(37, 34, 1, 1);call write~init~int#2(105, 34, 2, 1);call write~init~int#2(0, 34, 3, 1);call #Ultimate.allocInit(4, 35);call write~init~int#3(32, 35, 0, 1);call write~init~int#3(37, 35, 1, 1);call write~init~int#3(105, 35, 2, 1);call write~init~int#3(0, 35, 3, 1);call #Ultimate.allocInit(2, 36);call write~init~int#4(10, 36, 0, 1);call write~init~int#4(0, 36, 1, 1);call #Ultimate.allocInit(9, 37);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~cleanupTimeShifts~0 := 12;~prevDir~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0; 647837#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret30#1, main_~retValue_acc~1#1, main_~tmp~11#1;havoc main_~retValue_acc~1#1;havoc main_~tmp~11#1;assume { :begin_inline_select_helpers } true; 647838#select_helpers_returnLabel#1 assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 657666#select_features_returnLabel#1 assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1; 654038#valid_product_returnLabel#1 main_#t~ret30#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;assume { :end_inline_valid_product } true;main_~tmp~11#1 := main_#t~ret30#1;havoc main_#t~ret30#1; 646853#L591 assume 0 != main_~tmp~11#1;assume { :begin_inline_setup } true; 646854#setup_returnLabel#1 assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;havoc aliceCall_~tmp~4#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1; 650777#L1317 assume !(0 == getOrigin_~person#1); 650201#L1321 assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1; 644404#getOrigin_returnLabel#1 aliceCall_#t~ret19#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~4#1 := aliceCall_#t~ret19#1;havoc aliceCall_#t~ret19#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~4#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 644405#L964 assume !(0 == initPersonOnFloor_~floor#1); 656498#L991 assume !(1 == initPersonOnFloor_~floor#1); 648170#L1018 assume !(2 == initPersonOnFloor_~floor#1); 642636#L1045 assume 3 == initPersonOnFloor_~floor#1; 642637#L1046 assume !(0 == initPersonOnFloor_~person#1); 656801#L1049 assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_3~0 := 1; 639757#L1072-1 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 639758#L756 assume !(0 == callOnFloor_~floorID#1); 640076#L759 assume !(1 == callOnFloor_~floorID#1); 640077#L762 assume !(2 == callOnFloor_~floorID#1); 640235#L765 assume 3 == callOnFloor_~floorID#1;~calls_3~0 := 1; 640236#L768-2 havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true; 654318#initPersonOnFloor_returnLabel#1 havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true; 654319#aliceCall_returnLabel#1 havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;havoc angelinaCall_~tmp~5#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1; 657028#L1317-1 assume !(0 == getOrigin_~person#1); 650595#L1321-1 assume !(1 == getOrigin_~person#1); 649018#L1325-1 assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1; 649019#getOrigin_returnLabel#2 angelinaCall_#t~ret20#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~5#1 := angelinaCall_#t~ret20#1;havoc angelinaCall_#t~ret20#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~5#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 640808#L964-1 assume !(0 == initPersonOnFloor_~floor#1); 639342#L991-1 assume !(1 == initPersonOnFloor_~floor#1); 639343#L1018-1 assume 2 == initPersonOnFloor_~floor#1; 650218#L1019-2 assume !(0 == initPersonOnFloor_~person#1); 643157#L1022-2 assume !(1 == initPersonOnFloor_~person#1); 643158#L1025-2 assume 2 == initPersonOnFloor_~person#1;~personOnFloor_2_2~0 := 1; 652408#L1072-3 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 657879#L756-2 assume !(0 == callOnFloor_~floorID#1); 657878#L759-2 assume !(1 == callOnFloor_~floorID#1); 657877#L762-2 assume 2 == callOnFloor_~floorID#1;~calls_2~0 := 1; 645959#L768-5 havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true; 645838#initPersonOnFloor_returnLabel#2 havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true; 645839#angelinaCall_returnLabel#1 havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret115#1, timeShift_~tmp~29#1;havoc timeShift_~tmp~29#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;havoc getCurrentHeading_~retValue_acc~17#1;getCurrentHeading_~retValue_acc~17#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~17#1; 651162#getCurrentHeading_returnLabel#1 __utac_acc__Specification13_spec__1_#t~ret10#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret10#1;havoc __utac_acc__Specification13_spec__1_#t~ret10#1; 651163#__utac_acc__Specification13_spec__1_returnLabel#1 havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;havoc areDoorsOpen_~retValue_acc~15#1;areDoorsOpen_~retValue_acc~15#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~15#1; 656166#areDoorsOpen_returnLabel#1 timeShift_#t~ret115#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~29#1 := timeShift_#t~ret115#1;havoc timeShift_#t~ret115#1; 641180#L3060 assume !(0 != timeShift_~tmp~29#1);~blocked~0 := 0;assume { :begin_inline_timeShift__wrappee__executivefloor } true;havoc timeShift__wrappee__executivefloor_#t~ret104#1, timeShift__wrappee__executivefloor_#t~ret105#1, timeShift__wrappee__executivefloor_#t~ret106#1, timeShift__wrappee__executivefloor_#t~ret107#1, timeShift__wrappee__executivefloor_#t~ret108#1, timeShift__wrappee__executivefloor_#t~ret109#1, timeShift__wrappee__executivefloor_#t~ret110#1, timeShift__wrappee__executivefloor_#t~ret111#1, timeShift__wrappee__executivefloor_#t~ret112#1, timeShift__wrappee__executivefloor_#t~ret113#1, timeShift__wrappee__executivefloor_#t~ret114#1, timeShift__wrappee__executivefloor_~tmp~28#1, timeShift__wrappee__executivefloor_~tmp___0~12#1, timeShift__wrappee__executivefloor_~tmp___1~7#1, timeShift__wrappee__executivefloor_~tmp___2~5#1, timeShift__wrappee__executivefloor_~tmp___3~4#1, timeShift__wrappee__executivefloor_~tmp___4~3#1, timeShift__wrappee__executivefloor_~tmp___5~2#1, timeShift__wrappee__executivefloor_~tmp___6~2#1, timeShift__wrappee__executivefloor_~tmp___7~2#1, timeShift__wrappee__executivefloor_~tmp___8~2#1, timeShift__wrappee__executivefloor_~tmp___9~2#1;havoc timeShift__wrappee__executivefloor_~tmp~28#1;havoc timeShift__wrappee__executivefloor_~tmp___0~12#1;havoc timeShift__wrappee__executivefloor_~tmp___1~7#1;havoc timeShift__wrappee__executivefloor_~tmp___2~5#1;havoc timeShift__wrappee__executivefloor_~tmp___3~4#1;havoc timeShift__wrappee__executivefloor_~tmp___4~3#1;havoc timeShift__wrappee__executivefloor_~tmp___5~2#1;havoc timeShift__wrappee__executivefloor_~tmp___6~2#1;havoc timeShift__wrappee__executivefloor_~tmp___7~2#1;havoc timeShift__wrappee__executivefloor_~tmp___8~2#1;havoc timeShift__wrappee__executivefloor_~tmp___9~2#1;assume { :begin_inline_stopRequestedAtCurrentFloor } true;havoc stopRequestedAtCurrentFloor_#res#1;havoc stopRequestedAtCurrentFloor_#t~ret88#1, stopRequestedAtCurrentFloor_#t~ret89#1, stopRequestedAtCurrentFloor_#t~ret90#1, stopRequestedAtCurrentFloor_#t~ret91#1, stopRequestedAtCurrentFloor_~retValue_acc~27#1, stopRequestedAtCurrentFloor_~tmp~26#1, stopRequestedAtCurrentFloor_~tmp___0~10#1;havoc stopRequestedAtCurrentFloor_~retValue_acc~27#1;havoc stopRequestedAtCurrentFloor_~tmp~26#1;havoc stopRequestedAtCurrentFloor_~tmp___0~10#1;assume { :begin_inline_isExecutiveFloorCalling } true;havoc isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret144#1, isExecutiveFloorCalling_~retValue_acc~30#1;havoc isExecutiveFloorCalling_~retValue_acc~30#1;assume { :begin_inline_isFloorCalling } true;isFloorCalling_#in~floorID#1 := ~executiveFloor~0;havoc isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~2#1;isFloorCalling_~floorID#1 := isFloorCalling_#in~floorID#1;havoc isFloorCalling_~retValue_acc~2#1; 641181#L693-65 assume 0 == isFloorCalling_~floorID#1;isFloorCalling_~retValue_acc~2#1 := ~calls_0~0;isFloorCalling_#res#1 := isFloorCalling_~retValue_acc~2#1; 644267#isFloorCalling_returnLabel#66 isExecutiveFloorCalling_#t~ret144#1 := isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~2#1;havoc isFloorCalling_#in~floorID#1;assume { :end_inline_isFloorCalling } true;isExecutiveFloorCalling_~retValue_acc~30#1 := isExecutiveFloorCalling_#t~ret144#1;havoc isExecutiveFloorCalling_#t~ret144#1;isExecutiveFloorCalling_#res#1 := isExecutiveFloorCalling_~retValue_acc~30#1; 644268#isExecutiveFloorCalling_returnLabel#4 stopRequestedAtCurrentFloor_#t~ret88#1 := isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret144#1, isExecutiveFloorCalling_~retValue_acc~30#1;assume { :end_inline_isExecutiveFloorCalling } true;stopRequestedAtCurrentFloor_~tmp~26#1 := stopRequestedAtCurrentFloor_#t~ret88#1;havoc stopRequestedAtCurrentFloor_#t~ret88#1; 654670#L2777-1 assume 0 != stopRequestedAtCurrentFloor_~tmp~26#1;assume { :begin_inline_getCurrentFloorID } true;havoc getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~14#1;havoc getCurrentFloorID_~retValue_acc~14#1;getCurrentFloorID_~retValue_acc~14#1 := ~currentFloorID~0;getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~14#1; 657161#getCurrentFloorID_returnLabel#6 stopRequestedAtCurrentFloor_#t~ret89#1 := getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~14#1;assume { :end_inline_getCurrentFloorID } true;stopRequestedAtCurrentFloor_~tmp___0~10#1 := stopRequestedAtCurrentFloor_#t~ret89#1;havoc stopRequestedAtCurrentFloor_#t~ret89#1; 656223#L2781-1 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~10#1);stopRequestedAtCurrentFloor_~retValue_acc~27#1 := 0;stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~27#1; 652730#stopRequestedAtCurrentFloor_returnLabel#2 timeShift__wrappee__executivefloor_#t~ret104#1 := stopRequestedAtCurrentFloor_#res#1;havoc stopRequestedAtCurrentFloor_#t~ret88#1, stopRequestedAtCurrentFloor_#t~ret89#1, stopRequestedAtCurrentFloor_#t~ret90#1, stopRequestedAtCurrentFloor_#t~ret91#1, stopRequestedAtCurrentFloor_~retValue_acc~27#1, stopRequestedAtCurrentFloor_~tmp~26#1, stopRequestedAtCurrentFloor_~tmp___0~10#1;assume { :end_inline_stopRequestedAtCurrentFloor } true;timeShift__wrappee__executivefloor_~tmp___9~2#1 := timeShift__wrappee__executivefloor_#t~ret104#1;havoc timeShift__wrappee__executivefloor_#t~ret104#1; 653141#L2929-2 assume !(0 != timeShift__wrappee__executivefloor_~tmp___9~2#1); 653143#L3020-3 assume !(1 == ~doorState~0); 653159#L3020-5 assume { :begin_inline_stopRequestedInDirection } true;stopRequestedInDirection_#in~dir#1, stopRequestedInDirection_#in~respectFloorCalls#1, stopRequestedInDirection_#in~respectInLiftCalls#1 := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res#1;havoc stopRequestedInDirection_#t~ret79#1, stopRequestedInDirection_#t~ret80#1, stopRequestedInDirection_#t~ret81#1, stopRequestedInDirection_~dir#1, stopRequestedInDirection_~respectFloorCalls#1, stopRequestedInDirection_~respectInLiftCalls#1, stopRequestedInDirection_~retValue_acc~23#1, stopRequestedInDirection_~tmp~22#1, stopRequestedInDirection_~tmp___0~7#1, stopRequestedInDirection_~__cil_tmp7~6#1, stopRequestedInDirection_~__cil_tmp8~7#1;stopRequestedInDirection_~dir#1 := stopRequestedInDirection_#in~dir#1;stopRequestedInDirection_~respectFloorCalls#1 := stopRequestedInDirection_#in~respectFloorCalls#1;stopRequestedInDirection_~respectInLiftCalls#1 := stopRequestedInDirection_#in~respectInLiftCalls#1;havoc stopRequestedInDirection_~retValue_acc~23#1;havoc stopRequestedInDirection_~tmp~22#1;havoc stopRequestedInDirection_~tmp___0~7#1;havoc stopRequestedInDirection_~__cil_tmp7~6#1;havoc stopRequestedInDirection_~__cil_tmp8~7#1;assume { :begin_inline_isExecutiveFloorCalling } true;havoc isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret144#1, isExecutiveFloorCalling_~retValue_acc~30#1;havoc isExecutiveFloorCalling_~retValue_acc~30#1;assume { :begin_inline_isFloorCalling } true;isFloorCalling_#in~floorID#1 := ~executiveFloor~0;havoc isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~2#1;isFloorCalling_~floorID#1 := isFloorCalling_#in~floorID#1;havoc isFloorCalling_~retValue_acc~2#1; 647130#L693-68 assume 0 == isFloorCalling_~floorID#1;isFloorCalling_~retValue_acc~2#1 := ~calls_0~0;isFloorCalling_#res#1 := isFloorCalling_~retValue_acc~2#1; 644039#isFloorCalling_returnLabel#69 isExecutiveFloorCalling_#t~ret144#1 := isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~2#1;havoc isFloorCalling_#in~floorID#1;assume { :end_inline_isFloorCalling } true;isExecutiveFloorCalling_~retValue_acc~30#1 := isExecutiveFloorCalling_#t~ret144#1;havoc isExecutiveFloorCalling_#t~ret144#1;isExecutiveFloorCalling_#res#1 := isExecutiveFloorCalling_~retValue_acc~30#1; 651293#isExecutiveFloorCalling_returnLabel#5 stopRequestedInDirection_#t~ret79#1 := isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret144#1, isExecutiveFloorCalling_~retValue_acc~30#1;assume { :end_inline_isExecutiveFloorCalling } true;stopRequestedInDirection_~tmp___0~7#1 := stopRequestedInDirection_#t~ret79#1;havoc stopRequestedInDirection_#t~ret79#1; 645016#L2632-2 assume 0 != stopRequestedInDirection_~tmp___0~7#1;assume { :begin_inline_getCurrentFloorID } true;havoc getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~14#1;havoc getCurrentFloorID_~retValue_acc~14#1;getCurrentFloorID_~retValue_acc~14#1 := ~currentFloorID~0;getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~14#1; 645017#getCurrentFloorID_returnLabel#9 stopRequestedInDirection_#t~ret80#1 := getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~14#1;assume { :end_inline_getCurrentFloorID } true;stopRequestedInDirection_~tmp~22#1 := stopRequestedInDirection_#t~ret80#1;havoc stopRequestedInDirection_#t~ret80#1;stopRequestedInDirection_~__cil_tmp7~6#1 := (if 1 == stopRequestedInDirection_~dir#1 then 1 else 0);stopRequestedInDirection_~__cil_tmp8~7#1 := (if stopRequestedInDirection_~tmp~22#1 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~23#1 := (if stopRequestedInDirection_~__cil_tmp8~7#1 == stopRequestedInDirection_~__cil_tmp7~6#1 then 1 else 0);stopRequestedInDirection_#res#1 := stopRequestedInDirection_~retValue_acc~23#1; 641673#stopRequestedInDirection_returnLabel#3 timeShift__wrappee__executivefloor_#t~ret111#1 := stopRequestedInDirection_#res#1;havoc stopRequestedInDirection_#t~ret79#1, stopRequestedInDirection_#t~ret80#1, stopRequestedInDirection_#t~ret81#1, stopRequestedInDirection_~dir#1, stopRequestedInDirection_~respectFloorCalls#1, stopRequestedInDirection_~respectInLiftCalls#1, stopRequestedInDirection_~retValue_acc~23#1, stopRequestedInDirection_~tmp~22#1, stopRequestedInDirection_~tmp___0~7#1, stopRequestedInDirection_~__cil_tmp7~6#1, stopRequestedInDirection_~__cil_tmp8~7#1;havoc stopRequestedInDirection_#in~dir#1, stopRequestedInDirection_#in~respectFloorCalls#1, stopRequestedInDirection_#in~respectInLiftCalls#1;assume { :end_inline_stopRequestedInDirection } true;timeShift__wrappee__executivefloor_~tmp___8~2#1 := timeShift__wrappee__executivefloor_#t~ret111#1;havoc timeShift__wrappee__executivefloor_#t~ret111#1; 639179#L3028-2 assume 0 != timeShift__wrappee__executivefloor_~tmp___8~2#1;assume { :begin_inline_continueInDirection } true;continueInDirection_#in~dir#1 := ~currentHeading~0;havoc continueInDirection_#t~ret82#1, continueInDirection_~dir#1, continueInDirection_~tmp~23#1;continueInDirection_~dir#1 := continueInDirection_#in~dir#1;havoc continueInDirection_~tmp~23#1;~currentHeading~0 := continueInDirection_~dir#1; 639181#L2689-3 assume !(1 == ~currentHeading~0); 656148#L2699-9 assume !(0 == ~currentFloorID~0); 654131#L2699-11 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 650748#L2705-7 havoc continueInDirection_#t~ret82#1, continueInDirection_~dir#1, continueInDirection_~tmp~23#1;havoc continueInDirection_#in~dir#1;assume { :end_inline_continueInDirection } true; 646985#L3037-5 havoc timeShift__wrappee__executivefloor_#t~ret104#1, timeShift__wrappee__executivefloor_#t~ret105#1, timeShift__wrappee__executivefloor_#t~ret106#1, timeShift__wrappee__executivefloor_#t~ret107#1, timeShift__wrappee__executivefloor_#t~ret108#1, timeShift__wrappee__executivefloor_#t~ret109#1, timeShift__wrappee__executivefloor_#t~ret110#1, timeShift__wrappee__executivefloor_#t~ret111#1, timeShift__wrappee__executivefloor_#t~ret112#1, timeShift__wrappee__executivefloor_#t~ret113#1, timeShift__wrappee__executivefloor_#t~ret114#1, timeShift__wrappee__executivefloor_~tmp~28#1, timeShift__wrappee__executivefloor_~tmp___0~12#1, timeShift__wrappee__executivefloor_~tmp___1~7#1, timeShift__wrappee__executivefloor_~tmp___2~5#1, timeShift__wrappee__executivefloor_~tmp___3~4#1, timeShift__wrappee__executivefloor_~tmp___4~3#1, timeShift__wrappee__executivefloor_~tmp___5~2#1, timeShift__wrappee__executivefloor_~tmp___6~2#1, timeShift__wrappee__executivefloor_~tmp___7~2#1, timeShift__wrappee__executivefloor_~tmp___8~2#1, timeShift__wrappee__executivefloor_~tmp___9~2#1;assume { :end_inline_timeShift__wrappee__executivefloor } true; 660577#L3060-1 assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret11#1, __utac_acc__Specification13_spec__2_#t~ret12#1, __utac_acc__Specification13_spec__2_#t~ret13#1, __utac_acc__Specification13_spec__2_#t~ret14#1, __utac_acc__Specification13_spec__2_#t~ret15#1, __utac_acc__Specification13_spec__2_#t~ret16#1, __utac_acc__Specification13_spec__2_~tmp~2#1, __utac_acc__Specification13_spec__2_~tmp___0~2#1, __utac_acc__Specification13_spec__2_~tmp___1~2#1, __utac_acc__Specification13_spec__2_~tmp___2~0#1, __utac_acc__Specification13_spec__2_~tmp___3~0#1, __utac_acc__Specification13_spec__2_~tmp___4~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;havoc __utac_acc__Specification13_spec__2_~tmp~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~0#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3); 660575#L188 assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1; 660576#L189 assume 1 == ~prevDir~0;assume { :begin_inline_existInLiftCallsInDirection } true;existInLiftCallsInDirection_#in~d#1 := 0;havoc existInLiftCallsInDirection_#res#1;havoc existInLiftCallsInDirection_~d#1, existInLiftCallsInDirection_~retValue_acc~29#1, existInLiftCallsInDirection_~i~3#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~29#1;havoc existInLiftCallsInDirection_~i~3#1;havoc existInLiftCallsInDirection_~i___0~0#1; 660578#L3280 assume !(1 == existInLiftCallsInDirection_~d#1); 660796#L3346 assume 0 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i___0~0#1 := 0;existInLiftCallsInDirection_~i___0~0#1 := ~currentFloorID~0 - 1; 660795#L3350-2 [2024-10-15 00:44:42,791 INFO L747 eck$LassoCheckResult]: Loop: 660795#L3350-2 assume !false; 660794#L3351 assume existInLiftCallsInDirection_~i___0~0#1 >= 0; 660793#L3352 existInLiftCallsInDirection_~i___0~0#1 := 1 + ~currentFloorID~0; 660791#L3359-2 assume !false; 660789#L3360 assume !(existInLiftCallsInDirection_~i___0~0#1 < 5); 660790#L3418 existInLiftCallsInDirection_~i___0~0#1 := existInLiftCallsInDirection_~i___0~0#1 - 1; 660795#L3350-2 [2024-10-15 00:44:42,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:44:42,792 INFO L85 PathProgramCache]: Analyzing trace with hash -953121625, now seen corresponding path program 1 times [2024-10-15 00:44:42,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:44:42,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685546158] [2024-10-15 00:44:42,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:44:42,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:44:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:44:42,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:44:42,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:44:42,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685546158] [2024-10-15 00:44:42,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685546158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:44:42,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:44:42,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-15 00:44:42,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071906378] [2024-10-15 00:44:42,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:44:42,926 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:44:42,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:44:42,926 INFO L85 PathProgramCache]: Analyzing trace with hash -2025047829, now seen corresponding path program 9 times [2024-10-15 00:44:42,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:44:42,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458240765] [2024-10-15 00:44:42,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:44:42,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:44:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:44:42,941 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:44:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:44:42,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:44:42,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:44:42,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-15 00:44:42,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-15 00:44:42,973 INFO L87 Difference]: Start difference. First operand 29508 states and 55006 transitions. cyclomatic complexity: 25572 Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 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) [2024-10-15 00:44:43,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:44:43,858 INFO L93 Difference]: Finished difference Result 28742 states and 53134 transitions. [2024-10-15 00:44:43,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28742 states and 53134 transitions. [2024-10-15 00:44:43,964 INFO L131 ngComponentsAnalysis]: Automaton has 122 accepting balls. 8602 [2024-10-15 00:44:44,038 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28742 states to 28742 states and 53134 transitions. [2024-10-15 00:44:44,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28505 [2024-10-15 00:44:44,295 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28505 [2024-10-15 00:44:44,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28742 states and 53134 transitions. [2024-10-15 00:44:44,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:44:44,296 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28742 states and 53134 transitions. [2024-10-15 00:44:44,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28742 states and 53134 transitions. [2024-10-15 00:44:44,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28742 to 28742. [2024-10-15 00:44:44,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28742 states, 28742 states have (on average 1.848653538375896) internal successors, (53134), 28741 states have internal predecessors, (53134), 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) [2024-10-15 00:44:44,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28742 states to 28742 states and 53134 transitions. [2024-10-15 00:44:44,675 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28742 states and 53134 transitions. [2024-10-15 00:44:44,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-15 00:44:44,675 INFO L425 stractBuchiCegarLoop]: Abstraction has 28742 states and 53134 transitions. [2024-10-15 00:44:44,675 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-10-15 00:44:44,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28742 states and 53134 transitions. [2024-10-15 00:44:44,773 INFO L131 ngComponentsAnalysis]: Automaton has 122 accepting balls. 8602 [2024-10-15 00:44:44,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:44:44,773 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:44:44,774 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:44:44,774 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-15 00:44:44,775 INFO L745 eck$LassoCheckResult]: Stem: 705623#$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(32, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(10, 16);call #Ultimate.allocInit(4, 17);call write~init~int#5(91, 17, 0, 1);call write~init~int#5(95, 17, 1, 1);call write~init~int#5(93, 17, 2, 1);call write~init~int#5(0, 17, 3, 1);call #Ultimate.allocInit(4, 18);call write~init~int#6(91, 18, 0, 1);call write~init~int#6(93, 18, 1, 1);call write~init~int#6(32, 18, 2, 1);call write~init~int#6(0, 18, 3, 1);call #Ultimate.allocInit(5, 19);call write~init~int#7(32, 19, 0, 1);call write~init~int#7(97, 19, 1, 1);call write~init~int#7(116, 19, 2, 1);call write~init~int#7(32, 19, 3, 1);call write~init~int#7(0, 19, 4, 1);call #Ultimate.allocInit(3, 20);call write~init~int#8(37, 20, 0, 1);call write~init~int#8(105, 20, 1, 1);call write~init~int#8(0, 20, 2, 1);call #Ultimate.allocInit(10, 21);call #Ultimate.allocInit(3, 22);call write~init~int#9(117, 22, 0, 1);call write~init~int#9(112, 22, 1, 1);call write~init~int#9(0, 22, 2, 1);call #Ultimate.allocInit(5, 23);call write~init~int#10(100, 23, 0, 1);call write~init~int#10(111, 23, 1, 1);call write~init~int#10(119, 23, 2, 1);call write~init~int#10(110, 23, 3, 1);call write~init~int#10(0, 23, 4, 1);call #Ultimate.allocInit(7, 24);call write~init~int#11(32, 24, 0, 1);call write~init~int#11(73, 24, 1, 1);call write~init~int#11(76, 24, 2, 1);call write~init~int#11(95, 24, 3, 1);call write~init~int#11(112, 24, 4, 1);call write~init~int#11(58, 24, 5, 1);call write~init~int#11(0, 24, 6, 1);call #Ultimate.allocInit(4, 25);call write~init~int#12(32, 25, 0, 1);call write~init~int#12(37, 25, 1, 1);call write~init~int#12(105, 25, 2, 1);call write~init~int#12(0, 25, 3, 1);call #Ultimate.allocInit(4, 26);call write~init~int#13(32, 26, 0, 1);call write~init~int#13(37, 26, 1, 1);call write~init~int#13(105, 26, 2, 1);call write~init~int#13(0, 26, 3, 1);call #Ultimate.allocInit(4, 27);call write~init~int#14(32, 27, 0, 1);call write~init~int#14(37, 27, 1, 1);call write~init~int#14(105, 27, 2, 1);call write~init~int#14(0, 27, 3, 1);call #Ultimate.allocInit(4, 28);call write~init~int#15(32, 28, 0, 1);call write~init~int#15(37, 28, 1, 1);call write~init~int#15(105, 28, 2, 1);call write~init~int#15(0, 28, 3, 1);call #Ultimate.allocInit(4, 29);call write~init~int#16(32, 29, 0, 1);call write~init~int#16(37, 29, 1, 1);call write~init~int#16(105, 29, 2, 1);call write~init~int#16(0, 29, 3, 1);call #Ultimate.allocInit(6, 30);call write~init~int#17(32, 30, 0, 1);call write~init~int#17(70, 30, 1, 1);call write~init~int#17(95, 30, 2, 1);call write~init~int#17(112, 30, 3, 1);call write~init~int#17(58, 30, 4, 1);call write~init~int#17(0, 30, 5, 1);call #Ultimate.allocInit(4, 31);call write~init~int#18(32, 31, 0, 1);call write~init~int#18(37, 31, 1, 1);call write~init~int#18(105, 31, 2, 1);call write~init~int#18(0, 31, 3, 1);call #Ultimate.allocInit(4, 32);call write~init~int#19(32, 32, 0, 1);call write~init~int#19(37, 32, 1, 1);call write~init~int#19(105, 32, 2, 1);call write~init~int#19(0, 32, 3, 1);call #Ultimate.allocInit(4, 33);call write~init~int#1(32, 33, 0, 1);call write~init~int#1(37, 33, 1, 1);call write~init~int#1(105, 33, 2, 1);call write~init~int#1(0, 33, 3, 1);call #Ultimate.allocInit(4, 34);call write~init~int#2(32, 34, 0, 1);call write~init~int#2(37, 34, 1, 1);call write~init~int#2(105, 34, 2, 1);call write~init~int#2(0, 34, 3, 1);call #Ultimate.allocInit(4, 35);call write~init~int#3(32, 35, 0, 1);call write~init~int#3(37, 35, 1, 1);call write~init~int#3(105, 35, 2, 1);call write~init~int#3(0, 35, 3, 1);call #Ultimate.allocInit(2, 36);call write~init~int#4(10, 36, 0, 1);call write~init~int#4(0, 36, 1, 1);call #Ultimate.allocInit(9, 37);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~cleanupTimeShifts~0 := 12;~prevDir~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0; 705227#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret30#1, main_~retValue_acc~1#1, main_~tmp~11#1;havoc main_~retValue_acc~1#1;havoc main_~tmp~11#1;assume { :begin_inline_select_helpers } true; 705228#select_helpers_returnLabel#1 assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 713804#select_features_returnLabel#1 assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1; 710730#valid_product_returnLabel#1 main_#t~ret30#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;assume { :end_inline_valid_product } true;main_~tmp~11#1 := main_#t~ret30#1;havoc main_#t~ret30#1; 704327#L591 assume 0 != main_~tmp~11#1;assume { :begin_inline_setup } true; 704328#setup_returnLabel#1 assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;havoc aliceCall_~tmp~4#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1; 707850#L1317 assume !(0 == getOrigin_~person#1); 707342#L1321 assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1; 702119#getOrigin_returnLabel#1 aliceCall_#t~ret19#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~4#1 := aliceCall_#t~ret19#1;havoc aliceCall_#t~ret19#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~4#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 702120#L964 assume !(0 == initPersonOnFloor_~floor#1); 712854#L991 assume !(1 == initPersonOnFloor_~floor#1); 705520#L1018 assume !(2 == initPersonOnFloor_~floor#1); 700545#L1045 assume 3 == initPersonOnFloor_~floor#1; 700546#L1046 assume !(0 == initPersonOnFloor_~person#1); 713110#L1049 assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_3~0 := 1; 697938#L1072-1 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 697939#L756 assume !(0 == callOnFloor_~floorID#1); 698213#L759 assume !(1 == callOnFloor_~floorID#1); 698214#L762 assume !(2 == callOnFloor_~floorID#1); 698357#L765 assume 3 == callOnFloor_~floorID#1;~calls_3~0 := 1; 698358#L768-2 havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true; 710980#initPersonOnFloor_returnLabel#1 havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true; 710981#aliceCall_returnLabel#1 havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;havoc angelinaCall_~tmp~5#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1; 713293#L1317-1 assume !(0 == getOrigin_~person#1); 707686#L1321-1 assume !(1 == getOrigin_~person#1); 706274#L1325-1 assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1; 706275#getOrigin_returnLabel#2 angelinaCall_#t~ret20#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~5#1 := angelinaCall_#t~ret20#1;havoc angelinaCall_#t~ret20#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~5#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 698876#L964-1 assume !(0 == initPersonOnFloor_~floor#1); 697568#L991-1 assume !(1 == initPersonOnFloor_~floor#1); 697569#L1018-1 assume 2 == initPersonOnFloor_~floor#1; 707359#L1019-2 assume !(0 == initPersonOnFloor_~person#1); 700995#L1022-2 assume !(1 == initPersonOnFloor_~person#1); 700996#L1025-2 assume 2 == initPersonOnFloor_~person#1;~personOnFloor_2_2~0 := 1; 709295#L1072-3 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 713968#L756-2 assume !(0 == callOnFloor_~floorID#1); 713967#L759-2 assume !(1 == callOnFloor_~floorID#1); 713966#L762-2 assume 2 == callOnFloor_~floorID#1;~calls_2~0 := 1; 703524#L768-5 havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true; 703412#initPersonOnFloor_returnLabel#2 havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true; 703413#angelinaCall_returnLabel#1 havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret115#1, timeShift_~tmp~29#1;havoc timeShift_~tmp~29#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;havoc getCurrentHeading_~retValue_acc~17#1;getCurrentHeading_~retValue_acc~17#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~17#1; 708183#getCurrentHeading_returnLabel#1 __utac_acc__Specification13_spec__1_#t~ret10#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret10#1;havoc __utac_acc__Specification13_spec__1_#t~ret10#1; 708184#__utac_acc__Specification13_spec__1_returnLabel#1 havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;havoc areDoorsOpen_~retValue_acc~15#1;areDoorsOpen_~retValue_acc~15#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~15#1; 712576#areDoorsOpen_returnLabel#1 timeShift_#t~ret115#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~29#1 := timeShift_#t~ret115#1;havoc timeShift_#t~ret115#1; 699211#L3060 assume 0 != timeShift_~tmp~29#1; 699212#L3061 assume !(~weight~0 > ~maximumWeight~0);~blocked~0 := 0;assume { :begin_inline_timeShift__wrappee__executivefloor } true;havoc timeShift__wrappee__executivefloor_#t~ret104#1, timeShift__wrappee__executivefloor_#t~ret105#1, timeShift__wrappee__executivefloor_#t~ret106#1, timeShift__wrappee__executivefloor_#t~ret107#1, timeShift__wrappee__executivefloor_#t~ret108#1, timeShift__wrappee__executivefloor_#t~ret109#1, timeShift__wrappee__executivefloor_#t~ret110#1, timeShift__wrappee__executivefloor_#t~ret111#1, timeShift__wrappee__executivefloor_#t~ret112#1, timeShift__wrappee__executivefloor_#t~ret113#1, timeShift__wrappee__executivefloor_#t~ret114#1, timeShift__wrappee__executivefloor_~tmp~28#1, timeShift__wrappee__executivefloor_~tmp___0~12#1, timeShift__wrappee__executivefloor_~tmp___1~7#1, timeShift__wrappee__executivefloor_~tmp___2~5#1, timeShift__wrappee__executivefloor_~tmp___3~4#1, timeShift__wrappee__executivefloor_~tmp___4~3#1, timeShift__wrappee__executivefloor_~tmp___5~2#1, timeShift__wrappee__executivefloor_~tmp___6~2#1, timeShift__wrappee__executivefloor_~tmp___7~2#1, timeShift__wrappee__executivefloor_~tmp___8~2#1, timeShift__wrappee__executivefloor_~tmp___9~2#1;havoc timeShift__wrappee__executivefloor_~tmp~28#1;havoc timeShift__wrappee__executivefloor_~tmp___0~12#1;havoc timeShift__wrappee__executivefloor_~tmp___1~7#1;havoc timeShift__wrappee__executivefloor_~tmp___2~5#1;havoc timeShift__wrappee__executivefloor_~tmp___3~4#1;havoc timeShift__wrappee__executivefloor_~tmp___4~3#1;havoc timeShift__wrappee__executivefloor_~tmp___5~2#1;havoc timeShift__wrappee__executivefloor_~tmp___6~2#1;havoc timeShift__wrappee__executivefloor_~tmp___7~2#1;havoc timeShift__wrappee__executivefloor_~tmp___8~2#1;havoc timeShift__wrappee__executivefloor_~tmp___9~2#1;assume { :begin_inline_stopRequestedAtCurrentFloor } true;havoc stopRequestedAtCurrentFloor_#res#1;havoc stopRequestedAtCurrentFloor_#t~ret88#1, stopRequestedAtCurrentFloor_#t~ret89#1, stopRequestedAtCurrentFloor_#t~ret90#1, stopRequestedAtCurrentFloor_#t~ret91#1, stopRequestedAtCurrentFloor_~retValue_acc~27#1, stopRequestedAtCurrentFloor_~tmp~26#1, stopRequestedAtCurrentFloor_~tmp___0~10#1;havoc stopRequestedAtCurrentFloor_~retValue_acc~27#1;havoc stopRequestedAtCurrentFloor_~tmp~26#1;havoc stopRequestedAtCurrentFloor_~tmp___0~10#1;assume { :begin_inline_isExecutiveFloorCalling } true;havoc isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret144#1, isExecutiveFloorCalling_~retValue_acc~30#1;havoc isExecutiveFloorCalling_~retValue_acc~30#1;assume { :begin_inline_isFloorCalling } true;isFloorCalling_#in~floorID#1 := ~executiveFloor~0;havoc isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~2#1;isFloorCalling_~floorID#1 := isFloorCalling_#in~floorID#1;havoc isFloorCalling_~retValue_acc~2#1; 709689#L693 assume 0 == isFloorCalling_~floorID#1;isFloorCalling_~retValue_acc~2#1 := ~calls_0~0;isFloorCalling_#res#1 := isFloorCalling_~retValue_acc~2#1; 704148#isFloorCalling_returnLabel#1 isExecutiveFloorCalling_#t~ret144#1 := isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~2#1;havoc isFloorCalling_#in~floorID#1;assume { :end_inline_isFloorCalling } true;isExecutiveFloorCalling_~retValue_acc~30#1 := isExecutiveFloorCalling_#t~ret144#1;havoc isExecutiveFloorCalling_#t~ret144#1;isExecutiveFloorCalling_#res#1 := isExecutiveFloorCalling_~retValue_acc~30#1; 708171#isExecutiveFloorCalling_returnLabel#1 stopRequestedAtCurrentFloor_#t~ret88#1 := isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret144#1, isExecutiveFloorCalling_~retValue_acc~30#1;assume { :end_inline_isExecutiveFloorCalling } true;stopRequestedAtCurrentFloor_~tmp~26#1 := stopRequestedAtCurrentFloor_#t~ret88#1;havoc stopRequestedAtCurrentFloor_#t~ret88#1; 709610#L2777 assume 0 != stopRequestedAtCurrentFloor_~tmp~26#1;assume { :begin_inline_getCurrentFloorID } true;havoc getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~14#1;havoc getCurrentFloorID_~retValue_acc~14#1;getCurrentFloorID_~retValue_acc~14#1 := ~currentFloorID~0;getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~14#1; 703498#getCurrentFloorID_returnLabel#1 stopRequestedAtCurrentFloor_#t~ret89#1 := getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~14#1;assume { :end_inline_getCurrentFloorID } true;stopRequestedAtCurrentFloor_~tmp___0~10#1 := stopRequestedAtCurrentFloor_#t~ret89#1;havoc stopRequestedAtCurrentFloor_#t~ret89#1; 703499#L2781 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~10#1);stopRequestedAtCurrentFloor_~retValue_acc~27#1 := 0;stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~27#1; 697669#stopRequestedAtCurrentFloor_returnLabel#1 timeShift__wrappee__executivefloor_#t~ret104#1 := stopRequestedAtCurrentFloor_#res#1;havoc stopRequestedAtCurrentFloor_#t~ret88#1, stopRequestedAtCurrentFloor_#t~ret89#1, stopRequestedAtCurrentFloor_#t~ret90#1, stopRequestedAtCurrentFloor_#t~ret91#1, stopRequestedAtCurrentFloor_~retValue_acc~27#1, stopRequestedAtCurrentFloor_~tmp~26#1, stopRequestedAtCurrentFloor_~tmp___0~10#1;assume { :end_inline_stopRequestedAtCurrentFloor } true;timeShift__wrappee__executivefloor_~tmp___9~2#1 := timeShift__wrappee__executivefloor_#t~ret104#1;havoc timeShift__wrappee__executivefloor_#t~ret104#1; 697670#L2929 assume !(0 != timeShift__wrappee__executivefloor_~tmp___9~2#1); 705844#L3020 assume 1 == ~doorState~0;~doorState~0 := 0; 705845#L3020-2 assume { :begin_inline_stopRequestedInDirection } true;stopRequestedInDirection_#in~dir#1, stopRequestedInDirection_#in~respectFloorCalls#1, stopRequestedInDirection_#in~respectInLiftCalls#1 := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res#1;havoc stopRequestedInDirection_#t~ret79#1, stopRequestedInDirection_#t~ret80#1, stopRequestedInDirection_#t~ret81#1, stopRequestedInDirection_~dir#1, stopRequestedInDirection_~respectFloorCalls#1, stopRequestedInDirection_~respectInLiftCalls#1, stopRequestedInDirection_~retValue_acc~23#1, stopRequestedInDirection_~tmp~22#1, stopRequestedInDirection_~tmp___0~7#1, stopRequestedInDirection_~__cil_tmp7~6#1, stopRequestedInDirection_~__cil_tmp8~7#1;stopRequestedInDirection_~dir#1 := stopRequestedInDirection_#in~dir#1;stopRequestedInDirection_~respectFloorCalls#1 := stopRequestedInDirection_#in~respectFloorCalls#1;stopRequestedInDirection_~respectInLiftCalls#1 := stopRequestedInDirection_#in~respectInLiftCalls#1;havoc stopRequestedInDirection_~retValue_acc~23#1;havoc stopRequestedInDirection_~tmp~22#1;havoc stopRequestedInDirection_~tmp___0~7#1;havoc stopRequestedInDirection_~__cil_tmp7~6#1;havoc stopRequestedInDirection_~__cil_tmp8~7#1;assume { :begin_inline_isExecutiveFloorCalling } true;havoc isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret144#1, isExecutiveFloorCalling_~retValue_acc~30#1;havoc isExecutiveFloorCalling_~retValue_acc~30#1;assume { :begin_inline_isFloorCalling } true;isFloorCalling_#in~floorID#1 := ~executiveFloor~0;havoc isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~2#1;isFloorCalling_~floorID#1 := isFloorCalling_#in~floorID#1;havoc isFloorCalling_~retValue_acc~2#1; 713522#L693-3 assume 0 == isFloorCalling_~floorID#1;isFloorCalling_~retValue_acc~2#1 := ~calls_0~0;isFloorCalling_#res#1 := isFloorCalling_~retValue_acc~2#1; 707390#isFloorCalling_returnLabel#4 isExecutiveFloorCalling_#t~ret144#1 := isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~2#1;havoc isFloorCalling_#in~floorID#1;assume { :end_inline_isFloorCalling } true;isExecutiveFloorCalling_~retValue_acc~30#1 := isExecutiveFloorCalling_#t~ret144#1;havoc isExecutiveFloorCalling_#t~ret144#1;isExecutiveFloorCalling_#res#1 := isExecutiveFloorCalling_~retValue_acc~30#1; 712104#isExecutiveFloorCalling_returnLabel#2 stopRequestedInDirection_#t~ret79#1 := isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret144#1, isExecutiveFloorCalling_~retValue_acc~30#1;assume { :end_inline_isExecutiveFloorCalling } true;stopRequestedInDirection_~tmp___0~7#1 := stopRequestedInDirection_#t~ret79#1;havoc stopRequestedInDirection_#t~ret79#1; 713273#L2632 assume 0 != stopRequestedInDirection_~tmp___0~7#1;assume { :begin_inline_getCurrentFloorID } true;havoc getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~14#1;havoc getCurrentFloorID_~retValue_acc~14#1;getCurrentFloorID_~retValue_acc~14#1 := ~currentFloorID~0;getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~14#1; 713274#getCurrentFloorID_returnLabel#4 stopRequestedInDirection_#t~ret80#1 := getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~14#1;assume { :end_inline_getCurrentFloorID } true;stopRequestedInDirection_~tmp~22#1 := stopRequestedInDirection_#t~ret80#1;havoc stopRequestedInDirection_#t~ret80#1;stopRequestedInDirection_~__cil_tmp7~6#1 := (if 1 == stopRequestedInDirection_~dir#1 then 1 else 0);stopRequestedInDirection_~__cil_tmp8~7#1 := (if stopRequestedInDirection_~tmp~22#1 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~23#1 := (if stopRequestedInDirection_~__cil_tmp8~7#1 == stopRequestedInDirection_~__cil_tmp7~6#1 then 1 else 0);stopRequestedInDirection_#res#1 := stopRequestedInDirection_~retValue_acc~23#1; 711408#stopRequestedInDirection_returnLabel#1 timeShift__wrappee__executivefloor_#t~ret111#1 := stopRequestedInDirection_#res#1;havoc stopRequestedInDirection_#t~ret79#1, stopRequestedInDirection_#t~ret80#1, stopRequestedInDirection_#t~ret81#1, stopRequestedInDirection_~dir#1, stopRequestedInDirection_~respectFloorCalls#1, stopRequestedInDirection_~respectInLiftCalls#1, stopRequestedInDirection_~retValue_acc~23#1, stopRequestedInDirection_~tmp~22#1, stopRequestedInDirection_~tmp___0~7#1, stopRequestedInDirection_~__cil_tmp7~6#1, stopRequestedInDirection_~__cil_tmp8~7#1;havoc stopRequestedInDirection_#in~dir#1, stopRequestedInDirection_#in~respectFloorCalls#1, stopRequestedInDirection_#in~respectInLiftCalls#1;assume { :end_inline_stopRequestedInDirection } true;timeShift__wrappee__executivefloor_~tmp___8~2#1 := timeShift__wrappee__executivefloor_#t~ret111#1;havoc timeShift__wrappee__executivefloor_#t~ret111#1; 705478#L3028 assume 0 != timeShift__wrappee__executivefloor_~tmp___8~2#1;assume { :begin_inline_continueInDirection } true;continueInDirection_#in~dir#1 := ~currentHeading~0;havoc continueInDirection_#t~ret82#1, continueInDirection_~dir#1, continueInDirection_~tmp~23#1;continueInDirection_~dir#1 := continueInDirection_#in~dir#1;havoc continueInDirection_~tmp~23#1;~currentHeading~0 := continueInDirection_~dir#1; 705479#L2689 assume !(1 == ~currentHeading~0); 706423#L2699 assume !(0 == ~currentFloorID~0); 701012#L2699-2 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 711756#L2705-1 havoc continueInDirection_#t~ret82#1, continueInDirection_~dir#1, continueInDirection_~tmp~23#1;havoc continueInDirection_#in~dir#1;assume { :end_inline_continueInDirection } true; 705998#L3037-2 havoc timeShift__wrappee__executivefloor_#t~ret104#1, timeShift__wrappee__executivefloor_#t~ret105#1, timeShift__wrappee__executivefloor_#t~ret106#1, timeShift__wrappee__executivefloor_#t~ret107#1, timeShift__wrappee__executivefloor_#t~ret108#1, timeShift__wrappee__executivefloor_#t~ret109#1, timeShift__wrappee__executivefloor_#t~ret110#1, timeShift__wrappee__executivefloor_#t~ret111#1, timeShift__wrappee__executivefloor_#t~ret112#1, timeShift__wrappee__executivefloor_#t~ret113#1, timeShift__wrappee__executivefloor_#t~ret114#1, timeShift__wrappee__executivefloor_~tmp~28#1, timeShift__wrappee__executivefloor_~tmp___0~12#1, timeShift__wrappee__executivefloor_~tmp___1~7#1, timeShift__wrappee__executivefloor_~tmp___2~5#1, timeShift__wrappee__executivefloor_~tmp___3~4#1, timeShift__wrappee__executivefloor_~tmp___4~3#1, timeShift__wrappee__executivefloor_~tmp___5~2#1, timeShift__wrappee__executivefloor_~tmp___6~2#1, timeShift__wrappee__executivefloor_~tmp___7~2#1, timeShift__wrappee__executivefloor_~tmp___8~2#1, timeShift__wrappee__executivefloor_~tmp___9~2#1;assume { :end_inline_timeShift__wrappee__executivefloor } true; 713994#L3060-1 assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret11#1, __utac_acc__Specification13_spec__2_#t~ret12#1, __utac_acc__Specification13_spec__2_#t~ret13#1, __utac_acc__Specification13_spec__2_#t~ret14#1, __utac_acc__Specification13_spec__2_#t~ret15#1, __utac_acc__Specification13_spec__2_#t~ret16#1, __utac_acc__Specification13_spec__2_~tmp~2#1, __utac_acc__Specification13_spec__2_~tmp___0~2#1, __utac_acc__Specification13_spec__2_~tmp___1~2#1, __utac_acc__Specification13_spec__2_~tmp___2~0#1, __utac_acc__Specification13_spec__2_~tmp___3~0#1, __utac_acc__Specification13_spec__2_~tmp___4~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;havoc __utac_acc__Specification13_spec__2_~tmp~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~0#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3); 713987#L188 assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1; 713988#L189 assume 1 == ~prevDir~0;assume { :begin_inline_existInLiftCallsInDirection } true;existInLiftCallsInDirection_#in~d#1 := 0;havoc existInLiftCallsInDirection_#res#1;havoc existInLiftCallsInDirection_~d#1, existInLiftCallsInDirection_~retValue_acc~29#1, existInLiftCallsInDirection_~i~3#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~29#1;havoc existInLiftCallsInDirection_~i~3#1;havoc existInLiftCallsInDirection_~i___0~0#1; 713993#L3280 assume !(1 == existInLiftCallsInDirection_~d#1); 714111#L3346 assume 0 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i___0~0#1 := 0;existInLiftCallsInDirection_~i___0~0#1 := ~currentFloorID~0 - 1; 714112#L3350-2 [2024-10-15 00:44:44,776 INFO L747 eck$LassoCheckResult]: Loop: 714112#L3350-2 assume !false; 714109#L3351 assume existInLiftCallsInDirection_~i___0~0#1 >= 0; 714110#L3352 existInLiftCallsInDirection_~i___0~0#1 := 1 + ~currentFloorID~0; 714120#L3359-2 assume !false; 714117#L3360 assume !(existInLiftCallsInDirection_~i___0~0#1 < 5); 714118#L3418 existInLiftCallsInDirection_~i___0~0#1 := existInLiftCallsInDirection_~i___0~0#1 - 1; 714112#L3350-2 [2024-10-15 00:44:44,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:44:44,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1488758990, now seen corresponding path program 1 times [2024-10-15 00:44:44,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:44:44,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095917137] [2024-10-15 00:44:44,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:44:44,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:44:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:44:44,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:44:44,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:44:44,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095917137] [2024-10-15 00:44:44,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095917137] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:44:44,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:44:44,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 00:44:44,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884594207] [2024-10-15 00:44:44,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:44:44,900 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:44:44,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:44:44,901 INFO L85 PathProgramCache]: Analyzing trace with hash -2025047829, now seen corresponding path program 10 times [2024-10-15 00:44:44,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:44:44,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581551058] [2024-10-15 00:44:44,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:44:44,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:44:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:44:44,924 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:44:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:44:44,934 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:44:44,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:44:44,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-15 00:44:44,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-15 00:44:44,955 INFO L87 Difference]: Start difference. First operand 28742 states and 53134 transitions. cyclomatic complexity: 24526 Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 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)