./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/product-lines/elevator_spec13_product24.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/product-lines/elevator_spec13_product24.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 89950477a2818e2be847e3014c0e2f9e906834037b4e328723302699ed4d9564 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 07:35:49,942 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:35:50,012 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-01-10 07:35:50,017 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:35:50,018 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:35:50,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:35:50,042 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:35:50,042 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:35:50,042 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:35:50,043 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:35:50,044 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:35:50,044 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:35:50,044 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:35:50,044 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:35:50,045 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:35:50,045 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:35:50,045 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:35:50,045 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:35:50,045 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:35:50,045 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:35:50,045 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:35:50,046 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 07:35:50,046 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:35:50,046 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 07:35:50,046 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:35:50,046 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:35:50,046 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:35:50,046 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:35:50,046 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:35:50,046 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 07:35:50,047 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:35:50,047 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:35:50,047 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:35:50,047 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:35:50,047 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:35:50,047 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:35:50,047 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:35:50,048 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:35:50,048 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:35:50,048 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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-jdk21/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 -> 89950477a2818e2be847e3014c0e2f9e906834037b4e328723302699ed4d9564 [2025-01-10 07:35:50,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:35:50,364 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:35:50,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:35:50,368 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:35:50,368 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:35:50,370 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec13_product24.cil.c [2025-01-10 07:35:51,768 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a0e86812c/109ff62c370a42d2b4072c7f469bd5ef/FLAG77f234eaf [2025-01-10 07:35:52,218 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:35:52,220 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec13_product24.cil.c [2025-01-10 07:35:52,246 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a0e86812c/109ff62c370a42d2b4072c7f469bd5ef/FLAG77f234eaf [2025-01-10 07:35:52,264 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a0e86812c/109ff62c370a42d2b4072c7f469bd5ef [2025-01-10 07:35:52,268 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:35:52,270 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:35:52,271 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:35:52,271 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:35:52,275 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:35:52,276 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:35:52" (1/1) ... [2025-01-10 07:35:52,277 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45cafe95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:52, skipping insertion in model container [2025-01-10 07:35:52,277 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:35:52" (1/1) ... [2025-01-10 07:35:52,341 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:35:52,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:35:52,882 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:35:52,890 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [48] [2025-01-10 07:35:52,892 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [414] [2025-01-10 07:35:52,892 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [434] [2025-01-10 07:35:52,892 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2095] [2025-01-10 07:35:52,893 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2449] [2025-01-10 07:35:52,893 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [2458] [2025-01-10 07:35:52,893 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2549] [2025-01-10 07:35:52,893 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification13_spec.i","") [3210] [2025-01-10 07:35:52,893 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [3299] [2025-01-10 07:35:52,893 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3417] [2025-01-10 07:35:53,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:35:53,048 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:35:53,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:53 WrapperNode [2025-01-10 07:35:53,050 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:35:53,051 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:35:53,052 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:35:53,052 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:35:53,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:53" (1/1) ... [2025-01-10 07:35:53,083 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:53" (1/1) ... [2025-01-10 07:35:53,897 INFO L138 Inliner]: procedures = 96, calls = 353, calls flagged for inlining = 205, calls inlined = 1945, statements flattened = 67110 [2025-01-10 07:35:53,897 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:35:53,898 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:35:53,898 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:35:53,898 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:35:53,924 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:53" (1/1) ... [2025-01-10 07:35:53,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:53" (1/1) ... [2025-01-10 07:35:54,092 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:53" (1/1) ... [2025-01-10 07:35:54,348 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]. [2025-01-10 07:35:54,348 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:53" (1/1) ... [2025-01-10 07:35:54,348 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:53" (1/1) ... [2025-01-10 07:35:54,728 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:53" (1/1) ... [2025-01-10 07:35:54,779 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:53" (1/1) ... [2025-01-10 07:35:55,079 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:53" (1/1) ... [2025-01-10 07:35:55,138 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:53" (1/1) ... [2025-01-10 07:35:55,212 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:53" (1/1) ... [2025-01-10 07:35:55,358 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:35:55,360 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:35:55,360 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:35:55,360 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:35:55,361 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:53" (1/1) ... [2025-01-10 07:35:55,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:55,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:55,393 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:35:55,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-01-10 07:35:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 07:35:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 07:35:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 07:35:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 07:35:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 07:35:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-10 07:35:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-10 07:35:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-10 07:35:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-10 07:35:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-10 07:35:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-10 07:35:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-10 07:35:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-10 07:35:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-10 07:35:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-10 07:35:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-10 07:35:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-10 07:35:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-10 07:35:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-10 07:35:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-10 07:35:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-10 07:35:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:35:55,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:35:55,678 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:35:55,680 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:36:18,475 INFO L? ?]: Removed 29662 outVars from TransFormulas that were not future-live. [2025-01-10 07:36:18,475 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:36:18,691 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:36:18,691 INFO L312 CfgBuilder]: Removed 61 assume(true) statements. [2025-01-10 07:36:18,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:36:18 BoogieIcfgContainer [2025-01-10 07:36:18,692 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:36:18,693 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:36:18,693 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:36:18,698 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:36:18,699 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:36:18,699 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:35:52" (1/3) ... [2025-01-10 07:36:18,701 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1cee3ca7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:36:18, skipping insertion in model container [2025-01-10 07:36:18,703 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:36:18,703 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:53" (2/3) ... [2025-01-10 07:36:18,704 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1cee3ca7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:36:18, skipping insertion in model container [2025-01-10 07:36:18,704 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:36:18,704 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:36:18" (3/3) ... [2025-01-10 07:36:18,705 INFO L363 chiAutomizerObserver]: Analyzing ICFG elevator_spec13_product24.cil.c [2025-01-10 07:36:19,215 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:36:19,218 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:36:19,219 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:36:19,219 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:36:19,219 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:36:19,219 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:36:19,219 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:36:19,219 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:36:19,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17891 states, 17890 states have (on average 1.8766349916154277) internal successors, (33573), 17890 states have internal predecessors, (33573), 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) [2025-01-10 07:36:19,970 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4015 [2025-01-10 07:36:19,974 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:36:19,974 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:36:19,989 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] [2025-01-10 07:36:19,993 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:36:19,994 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:36:20,096 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17891 states, 17890 states have (on average 1.8766349916154277) internal successors, (33573), 17890 states have internal predecessors, (33573), 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) [2025-01-10 07:36:20,344 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4015 [2025-01-10 07:36:20,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:36:20,344 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:36:20,346 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] [2025-01-10 07:36:20,346 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:36:20,356 INFO L752 eck$LassoCheckResult]: Stem: "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);~head~0.base, ~head~0.offset := 0, 0;~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~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;~cleanupTimeShifts~0 := 12;~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;~prevDir~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret129#1, main_~retValue_acc~23#1, main_~tmp~27#1;havoc main_~retValue_acc~23#1;havoc main_~tmp~27#1;assume { :begin_inline_select_helpers } true;" "assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true;" "assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~31#1;havoc valid_product_~retValue_acc~31#1;valid_product_~retValue_acc~31#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~31#1;" "main_#t~ret129#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~31#1;assume { :end_inline_valid_product } true;main_~tmp~27#1 := main_#t~ret129#1;havoc main_#t~ret129#1;" "assume 0 != main_~tmp~27#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret118#1, aliceCall_~tmp~20#1;havoc aliceCall_~tmp~20#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~28#1;" "assume 0 == getOrigin_~person#1;getOrigin_~retValue_acc~28#1 := 4;getOrigin_#res#1 := getOrigin_~retValue_acc~28#1;" "aliceCall_#t~ret118#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~20#1 := aliceCall_#t~ret118#1;havoc aliceCall_#t~ret118#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~20#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume 0 == initPersonOnFloor_~floor#1;" "assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_0~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc aliceCall_#t~ret118#1, aliceCall_~tmp~20#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret119#1, angelinaCall_~tmp~21#1;havoc angelinaCall_~tmp~21#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~28#1;" "assume 0 == getOrigin_~person#1;getOrigin_~retValue_acc~28#1 := 4;getOrigin_#res#1 := getOrigin_~retValue_acc~28#1;" "angelinaCall_#t~ret119#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~21#1 := angelinaCall_#t~ret119#1;havoc angelinaCall_#t~ret119#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~21#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume 0 == initPersonOnFloor_~floor#1;" "assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_0~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc angelinaCall_#t~ret119#1, angelinaCall_~tmp~21#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret86#1, timeShift_~tmp~16#1;havoc timeShift_~tmp~16#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret136#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~7#1;havoc getCurrentHeading_~retValue_acc~7#1;getCurrentHeading_~retValue_acc~7#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~7#1;" "__utac_acc__Specification13_spec__1_#t~ret136#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~7#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret136#1;havoc __utac_acc__Specification13_spec__1_#t~ret136#1;" "havoc __utac_acc__Specification13_spec__1_#t~ret136#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~5#1;havoc areDoorsOpen_~retValue_acc~5#1;areDoorsOpen_~retValue_acc~5#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~5#1;" "timeShift_#t~ret86#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~5#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~16#1 := timeShift_#t~ret86#1;havoc timeShift_#t~ret86#1;" "assume 0 != timeShift_~tmp~16#1;" "assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1;" "assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret137#1, __utac_acc__Specification13_spec__2_#t~ret138#1, __utac_acc__Specification13_spec__2_#t~ret139#1, __utac_acc__Specification13_spec__2_#t~ret140#1, __utac_acc__Specification13_spec__2_#t~ret141#1, __utac_acc__Specification13_spec__2_#t~ret142#1, __utac_acc__Specification13_spec__2_~tmp~30#1, __utac_acc__Specification13_spec__2_~tmp___0~13#1, __utac_acc__Specification13_spec__2_~tmp___1~8#1, __utac_acc__Specification13_spec__2_~tmp___2~6#1, __utac_acc__Specification13_spec__2_~tmp___3~5#1, __utac_acc__Specification13_spec__2_~tmp___4~3#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~8#1;havoc __utac_acc__Specification13_spec__2_~tmp~30#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~13#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~8#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~6#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~5#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~3#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~8#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~8#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 / 3);" "assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~8#1;" "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~19#1, existInLiftCallsInDirection_~i~0#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~19#1;havoc existInLiftCallsInDirection_~i~0#1;havoc existInLiftCallsInDirection_~i___0~0#1;" "assume 1 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i~0#1 := 0;existInLiftCallsInDirection_~i~0#1 := 1 + ~currentFloorID~0;" [2025-01-10 07:36:20,357 INFO L754 eck$LassoCheckResult]: Loop: "assume existInLiftCallsInDirection_~i~0#1 < 5;" "assume !(0 == existInLiftCallsInDirection_~i~0#1);" "assume !(1 == existInLiftCallsInDirection_~i~0#1);" "assume !(2 == existInLiftCallsInDirection_~i~0#1);" "assume !(3 == existInLiftCallsInDirection_~i~0#1);" "assume !(4 == existInLiftCallsInDirection_~i~0#1);" "existInLiftCallsInDirection_~i~0#1 := 1 + existInLiftCallsInDirection_~i~0#1;" [2025-01-10 07:36:20,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:20,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1530792437, now seen corresponding path program 1 times [2025-01-10 07:36:20,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:20,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369394733] [2025-01-10 07:36:20,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:36:20,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:20,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 07:36:20,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 07:36:20,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:20,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:36:20,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:36:20,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:36:20,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369394733] [2025-01-10 07:36:20,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369394733] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:36:20,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:36:20,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 07:36:20,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861746408] [2025-01-10 07:36:20,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:36:20,951 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:36:20,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:20,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1914144703, now seen corresponding path program 1 times [2025-01-10 07:36:20,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:20,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011177696] [2025-01-10 07:36:20,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:36:20,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:20,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:36:20,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:36:20,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:20,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:20,992 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:36:20,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:36:20,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:36:20,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:20,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:21,030 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:36:21,092 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:36:21,092 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:36:21,092 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:36:21,093 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:36:21,093 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:36:21,094 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:36:21,094 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:36:21,094 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:36:21,094 INFO L132 ssoRankerPreferences]: Filename of dumped script: elevator_spec13_product24.cil.c_Iteration1_Loop [2025-01-10 07:36:21,094 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:36:21,094 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:36:21,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:36:21,187 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:36:21,187 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:36:21,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:36:21,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:36:21,193 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:36:21,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-01-10 07:36:21,196 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:36:21,197 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:36:21,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-01-10 07:36:21,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:36:21,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:36:21,223 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:36:21,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-01-10 07:36:21,226 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:36:21,226 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:36:21,260 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:36:21,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-01-10 07:36:21,268 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:36:21,268 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:36:21,268 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:36:21,268 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:36:21,269 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:36:21,269 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:36:21,269 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:36:21,269 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:36:21,269 INFO L132 ssoRankerPreferences]: Filename of dumped script: elevator_spec13_product24.cil.c_Iteration1_Loop [2025-01-10 07:36:21,269 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:36:21,269 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:36:21,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:36:21,333 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:36:21,337 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:36:21,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:36:21,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:36:21,341 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:36:21,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-01-10 07:36:21,345 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 [2025-01-10 07:36:21,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:36:21,358 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:36:21,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:36:21,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:36:21,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:36:21,367 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:36:21,368 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:36:21,371 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:36:21,375 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-01-10 07:36:21,377 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-01-10 07:36:21,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:36:21,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:36:21,383 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:36:21,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-01-10 07:36:21,385 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:36:21,385 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:36:21,386 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:36:21,386 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_existInLiftCallsInDirection_~i~0#1) = -1*ULTIMATE.start_existInLiftCallsInDirection_~i~0#1 Supporting invariants [] [2025-01-10 07:36:21,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-01-10 07:36:21,397 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:36:21,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:21,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 07:36:21,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 07:36:21,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:21,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:36:21,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:36:21,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:36:21,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:36:21,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:36:21,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:21,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:36:21,631 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 07:36:21,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:36:21,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:36:21,831 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 [2025-01-10 07:36:21,876 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 17891 states, 17890 states have (on average 1.8766349916154277) internal successors, (33573), 17890 states have internal predecessors, (33573), 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 8 states, 8 states have (on average 5.125) internal successors, (41), 8 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) [2025-01-10 07:36:23,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-01-10 07:36:23,717 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 17891 states, 17890 states have (on average 1.8766349916154277) internal successors, (33573), 17890 states have internal predecessors, (33573), 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 8 states, 8 states have (on average 5.125) internal successors, (41), 8 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) Result 46626 states and 87436 transitions. Complement of second has 18 states. [2025-01-10 07:36:23,719 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 [2025-01-10 07:36:23,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 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) [2025-01-10 07:36:23,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 60516 transitions. [2025-01-10 07:36:23,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 60516 transitions. Stem has 34 letters. Loop has 7 letters. [2025-01-10 07:36:23,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:36:23,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 60516 transitions. Stem has 41 letters. Loop has 7 letters. [2025-01-10 07:36:23,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:36:23,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 60516 transitions. Stem has 34 letters. Loop has 14 letters. [2025-01-10 07:36:23,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:36:23,798 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46626 states and 87436 transitions. [2025-01-10 07:36:24,104 INFO L131 ngComponentsAnalysis]: Automaton has 60 accepting balls. 7957 [2025-01-10 07:36:24,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46626 states to 32186 states and 60339 transitions. [2025-01-10 07:36:24,361 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32156 [2025-01-10 07:36:24,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32158 [2025-01-10 07:36:24,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32186 states and 60339 transitions. [2025-01-10 07:36:24,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:36:24,417 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32186 states and 60339 transitions. [2025-01-10 07:36:24,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32186 states and 60339 transitions. [2025-01-10 07:36:25,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32186 to 32159. [2025-01-10 07:36:25,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32159 states, 32159 states have (on average 1.87502720855748) internal successors, (60299), 32158 states have internal predecessors, (60299), 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) [2025-01-10 07:36:25,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32159 states to 32159 states and 60299 transitions. [2025-01-10 07:36:25,608 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32159 states and 60299 transitions. [2025-01-10 07:36:25,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:36:25,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 07:36:25,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 07:36:25,616 INFO L87 Difference]: Start difference. First operand 32159 states and 60299 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) [2025-01-10 07:36:26,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:36:26,281 INFO L93 Difference]: Finished difference Result 32141 states and 60219 transitions. [2025-01-10 07:36:26,281 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32141 states and 60219 transitions. [2025-01-10 07:36:26,482 INFO L131 ngComponentsAnalysis]: Automaton has 60 accepting balls. 7941 [2025-01-10 07:36:26,645 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32141 states to 32132 states and 60210 transitions. [2025-01-10 07:36:26,646 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32114 [2025-01-10 07:36:26,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32114 [2025-01-10 07:36:26,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32132 states and 60210 transitions. [2025-01-10 07:36:26,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:36:26,699 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32132 states and 60210 transitions. [2025-01-10 07:36:26,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32132 states and 60210 transitions. [2025-01-10 07:36:27,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32132 to 17877. [2025-01-10 07:36:27,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17877 states, 17877 states have (on average 1.8738602673826705) internal successors, (33499), 17876 states have internal predecessors, (33499), 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) [2025-01-10 07:36:27,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17877 states to 17877 states and 33499 transitions. [2025-01-10 07:36:27,580 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17877 states and 33499 transitions. [2025-01-10 07:36:27,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 07:36:27,581 INFO L432 stractBuchiCegarLoop]: Abstraction has 17877 states and 33499 transitions. [2025-01-10 07:36:27,581 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:36:27,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17877 states and 33499 transitions. [2025-01-10 07:36:27,656 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4013 [2025-01-10 07:36:27,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:36:27,657 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:36:27,658 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] [2025-01-10 07:36:27,658 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:36:27,658 INFO L752 eck$LassoCheckResult]: Stem: "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);~head~0.base, ~head~0.offset := 0, 0;~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~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;~cleanupTimeShifts~0 := 12;~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;~prevDir~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret129#1, main_~retValue_acc~23#1, main_~tmp~27#1;havoc main_~retValue_acc~23#1;havoc main_~tmp~27#1;assume { :begin_inline_select_helpers } true;" "assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true;" "assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~31#1;havoc valid_product_~retValue_acc~31#1;valid_product_~retValue_acc~31#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~31#1;" "main_#t~ret129#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~31#1;assume { :end_inline_valid_product } true;main_~tmp~27#1 := main_#t~ret129#1;havoc main_#t~ret129#1;" "assume 0 != main_~tmp~27#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret118#1, aliceCall_~tmp~20#1;havoc aliceCall_~tmp~20#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~28#1;" "assume !(0 == getOrigin_~person#1);" "assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~28#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~28#1;" "aliceCall_#t~ret118#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~20#1 := aliceCall_#t~ret118#1;havoc aliceCall_#t~ret118#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~20#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume 0 == initPersonOnFloor_~floor#1;" "assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_0~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc aliceCall_#t~ret118#1, aliceCall_~tmp~20#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret119#1, angelinaCall_~tmp~21#1;havoc angelinaCall_~tmp~21#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~28#1;" "assume !(0 == getOrigin_~person#1);" "assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~28#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~28#1;" "angelinaCall_#t~ret119#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~21#1 := angelinaCall_#t~ret119#1;havoc angelinaCall_#t~ret119#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~21#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume 0 == initPersonOnFloor_~floor#1;" "assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_0~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc angelinaCall_#t~ret119#1, angelinaCall_~tmp~21#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret86#1, timeShift_~tmp~16#1;havoc timeShift_~tmp~16#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret136#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~7#1;havoc getCurrentHeading_~retValue_acc~7#1;getCurrentHeading_~retValue_acc~7#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~7#1;" "__utac_acc__Specification13_spec__1_#t~ret136#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~7#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret136#1;havoc __utac_acc__Specification13_spec__1_#t~ret136#1;" "havoc __utac_acc__Specification13_spec__1_#t~ret136#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~5#1;havoc areDoorsOpen_~retValue_acc~5#1;areDoorsOpen_~retValue_acc~5#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~5#1;" "timeShift_#t~ret86#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~5#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~16#1 := timeShift_#t~ret86#1;havoc timeShift_#t~ret86#1;" "assume 0 != timeShift_~tmp~16#1;" "assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1;" "assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret137#1, __utac_acc__Specification13_spec__2_#t~ret138#1, __utac_acc__Specification13_spec__2_#t~ret139#1, __utac_acc__Specification13_spec__2_#t~ret140#1, __utac_acc__Specification13_spec__2_#t~ret141#1, __utac_acc__Specification13_spec__2_#t~ret142#1, __utac_acc__Specification13_spec__2_~tmp~30#1, __utac_acc__Specification13_spec__2_~tmp___0~13#1, __utac_acc__Specification13_spec__2_~tmp___1~8#1, __utac_acc__Specification13_spec__2_~tmp___2~6#1, __utac_acc__Specification13_spec__2_~tmp___3~5#1, __utac_acc__Specification13_spec__2_~tmp___4~3#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~8#1;havoc __utac_acc__Specification13_spec__2_~tmp~30#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~13#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~8#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~6#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~5#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~3#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~8#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~8#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 / 3);" "assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~8#1;" "assume !(1 == ~prevDir~0);" "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~19#1, existInLiftCallsInDirection_~i~0#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~19#1;havoc existInLiftCallsInDirection_~i~0#1;havoc existInLiftCallsInDirection_~i___0~0#1;" "assume 1 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i~0#1 := 0;existInLiftCallsInDirection_~i~0#1 := 1 + ~currentFloorID~0;" [2025-01-10 07:36:27,659 INFO L754 eck$LassoCheckResult]: Loop: "assume existInLiftCallsInDirection_~i~0#1 < 5;" "assume !(0 == existInLiftCallsInDirection_~i~0#1);" "assume !(1 == existInLiftCallsInDirection_~i~0#1);" "assume !(2 == existInLiftCallsInDirection_~i~0#1);" "assume !(3 == existInLiftCallsInDirection_~i~0#1);" "assume !(4 == existInLiftCallsInDirection_~i~0#1);" "existInLiftCallsInDirection_~i~0#1 := 1 + existInLiftCallsInDirection_~i~0#1;" [2025-01-10 07:36:27,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:27,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1862493678, now seen corresponding path program 1 times [2025-01-10 07:36:27,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:27,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909550971] [2025-01-10 07:36:27,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:36:27,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:27,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 07:36:27,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 07:36:27,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:27,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:36:27,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:36:27,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:36:27,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909550971] [2025-01-10 07:36:27,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909550971] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:36:27,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:36:27,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 07:36:27,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643196657] [2025-01-10 07:36:27,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:36:27,865 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:36:27,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:27,865 INFO L85 PathProgramCache]: Analyzing trace with hash 726413483, now seen corresponding path program 1 times [2025-01-10 07:36:27,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:27,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173232864] [2025-01-10 07:36:27,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:36:27,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:27,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:36:27,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:36:27,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:27,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:27,890 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:36:27,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:36:27,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:36:27,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:27,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:27,912 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:36:27,954 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:36:27,954 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:36:27,955 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:36:27,955 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:36:27,955 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:36:27,955 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:36:27,955 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:36:27,955 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:36:27,955 INFO L132 ssoRankerPreferences]: Filename of dumped script: elevator_spec13_product24.cil.c_Iteration2_Loop [2025-01-10 07:36:27,955 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:36:27,955 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:36:27,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:36:28,010 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:36:28,011 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:36:28,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:36:28,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:36:28,013 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:36:28,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-01-10 07:36:28,017 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:36:28,017 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:36:28,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-01-10 07:36:28,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:36:28,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:36:28,044 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:36:28,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-01-10 07:36:28,047 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:36:28,048 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:36:28,074 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:36:28,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-01-10 07:36:28,079 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:36:28,079 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:36:28,079 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:36:28,079 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:36:28,079 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:36:28,079 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:36:28,080 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:36:28,080 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:36:28,080 INFO L132 ssoRankerPreferences]: Filename of dumped script: elevator_spec13_product24.cil.c_Iteration2_Loop [2025-01-10 07:36:28,080 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:36:28,080 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:36:28,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:36:28,132 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:36:28,132 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:36:28,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:36:28,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:36:28,136 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:36:28,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-01-10 07:36:28,138 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 [2025-01-10 07:36:28,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:36:28,150 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:36:28,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:36:28,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:36:28,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:36:28,152 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:36:28,152 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:36:28,154 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:36:28,157 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-01-10 07:36:28,157 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-01-10 07:36:28,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:36:28,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:36:28,160 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:36:28,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-01-10 07:36:28,163 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:36:28,163 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:36:28,164 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:36:28,164 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_existInLiftCallsInDirection_~i~0#1) = -1*ULTIMATE.start_existInLiftCallsInDirection_~i~0#1 Supporting invariants [] [2025-01-10 07:36:28,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-01-10 07:36:28,172 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:36:28,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:28,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 07:36:28,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 07:36:28,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:28,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:36:28,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:36:28,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:36:28,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:36:28,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:36:28,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:28,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:36:28,346 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 07:36:28,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:36:28,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:36:28,520 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 [2025-01-10 07:36:28,520 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17877 states and 33499 transitions. cyclomatic complexity: 15656 Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 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) [2025-01-10 07:36:29,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-01-10 07:36:29,687 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17877 states and 33499 transitions. cyclomatic complexity: 15656. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 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) Result 32188 states and 60295 transitions. Complement of second has 17 states. [2025-01-10 07:36:29,688 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 [2025-01-10 07:36:29,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 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) [2025-01-10 07:36:29,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 33485 transitions. [2025-01-10 07:36:29,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 33485 transitions. Stem has 37 letters. Loop has 7 letters. [2025-01-10 07:36:29,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:36:29,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 33485 transitions. Stem has 44 letters. Loop has 7 letters. [2025-01-10 07:36:29,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:36:29,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 33485 transitions. Stem has 37 letters. Loop has 14 letters. [2025-01-10 07:36:29,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:36:29,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32188 states and 60295 transitions. [2025-01-10 07:36:29,862 INFO L131 ngComponentsAnalysis]: Automaton has 60 accepting balls. 7955 [2025-01-10 07:36:30,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32188 states to 32182 states and 60289 transitions. [2025-01-10 07:36:30,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32134 [2025-01-10 07:36:30,051 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32136 [2025-01-10 07:36:30,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32182 states and 60289 transitions. [2025-01-10 07:36:30,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:36:30,052 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32182 states and 60289 transitions. [2025-01-10 07:36:30,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32182 states and 60289 transitions. [2025-01-10 07:36:30,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32182 to 17900. [2025-01-10 07:36:30,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17900 states, 17900 states have (on average 1.8736312849162011) internal successors, (33538), 17899 states have internal predecessors, (33538), 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) [2025-01-10 07:36:30,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17900 states to 17900 states and 33538 transitions. [2025-01-10 07:36:30,426 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17900 states and 33538 transitions. [2025-01-10 07:36:30,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:36:30,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 07:36:30,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 07:36:30,427 INFO L87 Difference]: Start difference. First operand 17900 states and 33538 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) [2025-01-10 07:36:31,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:36:31,042 INFO L93 Difference]: Finished difference Result 17918 states and 33556 transitions. [2025-01-10 07:36:31,042 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17918 states and 33556 transitions. [2025-01-10 07:36:31,119 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4017 [2025-01-10 07:36:31,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17918 states to 17918 states and 33556 transitions. [2025-01-10 07:36:31,195 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17882 [2025-01-10 07:36:31,210 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17882 [2025-01-10 07:36:31,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17918 states and 33556 transitions. [2025-01-10 07:36:31,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:36:31,211 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17918 states and 33556 transitions. [2025-01-10 07:36:31,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17918 states and 33556 transitions. [2025-01-10 07:36:31,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17918 to 17915. [2025-01-10 07:36:31,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17915 states, 17915 states have (on average 1.8728998046329892) internal successors, (33553), 17914 states have internal predecessors, (33553), 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) [2025-01-10 07:36:31,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17915 states to 17915 states and 33553 transitions. [2025-01-10 07:36:31,477 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17915 states and 33553 transitions. [2025-01-10 07:36:31,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 07:36:31,479 INFO L432 stractBuchiCegarLoop]: Abstraction has 17915 states and 33553 transitions. [2025-01-10 07:36:31,479 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-01-10 07:36:31,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17915 states and 33553 transitions. [2025-01-10 07:36:31,537 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4017 [2025-01-10 07:36:31,538 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:36:31,538 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:36:31,540 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] [2025-01-10 07:36:31,540 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:36:31,540 INFO L752 eck$LassoCheckResult]: Stem: "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);~head~0.base, ~head~0.offset := 0, 0;~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~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;~cleanupTimeShifts~0 := 12;~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;~prevDir~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret129#1, main_~retValue_acc~23#1, main_~tmp~27#1;havoc main_~retValue_acc~23#1;havoc main_~tmp~27#1;assume { :begin_inline_select_helpers } true;" "assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true;" "assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~31#1;havoc valid_product_~retValue_acc~31#1;valid_product_~retValue_acc~31#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~31#1;" "main_#t~ret129#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~31#1;assume { :end_inline_valid_product } true;main_~tmp~27#1 := main_#t~ret129#1;havoc main_#t~ret129#1;" "assume 0 != main_~tmp~27#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret118#1, aliceCall_~tmp~20#1;havoc aliceCall_~tmp~20#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~28#1;" "assume !(0 == getOrigin_~person#1);" "assume !(1 == getOrigin_~person#1);" "assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~28#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~28#1;" "aliceCall_#t~ret118#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~20#1 := aliceCall_#t~ret118#1;havoc aliceCall_#t~ret118#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~20#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume 0 == initPersonOnFloor_~floor#1;" "assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_0~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc aliceCall_#t~ret118#1, aliceCall_~tmp~20#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret119#1, angelinaCall_~tmp~21#1;havoc angelinaCall_~tmp~21#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~28#1;" "assume !(0 == getOrigin_~person#1);" "assume !(1 == getOrigin_~person#1);" "assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~28#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~28#1;" "angelinaCall_#t~ret119#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~21#1 := angelinaCall_#t~ret119#1;havoc angelinaCall_#t~ret119#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~21#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume 0 == initPersonOnFloor_~floor#1;" "assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_0~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc angelinaCall_#t~ret119#1, angelinaCall_~tmp~21#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret86#1, timeShift_~tmp~16#1;havoc timeShift_~tmp~16#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret136#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~7#1;havoc getCurrentHeading_~retValue_acc~7#1;getCurrentHeading_~retValue_acc~7#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~7#1;" "__utac_acc__Specification13_spec__1_#t~ret136#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~7#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret136#1;havoc __utac_acc__Specification13_spec__1_#t~ret136#1;" "havoc __utac_acc__Specification13_spec__1_#t~ret136#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~5#1;havoc areDoorsOpen_~retValue_acc~5#1;areDoorsOpen_~retValue_acc~5#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~5#1;" "timeShift_#t~ret86#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~5#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~16#1 := timeShift_#t~ret86#1;havoc timeShift_#t~ret86#1;" "assume 0 != timeShift_~tmp~16#1;" "assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1;" "assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret137#1, __utac_acc__Specification13_spec__2_#t~ret138#1, __utac_acc__Specification13_spec__2_#t~ret139#1, __utac_acc__Specification13_spec__2_#t~ret140#1, __utac_acc__Specification13_spec__2_#t~ret141#1, __utac_acc__Specification13_spec__2_#t~ret142#1, __utac_acc__Specification13_spec__2_~tmp~30#1, __utac_acc__Specification13_spec__2_~tmp___0~13#1, __utac_acc__Specification13_spec__2_~tmp___1~8#1, __utac_acc__Specification13_spec__2_~tmp___2~6#1, __utac_acc__Specification13_spec__2_~tmp___3~5#1, __utac_acc__Specification13_spec__2_~tmp___4~3#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~8#1;havoc __utac_acc__Specification13_spec__2_~tmp~30#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~13#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~8#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~6#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~5#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~3#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~8#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~8#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 / 3);" "assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~8#1;" "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~19#1, existInLiftCallsInDirection_~i~0#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~19#1;havoc existInLiftCallsInDirection_~i~0#1;havoc existInLiftCallsInDirection_~i___0~0#1;" "assume 1 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i~0#1 := 0;existInLiftCallsInDirection_~i~0#1 := 1 + ~currentFloorID~0;" "assume existInLiftCallsInDirection_~i~0#1 < 5;" [2025-01-10 07:36:31,544 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == existInLiftCallsInDirection_~i~0#1;" "assume !(0 != ~floorButtons_0~0);" "assume !(1 == existInLiftCallsInDirection_~i~0#1);" "assume !(2 == existInLiftCallsInDirection_~i~0#1);" "assume !(3 == existInLiftCallsInDirection_~i~0#1);" "assume !(4 == existInLiftCallsInDirection_~i~0#1);" "existInLiftCallsInDirection_~i~0#1 := 1 + existInLiftCallsInDirection_~i~0#1;" "assume existInLiftCallsInDirection_~i~0#1 < 5;" [2025-01-10 07:36:31,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:31,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1342134621, now seen corresponding path program 1 times [2025-01-10 07:36:31,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:31,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443404150] [2025-01-10 07:36:31,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:36:31,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:31,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 07:36:31,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 07:36:31,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:31,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:36:31,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:36:31,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:36:31,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443404150] [2025-01-10 07:36:31,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443404150] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:36:31,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:36:31,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 07:36:31,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891960449] [2025-01-10 07:36:31,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:36:31,646 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:36:31,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:31,646 INFO L85 PathProgramCache]: Analyzing trace with hash -699119679, now seen corresponding path program 1 times [2025-01-10 07:36:31,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:31,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66602392] [2025-01-10 07:36:31,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:36:31,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:31,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:36:31,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:36:31,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:31,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:31,664 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:36:31,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:36:31,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:36:31,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:31,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:31,679 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:36:31,703 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:36:31,703 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:36:31,703 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:36:31,703 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:36:31,703 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:36:31,704 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:36:31,704 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:36:31,704 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:36:31,704 INFO L132 ssoRankerPreferences]: Filename of dumped script: elevator_spec13_product24.cil.c_Iteration3_Loop [2025-01-10 07:36:31,704 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:36:31,704 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:36:31,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:36:31,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:36:31,731 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:36:31,731 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:36:31,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:36:31,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:36:31,734 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:36:31,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-01-10 07:36:31,737 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:36:31,737 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:36:31,750 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:36:31,751 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~floorButtons_0~0=0} Honda state: {~floorButtons_0~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:36:31,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-01-10 07:36:31,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:36:31,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:36:31,760 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:36:31,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-01-10 07:36:31,763 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:36:31,763 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:36:31,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-01-10 07:36:31,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:36:31,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:36:31,788 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:36:31,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-01-10 07:36:31,791 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:36:31,791 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:36:31,805 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:36:31,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-01-10 07:36:31,812 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:36:31,812 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:36:31,812 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:36:31,813 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:36:31,813 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:36:31,813 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:36:31,813 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:36:31,813 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:36:31,813 INFO L132 ssoRankerPreferences]: Filename of dumped script: elevator_spec13_product24.cil.c_Iteration3_Loop [2025-01-10 07:36:31,813 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:36:31,813 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:36:31,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:36:31,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:36:31,844 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:36:31,844 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:36:31,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:36:31,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:36:31,847 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:36:31,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-01-10 07:36:31,850 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 [2025-01-10 07:36:31,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:36:31,861 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:36:31,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:36:31,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:36:31,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:36:31,863 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:36:31,863 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:36:31,864 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:36:31,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-01-10 07:36:31,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:36:31,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:36:31,874 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:36:31,877 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 [2025-01-10 07:36:31,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-01-10 07:36:31,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:36:31,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:36:31,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:36:31,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:36:31,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:36:31,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:36:31,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:36:31,892 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:36:31,894 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 07:36:31,895 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-01-10 07:36:31,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:36:31,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:36:31,897 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:36:31,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-01-10 07:36:31,900 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:36:31,900 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:36:31,900 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:36:31,900 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_existInLiftCallsInDirection_~i~0#1) = -2*ULTIMATE.start_existInLiftCallsInDirection_~i~0#1 + 1 Supporting invariants [] [2025-01-10 07:36:31,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-01-10 07:36:31,908 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:36:31,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:31,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 07:36:32,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-01-10 07:36:32,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 07:36:32,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:32,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:36:32,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:36:32,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:36:32,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:36:32,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:36:32,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:32,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:36:32,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:36:32,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:36:32,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:36:32,230 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 [2025-01-10 07:36:32,230 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17915 states and 33553 transitions. cyclomatic complexity: 15673 Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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) [2025-01-10 07:36:33,629 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17915 states and 33553 transitions. cyclomatic complexity: 15673. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 46534 states and 87146 transitions. Complement of second has 8 states. [2025-01-10 07:36:33,630 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 [2025-01-10 07:36:33,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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) [2025-01-10 07:36:33,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60207 transitions. [2025-01-10 07:36:33,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 60207 transitions. Stem has 39 letters. Loop has 8 letters. [2025-01-10 07:36:33,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:36:33,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 60207 transitions. Stem has 47 letters. Loop has 8 letters. [2025-01-10 07:36:33,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:36:33,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 60207 transitions. Stem has 39 letters. Loop has 16 letters. [2025-01-10 07:36:33,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:36:33,682 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46534 states and 87146 transitions. [2025-01-10 07:36:33,850 INFO L131 ngComponentsAnalysis]: Automaton has 60 accepting balls. 7943 [2025-01-10 07:36:34,197 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46534 states to 32225 states and 60342 transitions. [2025-01-10 07:36:34,198 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32142 [2025-01-10 07:36:34,216 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32146 [2025-01-10 07:36:34,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32225 states and 60342 transitions. [2025-01-10 07:36:34,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:36:34,241 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32225 states and 60342 transitions. [2025-01-10 07:36:34,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32225 states and 60342 transitions. [2025-01-10 07:36:34,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32225 to 17959. [2025-01-10 07:36:34,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17959 states, 17959 states have (on average 1.8719305083801994) internal successors, (33618), 17958 states have internal predecessors, (33618), 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) [2025-01-10 07:36:34,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17959 states to 17959 states and 33618 transitions. [2025-01-10 07:36:34,561 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17959 states and 33618 transitions. [2025-01-10 07:36:34,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:36:34,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 07:36:34,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 07:36:34,562 INFO L87 Difference]: Start difference. First operand 17959 states and 33618 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) [2025-01-10 07:36:34,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:36:34,770 INFO L93 Difference]: Finished difference Result 17925 states and 33550 transitions. [2025-01-10 07:36:34,770 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17925 states and 33550 transitions. [2025-01-10 07:36:34,849 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4015 [2025-01-10 07:36:34,916 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17925 states to 17925 states and 33550 transitions. [2025-01-10 07:36:34,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17846 [2025-01-10 07:36:34,935 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17846 [2025-01-10 07:36:34,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17925 states and 33550 transitions. [2025-01-10 07:36:34,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:36:34,935 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17925 states and 33550 transitions. [2025-01-10 07:36:34,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17925 states and 33550 transitions. [2025-01-10 07:36:35,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17925 to 17925. [2025-01-10 07:36:35,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17925 states, 17925 states have (on average 1.8716875871687588) internal successors, (33550), 17924 states have internal predecessors, (33550), 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) [2025-01-10 07:36:35,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17925 states to 17925 states and 33550 transitions. [2025-01-10 07:36:35,450 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17925 states and 33550 transitions. [2025-01-10 07:36:35,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 07:36:35,452 INFO L432 stractBuchiCegarLoop]: Abstraction has 17925 states and 33550 transitions. [2025-01-10 07:36:35,452 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-01-10 07:36:35,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17925 states and 33550 transitions. [2025-01-10 07:36:35,517 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4015 [2025-01-10 07:36:35,517 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:36:35,517 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:36:35,518 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] [2025-01-10 07:36:35,518 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 07:36:35,518 INFO L752 eck$LassoCheckResult]: Stem: "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);~head~0.base, ~head~0.offset := 0, 0;~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~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;~cleanupTimeShifts~0 := 12;~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;~prevDir~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret129#1, main_~retValue_acc~23#1, main_~tmp~27#1;havoc main_~retValue_acc~23#1;havoc main_~tmp~27#1;assume { :begin_inline_select_helpers } true;" "assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true;" "assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~31#1;havoc valid_product_~retValue_acc~31#1;valid_product_~retValue_acc~31#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~31#1;" "main_#t~ret129#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~31#1;assume { :end_inline_valid_product } true;main_~tmp~27#1 := main_#t~ret129#1;havoc main_#t~ret129#1;" "assume 0 != main_~tmp~27#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret118#1, aliceCall_~tmp~20#1;havoc aliceCall_~tmp~20#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~28#1;" "assume !(0 == getOrigin_~person#1);" "assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~28#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~28#1;" "aliceCall_#t~ret118#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~20#1 := aliceCall_#t~ret118#1;havoc aliceCall_#t~ret118#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~20#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume !(0 == initPersonOnFloor_~floor#1);" "assume !(1 == initPersonOnFloor_~floor#1);" "assume !(2 == initPersonOnFloor_~floor#1);" "assume 3 == initPersonOnFloor_~floor#1;" "assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_3~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc aliceCall_#t~ret118#1, aliceCall_~tmp~20#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret119#1, angelinaCall_~tmp~21#1;havoc angelinaCall_~tmp~21#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~28#1;" "assume !(0 == getOrigin_~person#1);" "assume !(1 == getOrigin_~person#1);" "assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~28#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~28#1;" "angelinaCall_#t~ret119#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~21#1 := angelinaCall_#t~ret119#1;havoc angelinaCall_#t~ret119#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~21#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume 0 == initPersonOnFloor_~floor#1;" "assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_0~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc angelinaCall_#t~ret119#1, angelinaCall_~tmp~21#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret86#1, timeShift_~tmp~16#1;havoc timeShift_~tmp~16#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret136#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~7#1;havoc getCurrentHeading_~retValue_acc~7#1;getCurrentHeading_~retValue_acc~7#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~7#1;" "__utac_acc__Specification13_spec__1_#t~ret136#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~7#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret136#1;havoc __utac_acc__Specification13_spec__1_#t~ret136#1;" "havoc __utac_acc__Specification13_spec__1_#t~ret136#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~5#1;havoc areDoorsOpen_~retValue_acc~5#1;areDoorsOpen_~retValue_acc~5#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~5#1;" "timeShift_#t~ret86#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~5#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~16#1 := timeShift_#t~ret86#1;havoc timeShift_#t~ret86#1;" "assume 0 != timeShift_~tmp~16#1;" "assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1;" "assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret137#1, __utac_acc__Specification13_spec__2_#t~ret138#1, __utac_acc__Specification13_spec__2_#t~ret139#1, __utac_acc__Specification13_spec__2_#t~ret140#1, __utac_acc__Specification13_spec__2_#t~ret141#1, __utac_acc__Specification13_spec__2_#t~ret142#1, __utac_acc__Specification13_spec__2_~tmp~30#1, __utac_acc__Specification13_spec__2_~tmp___0~13#1, __utac_acc__Specification13_spec__2_~tmp___1~8#1, __utac_acc__Specification13_spec__2_~tmp___2~6#1, __utac_acc__Specification13_spec__2_~tmp___3~5#1, __utac_acc__Specification13_spec__2_~tmp___4~3#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~8#1;havoc __utac_acc__Specification13_spec__2_~tmp~30#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~13#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~8#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~6#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~5#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~3#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~8#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~8#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 / 3);" "assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~8#1;" "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~19#1, existInLiftCallsInDirection_~i~0#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~19#1;havoc existInLiftCallsInDirection_~i~0#1;havoc existInLiftCallsInDirection_~i___0~0#1;" "assume !(1 == existInLiftCallsInDirection_~d#1);" "assume 0 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i___0~0#1 := 0;existInLiftCallsInDirection_~i___0~0#1 := ~currentFloorID~0 - 1;" [2025-01-10 07:36:35,519 INFO L754 eck$LassoCheckResult]: Loop: "assume existInLiftCallsInDirection_~i___0~0#1 >= 0;" "existInLiftCallsInDirection_~i___0~0#1 := 1 + ~currentFloorID~0;" "assume !(existInLiftCallsInDirection_~i___0~0#1 < 5);" "existInLiftCallsInDirection_~i___0~0#1 := existInLiftCallsInDirection_~i___0~0#1 - 1;" [2025-01-10 07:36:35,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:35,520 INFO L85 PathProgramCache]: Analyzing trace with hash 332393452, now seen corresponding path program 1 times [2025-01-10 07:36:35,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:35,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519698632] [2025-01-10 07:36:35,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:36:35,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:35,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-10 07:36:35,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 07:36:35,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:35,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:36:35,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:36:35,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:36:35,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519698632] [2025-01-10 07:36:35,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519698632] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:36:35,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:36:35,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 07:36:35,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339594408] [2025-01-10 07:36:35,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:36:35,660 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:36:35,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:35,660 INFO L85 PathProgramCache]: Analyzing trace with hash 514712802, now seen corresponding path program 1 times [2025-01-10 07:36:35,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:35,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367438056] [2025-01-10 07:36:35,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:36:35,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:35,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:36:35,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:36:35,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:35,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:35,685 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:36:35,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:36:35,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:36:35,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:35,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:35,703 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:36:35,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:36:35,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 07:36:35,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 07:36:35,728 INFO L87 Difference]: Start difference. First operand 17925 states and 33550 transitions. cyclomatic complexity: 15662 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) [2025-01-10 07:36:36,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:36:36,480 INFO L93 Difference]: Finished difference Result 17933 states and 33557 transitions. [2025-01-10 07:36:36,480 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17933 states and 33557 transitions. [2025-01-10 07:36:36,570 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4015 [2025-01-10 07:36:36,643 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17933 states to 17933 states and 33557 transitions. [2025-01-10 07:36:36,644 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17854 [2025-01-10 07:36:36,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17854 [2025-01-10 07:36:36,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17933 states and 33557 transitions. [2025-01-10 07:36:36,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:36:36,664 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17933 states and 33557 transitions. [2025-01-10 07:36:36,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17933 states and 33557 transitions. [2025-01-10 07:36:36,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17933 to 17925. [2025-01-10 07:36:36,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17925 states, 17925 states have (on average 1.871352859135286) internal successors, (33544), 17924 states have internal predecessors, (33544), 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) [2025-01-10 07:36:36,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17925 states to 17925 states and 33544 transitions. [2025-01-10 07:36:36,978 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17925 states and 33544 transitions. [2025-01-10 07:36:36,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 07:36:36,979 INFO L432 stractBuchiCegarLoop]: Abstraction has 17925 states and 33544 transitions. [2025-01-10 07:36:36,979 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-01-10 07:36:36,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17925 states and 33544 transitions. [2025-01-10 07:36:37,038 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4015 [2025-01-10 07:36:37,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:36:37,038 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:36:37,038 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] [2025-01-10 07:36:37,038 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 07:36:37,039 INFO L752 eck$LassoCheckResult]: Stem: "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);~head~0.base, ~head~0.offset := 0, 0;~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~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;~cleanupTimeShifts~0 := 12;~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;~prevDir~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret129#1, main_~retValue_acc~23#1, main_~tmp~27#1;havoc main_~retValue_acc~23#1;havoc main_~tmp~27#1;assume { :begin_inline_select_helpers } true;" "assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true;" "assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~31#1;havoc valid_product_~retValue_acc~31#1;valid_product_~retValue_acc~31#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~31#1;" "main_#t~ret129#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~31#1;assume { :end_inline_valid_product } true;main_~tmp~27#1 := main_#t~ret129#1;havoc main_#t~ret129#1;" "assume 0 != main_~tmp~27#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret118#1, aliceCall_~tmp~20#1;havoc aliceCall_~tmp~20#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~28#1;" "assume !(0 == getOrigin_~person#1);" "assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~28#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~28#1;" "aliceCall_#t~ret118#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~20#1 := aliceCall_#t~ret118#1;havoc aliceCall_#t~ret118#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~20#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume !(0 == initPersonOnFloor_~floor#1);" "assume !(1 == initPersonOnFloor_~floor#1);" "assume !(2 == initPersonOnFloor_~floor#1);" "assume 3 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_3~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc aliceCall_#t~ret118#1, aliceCall_~tmp~20#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret119#1, angelinaCall_~tmp~21#1;havoc angelinaCall_~tmp~21#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~28#1;" "assume !(0 == getOrigin_~person#1);" "assume !(1 == getOrigin_~person#1);" "assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~28#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~28#1;" "angelinaCall_#t~ret119#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~21#1 := angelinaCall_#t~ret119#1;havoc angelinaCall_#t~ret119#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~21#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume 0 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_0~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc angelinaCall_#t~ret119#1, angelinaCall_~tmp~21#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret86#1, timeShift_~tmp~16#1;havoc timeShift_~tmp~16#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret136#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~7#1;havoc getCurrentHeading_~retValue_acc~7#1;getCurrentHeading_~retValue_acc~7#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~7#1;" "__utac_acc__Specification13_spec__1_#t~ret136#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~7#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret136#1;havoc __utac_acc__Specification13_spec__1_#t~ret136#1;" "havoc __utac_acc__Specification13_spec__1_#t~ret136#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~5#1;havoc areDoorsOpen_~retValue_acc~5#1;areDoorsOpen_~retValue_acc~5#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~5#1;" "timeShift_#t~ret86#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~5#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~16#1 := timeShift_#t~ret86#1;havoc timeShift_#t~ret86#1;" "assume 0 != timeShift_~tmp~16#1;" "assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1;" "assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret137#1, __utac_acc__Specification13_spec__2_#t~ret138#1, __utac_acc__Specification13_spec__2_#t~ret139#1, __utac_acc__Specification13_spec__2_#t~ret140#1, __utac_acc__Specification13_spec__2_#t~ret141#1, __utac_acc__Specification13_spec__2_#t~ret142#1, __utac_acc__Specification13_spec__2_~tmp~30#1, __utac_acc__Specification13_spec__2_~tmp___0~13#1, __utac_acc__Specification13_spec__2_~tmp___1~8#1, __utac_acc__Specification13_spec__2_~tmp___2~6#1, __utac_acc__Specification13_spec__2_~tmp___3~5#1, __utac_acc__Specification13_spec__2_~tmp___4~3#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~8#1;havoc __utac_acc__Specification13_spec__2_~tmp~30#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~13#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~8#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~6#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~5#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~3#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~8#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~8#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 / 3);" "assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~8#1;" "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~19#1, existInLiftCallsInDirection_~i~0#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~19#1;havoc existInLiftCallsInDirection_~i~0#1;havoc existInLiftCallsInDirection_~i___0~0#1;" "assume !(1 == existInLiftCallsInDirection_~d#1);" "assume 0 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i___0~0#1 := 0;existInLiftCallsInDirection_~i___0~0#1 := ~currentFloorID~0 - 1;" [2025-01-10 07:36:37,039 INFO L754 eck$LassoCheckResult]: Loop: "assume existInLiftCallsInDirection_~i___0~0#1 >= 0;" "existInLiftCallsInDirection_~i___0~0#1 := 1 + ~currentFloorID~0;" "assume !(existInLiftCallsInDirection_~i___0~0#1 < 5);" "existInLiftCallsInDirection_~i___0~0#1 := existInLiftCallsInDirection_~i___0~0#1 - 1;" [2025-01-10 07:36:37,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:37,040 INFO L85 PathProgramCache]: Analyzing trace with hash 553838000, now seen corresponding path program 1 times [2025-01-10 07:36:37,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:37,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884856971] [2025-01-10 07:36:37,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:36:37,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:37,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-10 07:36:37,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-10 07:36:37,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:37,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:36:37,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:36:37,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:36:37,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884856971] [2025-01-10 07:36:37,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884856971] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:36:37,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:36:37,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 07:36:37,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748355037] [2025-01-10 07:36:37,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:36:37,292 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:36:37,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:37,292 INFO L85 PathProgramCache]: Analyzing trace with hash 514712802, now seen corresponding path program 2 times [2025-01-10 07:36:37,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:37,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873643197] [2025-01-10 07:36:37,292 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:36:37,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:37,309 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:36:37,310 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:36:37,311 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:36:37,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:37,311 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:36:37,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:36:37,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:36:37,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:37,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:37,333 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:36:37,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:36:37,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 07:36:37,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 07:36:37,356 INFO L87 Difference]: Start difference. First operand 17925 states and 33544 transitions. cyclomatic complexity: 15656 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) [2025-01-10 07:36:37,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:36:37,682 INFO L93 Difference]: Finished difference Result 17929 states and 33547 transitions. [2025-01-10 07:36:37,682 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17929 states and 33547 transitions. [2025-01-10 07:36:37,753 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4015 [2025-01-10 07:36:37,823 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17929 states to 17929 states and 33547 transitions. [2025-01-10 07:36:37,824 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17850 [2025-01-10 07:36:37,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17850 [2025-01-10 07:36:37,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17929 states and 33547 transitions. [2025-01-10 07:36:37,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:36:37,844 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17929 states and 33547 transitions. [2025-01-10 07:36:37,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17929 states and 33547 transitions. [2025-01-10 07:36:38,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17929 to 17929. [2025-01-10 07:36:38,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17929 states, 17929 states have (on average 1.871102682804395) internal successors, (33547), 17928 states have internal predecessors, (33547), 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) [2025-01-10 07:36:38,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17929 states to 17929 states and 33547 transitions. [2025-01-10 07:36:38,341 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17929 states and 33547 transitions. [2025-01-10 07:36:38,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 07:36:38,342 INFO L432 stractBuchiCegarLoop]: Abstraction has 17929 states and 33547 transitions. [2025-01-10 07:36:38,343 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-01-10 07:36:38,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17929 states and 33547 transitions. [2025-01-10 07:36:38,409 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4015 [2025-01-10 07:36:38,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:36:38,410 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:36:38,410 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] [2025-01-10 07:36:38,413 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 07:36:38,413 INFO L752 eck$LassoCheckResult]: Stem: "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);~head~0.base, ~head~0.offset := 0, 0;~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~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;~cleanupTimeShifts~0 := 12;~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;~prevDir~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret129#1, main_~retValue_acc~23#1, main_~tmp~27#1;havoc main_~retValue_acc~23#1;havoc main_~tmp~27#1;assume { :begin_inline_select_helpers } true;" "assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true;" "assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~31#1;havoc valid_product_~retValue_acc~31#1;valid_product_~retValue_acc~31#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~31#1;" "main_#t~ret129#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~31#1;assume { :end_inline_valid_product } true;main_~tmp~27#1 := main_#t~ret129#1;havoc main_#t~ret129#1;" "assume 0 != main_~tmp~27#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret118#1, aliceCall_~tmp~20#1;havoc aliceCall_~tmp~20#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~28#1;" "assume !(0 == getOrigin_~person#1);" "assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~28#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~28#1;" "aliceCall_#t~ret118#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~20#1 := aliceCall_#t~ret118#1;havoc aliceCall_#t~ret118#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~20#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume !(0 == initPersonOnFloor_~floor#1);" "assume !(1 == initPersonOnFloor_~floor#1);" "assume !(2 == initPersonOnFloor_~floor#1);" "assume 3 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_3~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume !(0 == callOnFloor_~floorID#1);" "assume 1 == callOnFloor_~floorID#1;~calls_1~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc aliceCall_#t~ret118#1, aliceCall_~tmp~20#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret119#1, angelinaCall_~tmp~21#1;havoc angelinaCall_~tmp~21#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~28#1;" "assume !(0 == getOrigin_~person#1);" "assume !(1 == getOrigin_~person#1);" "assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~28#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~28#1;" "angelinaCall_#t~ret119#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~21#1 := angelinaCall_#t~ret119#1;havoc angelinaCall_#t~ret119#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~21#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume 0 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_0~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc angelinaCall_#t~ret119#1, angelinaCall_~tmp~21#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret86#1, timeShift_~tmp~16#1;havoc timeShift_~tmp~16#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret136#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~7#1;havoc getCurrentHeading_~retValue_acc~7#1;getCurrentHeading_~retValue_acc~7#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~7#1;" "__utac_acc__Specification13_spec__1_#t~ret136#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~7#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret136#1;havoc __utac_acc__Specification13_spec__1_#t~ret136#1;" "havoc __utac_acc__Specification13_spec__1_#t~ret136#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~5#1;havoc areDoorsOpen_~retValue_acc~5#1;areDoorsOpen_~retValue_acc~5#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~5#1;" "timeShift_#t~ret86#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~5#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~16#1 := timeShift_#t~ret86#1;havoc timeShift_#t~ret86#1;" "assume 0 != timeShift_~tmp~16#1;" "assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1;" "assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret137#1, __utac_acc__Specification13_spec__2_#t~ret138#1, __utac_acc__Specification13_spec__2_#t~ret139#1, __utac_acc__Specification13_spec__2_#t~ret140#1, __utac_acc__Specification13_spec__2_#t~ret141#1, __utac_acc__Specification13_spec__2_#t~ret142#1, __utac_acc__Specification13_spec__2_~tmp~30#1, __utac_acc__Specification13_spec__2_~tmp___0~13#1, __utac_acc__Specification13_spec__2_~tmp___1~8#1, __utac_acc__Specification13_spec__2_~tmp___2~6#1, __utac_acc__Specification13_spec__2_~tmp___3~5#1, __utac_acc__Specification13_spec__2_~tmp___4~3#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~8#1;havoc __utac_acc__Specification13_spec__2_~tmp~30#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~13#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~8#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~6#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~5#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~3#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~8#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~8#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 / 3);" "assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~8#1;" "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~19#1, existInLiftCallsInDirection_~i~0#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~19#1;havoc existInLiftCallsInDirection_~i~0#1;havoc existInLiftCallsInDirection_~i___0~0#1;" "assume !(1 == existInLiftCallsInDirection_~d#1);" "assume 0 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i___0~0#1 := 0;existInLiftCallsInDirection_~i___0~0#1 := ~currentFloorID~0 - 1;" [2025-01-10 07:36:38,413 INFO L754 eck$LassoCheckResult]: Loop: "assume existInLiftCallsInDirection_~i___0~0#1 >= 0;" "existInLiftCallsInDirection_~i___0~0#1 := 1 + ~currentFloorID~0;" "assume !(existInLiftCallsInDirection_~i___0~0#1 < 5);" "existInLiftCallsInDirection_~i___0~0#1 := existInLiftCallsInDirection_~i___0~0#1 - 1;" [2025-01-10 07:36:38,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:38,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1251686901, now seen corresponding path program 1 times [2025-01-10 07:36:38,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:38,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175879137] [2025-01-10 07:36:38,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:36:38,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:38,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 07:36:38,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 07:36:38,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:38,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:36:38,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:36:38,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:36:38,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175879137] [2025-01-10 07:36:38,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175879137] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:36:38,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:36:38,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 07:36:38,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706536011] [2025-01-10 07:36:38,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:36:38,503 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:36:38,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:38,503 INFO L85 PathProgramCache]: Analyzing trace with hash 514712802, now seen corresponding path program 3 times [2025-01-10 07:36:38,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:38,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348851843] [2025-01-10 07:36:38,503 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:36:38,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:38,517 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:36:38,518 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:36:38,518 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:36:38,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:38,519 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:36:38,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:36:38,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:36:38,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:38,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:38,531 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:36:38,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:36:38,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 07:36:38,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 07:36:38,551 INFO L87 Difference]: Start difference. First operand 17929 states and 33547 transitions. cyclomatic complexity: 15655 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) [2025-01-10 07:36:38,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:36:38,893 INFO L93 Difference]: Finished difference Result 17935 states and 33552 transitions. [2025-01-10 07:36:38,893 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17935 states and 33552 transitions. [2025-01-10 07:36:38,958 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4015 [2025-01-10 07:36:39,216 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17935 states to 17935 states and 33552 transitions. [2025-01-10 07:36:39,216 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17856 [2025-01-10 07:36:39,228 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17856 [2025-01-10 07:36:39,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17935 states and 33552 transitions. [2025-01-10 07:36:39,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:36:39,229 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17935 states and 33552 transitions. [2025-01-10 07:36:39,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17935 states and 33552 transitions. [2025-01-10 07:36:39,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17935 to 17935. [2025-01-10 07:36:39,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17935 states, 17935 states have (on average 1.8707555059938668) internal successors, (33552), 17934 states have internal predecessors, (33552), 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) [2025-01-10 07:36:39,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17935 states to 17935 states and 33552 transitions. [2025-01-10 07:36:39,471 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17935 states and 33552 transitions. [2025-01-10 07:36:39,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 07:36:39,472 INFO L432 stractBuchiCegarLoop]: Abstraction has 17935 states and 33552 transitions. [2025-01-10 07:36:39,472 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-01-10 07:36:39,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17935 states and 33552 transitions. [2025-01-10 07:36:39,521 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4015 [2025-01-10 07:36:39,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:36:39,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:36:39,521 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] [2025-01-10 07:36:39,521 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 07:36:39,522 INFO L752 eck$LassoCheckResult]: Stem: "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);~head~0.base, ~head~0.offset := 0, 0;~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~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;~cleanupTimeShifts~0 := 12;~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;~prevDir~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret129#1, main_~retValue_acc~23#1, main_~tmp~27#1;havoc main_~retValue_acc~23#1;havoc main_~tmp~27#1;assume { :begin_inline_select_helpers } true;" "assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true;" "assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~31#1;havoc valid_product_~retValue_acc~31#1;valid_product_~retValue_acc~31#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~31#1;" "main_#t~ret129#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~31#1;assume { :end_inline_valid_product } true;main_~tmp~27#1 := main_#t~ret129#1;havoc main_#t~ret129#1;" "assume 0 != main_~tmp~27#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret118#1, aliceCall_~tmp~20#1;havoc aliceCall_~tmp~20#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~28#1;" "assume !(0 == getOrigin_~person#1);" "assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~28#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~28#1;" "aliceCall_#t~ret118#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~20#1 := aliceCall_#t~ret118#1;havoc aliceCall_#t~ret118#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~20#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume !(0 == initPersonOnFloor_~floor#1);" "assume !(1 == initPersonOnFloor_~floor#1);" "assume !(2 == initPersonOnFloor_~floor#1);" "assume 3 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_3~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume !(0 == callOnFloor_~floorID#1);" "assume !(1 == callOnFloor_~floorID#1);" "assume 2 == callOnFloor_~floorID#1;~calls_2~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc aliceCall_#t~ret118#1, aliceCall_~tmp~20#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret119#1, angelinaCall_~tmp~21#1;havoc angelinaCall_~tmp~21#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~28#1;" "assume !(0 == getOrigin_~person#1);" "assume !(1 == getOrigin_~person#1);" "assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~28#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~28#1;" "angelinaCall_#t~ret119#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~21#1 := angelinaCall_#t~ret119#1;havoc angelinaCall_#t~ret119#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~21#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume 0 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_0~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc angelinaCall_#t~ret119#1, angelinaCall_~tmp~21#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret86#1, timeShift_~tmp~16#1;havoc timeShift_~tmp~16#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret136#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~7#1;havoc getCurrentHeading_~retValue_acc~7#1;getCurrentHeading_~retValue_acc~7#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~7#1;" "__utac_acc__Specification13_spec__1_#t~ret136#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~7#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret136#1;havoc __utac_acc__Specification13_spec__1_#t~ret136#1;" "havoc __utac_acc__Specification13_spec__1_#t~ret136#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~5#1;havoc areDoorsOpen_~retValue_acc~5#1;areDoorsOpen_~retValue_acc~5#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~5#1;" "timeShift_#t~ret86#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~5#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~16#1 := timeShift_#t~ret86#1;havoc timeShift_#t~ret86#1;" "assume 0 != timeShift_~tmp~16#1;" "assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1;" "assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret137#1, __utac_acc__Specification13_spec__2_#t~ret138#1, __utac_acc__Specification13_spec__2_#t~ret139#1, __utac_acc__Specification13_spec__2_#t~ret140#1, __utac_acc__Specification13_spec__2_#t~ret141#1, __utac_acc__Specification13_spec__2_#t~ret142#1, __utac_acc__Specification13_spec__2_~tmp~30#1, __utac_acc__Specification13_spec__2_~tmp___0~13#1, __utac_acc__Specification13_spec__2_~tmp___1~8#1, __utac_acc__Specification13_spec__2_~tmp___2~6#1, __utac_acc__Specification13_spec__2_~tmp___3~5#1, __utac_acc__Specification13_spec__2_~tmp___4~3#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~8#1;havoc __utac_acc__Specification13_spec__2_~tmp~30#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~13#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~8#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~6#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~5#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~3#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~8#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~8#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 / 3);" "assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~8#1;" "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~19#1, existInLiftCallsInDirection_~i~0#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~19#1;havoc existInLiftCallsInDirection_~i~0#1;havoc existInLiftCallsInDirection_~i___0~0#1;" "assume !(1 == existInLiftCallsInDirection_~d#1);" "assume 0 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i___0~0#1 := 0;existInLiftCallsInDirection_~i___0~0#1 := ~currentFloorID~0 - 1;" [2025-01-10 07:36:39,522 INFO L754 eck$LassoCheckResult]: Loop: "assume existInLiftCallsInDirection_~i___0~0#1 >= 0;" "existInLiftCallsInDirection_~i___0~0#1 := 1 + ~currentFloorID~0;" "assume !(existInLiftCallsInDirection_~i___0~0#1 < 5);" "existInLiftCallsInDirection_~i___0~0#1 := existInLiftCallsInDirection_~i___0~0#1 - 1;" [2025-01-10 07:36:39,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:39,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1233284949, now seen corresponding path program 1 times [2025-01-10 07:36:39,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:39,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908514779] [2025-01-10 07:36:39,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:36:39,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:39,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-10 07:36:39,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 07:36:39,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:39,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:36:39,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:36:39,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:36:39,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908514779] [2025-01-10 07:36:39,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908514779] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:36:39,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:36:39,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 07:36:39,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628044801] [2025-01-10 07:36:39,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:36:39,645 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:36:39,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:39,646 INFO L85 PathProgramCache]: Analyzing trace with hash 514712802, now seen corresponding path program 4 times [2025-01-10 07:36:39,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:39,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186315926] [2025-01-10 07:36:39,646 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:36:39,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:39,662 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 4 statements into 2 equivalence classes. [2025-01-10 07:36:39,663 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:36:39,663 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:36:39,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:39,664 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:36:39,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:36:39,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:36:39,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:39,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:39,675 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:36:39,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:36:39,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 07:36:39,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 07:36:39,694 INFO L87 Difference]: Start difference. First operand 17935 states and 33552 transitions. cyclomatic complexity: 15654 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) [2025-01-10 07:36:40,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:36:40,209 INFO L93 Difference]: Finished difference Result 17943 states and 33559 transitions. [2025-01-10 07:36:40,210 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17943 states and 33559 transitions. [2025-01-10 07:36:40,289 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4015 [2025-01-10 07:36:40,341 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17943 states to 17943 states and 33559 transitions. [2025-01-10 07:36:40,341 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17864 [2025-01-10 07:36:40,356 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17864 [2025-01-10 07:36:40,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17943 states and 33559 transitions. [2025-01-10 07:36:40,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:36:40,358 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17943 states and 33559 transitions. [2025-01-10 07:36:40,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17943 states and 33559 transitions. [2025-01-10 07:36:40,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17943 to 17943. [2025-01-10 07:36:40,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17943 states, 17943 states have (on average 1.8703115421055565) internal successors, (33559), 17942 states have internal predecessors, (33559), 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) [2025-01-10 07:36:40,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17943 states to 17943 states and 33559 transitions. [2025-01-10 07:36:40,647 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17943 states and 33559 transitions. [2025-01-10 07:36:40,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 07:36:40,647 INFO L432 stractBuchiCegarLoop]: Abstraction has 17943 states and 33559 transitions. [2025-01-10 07:36:40,647 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-01-10 07:36:40,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17943 states and 33559 transitions. [2025-01-10 07:36:40,710 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4015 [2025-01-10 07:36:40,710 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:36:40,710 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:36:40,710 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] [2025-01-10 07:36:40,710 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 07:36:40,711 INFO L752 eck$LassoCheckResult]: Stem: "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);~head~0.base, ~head~0.offset := 0, 0;~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~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;~cleanupTimeShifts~0 := 12;~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;~prevDir~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret129#1, main_~retValue_acc~23#1, main_~tmp~27#1;havoc main_~retValue_acc~23#1;havoc main_~tmp~27#1;assume { :begin_inline_select_helpers } true;" "assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true;" "assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~31#1;havoc valid_product_~retValue_acc~31#1;valid_product_~retValue_acc~31#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~31#1;" "main_#t~ret129#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~31#1;assume { :end_inline_valid_product } true;main_~tmp~27#1 := main_#t~ret129#1;havoc main_#t~ret129#1;" "assume 0 != main_~tmp~27#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret118#1, aliceCall_~tmp~20#1;havoc aliceCall_~tmp~20#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~28#1;" "assume !(0 == getOrigin_~person#1);" "assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~28#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~28#1;" "aliceCall_#t~ret118#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~20#1 := aliceCall_#t~ret118#1;havoc aliceCall_#t~ret118#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~20#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume !(0 == initPersonOnFloor_~floor#1);" "assume !(1 == initPersonOnFloor_~floor#1);" "assume !(2 == initPersonOnFloor_~floor#1);" "assume 3 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_3~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume !(0 == callOnFloor_~floorID#1);" "assume !(1 == callOnFloor_~floorID#1);" "assume !(2 == callOnFloor_~floorID#1);" "assume 3 == callOnFloor_~floorID#1;~calls_3~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc aliceCall_#t~ret118#1, aliceCall_~tmp~20#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret119#1, angelinaCall_~tmp~21#1;havoc angelinaCall_~tmp~21#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~28#1;" "assume !(0 == getOrigin_~person#1);" "assume !(1 == getOrigin_~person#1);" "assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~28#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~28#1;" "angelinaCall_#t~ret119#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~21#1 := angelinaCall_#t~ret119#1;havoc angelinaCall_#t~ret119#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~21#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume 0 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_0~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc angelinaCall_#t~ret119#1, angelinaCall_~tmp~21#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret86#1, timeShift_~tmp~16#1;havoc timeShift_~tmp~16#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret136#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~7#1;havoc getCurrentHeading_~retValue_acc~7#1;getCurrentHeading_~retValue_acc~7#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~7#1;" "__utac_acc__Specification13_spec__1_#t~ret136#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~7#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret136#1;havoc __utac_acc__Specification13_spec__1_#t~ret136#1;" "havoc __utac_acc__Specification13_spec__1_#t~ret136#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~5#1;havoc areDoorsOpen_~retValue_acc~5#1;areDoorsOpen_~retValue_acc~5#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~5#1;" "timeShift_#t~ret86#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~5#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~16#1 := timeShift_#t~ret86#1;havoc timeShift_#t~ret86#1;" "assume 0 != timeShift_~tmp~16#1;" "assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1;" "assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret137#1, __utac_acc__Specification13_spec__2_#t~ret138#1, __utac_acc__Specification13_spec__2_#t~ret139#1, __utac_acc__Specification13_spec__2_#t~ret140#1, __utac_acc__Specification13_spec__2_#t~ret141#1, __utac_acc__Specification13_spec__2_#t~ret142#1, __utac_acc__Specification13_spec__2_~tmp~30#1, __utac_acc__Specification13_spec__2_~tmp___0~13#1, __utac_acc__Specification13_spec__2_~tmp___1~8#1, __utac_acc__Specification13_spec__2_~tmp___2~6#1, __utac_acc__Specification13_spec__2_~tmp___3~5#1, __utac_acc__Specification13_spec__2_~tmp___4~3#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~8#1;havoc __utac_acc__Specification13_spec__2_~tmp~30#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~13#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~8#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~6#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~5#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~3#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~8#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~8#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 / 3);" "assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~8#1;" "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~19#1, existInLiftCallsInDirection_~i~0#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~19#1;havoc existInLiftCallsInDirection_~i~0#1;havoc existInLiftCallsInDirection_~i___0~0#1;" "assume !(1 == existInLiftCallsInDirection_~d#1);" "assume 0 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i___0~0#1 := 0;existInLiftCallsInDirection_~i___0~0#1 := ~currentFloorID~0 - 1;" [2025-01-10 07:36:40,711 INFO L754 eck$LassoCheckResult]: Loop: "assume existInLiftCallsInDirection_~i___0~0#1 >= 0;" "existInLiftCallsInDirection_~i___0~0#1 := 1 + ~currentFloorID~0;" "assume !(existInLiftCallsInDirection_~i___0~0#1 < 5);" "existInLiftCallsInDirection_~i___0~0#1 := existInLiftCallsInDirection_~i___0~0#1 - 1;" [2025-01-10 07:36:40,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:40,711 INFO L85 PathProgramCache]: Analyzing trace with hash -507725402, now seen corresponding path program 1 times [2025-01-10 07:36:40,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:40,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090740719] [2025-01-10 07:36:40,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:36:40,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:40,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-10 07:36:40,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-10 07:36:40,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:40,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:36:40,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:36:40,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:36:40,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090740719] [2025-01-10 07:36:40,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090740719] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:36:40,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:36:40,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 07:36:40,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828364388] [2025-01-10 07:36:40,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:36:40,858 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:36:40,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:40,858 INFO L85 PathProgramCache]: Analyzing trace with hash 514712802, now seen corresponding path program 5 times [2025-01-10 07:36:40,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:40,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250138377] [2025-01-10 07:36:40,859 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:36:40,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:40,878 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:36:40,880 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:36:40,880 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:36:40,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:40,881 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:36:40,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:36:40,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:36:40,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:40,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:40,891 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:36:40,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:36:40,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 07:36:40,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 07:36:40,918 INFO L87 Difference]: Start difference. First operand 17943 states and 33559 transitions. cyclomatic complexity: 15653 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) [2025-01-10 07:36:41,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:36:41,560 INFO L93 Difference]: Finished difference Result 17929 states and 33533 transitions. [2025-01-10 07:36:41,560 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17929 states and 33533 transitions. [2025-01-10 07:36:41,616 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4015 [2025-01-10 07:36:41,662 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17929 states to 17929 states and 33533 transitions. [2025-01-10 07:36:41,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17850 [2025-01-10 07:36:41,680 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17850 [2025-01-10 07:36:41,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17929 states and 33533 transitions. [2025-01-10 07:36:41,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:36:41,687 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17929 states and 33533 transitions. [2025-01-10 07:36:41,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17929 states and 33533 transitions. [2025-01-10 07:36:41,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17929 to 17929. [2025-01-10 07:36:41,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17929 states, 17929 states have (on average 1.8703218249762954) internal successors, (33533), 17928 states have internal predecessors, (33533), 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) [2025-01-10 07:36:41,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17929 states to 17929 states and 33533 transitions. [2025-01-10 07:36:41,929 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17929 states and 33533 transitions. [2025-01-10 07:36:41,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 07:36:41,929 INFO L432 stractBuchiCegarLoop]: Abstraction has 17929 states and 33533 transitions. [2025-01-10 07:36:41,929 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-01-10 07:36:41,929 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17929 states and 33533 transitions. [2025-01-10 07:36:41,977 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4015 [2025-01-10 07:36:41,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:36:41,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:36:41,977 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] [2025-01-10 07:36:41,981 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 07:36:41,981 INFO L752 eck$LassoCheckResult]: Stem: "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);~head~0.base, ~head~0.offset := 0, 0;~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~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;~cleanupTimeShifts~0 := 12;~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;~prevDir~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret129#1, main_~retValue_acc~23#1, main_~tmp~27#1;havoc main_~retValue_acc~23#1;havoc main_~tmp~27#1;assume { :begin_inline_select_helpers } true;" "assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true;" "assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~31#1;havoc valid_product_~retValue_acc~31#1;valid_product_~retValue_acc~31#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~31#1;" "main_#t~ret129#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~31#1;assume { :end_inline_valid_product } true;main_~tmp~27#1 := main_#t~ret129#1;havoc main_#t~ret129#1;" "assume 0 != main_~tmp~27#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret118#1, aliceCall_~tmp~20#1;havoc aliceCall_~tmp~20#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~28#1;" "assume !(0 == getOrigin_~person#1);" "assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~28#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~28#1;" "aliceCall_#t~ret118#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~20#1 := aliceCall_#t~ret118#1;havoc aliceCall_#t~ret118#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~20#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume !(0 == initPersonOnFloor_~floor#1);" "assume !(1 == initPersonOnFloor_~floor#1);" "assume !(2 == initPersonOnFloor_~floor#1);" "assume 3 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_3~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume !(0 == callOnFloor_~floorID#1);" "assume !(1 == callOnFloor_~floorID#1);" "assume !(2 == callOnFloor_~floorID#1);" "assume 3 == callOnFloor_~floorID#1;~calls_3~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc aliceCall_#t~ret118#1, aliceCall_~tmp~20#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret119#1, angelinaCall_~tmp~21#1;havoc angelinaCall_~tmp~21#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~28#1;" "assume !(0 == getOrigin_~person#1);" "assume !(1 == getOrigin_~person#1);" "assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~28#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~28#1;" "angelinaCall_#t~ret119#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~21#1 := angelinaCall_#t~ret119#1;havoc angelinaCall_#t~ret119#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~21#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume !(0 == initPersonOnFloor_~floor#1);" "assume 1 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_1~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume !(0 == callOnFloor_~floorID#1);" "assume 1 == callOnFloor_~floorID#1;~calls_1~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc angelinaCall_#t~ret119#1, angelinaCall_~tmp~21#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret86#1, timeShift_~tmp~16#1;havoc timeShift_~tmp~16#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret136#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~7#1;havoc getCurrentHeading_~retValue_acc~7#1;getCurrentHeading_~retValue_acc~7#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~7#1;" "__utac_acc__Specification13_spec__1_#t~ret136#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~7#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret136#1;havoc __utac_acc__Specification13_spec__1_#t~ret136#1;" "havoc __utac_acc__Specification13_spec__1_#t~ret136#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~5#1;havoc areDoorsOpen_~retValue_acc~5#1;areDoorsOpen_~retValue_acc~5#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~5#1;" "timeShift_#t~ret86#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~5#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~16#1 := timeShift_#t~ret86#1;havoc timeShift_#t~ret86#1;" "assume 0 != timeShift_~tmp~16#1;" "assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1;" "assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret137#1, __utac_acc__Specification13_spec__2_#t~ret138#1, __utac_acc__Specification13_spec__2_#t~ret139#1, __utac_acc__Specification13_spec__2_#t~ret140#1, __utac_acc__Specification13_spec__2_#t~ret141#1, __utac_acc__Specification13_spec__2_#t~ret142#1, __utac_acc__Specification13_spec__2_~tmp~30#1, __utac_acc__Specification13_spec__2_~tmp___0~13#1, __utac_acc__Specification13_spec__2_~tmp___1~8#1, __utac_acc__Specification13_spec__2_~tmp___2~6#1, __utac_acc__Specification13_spec__2_~tmp___3~5#1, __utac_acc__Specification13_spec__2_~tmp___4~3#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~8#1;havoc __utac_acc__Specification13_spec__2_~tmp~30#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~13#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~8#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~6#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~5#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~3#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~8#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~8#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 / 3);" "assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~8#1;" "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~19#1, existInLiftCallsInDirection_~i~0#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~19#1;havoc existInLiftCallsInDirection_~i~0#1;havoc existInLiftCallsInDirection_~i___0~0#1;" "assume !(1 == existInLiftCallsInDirection_~d#1);" "assume 0 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i___0~0#1 := 0;existInLiftCallsInDirection_~i___0~0#1 := ~currentFloorID~0 - 1;" [2025-01-10 07:36:41,981 INFO L754 eck$LassoCheckResult]: Loop: "assume existInLiftCallsInDirection_~i___0~0#1 >= 0;" "existInLiftCallsInDirection_~i___0~0#1 := 1 + ~currentFloorID~0;" "assume !(existInLiftCallsInDirection_~i___0~0#1 < 5);" "existInLiftCallsInDirection_~i___0~0#1 := existInLiftCallsInDirection_~i___0~0#1 - 1;" [2025-01-10 07:36:41,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:41,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1319509244, now seen corresponding path program 1 times [2025-01-10 07:36:41,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:41,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855241401] [2025-01-10 07:36:41,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:36:41,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:42,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 07:36:42,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 07:36:42,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:42,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:36:42,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:36:42,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:36:42,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855241401] [2025-01-10 07:36:42,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855241401] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:36:42,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:36:42,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 07:36:42,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201259266] [2025-01-10 07:36:42,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:36:42,088 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:36:42,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:42,089 INFO L85 PathProgramCache]: Analyzing trace with hash 514712802, now seen corresponding path program 6 times [2025-01-10 07:36:42,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:42,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345931362] [2025-01-10 07:36:42,089 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 07:36:42,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:42,104 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:36:42,105 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:36:42,105 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-10 07:36:42,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:42,105 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:36:42,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:36:42,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:36:42,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:42,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:42,114 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:36:42,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:36:42,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 07:36:42,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 07:36:42,133 INFO L87 Difference]: Start difference. First operand 17929 states and 33533 transitions. cyclomatic complexity: 15641 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) [2025-01-10 07:36:42,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:36:42,660 INFO L93 Difference]: Finished difference Result 17923 states and 33520 transitions. [2025-01-10 07:36:42,661 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17923 states and 33520 transitions. [2025-01-10 07:36:42,726 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4015 [2025-01-10 07:36:42,772 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17923 states to 17923 states and 33520 transitions. [2025-01-10 07:36:42,773 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17844 [2025-01-10 07:36:42,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17844 [2025-01-10 07:36:42,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17923 states and 33520 transitions. [2025-01-10 07:36:42,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:36:42,796 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17923 states and 33520 transitions. [2025-01-10 07:36:42,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17923 states and 33520 transitions. [2025-01-10 07:36:42,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17923 to 17923. [2025-01-10 07:36:42,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17923 states, 17923 states have (on average 1.8702226189811972) internal successors, (33520), 17922 states have internal predecessors, (33520), 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) [2025-01-10 07:36:43,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17923 states to 17923 states and 33520 transitions. [2025-01-10 07:36:43,013 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17923 states and 33520 transitions. [2025-01-10 07:36:43,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 07:36:43,013 INFO L432 stractBuchiCegarLoop]: Abstraction has 17923 states and 33520 transitions. [2025-01-10 07:36:43,013 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-01-10 07:36:43,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17923 states and 33520 transitions. [2025-01-10 07:36:43,055 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4015 [2025-01-10 07:36:43,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:36:43,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:36:43,056 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] [2025-01-10 07:36:43,056 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 07:36:43,056 INFO L752 eck$LassoCheckResult]: Stem: "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);~head~0.base, ~head~0.offset := 0, 0;~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~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;~cleanupTimeShifts~0 := 12;~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;~prevDir~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret129#1, main_~retValue_acc~23#1, main_~tmp~27#1;havoc main_~retValue_acc~23#1;havoc main_~tmp~27#1;assume { :begin_inline_select_helpers } true;" "assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true;" "assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~31#1;havoc valid_product_~retValue_acc~31#1;valid_product_~retValue_acc~31#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~31#1;" "main_#t~ret129#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~31#1;assume { :end_inline_valid_product } true;main_~tmp~27#1 := main_#t~ret129#1;havoc main_#t~ret129#1;" "assume 0 != main_~tmp~27#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret118#1, aliceCall_~tmp~20#1;havoc aliceCall_~tmp~20#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~28#1;" "assume !(0 == getOrigin_~person#1);" "assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~28#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~28#1;" "aliceCall_#t~ret118#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~20#1 := aliceCall_#t~ret118#1;havoc aliceCall_#t~ret118#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~20#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume !(0 == initPersonOnFloor_~floor#1);" "assume !(1 == initPersonOnFloor_~floor#1);" "assume !(2 == initPersonOnFloor_~floor#1);" "assume 3 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_3~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume !(0 == callOnFloor_~floorID#1);" "assume !(1 == callOnFloor_~floorID#1);" "assume !(2 == callOnFloor_~floorID#1);" "assume 3 == callOnFloor_~floorID#1;~calls_3~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc aliceCall_#t~ret118#1, aliceCall_~tmp~20#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret119#1, angelinaCall_~tmp~21#1;havoc angelinaCall_~tmp~21#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~28#1;" "assume !(0 == getOrigin_~person#1);" "assume !(1 == getOrigin_~person#1);" "assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~28#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~28#1;" "angelinaCall_#t~ret119#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~21#1 := angelinaCall_#t~ret119#1;havoc angelinaCall_#t~ret119#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~21#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume !(0 == initPersonOnFloor_~floor#1);" "assume !(1 == initPersonOnFloor_~floor#1);" "assume 2 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_2~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume !(0 == callOnFloor_~floorID#1);" "assume !(1 == callOnFloor_~floorID#1);" "assume 2 == callOnFloor_~floorID#1;~calls_2~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc angelinaCall_#t~ret119#1, angelinaCall_~tmp~21#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret86#1, timeShift_~tmp~16#1;havoc timeShift_~tmp~16#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret136#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~7#1;havoc getCurrentHeading_~retValue_acc~7#1;getCurrentHeading_~retValue_acc~7#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~7#1;" "__utac_acc__Specification13_spec__1_#t~ret136#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~7#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret136#1;havoc __utac_acc__Specification13_spec__1_#t~ret136#1;" "havoc __utac_acc__Specification13_spec__1_#t~ret136#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~5#1;havoc areDoorsOpen_~retValue_acc~5#1;areDoorsOpen_~retValue_acc~5#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~5#1;" "timeShift_#t~ret86#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~5#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~16#1 := timeShift_#t~ret86#1;havoc timeShift_#t~ret86#1;" "assume 0 != timeShift_~tmp~16#1;" "assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1;" "assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret137#1, __utac_acc__Specification13_spec__2_#t~ret138#1, __utac_acc__Specification13_spec__2_#t~ret139#1, __utac_acc__Specification13_spec__2_#t~ret140#1, __utac_acc__Specification13_spec__2_#t~ret141#1, __utac_acc__Specification13_spec__2_#t~ret142#1, __utac_acc__Specification13_spec__2_~tmp~30#1, __utac_acc__Specification13_spec__2_~tmp___0~13#1, __utac_acc__Specification13_spec__2_~tmp___1~8#1, __utac_acc__Specification13_spec__2_~tmp___2~6#1, __utac_acc__Specification13_spec__2_~tmp___3~5#1, __utac_acc__Specification13_spec__2_~tmp___4~3#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~8#1;havoc __utac_acc__Specification13_spec__2_~tmp~30#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~13#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~8#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~6#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~5#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~3#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~8#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~8#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 / 3);" "assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~8#1;" "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~19#1, existInLiftCallsInDirection_~i~0#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~19#1;havoc existInLiftCallsInDirection_~i~0#1;havoc existInLiftCallsInDirection_~i___0~0#1;" "assume !(1 == existInLiftCallsInDirection_~d#1);" "assume 0 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i___0~0#1 := 0;existInLiftCallsInDirection_~i___0~0#1 := ~currentFloorID~0 - 1;" [2025-01-10 07:36:43,057 INFO L754 eck$LassoCheckResult]: Loop: "assume existInLiftCallsInDirection_~i___0~0#1 >= 0;" "existInLiftCallsInDirection_~i___0~0#1 := 1 + ~currentFloorID~0;" "assume !(existInLiftCallsInDirection_~i___0~0#1 < 5);" "existInLiftCallsInDirection_~i___0~0#1 := existInLiftCallsInDirection_~i___0~0#1 - 1;" [2025-01-10 07:36:43,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:43,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1479862045, now seen corresponding path program 1 times [2025-01-10 07:36:43,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:43,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657900887] [2025-01-10 07:36:43,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:36:43,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:43,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 07:36:43,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 07:36:43,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:43,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:36:43,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:36:43,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:36:43,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657900887] [2025-01-10 07:36:43,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657900887] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:36:43,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:36:43,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 07:36:43,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111607807] [2025-01-10 07:36:43,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:36:43,142 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:36:43,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:43,142 INFO L85 PathProgramCache]: Analyzing trace with hash 514712802, now seen corresponding path program 7 times [2025-01-10 07:36:43,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:43,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857724801] [2025-01-10 07:36:43,142 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 07:36:43,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:43,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:36:43,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:36:43,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:43,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:43,232 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:36:43,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:36:43,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:36:43,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:43,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:43,241 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:36:43,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:36:43,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 07:36:43,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 07:36:43,262 INFO L87 Difference]: Start difference. First operand 17923 states and 33520 transitions. cyclomatic complexity: 15634 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) [2025-01-10 07:36:43,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:36:43,677 INFO L93 Difference]: Finished difference Result 17939 states and 33532 transitions. [2025-01-10 07:36:43,677 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17939 states and 33532 transitions. [2025-01-10 07:36:43,742 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4015 [2025-01-10 07:36:43,791 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17939 states to 17939 states and 33532 transitions. [2025-01-10 07:36:43,791 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17860 [2025-01-10 07:36:43,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17860 [2025-01-10 07:36:43,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17939 states and 33532 transitions. [2025-01-10 07:36:43,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:36:43,818 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17939 states and 33532 transitions. [2025-01-10 07:36:43,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17939 states and 33532 transitions. [2025-01-10 07:36:43,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17939 to 17923. [2025-01-10 07:36:43,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17923 states, 17923 states have (on average 1.8697762651341852) internal successors, (33512), 17922 states have internal predecessors, (33512), 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) [2025-01-10 07:36:44,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17923 states to 17923 states and 33512 transitions. [2025-01-10 07:36:44,025 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17923 states and 33512 transitions. [2025-01-10 07:36:44,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 07:36:44,026 INFO L432 stractBuchiCegarLoop]: Abstraction has 17923 states and 33512 transitions. [2025-01-10 07:36:44,026 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-01-10 07:36:44,026 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17923 states and 33512 transitions. [2025-01-10 07:36:44,072 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4015 [2025-01-10 07:36:44,072 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:36:44,072 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:36:44,073 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] [2025-01-10 07:36:44,073 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 07:36:44,073 INFO L752 eck$LassoCheckResult]: Stem: "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);~head~0.base, ~head~0.offset := 0, 0;~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~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;~cleanupTimeShifts~0 := 12;~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;~prevDir~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret129#1, main_~retValue_acc~23#1, main_~tmp~27#1;havoc main_~retValue_acc~23#1;havoc main_~tmp~27#1;assume { :begin_inline_select_helpers } true;" "assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true;" "assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~31#1;havoc valid_product_~retValue_acc~31#1;valid_product_~retValue_acc~31#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~31#1;" "main_#t~ret129#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~31#1;assume { :end_inline_valid_product } true;main_~tmp~27#1 := main_#t~ret129#1;havoc main_#t~ret129#1;" "assume 0 != main_~tmp~27#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret118#1, aliceCall_~tmp~20#1;havoc aliceCall_~tmp~20#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~28#1;" "assume !(0 == getOrigin_~person#1);" "assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~28#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~28#1;" "aliceCall_#t~ret118#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~20#1 := aliceCall_#t~ret118#1;havoc aliceCall_#t~ret118#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~20#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume !(0 == initPersonOnFloor_~floor#1);" "assume !(1 == initPersonOnFloor_~floor#1);" "assume !(2 == initPersonOnFloor_~floor#1);" "assume 3 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_3~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume !(0 == callOnFloor_~floorID#1);" "assume !(1 == callOnFloor_~floorID#1);" "assume !(2 == callOnFloor_~floorID#1);" "assume 3 == callOnFloor_~floorID#1;~calls_3~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc aliceCall_#t~ret118#1, aliceCall_~tmp~20#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret119#1, angelinaCall_~tmp~21#1;havoc angelinaCall_~tmp~21#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~28#1;" "assume !(0 == getOrigin_~person#1);" "assume !(1 == getOrigin_~person#1);" "assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~28#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~28#1;" "angelinaCall_#t~ret119#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~21#1 := angelinaCall_#t~ret119#1;havoc angelinaCall_#t~ret119#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~21#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume !(0 == initPersonOnFloor_~floor#1);" "assume !(1 == initPersonOnFloor_~floor#1);" "assume 2 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume !(1 == initPersonOnFloor_~person#1);" "assume 2 == initPersonOnFloor_~person#1;~personOnFloor_2_2~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume !(0 == callOnFloor_~floorID#1);" "assume !(1 == callOnFloor_~floorID#1);" "assume 2 == callOnFloor_~floorID#1;~calls_2~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc angelinaCall_#t~ret119#1, angelinaCall_~tmp~21#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret86#1, timeShift_~tmp~16#1;havoc timeShift_~tmp~16#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret136#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~7#1;havoc getCurrentHeading_~retValue_acc~7#1;getCurrentHeading_~retValue_acc~7#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~7#1;" "__utac_acc__Specification13_spec__1_#t~ret136#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~7#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret136#1;havoc __utac_acc__Specification13_spec__1_#t~ret136#1;" "havoc __utac_acc__Specification13_spec__1_#t~ret136#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~5#1;havoc areDoorsOpen_~retValue_acc~5#1;areDoorsOpen_~retValue_acc~5#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~5#1;" "timeShift_#t~ret86#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~5#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~16#1 := timeShift_#t~ret86#1;havoc timeShift_#t~ret86#1;" "assume 0 != timeShift_~tmp~16#1;" "assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1;" "assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret137#1, __utac_acc__Specification13_spec__2_#t~ret138#1, __utac_acc__Specification13_spec__2_#t~ret139#1, __utac_acc__Specification13_spec__2_#t~ret140#1, __utac_acc__Specification13_spec__2_#t~ret141#1, __utac_acc__Specification13_spec__2_#t~ret142#1, __utac_acc__Specification13_spec__2_~tmp~30#1, __utac_acc__Specification13_spec__2_~tmp___0~13#1, __utac_acc__Specification13_spec__2_~tmp___1~8#1, __utac_acc__Specification13_spec__2_~tmp___2~6#1, __utac_acc__Specification13_spec__2_~tmp___3~5#1, __utac_acc__Specification13_spec__2_~tmp___4~3#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~8#1;havoc __utac_acc__Specification13_spec__2_~tmp~30#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~13#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~8#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~6#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~5#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~3#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~8#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~8#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 / 3);" "assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~8#1;" "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~19#1, existInLiftCallsInDirection_~i~0#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~19#1;havoc existInLiftCallsInDirection_~i~0#1;havoc existInLiftCallsInDirection_~i___0~0#1;" "assume !(1 == existInLiftCallsInDirection_~d#1);" "assume 0 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i___0~0#1 := 0;existInLiftCallsInDirection_~i___0~0#1 := ~currentFloorID~0 - 1;" [2025-01-10 07:36:44,073 INFO L754 eck$LassoCheckResult]: Loop: "assume existInLiftCallsInDirection_~i___0~0#1 >= 0;" "existInLiftCallsInDirection_~i___0~0#1 := 1 + ~currentFloorID~0;" "assume !(existInLiftCallsInDirection_~i___0~0#1 < 5);" "existInLiftCallsInDirection_~i___0~0#1 := existInLiftCallsInDirection_~i___0~0#1 - 1;" [2025-01-10 07:36:44,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:44,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1525038428, now seen corresponding path program 1 times [2025-01-10 07:36:44,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:44,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119860343] [2025-01-10 07:36:44,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:36:44,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:44,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-10 07:36:44,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 07:36:44,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:44,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:36:44,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:36:44,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:36:44,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119860343] [2025-01-10 07:36:44,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119860343] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:36:44,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:36:44,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 07:36:44,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535964383] [2025-01-10 07:36:44,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:36:44,278 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:36:44,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:44,278 INFO L85 PathProgramCache]: Analyzing trace with hash 514712802, now seen corresponding path program 8 times [2025-01-10 07:36:44,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:44,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614996509] [2025-01-10 07:36:44,279 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:36:44,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:44,298 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:36:44,299 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:36:44,299 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:36:44,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:44,299 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:36:44,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:36:44,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:36:44,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:44,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:44,311 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:36:44,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:36:44,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 07:36:44,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 07:36:44,334 INFO L87 Difference]: Start difference. First operand 17923 states and 33512 transitions. cyclomatic complexity: 15626 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) [2025-01-10 07:36:45,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:36:45,235 INFO L93 Difference]: Finished difference Result 33858 states and 63434 transitions. [2025-01-10 07:36:45,235 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33858 states and 63434 transitions. [2025-01-10 07:36:45,399 INFO L131 ngComponentsAnalysis]: Automaton has 66 accepting balls. 6998 [2025-01-10 07:36:45,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33858 states to 33858 states and 63434 transitions. [2025-01-10 07:36:45,513 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33700 [2025-01-10 07:36:45,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33700 [2025-01-10 07:36:45,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33858 states and 63434 transitions. [2025-01-10 07:36:45,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:36:45,550 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33858 states and 63434 transitions. [2025-01-10 07:36:45,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33858 states and 63434 transitions. [2025-01-10 07:36:46,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33858 to 28846. [2025-01-10 07:36:46,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28846 states, 28846 states have (on average 1.870137974069195) internal successors, (53946), 28845 states have internal predecessors, (53946), 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) [2025-01-10 07:36:46,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28846 states to 28846 states and 53946 transitions. [2025-01-10 07:36:46,185 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28846 states and 53946 transitions. [2025-01-10 07:36:46,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 07:36:46,185 INFO L432 stractBuchiCegarLoop]: Abstraction has 28846 states and 53946 transitions. [2025-01-10 07:36:46,185 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-01-10 07:36:46,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28846 states and 53946 transitions. [2025-01-10 07:36:46,256 INFO L131 ngComponentsAnalysis]: Automaton has 66 accepting balls. 6998 [2025-01-10 07:36:46,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:36:46,256 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:36:46,257 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] [2025-01-10 07:36:46,257 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 07:36:46,257 INFO L752 eck$LassoCheckResult]: Stem: "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);~head~0.base, ~head~0.offset := 0, 0;~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~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;~cleanupTimeShifts~0 := 12;~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;~prevDir~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret129#1, main_~retValue_acc~23#1, main_~tmp~27#1;havoc main_~retValue_acc~23#1;havoc main_~tmp~27#1;assume { :begin_inline_select_helpers } true;" "assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true;" "assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~31#1;havoc valid_product_~retValue_acc~31#1;valid_product_~retValue_acc~31#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~31#1;" "main_#t~ret129#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~31#1;assume { :end_inline_valid_product } true;main_~tmp~27#1 := main_#t~ret129#1;havoc main_#t~ret129#1;" "assume 0 != main_~tmp~27#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret118#1, aliceCall_~tmp~20#1;havoc aliceCall_~tmp~20#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~28#1;" "assume !(0 == getOrigin_~person#1);" "assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~28#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~28#1;" "aliceCall_#t~ret118#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~20#1 := aliceCall_#t~ret118#1;havoc aliceCall_#t~ret118#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~20#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume !(0 == initPersonOnFloor_~floor#1);" "assume !(1 == initPersonOnFloor_~floor#1);" "assume !(2 == initPersonOnFloor_~floor#1);" "assume 3 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_3~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume !(0 == callOnFloor_~floorID#1);" "assume !(1 == callOnFloor_~floorID#1);" "assume !(2 == callOnFloor_~floorID#1);" "assume 3 == callOnFloor_~floorID#1;~calls_3~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc aliceCall_#t~ret118#1, aliceCall_~tmp~20#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret119#1, angelinaCall_~tmp~21#1;havoc angelinaCall_~tmp~21#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~28#1;" "assume !(0 == getOrigin_~person#1);" "assume !(1 == getOrigin_~person#1);" "assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~28#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~28#1;" "angelinaCall_#t~ret119#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~21#1 := angelinaCall_#t~ret119#1;havoc angelinaCall_#t~ret119#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~21#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume !(0 == initPersonOnFloor_~floor#1);" "assume !(1 == initPersonOnFloor_~floor#1);" "assume 2 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume !(1 == initPersonOnFloor_~person#1);" "assume 2 == initPersonOnFloor_~person#1;~personOnFloor_2_2~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume !(0 == callOnFloor_~floorID#1);" "assume !(1 == callOnFloor_~floorID#1);" "assume 2 == callOnFloor_~floorID#1;~calls_2~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc angelinaCall_#t~ret119#1, angelinaCall_~tmp~21#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret86#1, timeShift_~tmp~16#1;havoc timeShift_~tmp~16#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret136#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~7#1;havoc getCurrentHeading_~retValue_acc~7#1;getCurrentHeading_~retValue_acc~7#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~7#1;" "__utac_acc__Specification13_spec__1_#t~ret136#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~7#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret136#1;havoc __utac_acc__Specification13_spec__1_#t~ret136#1;" "havoc __utac_acc__Specification13_spec__1_#t~ret136#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~5#1;havoc areDoorsOpen_~retValue_acc~5#1;areDoorsOpen_~retValue_acc~5#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~5#1;" "timeShift_#t~ret86#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~5#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~16#1 := timeShift_#t~ret86#1;havoc timeShift_#t~ret86#1;" "assume !(0 != timeShift_~tmp~16#1);~blocked~0 := 0;assume { :begin_inline_timeShift__wrappee__executivefloor } true;havoc timeShift__wrappee__executivefloor_#t~ret75#1, timeShift__wrappee__executivefloor_#t~ret76#1, timeShift__wrappee__executivefloor_#t~ret77#1, timeShift__wrappee__executivefloor_#t~ret78#1, timeShift__wrappee__executivefloor_#t~ret79#1, timeShift__wrappee__executivefloor_#t~ret80#1, timeShift__wrappee__executivefloor_#t~ret81#1, timeShift__wrappee__executivefloor_#t~ret82#1, timeShift__wrappee__executivefloor_#t~ret83#1, timeShift__wrappee__executivefloor_#t~ret84#1, timeShift__wrappee__executivefloor_#t~ret85#1, timeShift__wrappee__executivefloor_~tmp~15#1, timeShift__wrappee__executivefloor_~tmp___0~7#1, timeShift__wrappee__executivefloor_~tmp___1~3#1, timeShift__wrappee__executivefloor_~tmp___2~3#1, timeShift__wrappee__executivefloor_~tmp___3~3#1, timeShift__wrappee__executivefloor_~tmp___4~2#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~15#1;havoc timeShift__wrappee__executivefloor_~tmp___0~7#1;havoc timeShift__wrappee__executivefloor_~tmp___1~3#1;havoc timeShift__wrappee__executivefloor_~tmp___2~3#1;havoc timeShift__wrappee__executivefloor_~tmp___3~3#1;havoc timeShift__wrappee__executivefloor_~tmp___4~2#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~ret59#1, stopRequestedAtCurrentFloor_#t~ret60#1, stopRequestedAtCurrentFloor_#t~ret61#1, stopRequestedAtCurrentFloor_#t~ret62#1, stopRequestedAtCurrentFloor_~retValue_acc~17#1, stopRequestedAtCurrentFloor_~tmp~13#1, stopRequestedAtCurrentFloor_~tmp___0~5#1;havoc stopRequestedAtCurrentFloor_~retValue_acc~17#1;havoc stopRequestedAtCurrentFloor_~tmp~13#1;havoc stopRequestedAtCurrentFloor_~tmp___0~5#1;assume { :begin_inline_isExecutiveFloorCalling } true;havoc isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret115#1, isExecutiveFloorCalling_~retValue_acc~20#1;havoc isExecutiveFloorCalling_~retValue_acc~20#1;assume { :begin_inline_isFloorCalling } true;isFloorCalling_#in~floorID#1 := ~executiveFloor~0;havoc isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~24#1;isFloorCalling_~floorID#1 := isFloorCalling_#in~floorID#1;havoc isFloorCalling_~retValue_acc~24#1;" "assume 0 == isFloorCalling_~floorID#1;isFloorCalling_~retValue_acc~24#1 := ~calls_0~0;isFloorCalling_#res#1 := isFloorCalling_~retValue_acc~24#1;" "isExecutiveFloorCalling_#t~ret115#1 := isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~24#1;havoc isFloorCalling_#in~floorID#1;assume { :end_inline_isFloorCalling } true;isExecutiveFloorCalling_~retValue_acc~20#1 := isExecutiveFloorCalling_#t~ret115#1;havoc isExecutiveFloorCalling_#t~ret115#1;isExecutiveFloorCalling_#res#1 := isExecutiveFloorCalling_~retValue_acc~20#1;" "stopRequestedAtCurrentFloor_#t~ret59#1 := isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret115#1, isExecutiveFloorCalling_~retValue_acc~20#1;assume { :end_inline_isExecutiveFloorCalling } true;stopRequestedAtCurrentFloor_~tmp~13#1 := stopRequestedAtCurrentFloor_#t~ret59#1;havoc stopRequestedAtCurrentFloor_#t~ret59#1;" "assume 0 != stopRequestedAtCurrentFloor_~tmp~13#1;assume { :begin_inline_getCurrentFloorID } true;havoc getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~4#1;havoc getCurrentFloorID_~retValue_acc~4#1;getCurrentFloorID_~retValue_acc~4#1 := ~currentFloorID~0;getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~4#1;" "stopRequestedAtCurrentFloor_#t~ret60#1 := getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~4#1;assume { :end_inline_getCurrentFloorID } true;stopRequestedAtCurrentFloor_~tmp___0~5#1 := stopRequestedAtCurrentFloor_#t~ret60#1;havoc stopRequestedAtCurrentFloor_#t~ret60#1;" "assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~5#1);stopRequestedAtCurrentFloor_~retValue_acc~17#1 := 0;stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~17#1;" "timeShift__wrappee__executivefloor_#t~ret75#1 := stopRequestedAtCurrentFloor_#res#1;havoc stopRequestedAtCurrentFloor_#t~ret59#1, stopRequestedAtCurrentFloor_#t~ret60#1, stopRequestedAtCurrentFloor_#t~ret61#1, stopRequestedAtCurrentFloor_#t~ret62#1, stopRequestedAtCurrentFloor_~retValue_acc~17#1, stopRequestedAtCurrentFloor_~tmp~13#1, stopRequestedAtCurrentFloor_~tmp___0~5#1;assume { :end_inline_stopRequestedAtCurrentFloor } true;timeShift__wrappee__executivefloor_~tmp___9~2#1 := timeShift__wrappee__executivefloor_#t~ret75#1;havoc timeShift__wrappee__executivefloor_#t~ret75#1;" "assume !(0 != timeShift__wrappee__executivefloor_~tmp___9~2#1);" "assume !(1 == ~doorState~0);" "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~ret50#1, stopRequestedInDirection_#t~ret51#1, stopRequestedInDirection_#t~ret52#1, stopRequestedInDirection_~dir#1, stopRequestedInDirection_~respectFloorCalls#1, stopRequestedInDirection_~respectInLiftCalls#1, stopRequestedInDirection_~retValue_acc~13#1, stopRequestedInDirection_~tmp~9#1, stopRequestedInDirection_~tmp___0~2#1, stopRequestedInDirection_~__cil_tmp7~5#1, stopRequestedInDirection_~__cil_tmp8~6#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~13#1;havoc stopRequestedInDirection_~tmp~9#1;havoc stopRequestedInDirection_~tmp___0~2#1;havoc stopRequestedInDirection_~__cil_tmp7~5#1;havoc stopRequestedInDirection_~__cil_tmp8~6#1;assume { :begin_inline_isExecutiveFloorCalling } true;havoc isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret115#1, isExecutiveFloorCalling_~retValue_acc~20#1;havoc isExecutiveFloorCalling_~retValue_acc~20#1;assume { :begin_inline_isFloorCalling } true;isFloorCalling_#in~floorID#1 := ~executiveFloor~0;havoc isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~24#1;isFloorCalling_~floorID#1 := isFloorCalling_#in~floorID#1;havoc isFloorCalling_~retValue_acc~24#1;" "assume 0 == isFloorCalling_~floorID#1;isFloorCalling_~retValue_acc~24#1 := ~calls_0~0;isFloorCalling_#res#1 := isFloorCalling_~retValue_acc~24#1;" "isExecutiveFloorCalling_#t~ret115#1 := isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~24#1;havoc isFloorCalling_#in~floorID#1;assume { :end_inline_isFloorCalling } true;isExecutiveFloorCalling_~retValue_acc~20#1 := isExecutiveFloorCalling_#t~ret115#1;havoc isExecutiveFloorCalling_#t~ret115#1;isExecutiveFloorCalling_#res#1 := isExecutiveFloorCalling_~retValue_acc~20#1;" "stopRequestedInDirection_#t~ret50#1 := isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret115#1, isExecutiveFloorCalling_~retValue_acc~20#1;assume { :end_inline_isExecutiveFloorCalling } true;stopRequestedInDirection_~tmp___0~2#1 := stopRequestedInDirection_#t~ret50#1;havoc stopRequestedInDirection_#t~ret50#1;" "assume 0 != stopRequestedInDirection_~tmp___0~2#1;assume { :begin_inline_getCurrentFloorID } true;havoc getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~4#1;havoc getCurrentFloorID_~retValue_acc~4#1;getCurrentFloorID_~retValue_acc~4#1 := ~currentFloorID~0;getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~4#1;" "stopRequestedInDirection_#t~ret51#1 := getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~4#1;assume { :end_inline_getCurrentFloorID } true;stopRequestedInDirection_~tmp~9#1 := stopRequestedInDirection_#t~ret51#1;havoc stopRequestedInDirection_#t~ret51#1;stopRequestedInDirection_~__cil_tmp7~5#1 := (if 1 == stopRequestedInDirection_~dir#1 then 1 else 0);stopRequestedInDirection_~__cil_tmp8~6#1 := (if stopRequestedInDirection_~tmp~9#1 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~13#1 := (if stopRequestedInDirection_~__cil_tmp8~6#1 == stopRequestedInDirection_~__cil_tmp7~5#1 then 1 else 0);stopRequestedInDirection_#res#1 := stopRequestedInDirection_~retValue_acc~13#1;" "timeShift__wrappee__executivefloor_#t~ret82#1 := stopRequestedInDirection_#res#1;havoc stopRequestedInDirection_#t~ret50#1, stopRequestedInDirection_#t~ret51#1, stopRequestedInDirection_#t~ret52#1, stopRequestedInDirection_~dir#1, stopRequestedInDirection_~respectFloorCalls#1, stopRequestedInDirection_~respectInLiftCalls#1, stopRequestedInDirection_~retValue_acc~13#1, stopRequestedInDirection_~tmp~9#1, stopRequestedInDirection_~tmp___0~2#1, stopRequestedInDirection_~__cil_tmp7~5#1, stopRequestedInDirection_~__cil_tmp8~6#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~ret82#1;havoc timeShift__wrappee__executivefloor_#t~ret82#1;" "assume 0 != timeShift__wrappee__executivefloor_~tmp___8~2#1;assume { :begin_inline_continueInDirection } true;continueInDirection_#in~dir#1 := ~currentHeading~0;havoc continueInDirection_#t~ret53#1, continueInDirection_~dir#1, continueInDirection_~tmp~10#1;continueInDirection_~dir#1 := continueInDirection_#in~dir#1;havoc continueInDirection_~tmp~10#1;~currentHeading~0 := continueInDirection_~dir#1;" "assume !(1 == ~currentHeading~0);" "assume !(0 == ~currentFloorID~0);" "assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1;" "havoc continueInDirection_#t~ret53#1, continueInDirection_~dir#1, continueInDirection_~tmp~10#1;havoc continueInDirection_#in~dir#1;assume { :end_inline_continueInDirection } true;" "havoc timeShift__wrappee__executivefloor_#t~ret75#1, timeShift__wrappee__executivefloor_#t~ret76#1, timeShift__wrappee__executivefloor_#t~ret77#1, timeShift__wrappee__executivefloor_#t~ret78#1, timeShift__wrappee__executivefloor_#t~ret79#1, timeShift__wrappee__executivefloor_#t~ret80#1, timeShift__wrappee__executivefloor_#t~ret81#1, timeShift__wrappee__executivefloor_#t~ret82#1, timeShift__wrappee__executivefloor_#t~ret83#1, timeShift__wrappee__executivefloor_#t~ret84#1, timeShift__wrappee__executivefloor_#t~ret85#1, timeShift__wrappee__executivefloor_~tmp~15#1, timeShift__wrappee__executivefloor_~tmp___0~7#1, timeShift__wrappee__executivefloor_~tmp___1~3#1, timeShift__wrappee__executivefloor_~tmp___2~3#1, timeShift__wrappee__executivefloor_~tmp___3~3#1, timeShift__wrappee__executivefloor_~tmp___4~2#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;" "assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret137#1, __utac_acc__Specification13_spec__2_#t~ret138#1, __utac_acc__Specification13_spec__2_#t~ret139#1, __utac_acc__Specification13_spec__2_#t~ret140#1, __utac_acc__Specification13_spec__2_#t~ret141#1, __utac_acc__Specification13_spec__2_#t~ret142#1, __utac_acc__Specification13_spec__2_~tmp~30#1, __utac_acc__Specification13_spec__2_~tmp___0~13#1, __utac_acc__Specification13_spec__2_~tmp___1~8#1, __utac_acc__Specification13_spec__2_~tmp___2~6#1, __utac_acc__Specification13_spec__2_~tmp___3~5#1, __utac_acc__Specification13_spec__2_~tmp___4~3#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~8#1;havoc __utac_acc__Specification13_spec__2_~tmp~30#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~13#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~8#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~6#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~5#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~3#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~8#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~8#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 / 3);" "assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~8#1;" "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~19#1, existInLiftCallsInDirection_~i~0#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~19#1;havoc existInLiftCallsInDirection_~i~0#1;havoc existInLiftCallsInDirection_~i___0~0#1;" "assume !(1 == existInLiftCallsInDirection_~d#1);" "assume 0 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i___0~0#1 := 0;existInLiftCallsInDirection_~i___0~0#1 := ~currentFloorID~0 - 1;" [2025-01-10 07:36:46,257 INFO L754 eck$LassoCheckResult]: Loop: "assume existInLiftCallsInDirection_~i___0~0#1 >= 0;" "existInLiftCallsInDirection_~i___0~0#1 := 1 + ~currentFloorID~0;" "assume !(existInLiftCallsInDirection_~i___0~0#1 < 5);" "existInLiftCallsInDirection_~i___0~0#1 := existInLiftCallsInDirection_~i___0~0#1 - 1;" [2025-01-10 07:36:46,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:46,258 INFO L85 PathProgramCache]: Analyzing trace with hash 401191911, now seen corresponding path program 1 times [2025-01-10 07:36:46,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:46,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062014893] [2025-01-10 07:36:46,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:36:46,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:46,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-10 07:36:46,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-10 07:36:46,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:46,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:36:46,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:36:46,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:36:46,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062014893] [2025-01-10 07:36:46,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062014893] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:36:46,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:36:46,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 07:36:46,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451735615] [2025-01-10 07:36:46,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:36:46,411 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:36:46,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:46,411 INFO L85 PathProgramCache]: Analyzing trace with hash 514712802, now seen corresponding path program 9 times [2025-01-10 07:36:46,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:46,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061949279] [2025-01-10 07:36:46,411 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:36:46,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:46,424 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:36:46,426 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:36:46,426 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:36:46,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:46,426 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:36:46,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:36:46,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:36:46,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:46,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:46,435 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:36:46,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:36:46,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 07:36:46,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-10 07:36:46,458 INFO L87 Difference]: Start difference. First operand 28846 states and 53946 transitions. cyclomatic complexity: 25174 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) [2025-01-10 07:36:47,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:36:47,340 INFO L93 Difference]: Finished difference Result 28024 states and 52071 transitions. [2025-01-10 07:36:47,340 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28024 states and 52071 transitions. [2025-01-10 07:36:47,433 INFO L131 ngComponentsAnalysis]: Automaton has 122 accepting balls. 8268 [2025-01-10 07:36:47,505 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28024 states to 28024 states and 52071 transitions. [2025-01-10 07:36:47,506 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27787 [2025-01-10 07:36:47,526 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27787 [2025-01-10 07:36:47,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28024 states and 52071 transitions. [2025-01-10 07:36:47,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:36:47,548 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28024 states and 52071 transitions. [2025-01-10 07:36:47,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28024 states and 52071 transitions. [2025-01-10 07:36:47,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28024 to 28024. [2025-01-10 07:36:47,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28024 states, 28024 states have (on average 1.8580859263488438) internal successors, (52071), 28023 states have internal predecessors, (52071), 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) [2025-01-10 07:36:47,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28024 states to 28024 states and 52071 transitions. [2025-01-10 07:36:47,890 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28024 states and 52071 transitions. [2025-01-10 07:36:47,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 07:36:47,891 INFO L432 stractBuchiCegarLoop]: Abstraction has 28024 states and 52071 transitions. [2025-01-10 07:36:47,891 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-01-10 07:36:47,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28024 states and 52071 transitions. [2025-01-10 07:36:48,156 INFO L131 ngComponentsAnalysis]: Automaton has 122 accepting balls. 8268 [2025-01-10 07:36:48,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:36:48,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:36:48,156 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] [2025-01-10 07:36:48,157 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 07:36:48,157 INFO L752 eck$LassoCheckResult]: Stem: "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);~head~0.base, ~head~0.offset := 0, 0;~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~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;~cleanupTimeShifts~0 := 12;~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;~prevDir~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret129#1, main_~retValue_acc~23#1, main_~tmp~27#1;havoc main_~retValue_acc~23#1;havoc main_~tmp~27#1;assume { :begin_inline_select_helpers } true;" "assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true;" "assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~31#1;havoc valid_product_~retValue_acc~31#1;valid_product_~retValue_acc~31#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~31#1;" "main_#t~ret129#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~31#1;assume { :end_inline_valid_product } true;main_~tmp~27#1 := main_#t~ret129#1;havoc main_#t~ret129#1;" "assume 0 != main_~tmp~27#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret118#1, aliceCall_~tmp~20#1;havoc aliceCall_~tmp~20#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~28#1;" "assume !(0 == getOrigin_~person#1);" "assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~28#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~28#1;" "aliceCall_#t~ret118#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~20#1 := aliceCall_#t~ret118#1;havoc aliceCall_#t~ret118#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~20#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume !(0 == initPersonOnFloor_~floor#1);" "assume !(1 == initPersonOnFloor_~floor#1);" "assume !(2 == initPersonOnFloor_~floor#1);" "assume 3 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_3~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume !(0 == callOnFloor_~floorID#1);" "assume !(1 == callOnFloor_~floorID#1);" "assume !(2 == callOnFloor_~floorID#1);" "assume 3 == callOnFloor_~floorID#1;~calls_3~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc aliceCall_#t~ret118#1, aliceCall_~tmp~20#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret119#1, angelinaCall_~tmp~21#1;havoc angelinaCall_~tmp~21#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~28#1;" "assume !(0 == getOrigin_~person#1);" "assume !(1 == getOrigin_~person#1);" "assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~28#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~28#1;" "angelinaCall_#t~ret119#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~21#1 := angelinaCall_#t~ret119#1;havoc angelinaCall_#t~ret119#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~21#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume !(0 == initPersonOnFloor_~floor#1);" "assume !(1 == initPersonOnFloor_~floor#1);" "assume 2 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume !(1 == initPersonOnFloor_~person#1);" "assume 2 == initPersonOnFloor_~person#1;~personOnFloor_2_2~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume !(0 == callOnFloor_~floorID#1);" "assume !(1 == callOnFloor_~floorID#1);" "assume 2 == callOnFloor_~floorID#1;~calls_2~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc angelinaCall_#t~ret119#1, angelinaCall_~tmp~21#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret86#1, timeShift_~tmp~16#1;havoc timeShift_~tmp~16#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret136#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~7#1;havoc getCurrentHeading_~retValue_acc~7#1;getCurrentHeading_~retValue_acc~7#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~7#1;" "__utac_acc__Specification13_spec__1_#t~ret136#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~7#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret136#1;havoc __utac_acc__Specification13_spec__1_#t~ret136#1;" "havoc __utac_acc__Specification13_spec__1_#t~ret136#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~5#1;havoc areDoorsOpen_~retValue_acc~5#1;areDoorsOpen_~retValue_acc~5#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~5#1;" "timeShift_#t~ret86#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~5#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~16#1 := timeShift_#t~ret86#1;havoc timeShift_#t~ret86#1;" "assume 0 != timeShift_~tmp~16#1;" "assume !(~weight~0 > ~maximumWeight~0);~blocked~0 := 0;assume { :begin_inline_timeShift__wrappee__executivefloor } true;havoc timeShift__wrappee__executivefloor_#t~ret75#1, timeShift__wrappee__executivefloor_#t~ret76#1, timeShift__wrappee__executivefloor_#t~ret77#1, timeShift__wrappee__executivefloor_#t~ret78#1, timeShift__wrappee__executivefloor_#t~ret79#1, timeShift__wrappee__executivefloor_#t~ret80#1, timeShift__wrappee__executivefloor_#t~ret81#1, timeShift__wrappee__executivefloor_#t~ret82#1, timeShift__wrappee__executivefloor_#t~ret83#1, timeShift__wrappee__executivefloor_#t~ret84#1, timeShift__wrappee__executivefloor_#t~ret85#1, timeShift__wrappee__executivefloor_~tmp~15#1, timeShift__wrappee__executivefloor_~tmp___0~7#1, timeShift__wrappee__executivefloor_~tmp___1~3#1, timeShift__wrappee__executivefloor_~tmp___2~3#1, timeShift__wrappee__executivefloor_~tmp___3~3#1, timeShift__wrappee__executivefloor_~tmp___4~2#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~15#1;havoc timeShift__wrappee__executivefloor_~tmp___0~7#1;havoc timeShift__wrappee__executivefloor_~tmp___1~3#1;havoc timeShift__wrappee__executivefloor_~tmp___2~3#1;havoc timeShift__wrappee__executivefloor_~tmp___3~3#1;havoc timeShift__wrappee__executivefloor_~tmp___4~2#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~ret59#1, stopRequestedAtCurrentFloor_#t~ret60#1, stopRequestedAtCurrentFloor_#t~ret61#1, stopRequestedAtCurrentFloor_#t~ret62#1, stopRequestedAtCurrentFloor_~retValue_acc~17#1, stopRequestedAtCurrentFloor_~tmp~13#1, stopRequestedAtCurrentFloor_~tmp___0~5#1;havoc stopRequestedAtCurrentFloor_~retValue_acc~17#1;havoc stopRequestedAtCurrentFloor_~tmp~13#1;havoc stopRequestedAtCurrentFloor_~tmp___0~5#1;assume { :begin_inline_isExecutiveFloorCalling } true;havoc isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret115#1, isExecutiveFloorCalling_~retValue_acc~20#1;havoc isExecutiveFloorCalling_~retValue_acc~20#1;assume { :begin_inline_isFloorCalling } true;isFloorCalling_#in~floorID#1 := ~executiveFloor~0;havoc isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~24#1;isFloorCalling_~floorID#1 := isFloorCalling_#in~floorID#1;havoc isFloorCalling_~retValue_acc~24#1;" "assume 0 == isFloorCalling_~floorID#1;isFloorCalling_~retValue_acc~24#1 := ~calls_0~0;isFloorCalling_#res#1 := isFloorCalling_~retValue_acc~24#1;" "isExecutiveFloorCalling_#t~ret115#1 := isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~24#1;havoc isFloorCalling_#in~floorID#1;assume { :end_inline_isFloorCalling } true;isExecutiveFloorCalling_~retValue_acc~20#1 := isExecutiveFloorCalling_#t~ret115#1;havoc isExecutiveFloorCalling_#t~ret115#1;isExecutiveFloorCalling_#res#1 := isExecutiveFloorCalling_~retValue_acc~20#1;" "stopRequestedAtCurrentFloor_#t~ret59#1 := isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret115#1, isExecutiveFloorCalling_~retValue_acc~20#1;assume { :end_inline_isExecutiveFloorCalling } true;stopRequestedAtCurrentFloor_~tmp~13#1 := stopRequestedAtCurrentFloor_#t~ret59#1;havoc stopRequestedAtCurrentFloor_#t~ret59#1;" "assume 0 != stopRequestedAtCurrentFloor_~tmp~13#1;assume { :begin_inline_getCurrentFloorID } true;havoc getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~4#1;havoc getCurrentFloorID_~retValue_acc~4#1;getCurrentFloorID_~retValue_acc~4#1 := ~currentFloorID~0;getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~4#1;" "stopRequestedAtCurrentFloor_#t~ret60#1 := getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~4#1;assume { :end_inline_getCurrentFloorID } true;stopRequestedAtCurrentFloor_~tmp___0~5#1 := stopRequestedAtCurrentFloor_#t~ret60#1;havoc stopRequestedAtCurrentFloor_#t~ret60#1;" "assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~5#1);stopRequestedAtCurrentFloor_~retValue_acc~17#1 := 0;stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~17#1;" "timeShift__wrappee__executivefloor_#t~ret75#1 := stopRequestedAtCurrentFloor_#res#1;havoc stopRequestedAtCurrentFloor_#t~ret59#1, stopRequestedAtCurrentFloor_#t~ret60#1, stopRequestedAtCurrentFloor_#t~ret61#1, stopRequestedAtCurrentFloor_#t~ret62#1, stopRequestedAtCurrentFloor_~retValue_acc~17#1, stopRequestedAtCurrentFloor_~tmp~13#1, stopRequestedAtCurrentFloor_~tmp___0~5#1;assume { :end_inline_stopRequestedAtCurrentFloor } true;timeShift__wrappee__executivefloor_~tmp___9~2#1 := timeShift__wrappee__executivefloor_#t~ret75#1;havoc timeShift__wrappee__executivefloor_#t~ret75#1;" "assume !(0 != timeShift__wrappee__executivefloor_~tmp___9~2#1);" "assume 1 == ~doorState~0;~doorState~0 := 0;" "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~ret50#1, stopRequestedInDirection_#t~ret51#1, stopRequestedInDirection_#t~ret52#1, stopRequestedInDirection_~dir#1, stopRequestedInDirection_~respectFloorCalls#1, stopRequestedInDirection_~respectInLiftCalls#1, stopRequestedInDirection_~retValue_acc~13#1, stopRequestedInDirection_~tmp~9#1, stopRequestedInDirection_~tmp___0~2#1, stopRequestedInDirection_~__cil_tmp7~5#1, stopRequestedInDirection_~__cil_tmp8~6#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~13#1;havoc stopRequestedInDirection_~tmp~9#1;havoc stopRequestedInDirection_~tmp___0~2#1;havoc stopRequestedInDirection_~__cil_tmp7~5#1;havoc stopRequestedInDirection_~__cil_tmp8~6#1;assume { :begin_inline_isExecutiveFloorCalling } true;havoc isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret115#1, isExecutiveFloorCalling_~retValue_acc~20#1;havoc isExecutiveFloorCalling_~retValue_acc~20#1;assume { :begin_inline_isFloorCalling } true;isFloorCalling_#in~floorID#1 := ~executiveFloor~0;havoc isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~24#1;isFloorCalling_~floorID#1 := isFloorCalling_#in~floorID#1;havoc isFloorCalling_~retValue_acc~24#1;" "assume 0 == isFloorCalling_~floorID#1;isFloorCalling_~retValue_acc~24#1 := ~calls_0~0;isFloorCalling_#res#1 := isFloorCalling_~retValue_acc~24#1;" "isExecutiveFloorCalling_#t~ret115#1 := isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~24#1;havoc isFloorCalling_#in~floorID#1;assume { :end_inline_isFloorCalling } true;isExecutiveFloorCalling_~retValue_acc~20#1 := isExecutiveFloorCalling_#t~ret115#1;havoc isExecutiveFloorCalling_#t~ret115#1;isExecutiveFloorCalling_#res#1 := isExecutiveFloorCalling_~retValue_acc~20#1;" "stopRequestedInDirection_#t~ret50#1 := isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret115#1, isExecutiveFloorCalling_~retValue_acc~20#1;assume { :end_inline_isExecutiveFloorCalling } true;stopRequestedInDirection_~tmp___0~2#1 := stopRequestedInDirection_#t~ret50#1;havoc stopRequestedInDirection_#t~ret50#1;" "assume 0 != stopRequestedInDirection_~tmp___0~2#1;assume { :begin_inline_getCurrentFloorID } true;havoc getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~4#1;havoc getCurrentFloorID_~retValue_acc~4#1;getCurrentFloorID_~retValue_acc~4#1 := ~currentFloorID~0;getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~4#1;" "stopRequestedInDirection_#t~ret51#1 := getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~4#1;assume { :end_inline_getCurrentFloorID } true;stopRequestedInDirection_~tmp~9#1 := stopRequestedInDirection_#t~ret51#1;havoc stopRequestedInDirection_#t~ret51#1;stopRequestedInDirection_~__cil_tmp7~5#1 := (if 1 == stopRequestedInDirection_~dir#1 then 1 else 0);stopRequestedInDirection_~__cil_tmp8~6#1 := (if stopRequestedInDirection_~tmp~9#1 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~13#1 := (if stopRequestedInDirection_~__cil_tmp8~6#1 == stopRequestedInDirection_~__cil_tmp7~5#1 then 1 else 0);stopRequestedInDirection_#res#1 := stopRequestedInDirection_~retValue_acc~13#1;" "timeShift__wrappee__executivefloor_#t~ret82#1 := stopRequestedInDirection_#res#1;havoc stopRequestedInDirection_#t~ret50#1, stopRequestedInDirection_#t~ret51#1, stopRequestedInDirection_#t~ret52#1, stopRequestedInDirection_~dir#1, stopRequestedInDirection_~respectFloorCalls#1, stopRequestedInDirection_~respectInLiftCalls#1, stopRequestedInDirection_~retValue_acc~13#1, stopRequestedInDirection_~tmp~9#1, stopRequestedInDirection_~tmp___0~2#1, stopRequestedInDirection_~__cil_tmp7~5#1, stopRequestedInDirection_~__cil_tmp8~6#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~ret82#1;havoc timeShift__wrappee__executivefloor_#t~ret82#1;" "assume 0 != timeShift__wrappee__executivefloor_~tmp___8~2#1;assume { :begin_inline_continueInDirection } true;continueInDirection_#in~dir#1 := ~currentHeading~0;havoc continueInDirection_#t~ret53#1, continueInDirection_~dir#1, continueInDirection_~tmp~10#1;continueInDirection_~dir#1 := continueInDirection_#in~dir#1;havoc continueInDirection_~tmp~10#1;~currentHeading~0 := continueInDirection_~dir#1;" "assume !(1 == ~currentHeading~0);" "assume !(0 == ~currentFloorID~0);" "assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1;" "havoc continueInDirection_#t~ret53#1, continueInDirection_~dir#1, continueInDirection_~tmp~10#1;havoc continueInDirection_#in~dir#1;assume { :end_inline_continueInDirection } true;" "havoc timeShift__wrappee__executivefloor_#t~ret75#1, timeShift__wrappee__executivefloor_#t~ret76#1, timeShift__wrappee__executivefloor_#t~ret77#1, timeShift__wrappee__executivefloor_#t~ret78#1, timeShift__wrappee__executivefloor_#t~ret79#1, timeShift__wrappee__executivefloor_#t~ret80#1, timeShift__wrappee__executivefloor_#t~ret81#1, timeShift__wrappee__executivefloor_#t~ret82#1, timeShift__wrappee__executivefloor_#t~ret83#1, timeShift__wrappee__executivefloor_#t~ret84#1, timeShift__wrappee__executivefloor_#t~ret85#1, timeShift__wrappee__executivefloor_~tmp~15#1, timeShift__wrappee__executivefloor_~tmp___0~7#1, timeShift__wrappee__executivefloor_~tmp___1~3#1, timeShift__wrappee__executivefloor_~tmp___2~3#1, timeShift__wrappee__executivefloor_~tmp___3~3#1, timeShift__wrappee__executivefloor_~tmp___4~2#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;" "assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret137#1, __utac_acc__Specification13_spec__2_#t~ret138#1, __utac_acc__Specification13_spec__2_#t~ret139#1, __utac_acc__Specification13_spec__2_#t~ret140#1, __utac_acc__Specification13_spec__2_#t~ret141#1, __utac_acc__Specification13_spec__2_#t~ret142#1, __utac_acc__Specification13_spec__2_~tmp~30#1, __utac_acc__Specification13_spec__2_~tmp___0~13#1, __utac_acc__Specification13_spec__2_~tmp___1~8#1, __utac_acc__Specification13_spec__2_~tmp___2~6#1, __utac_acc__Specification13_spec__2_~tmp___3~5#1, __utac_acc__Specification13_spec__2_~tmp___4~3#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~8#1;havoc __utac_acc__Specification13_spec__2_~tmp~30#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~13#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~8#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~6#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~5#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~3#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~8#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~8#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 / 3);" "assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~8#1;" "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~19#1, existInLiftCallsInDirection_~i~0#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~19#1;havoc existInLiftCallsInDirection_~i~0#1;havoc existInLiftCallsInDirection_~i___0~0#1;" "assume !(1 == existInLiftCallsInDirection_~d#1);" "assume 0 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i___0~0#1 := 0;existInLiftCallsInDirection_~i___0~0#1 := ~currentFloorID~0 - 1;" [2025-01-10 07:36:48,157 INFO L754 eck$LassoCheckResult]: Loop: "assume existInLiftCallsInDirection_~i___0~0#1 >= 0;" "existInLiftCallsInDirection_~i___0~0#1 := 1 + ~currentFloorID~0;" "assume !(existInLiftCallsInDirection_~i___0~0#1 < 5);" "existInLiftCallsInDirection_~i___0~0#1 := existInLiftCallsInDirection_~i___0~0#1 - 1;" [2025-01-10 07:36:48,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:48,158 INFO L85 PathProgramCache]: Analyzing trace with hash 886367618, now seen corresponding path program 1 times [2025-01-10 07:36:48,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:48,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969159452] [2025-01-10 07:36:48,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:36:48,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:48,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-10 07:36:48,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-10 07:36:48,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:48,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:36:48,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:36:48,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:36:48,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969159452] [2025-01-10 07:36:48,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969159452] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:36:48,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:36:48,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 07:36:48,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093144284] [2025-01-10 07:36:48,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:36:48,263 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:36:48,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:48,263 INFO L85 PathProgramCache]: Analyzing trace with hash 514712802, now seen corresponding path program 10 times [2025-01-10 07:36:48,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:48,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140488143] [2025-01-10 07:36:48,264 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:36:48,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:48,280 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 4 statements into 2 equivalence classes. [2025-01-10 07:36:48,281 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:36:48,281 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:36:48,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:48,281 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:36:48,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:36:48,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:36:48,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:48,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:48,290 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:36:48,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:36:48,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 07:36:48,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 07:36:48,311 INFO L87 Difference]: Start difference. First operand 28024 states and 52071 transitions. cyclomatic complexity: 24181 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) [2025-01-10 07:36:54,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:36:54,005 INFO L93 Difference]: Finished difference Result 28024 states and 50816 transitions. [2025-01-10 07:36:54,005 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28024 states and 50816 transitions. [2025-01-10 07:36:54,130 INFO L131 ngComponentsAnalysis]: Automaton has 122 accepting balls. 8268 [2025-01-10 07:36:54,216 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28024 states to 28024 states and 50816 transitions. [2025-01-10 07:36:54,217 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27787 [2025-01-10 07:36:54,239 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27787 [2025-01-10 07:36:54,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28024 states and 50816 transitions. [2025-01-10 07:36:54,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:36:54,257 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28024 states and 50816 transitions. [2025-01-10 07:36:54,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28024 states and 50816 transitions. [2025-01-10 07:36:54,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28024 to 28024. [2025-01-10 07:36:54,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28024 states, 28024 states have (on average 1.8133028832429345) internal successors, (50816), 28023 states have internal predecessors, (50816), 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) [2025-01-10 07:36:54,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28024 states to 28024 states and 50816 transitions. [2025-01-10 07:36:54,677 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28024 states and 50816 transitions. [2025-01-10 07:36:54,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 07:36:54,677 INFO L432 stractBuchiCegarLoop]: Abstraction has 28024 states and 50816 transitions. [2025-01-10 07:36:54,677 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-01-10 07:36:54,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28024 states and 50816 transitions. [2025-01-10 07:36:54,772 INFO L131 ngComponentsAnalysis]: Automaton has 122 accepting balls. 8268 [2025-01-10 07:36:54,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:36:54,773 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:36:54,773 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:36:54,773 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 07:36:54,774 INFO L752 eck$LassoCheckResult]: Stem: "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);~head~0.base, ~head~0.offset := 0, 0;~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~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;~cleanupTimeShifts~0 := 12;~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;~prevDir~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret129#1, main_~retValue_acc~23#1, main_~tmp~27#1;havoc main_~retValue_acc~23#1;havoc main_~tmp~27#1;assume { :begin_inline_select_helpers } true;" "assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true;" "assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~31#1;havoc valid_product_~retValue_acc~31#1;valid_product_~retValue_acc~31#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~31#1;" "main_#t~ret129#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~31#1;assume { :end_inline_valid_product } true;main_~tmp~27#1 := main_#t~ret129#1;havoc main_#t~ret129#1;" "assume 0 != main_~tmp~27#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret118#1, aliceCall_~tmp~20#1;havoc aliceCall_~tmp~20#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~28#1;" "assume !(0 == getOrigin_~person#1);" "assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~28#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~28#1;" "aliceCall_#t~ret118#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~20#1 := aliceCall_#t~ret118#1;havoc aliceCall_#t~ret118#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~20#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume !(0 == initPersonOnFloor_~floor#1);" "assume !(1 == initPersonOnFloor_~floor#1);" "assume !(2 == initPersonOnFloor_~floor#1);" "assume 3 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_3~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume !(0 == callOnFloor_~floorID#1);" "assume !(1 == callOnFloor_~floorID#1);" "assume !(2 == callOnFloor_~floorID#1);" "assume 3 == callOnFloor_~floorID#1;~calls_3~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc aliceCall_#t~ret118#1, aliceCall_~tmp~20#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret119#1, angelinaCall_~tmp~21#1;havoc angelinaCall_~tmp~21#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~28#1;" "assume !(0 == getOrigin_~person#1);" "assume !(1 == getOrigin_~person#1);" "assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~28#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~28#1;" "angelinaCall_#t~ret119#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~28#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~21#1 := angelinaCall_#t~ret119#1;havoc angelinaCall_#t~ret119#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~21#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume !(0 == initPersonOnFloor_~floor#1);" "assume !(1 == initPersonOnFloor_~floor#1);" "assume 2 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume !(1 == initPersonOnFloor_~person#1);" "assume 2 == initPersonOnFloor_~person#1;~personOnFloor_2_2~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume !(0 == callOnFloor_~floorID#1);" "assume !(1 == callOnFloor_~floorID#1);" "assume 2 == callOnFloor_~floorID#1;~calls_2~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc angelinaCall_#t~ret119#1, angelinaCall_~tmp~21#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret86#1, timeShift_~tmp~16#1;havoc timeShift_~tmp~16#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret136#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~7#1;havoc getCurrentHeading_~retValue_acc~7#1;getCurrentHeading_~retValue_acc~7#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~7#1;" "__utac_acc__Specification13_spec__1_#t~ret136#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~7#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret136#1;havoc __utac_acc__Specification13_spec__1_#t~ret136#1;" "havoc __utac_acc__Specification13_spec__1_#t~ret136#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~5#1;havoc areDoorsOpen_~retValue_acc~5#1;areDoorsOpen_~retValue_acc~5#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~5#1;" "timeShift_#t~ret86#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~5#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~16#1 := timeShift_#t~ret86#1;havoc timeShift_#t~ret86#1;" "assume 0 != timeShift_~tmp~16#1;" "assume !(~weight~0 > ~maximumWeight~0);~blocked~0 := 0;assume { :begin_inline_timeShift__wrappee__executivefloor } true;havoc timeShift__wrappee__executivefloor_#t~ret75#1, timeShift__wrappee__executivefloor_#t~ret76#1, timeShift__wrappee__executivefloor_#t~ret77#1, timeShift__wrappee__executivefloor_#t~ret78#1, timeShift__wrappee__executivefloor_#t~ret79#1, timeShift__wrappee__executivefloor_#t~ret80#1, timeShift__wrappee__executivefloor_#t~ret81#1, timeShift__wrappee__executivefloor_#t~ret82#1, timeShift__wrappee__executivefloor_#t~ret83#1, timeShift__wrappee__executivefloor_#t~ret84#1, timeShift__wrappee__executivefloor_#t~ret85#1, timeShift__wrappee__executivefloor_~tmp~15#1, timeShift__wrappee__executivefloor_~tmp___0~7#1, timeShift__wrappee__executivefloor_~tmp___1~3#1, timeShift__wrappee__executivefloor_~tmp___2~3#1, timeShift__wrappee__executivefloor_~tmp___3~3#1, timeShift__wrappee__executivefloor_~tmp___4~2#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~15#1;havoc timeShift__wrappee__executivefloor_~tmp___0~7#1;havoc timeShift__wrappee__executivefloor_~tmp___1~3#1;havoc timeShift__wrappee__executivefloor_~tmp___2~3#1;havoc timeShift__wrappee__executivefloor_~tmp___3~3#1;havoc timeShift__wrappee__executivefloor_~tmp___4~2#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~ret59#1, stopRequestedAtCurrentFloor_#t~ret60#1, stopRequestedAtCurrentFloor_#t~ret61#1, stopRequestedAtCurrentFloor_#t~ret62#1, stopRequestedAtCurrentFloor_~retValue_acc~17#1, stopRequestedAtCurrentFloor_~tmp~13#1, stopRequestedAtCurrentFloor_~tmp___0~5#1;havoc stopRequestedAtCurrentFloor_~retValue_acc~17#1;havoc stopRequestedAtCurrentFloor_~tmp~13#1;havoc stopRequestedAtCurrentFloor_~tmp___0~5#1;assume { :begin_inline_isExecutiveFloorCalling } true;havoc isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret115#1, isExecutiveFloorCalling_~retValue_acc~20#1;havoc isExecutiveFloorCalling_~retValue_acc~20#1;assume { :begin_inline_isFloorCalling } true;isFloorCalling_#in~floorID#1 := ~executiveFloor~0;havoc isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~24#1;isFloorCalling_~floorID#1 := isFloorCalling_#in~floorID#1;havoc isFloorCalling_~retValue_acc~24#1;" "assume !(0 == isFloorCalling_~floorID#1);" "assume !(1 == isFloorCalling_~floorID#1);" "assume !(2 == isFloorCalling_~floorID#1);" "assume !(3 == isFloorCalling_~floorID#1);" "assume 4 == isFloorCalling_~floorID#1;isFloorCalling_~retValue_acc~24#1 := ~calls_4~0;isFloorCalling_#res#1 := isFloorCalling_~retValue_acc~24#1;" "isExecutiveFloorCalling_#t~ret115#1 := isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~24#1;havoc isFloorCalling_#in~floorID#1;assume { :end_inline_isFloorCalling } true;isExecutiveFloorCalling_~retValue_acc~20#1 := isExecutiveFloorCalling_#t~ret115#1;havoc isExecutiveFloorCalling_#t~ret115#1;isExecutiveFloorCalling_#res#1 := isExecutiveFloorCalling_~retValue_acc~20#1;" "stopRequestedAtCurrentFloor_#t~ret59#1 := isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret115#1, isExecutiveFloorCalling_~retValue_acc~20#1;assume { :end_inline_isExecutiveFloorCalling } true;stopRequestedAtCurrentFloor_~tmp~13#1 := stopRequestedAtCurrentFloor_#t~ret59#1;havoc stopRequestedAtCurrentFloor_#t~ret59#1;" "assume 0 != stopRequestedAtCurrentFloor_~tmp~13#1;assume { :begin_inline_getCurrentFloorID } true;havoc getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~4#1;havoc getCurrentFloorID_~retValue_acc~4#1;getCurrentFloorID_~retValue_acc~4#1 := ~currentFloorID~0;getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~4#1;" "stopRequestedAtCurrentFloor_#t~ret60#1 := getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~4#1;assume { :end_inline_getCurrentFloorID } true;stopRequestedAtCurrentFloor_~tmp___0~5#1 := stopRequestedAtCurrentFloor_#t~ret60#1;havoc stopRequestedAtCurrentFloor_#t~ret60#1;" "assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~5#1);stopRequestedAtCurrentFloor_~retValue_acc~17#1 := 0;stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~17#1;" "timeShift__wrappee__executivefloor_#t~ret75#1 := stopRequestedAtCurrentFloor_#res#1;havoc stopRequestedAtCurrentFloor_#t~ret59#1, stopRequestedAtCurrentFloor_#t~ret60#1, stopRequestedAtCurrentFloor_#t~ret61#1, stopRequestedAtCurrentFloor_#t~ret62#1, stopRequestedAtCurrentFloor_~retValue_acc~17#1, stopRequestedAtCurrentFloor_~tmp~13#1, stopRequestedAtCurrentFloor_~tmp___0~5#1;assume { :end_inline_stopRequestedAtCurrentFloor } true;timeShift__wrappee__executivefloor_~tmp___9~2#1 := timeShift__wrappee__executivefloor_#t~ret75#1;havoc timeShift__wrappee__executivefloor_#t~ret75#1;" "assume !(0 != timeShift__wrappee__executivefloor_~tmp___9~2#1);" "assume 1 == ~doorState~0;~doorState~0 := 0;" "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~ret50#1, stopRequestedInDirection_#t~ret51#1, stopRequestedInDirection_#t~ret52#1, stopRequestedInDirection_~dir#1, stopRequestedInDirection_~respectFloorCalls#1, stopRequestedInDirection_~respectInLiftCalls#1, stopRequestedInDirection_~retValue_acc~13#1, stopRequestedInDirection_~tmp~9#1, stopRequestedInDirection_~tmp___0~2#1, stopRequestedInDirection_~__cil_tmp7~5#1, stopRequestedInDirection_~__cil_tmp8~6#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~13#1;havoc stopRequestedInDirection_~tmp~9#1;havoc stopRequestedInDirection_~tmp___0~2#1;havoc stopRequestedInDirection_~__cil_tmp7~5#1;havoc stopRequestedInDirection_~__cil_tmp8~6#1;assume { :begin_inline_isExecutiveFloorCalling } true;havoc isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret115#1, isExecutiveFloorCalling_~retValue_acc~20#1;havoc isExecutiveFloorCalling_~retValue_acc~20#1;assume { :begin_inline_isFloorCalling } true;isFloorCalling_#in~floorID#1 := ~executiveFloor~0;havoc isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~24#1;isFloorCalling_~floorID#1 := isFloorCalling_#in~floorID#1;havoc isFloorCalling_~retValue_acc~24#1;" "assume !(0 == isFloorCalling_~floorID#1);" "assume !(1 == isFloorCalling_~floorID#1);" "assume !(2 == isFloorCalling_~floorID#1);" "assume !(3 == isFloorCalling_~floorID#1);" "assume 4 == isFloorCalling_~floorID#1;isFloorCalling_~retValue_acc~24#1 := ~calls_4~0;isFloorCalling_#res#1 := isFloorCalling_~retValue_acc~24#1;" "isExecutiveFloorCalling_#t~ret115#1 := isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~24#1;havoc isFloorCalling_#in~floorID#1;assume { :end_inline_isFloorCalling } true;isExecutiveFloorCalling_~retValue_acc~20#1 := isExecutiveFloorCalling_#t~ret115#1;havoc isExecutiveFloorCalling_#t~ret115#1;isExecutiveFloorCalling_#res#1 := isExecutiveFloorCalling_~retValue_acc~20#1;" "stopRequestedInDirection_#t~ret50#1 := isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret115#1, isExecutiveFloorCalling_~retValue_acc~20#1;assume { :end_inline_isExecutiveFloorCalling } true;stopRequestedInDirection_~tmp___0~2#1 := stopRequestedInDirection_#t~ret50#1;havoc stopRequestedInDirection_#t~ret50#1;" "assume 0 != stopRequestedInDirection_~tmp___0~2#1;assume { :begin_inline_getCurrentFloorID } true;havoc getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~4#1;havoc getCurrentFloorID_~retValue_acc~4#1;getCurrentFloorID_~retValue_acc~4#1 := ~currentFloorID~0;getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~4#1;" "stopRequestedInDirection_#t~ret51#1 := getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~4#1;assume { :end_inline_getCurrentFloorID } true;stopRequestedInDirection_~tmp~9#1 := stopRequestedInDirection_#t~ret51#1;havoc stopRequestedInDirection_#t~ret51#1;stopRequestedInDirection_~__cil_tmp7~5#1 := (if 1 == stopRequestedInDirection_~dir#1 then 1 else 0);stopRequestedInDirection_~__cil_tmp8~6#1 := (if stopRequestedInDirection_~tmp~9#1 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~13#1 := (if stopRequestedInDirection_~__cil_tmp8~6#1 == stopRequestedInDirection_~__cil_tmp7~5#1 then 1 else 0);stopRequestedInDirection_#res#1 := stopRequestedInDirection_~retValue_acc~13#1;" "timeShift__wrappee__executivefloor_#t~ret82#1 := stopRequestedInDirection_#res#1;havoc stopRequestedInDirection_#t~ret50#1, stopRequestedInDirection_#t~ret51#1, stopRequestedInDirection_#t~ret52#1, stopRequestedInDirection_~dir#1, stopRequestedInDirection_~respectFloorCalls#1, stopRequestedInDirection_~respectInLiftCalls#1, stopRequestedInDirection_~retValue_acc~13#1, stopRequestedInDirection_~tmp~9#1, stopRequestedInDirection_~tmp___0~2#1, stopRequestedInDirection_~__cil_tmp7~5#1, stopRequestedInDirection_~__cil_tmp8~6#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~ret82#1;havoc timeShift__wrappee__executivefloor_#t~ret82#1;" "assume 0 != timeShift__wrappee__executivefloor_~tmp___8~2#1;assume { :begin_inline_continueInDirection } true;continueInDirection_#in~dir#1 := ~currentHeading~0;havoc continueInDirection_#t~ret53#1, continueInDirection_~dir#1, continueInDirection_~tmp~10#1;continueInDirection_~dir#1 := continueInDirection_#in~dir#1;havoc continueInDirection_~tmp~10#1;~currentHeading~0 := continueInDirection_~dir#1;" "assume !(1 == ~currentHeading~0);" "assume !(0 == ~currentFloorID~0);" "assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1;" "havoc continueInDirection_#t~ret53#1, continueInDirection_~dir#1, continueInDirection_~tmp~10#1;havoc continueInDirection_#in~dir#1;assume { :end_inline_continueInDirection } true;" "havoc timeShift__wrappee__executivefloor_#t~ret75#1, timeShift__wrappee__executivefloor_#t~ret76#1, timeShift__wrappee__executivefloor_#t~ret77#1, timeShift__wrappee__executivefloor_#t~ret78#1, timeShift__wrappee__executivefloor_#t~ret79#1, timeShift__wrappee__executivefloor_#t~ret80#1, timeShift__wrappee__executivefloor_#t~ret81#1, timeShift__wrappee__executivefloor_#t~ret82#1, timeShift__wrappee__executivefloor_#t~ret83#1, timeShift__wrappee__executivefloor_#t~ret84#1, timeShift__wrappee__executivefloor_#t~ret85#1, timeShift__wrappee__executivefloor_~tmp~15#1, timeShift__wrappee__executivefloor_~tmp___0~7#1, timeShift__wrappee__executivefloor_~tmp___1~3#1, timeShift__wrappee__executivefloor_~tmp___2~3#1, timeShift__wrappee__executivefloor_~tmp___3~3#1, timeShift__wrappee__executivefloor_~tmp___4~2#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;" "assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret137#1, __utac_acc__Specification13_spec__2_#t~ret138#1, __utac_acc__Specification13_spec__2_#t~ret139#1, __utac_acc__Specification13_spec__2_#t~ret140#1, __utac_acc__Specification13_spec__2_#t~ret141#1, __utac_acc__Specification13_spec__2_#t~ret142#1, __utac_acc__Specification13_spec__2_~tmp~30#1, __utac_acc__Specification13_spec__2_~tmp___0~13#1, __utac_acc__Specification13_spec__2_~tmp___1~8#1, __utac_acc__Specification13_spec__2_~tmp___2~6#1, __utac_acc__Specification13_spec__2_~tmp___3~5#1, __utac_acc__Specification13_spec__2_~tmp___4~3#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~8#1;havoc __utac_acc__Specification13_spec__2_~tmp~30#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~13#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~8#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~6#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~5#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~3#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~8#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~8#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~7#1 / 3);" "assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~8#1;" "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~19#1, existInLiftCallsInDirection_~i~0#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~19#1;havoc existInLiftCallsInDirection_~i~0#1;havoc existInLiftCallsInDirection_~i___0~0#1;" "assume !(1 == existInLiftCallsInDirection_~d#1);" "assume 0 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i___0~0#1 := 0;existInLiftCallsInDirection_~i___0~0#1 := ~currentFloorID~0 - 1;" [2025-01-10 07:36:54,774 INFO L754 eck$LassoCheckResult]: Loop: "assume existInLiftCallsInDirection_~i___0~0#1 >= 0;" "existInLiftCallsInDirection_~i___0~0#1 := 1 + ~currentFloorID~0;" "assume !(existInLiftCallsInDirection_~i___0~0#1 < 5);" "existInLiftCallsInDirection_~i___0~0#1 := existInLiftCallsInDirection_~i___0~0#1 - 1;" [2025-01-10 07:36:54,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:54,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1301382166, now seen corresponding path program 1 times [2025-01-10 07:36:54,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:54,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570721666] [2025-01-10 07:36:54,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:36:54,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:54,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-10 07:36:54,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-10 07:36:54,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:54,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:36:54,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:36:54,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:36:54,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570721666] [2025-01-10 07:36:54,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570721666] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:36:54,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:36:54,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 07:36:54,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123877138] [2025-01-10 07:36:54,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:36:54,912 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:36:54,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:54,912 INFO L85 PathProgramCache]: Analyzing trace with hash 514712802, now seen corresponding path program 11 times [2025-01-10 07:36:54,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:54,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120842484] [2025-01-10 07:36:54,912 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:36:54,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:54,933 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:36:54,934 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:36:54,934 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:36:54,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:54,934 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:36:54,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:36:54,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:36:54,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:54,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:54,944 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:36:54,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:36:54,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 07:36:54,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 07:36:54,968 INFO L87 Difference]: Start difference. First operand 28024 states and 50816 transitions. cyclomatic complexity: 22926 Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 5 states have internal predecessors, (81), 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)