./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/product-lines/elevator_spec13_product30.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version ff03de63 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/product-lines/elevator_spec13_product30.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d84130cab59568fb669543ac086f4847eedfc87145b3c30d32e19c1d0d03b42f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 22:23:40,024 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 22:23:40,025 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 22:23:40,068 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 22:23:40,068 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 22:23:40,071 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 22:23:40,073 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 22:23:40,078 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 22:23:40,080 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 22:23:40,084 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 22:23:40,085 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 22:23:40,086 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 22:23:40,086 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 22:23:40,088 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 22:23:40,089 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 22:23:40,091 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 22:23:40,091 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 22:23:40,092 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 22:23:40,095 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 22:23:40,100 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 22:23:40,102 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 22:23:40,103 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 22:23:40,104 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 22:23:40,105 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 22:23:40,111 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 22:23:40,111 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 22:23:40,111 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 22:23:40,113 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 22:23:40,113 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 22:23:40,114 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 22:23:40,114 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 22:23:40,115 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 22:23:40,116 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 22:23:40,117 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 22:23:40,118 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 22:23:40,119 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 22:23:40,119 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 22:23:40,120 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 22:23:40,120 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 22:23:40,121 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 22:23:40,121 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 22:23:40,123 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-21 22:23:40,155 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 22:23:40,156 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 22:23:40,156 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 22:23:40,156 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 22:23:40,158 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 22:23:40,158 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 22:23:40,158 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 22:23:40,158 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-21 22:23:40,158 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-21 22:23:40,159 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-21 22:23:40,159 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-21 22:23:40,160 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-21 22:23:40,160 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-21 22:23:40,160 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 22:23:40,160 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 22:23:40,160 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-21 22:23:40,161 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 22:23:40,161 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 22:23:40,161 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 22:23:40,161 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-21 22:23:40,161 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-21 22:23:40,162 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-21 22:23:40,162 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 22:23:40,162 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 22:23:40,162 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-21 22:23:40,162 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 22:23:40,162 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-21 22:23:40,163 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 22:23:40,163 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 22:23:40,163 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 22:23:40,164 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 22:23:40,164 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 22:23:40,165 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-21 22:23:40,165 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d84130cab59568fb669543ac086f4847eedfc87145b3c30d32e19c1d0d03b42f [2021-12-21 22:23:40,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 22:23:40,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 22:23:40,411 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 22:23:40,412 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 22:23:40,412 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 22:23:40,413 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec13_product30.cil.c [2021-12-21 22:23:40,473 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4599f0f02/f9f8ff0398c04a079da948481b796376/FLAGfb42626dc [2021-12-21 22:23:40,949 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 22:23:40,949 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec13_product30.cil.c [2021-12-21 22:23:40,980 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4599f0f02/f9f8ff0398c04a079da948481b796376/FLAGfb42626dc [2021-12-21 22:23:41,276 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4599f0f02/f9f8ff0398c04a079da948481b796376 [2021-12-21 22:23:41,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 22:23:41,279 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 22:23:41,281 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 22:23:41,282 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 22:23:41,284 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 22:23:41,285 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:23:41" (1/1) ... [2021-12-21 22:23:41,286 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7debc0f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:23:41, skipping insertion in model container [2021-12-21 22:23:41,286 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:23:41" (1/1) ... [2021-12-21 22:23:41,292 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 22:23:41,351 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 22:23:41,669 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec13_product30.cil.c[61393,61406] [2021-12-21 22:23:41,708 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 22:23:41,722 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 22:23:41,807 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec13_product30.cil.c[61393,61406] [2021-12-21 22:23:41,819 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 22:23:41,840 INFO L208 MainTranslator]: Completed translation [2021-12-21 22:23:41,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:23:41 WrapperNode [2021-12-21 22:23:41,841 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 22:23:41,842 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 22:23:41,842 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 22:23:41,842 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 22:23:41,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:23:41" (1/1) ... [2021-12-21 22:23:41,871 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:23:41" (1/1) ... [2021-12-21 22:23:42,488 INFO L137 Inliner]: procedures = 93, calls = 346, calls flagged for inlining = 198, calls inlined = 1875, statements flattened = 66503 [2021-12-21 22:23:42,489 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 22:23:42,490 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 22:23:42,490 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 22:23:42,490 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 22:23:42,498 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:23:41" (1/1) ... [2021-12-21 22:23:42,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:23:41" (1/1) ... [2021-12-21 22:23:42,640 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:23:41" (1/1) ... [2021-12-21 22:23:42,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:23:41" (1/1) ... [2021-12-21 22:23:43,166 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:23:41" (1/1) ... [2021-12-21 22:23:43,755 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:23:41" (1/1) ... [2021-12-21 22:23:43,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:23:41" (1/1) ... [2021-12-21 22:23:43,998 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 22:23:43,999 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 22:23:44,000 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 22:23:44,001 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 22:23:44,001 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:23:41" (1/1) ... [2021-12-21 22:23:44,008 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:23:44,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:23:44,032 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:23:44,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-21 22:23:44,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 22:23:44,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 22:23:44,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 22:23:44,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 22:23:44,303 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 22:23:44,305 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 22:24:01,793 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 22:24:01,894 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 22:24:01,894 INFO L299 CfgBuilder]: Removed 61 assume(true) statements. [2021-12-21 22:24:01,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:24:01 BoogieIcfgContainer [2021-12-21 22:24:01,916 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 22:24:01,917 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-21 22:24:01,917 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-21 22:24:01,920 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-21 22:24:01,921 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 22:24:01,921 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.12 10:23:41" (1/3) ... [2021-12-21 22:24:01,922 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c57e11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.12 10:24:01, skipping insertion in model container [2021-12-21 22:24:01,922 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 22:24:01,922 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:23:41" (2/3) ... [2021-12-21 22:24:01,923 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c57e11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.12 10:24:01, skipping insertion in model container [2021-12-21 22:24:01,923 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 22:24:01,924 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:24:01" (3/3) ... [2021-12-21 22:24:01,925 INFO L388 chiAutomizerObserver]: Analyzing ICFG elevator_spec13_product30.cil.c [2021-12-21 22:24:01,966 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-21 22:24:01,966 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-21 22:24:01,966 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-21 22:24:01,966 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-21 22:24:01,966 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-21 22:24:01,966 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-21 22:24:01,967 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-21 22:24:01,967 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-21 22:24:02,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17932 states, 17931 states have (on average 1.8808209246556244) internal successors, (33725), 17931 states have internal predecessors, (33725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:24:02,534 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4072 [2021-12-21 22:24:02,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:24:02,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:24:02,545 INFO L842 BuchiCegarLoop]: 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] [2021-12-21 22:24:02,546 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:24:02,546 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-21 22:24:02,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17932 states, 17931 states have (on average 1.8808209246556244) internal successors, (33725), 17931 states have internal predecessors, (33725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:24:02,822 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4072 [2021-12-21 22:24:02,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:24:02,822 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:24:02,825 INFO L842 BuchiCegarLoop]: 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] [2021-12-21 22:24:02,826 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:24:02,837 INFO L791 eck$LassoCheckResult]: Stem: 7195#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(10, 4);call #Ultimate.allocInit(4, 5);call write~init~int(91, 5, 0, 1);call write~init~int(95, 5, 1, 1);call write~init~int(93, 5, 2, 1);call write~init~int(0, 5, 3, 1);call #Ultimate.allocInit(4, 6);call write~init~int(91, 6, 0, 1);call write~init~int(93, 6, 1, 1);call write~init~int(32, 6, 2, 1);call write~init~int(0, 6, 3, 1);call #Ultimate.allocInit(5, 7);call write~init~int(32, 7, 0, 1);call write~init~int(97, 7, 1, 1);call write~init~int(116, 7, 2, 1);call write~init~int(32, 7, 3, 1);call write~init~int(0, 7, 4, 1);call #Ultimate.allocInit(3, 8);call write~init~int(37, 8, 0, 1);call write~init~int(105, 8, 1, 1);call write~init~int(0, 8, 2, 1);call #Ultimate.allocInit(10, 9);call #Ultimate.allocInit(3, 10);call write~init~int(117, 10, 0, 1);call write~init~int(112, 10, 1, 1);call write~init~int(0, 10, 2, 1);call #Ultimate.allocInit(5, 11);call write~init~int(100, 11, 0, 1);call write~init~int(111, 11, 1, 1);call write~init~int(119, 11, 2, 1);call write~init~int(110, 11, 3, 1);call write~init~int(0, 11, 4, 1);call #Ultimate.allocInit(7, 12);call write~init~int(32, 12, 0, 1);call write~init~int(73, 12, 1, 1);call write~init~int(76, 12, 2, 1);call write~init~int(95, 12, 3, 1);call write~init~int(112, 12, 4, 1);call write~init~int(58, 12, 5, 1);call write~init~int(0, 12, 6, 1);call #Ultimate.allocInit(4, 13);call write~init~int(32, 13, 0, 1);call write~init~int(37, 13, 1, 1);call write~init~int(105, 13, 2, 1);call write~init~int(0, 13, 3, 1);call #Ultimate.allocInit(4, 14);call write~init~int(32, 14, 0, 1);call write~init~int(37, 14, 1, 1);call write~init~int(105, 14, 2, 1);call write~init~int(0, 14, 3, 1);call #Ultimate.allocInit(4, 15);call write~init~int(32, 15, 0, 1);call write~init~int(37, 15, 1, 1);call write~init~int(105, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(4, 16);call write~init~int(32, 16, 0, 1);call write~init~int(37, 16, 1, 1);call write~init~int(105, 16, 2, 1);call write~init~int(0, 16, 3, 1);call #Ultimate.allocInit(4, 17);call write~init~int(32, 17, 0, 1);call write~init~int(37, 17, 1, 1);call write~init~int(105, 17, 2, 1);call write~init~int(0, 17, 3, 1);call #Ultimate.allocInit(6, 18);call write~init~int(32, 18, 0, 1);call write~init~int(70, 18, 1, 1);call write~init~int(95, 18, 2, 1);call write~init~int(112, 18, 3, 1);call write~init~int(58, 18, 4, 1);call write~init~int(0, 18, 5, 1);call #Ultimate.allocInit(4, 19);call write~init~int(32, 19, 0, 1);call write~init~int(37, 19, 1, 1);call write~init~int(105, 19, 2, 1);call write~init~int(0, 19, 3, 1);call #Ultimate.allocInit(4, 20);call write~init~int(32, 20, 0, 1);call write~init~int(37, 20, 1, 1);call write~init~int(105, 20, 2, 1);call write~init~int(0, 20, 3, 1);call #Ultimate.allocInit(4, 21);call write~init~int(32, 21, 0, 1);call write~init~int(37, 21, 1, 1);call write~init~int(105, 21, 2, 1);call write~init~int(0, 21, 3, 1);call #Ultimate.allocInit(4, 22);call write~init~int(32, 22, 0, 1);call write~init~int(37, 22, 1, 1);call write~init~int(105, 22, 2, 1);call write~init~int(0, 22, 3, 1);call #Ultimate.allocInit(4, 23);call write~init~int(32, 23, 0, 1);call write~init~int(37, 23, 1, 1);call write~init~int(105, 23, 2, 1);call write~init~int(0, 23, 3, 1);call #Ultimate.allocInit(2, 24);call write~init~int(10, 24, 0, 1);call write~init~int(0, 24, 1, 1);call #Ultimate.allocInit(9, 25);call #Ultimate.allocInit(30, 26);call #Ultimate.allocInit(9, 27);call #Ultimate.allocInit(21, 28);call #Ultimate.allocInit(30, 29);call #Ultimate.allocInit(9, 30);call #Ultimate.allocInit(21, 31);call #Ultimate.allocInit(30, 32);call #Ultimate.allocInit(9, 33);call #Ultimate.allocInit(25, 34);call #Ultimate.allocInit(30, 35);call #Ultimate.allocInit(9, 36);call #Ultimate.allocInit(25, 37);~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;~weight~0 := 0;~maximumWeight~0 := 100;~blocked~0 := 0;~prevDir~0 := 0;~cleanupTimeShifts~0 := 12;~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;~head~0.base, ~head~0.offset := 0, 0; 4317#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_~retValue_acc~7#1, main_~tmp~9#1;havoc main_~retValue_acc~7#1;havoc main_~tmp~9#1;assume { :begin_inline_select_helpers } true; 3927#L2983true assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 16724#L2976true assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~24#1;havoc valid_product_~retValue_acc~24#1;valid_product_~retValue_acc~24#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~24#1; 9522#L2991true main_#t~ret24#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~9#1 := main_#t~ret24#1;havoc main_#t~ret24#1; 8971#L1277true assume 0 != main_~tmp~9#1;assume { :begin_inline_setup } true; 6934#L1250true assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret13#1, aliceCall_~tmp~2#1;havoc aliceCall_~tmp~2#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~1#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~1#1; 2414#L95true assume 0 == getOrigin_~person#1;getOrigin_~retValue_acc~1#1 := 4;getOrigin_#res#1 := getOrigin_~retValue_acc~1#1; 11133#L120true aliceCall_#t~ret13#1 := getOrigin_#res#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~2#1 := aliceCall_#t~ret13#1;havoc aliceCall_#t~ret13#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~2#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 17132#L530true assume 0 == initPersonOnFloor_~floor#1; 11833#L531true assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_0~0 := 1; 14351#L638-1true assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 13120#L322true assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1; 12584#L334-2true assume { :end_inline_callOnFloor } true; 17702#L674true assume { :end_inline_initPersonOnFloor } true; 13050#L1006true assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret14#1, angelinaCall_~tmp~3#1;havoc angelinaCall_~tmp~3#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~1#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~1#1; 81#L95-1true assume 0 == getOrigin_~person#1;getOrigin_~retValue_acc~1#1 := 4;getOrigin_#res#1 := getOrigin_~retValue_acc~1#1; 14352#L120-1true angelinaCall_#t~ret14#1 := getOrigin_#res#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~3#1 := angelinaCall_#t~ret14#1;havoc angelinaCall_#t~ret14#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~3#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 6972#L530-1true assume 0 == initPersonOnFloor_~floor#1; 13026#L531-2true assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_0~0 := 1; 10086#L638-3true assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 2909#L322-2true assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1; 4321#L334-5true assume { :end_inline_callOnFloor } true; 9340#L674-1true assume { :end_inline_initPersonOnFloor } true; 5355#L1017true assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret84#1, timeShift_~tmp~24#1;havoc timeShift_~tmp~24#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret4#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~12#1;havoc getCurrentHeading_~retValue_acc~12#1;getCurrentHeading_~retValue_acc~12#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~12#1; 4549#L1680true __utac_acc__Specification13_spec__1_#t~ret4#1 := getCurrentHeading_#res#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret4#1;havoc __utac_acc__Specification13_spec__1_#t~ret4#1; 17892#L851true assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~10#1;havoc areDoorsOpen_~retValue_acc~10#1;areDoorsOpen_~retValue_acc~10#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~10#1; 17123#L1637true timeShift_#t~ret84#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~24#1 := timeShift_#t~ret84#1;havoc timeShift_#t~ret84#1; 2412#L2587true assume 0 != timeShift_~tmp~24#1; 5434#L2588true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 17486#L2587-1true assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret5#1, __utac_acc__Specification13_spec__2_#t~ret6#1, __utac_acc__Specification13_spec__2_#t~ret7#1, __utac_acc__Specification13_spec__2_#t~ret8#1, __utac_acc__Specification13_spec__2_#t~ret9#1, __utac_acc__Specification13_spec__2_#t~ret10#1, __utac_acc__Specification13_spec__2_~tmp~0#1, __utac_acc__Specification13_spec__2_~tmp___0~0#1, __utac_acc__Specification13_spec__2_~tmp___1~0#1, __utac_acc__Specification13_spec__2_~tmp___2~0#1, __utac_acc__Specification13_spec__2_~tmp___3~0#1, __utac_acc__Specification13_spec__2_~tmp___4~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;havoc __utac_acc__Specification13_spec__2_~tmp~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~0#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3); 5073#L869true assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1; 3638#L870true 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~22#1, existInLiftCallsInDirection_~i~3#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~22#1;havoc existInLiftCallsInDirection_~i~3#1;havoc existInLiftCallsInDirection_~i___0~0#1; 12371#L2807true assume 1 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i~3#1 := 0;existInLiftCallsInDirection_~i~3#1 := 1 + ~currentFloorID~0; 6307#L2811-2true [2021-12-21 22:24:02,837 INFO L793 eck$LassoCheckResult]: Loop: 6307#L2811-2true assume !false; 4904#L2812true assume existInLiftCallsInDirection_~i~3#1 < 5; 508#L2813true assume !(0 == existInLiftCallsInDirection_~i~3#1); 7017#L2826true assume !(1 == existInLiftCallsInDirection_~i~3#1); 7241#L2835true assume !(2 == existInLiftCallsInDirection_~i~3#1); 3717#L2844true assume !(3 == existInLiftCallsInDirection_~i~3#1); 9526#L2853true assume !(4 == existInLiftCallsInDirection_~i~3#1); 976#L2854-1true existInLiftCallsInDirection_~i~3#1 := 1 + existInLiftCallsInDirection_~i~3#1; 6307#L2811-2true [2021-12-21 22:24:02,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:24:02,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1529622645, now seen corresponding path program 1 times [2021-12-21 22:24:02,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:24:02,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480685112] [2021-12-21 22:24:02,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:24:02,857 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:24:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:24:03,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:24:03,094 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:24:03,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480685112] [2021-12-21 22:24:03,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480685112] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:24:03,095 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:24:03,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 22:24:03,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272989115] [2021-12-21 22:24:03,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:24:03,101 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:24:03,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:24:03,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1374005635, now seen corresponding path program 1 times [2021-12-21 22:24:03,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:24:03,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766901326] [2021-12-21 22:24:03,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:24:03,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:24:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:24:03,108 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:24:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:24:03,126 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:24:03,173 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 22:24:03,174 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 22:24:03,174 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 22:24:03,174 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 22:24:03,174 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-21 22:24:03,175 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:24:03,175 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 22:24:03,175 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 22:24:03,175 INFO L133 ssoRankerPreferences]: Filename of dumped script: elevator_spec13_product30.cil.c_Iteration1_Loop [2021-12-21 22:24:03,175 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 22:24:03,175 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 22:24:03,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:24:03,241 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 22:24:03,241 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-21 22:24:03,243 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:24:03,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:24:03,245 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:24:03,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-12-21 22:24:03,265 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 22:24:03,265 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 22:24:03,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-12-21 22:24:03,344 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:24:03,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:24:03,348 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:24:03,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-21 22:24:03,351 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-21 22:24:03,351 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 22:24:03,391 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-21 22:24:03,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-12-21 22:24:03,397 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 22:24:03,397 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 22:24:03,398 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 22:24:03,398 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 22:24:03,398 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-21 22:24:03,398 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:24:03,398 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 22:24:03,398 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 22:24:03,398 INFO L133 ssoRankerPreferences]: Filename of dumped script: elevator_spec13_product30.cil.c_Iteration1_Loop [2021-12-21 22:24:03,398 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 22:24:03,398 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 22:24:03,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:24:03,444 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 22:24:03,448 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-21 22:24:03,449 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:24:03,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:24:03,453 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:24:03,466 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:24:03,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:24:03,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:24:03,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:24:03,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:24:03,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:24:03,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-12-21 22:24:03,477 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:24:03,478 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:24:03,495 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-21 22:24:03,503 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-21 22:24:03,503 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-21 22:24:03,505 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:24:03,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:24:03,506 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:24:03,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-12-21 22:24:03,510 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-21 22:24:03,510 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-21 22:24:03,510 INFO L513 LassoAnalysis]: Proved termination. [2021-12-21 22:24:03,511 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_existInLiftCallsInDirection_~i~3#1) = -1*ULTIMATE.start_existInLiftCallsInDirection_~i~3#1 Supporting invariants [] [2021-12-21 22:24:03,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-12-21 22:24:03,537 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-21 22:24:03,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:24:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:24:03,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 22:24:03,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:24:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:24:03,741 WARN L261 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-21 22:24:03,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:24:03,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:24:03,919 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2021-12-21 22:24:03,962 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 17932 states, 17931 states have (on average 1.8808209246556244) internal successors, (33725), 17931 states have internal predecessors, (33725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:24:04,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-12-21 22:24:12,433 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 17932 states, 17931 states have (on average 1.8808209246556244) internal successors, (33725), 17931 states have internal predecessors, (33725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 211046 states and 396793 transitions. Complement of second has 18 states. [2021-12-21 22:24:12,435 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 [2021-12-21 22:24:12,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:24:12,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 215267 transitions. [2021-12-21 22:24:12,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 215267 transitions. Stem has 34 letters. Loop has 8 letters. [2021-12-21 22:24:12,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 22:24:12,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 215267 transitions. Stem has 42 letters. Loop has 8 letters. [2021-12-21 22:24:12,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 22:24:12,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 215267 transitions. Stem has 34 letters. Loop has 16 letters. [2021-12-21 22:24:12,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 22:24:12,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 211046 states and 396793 transitions. [2021-12-21 22:24:14,225 INFO L131 ngComponentsAnalysis]: Automaton has 66 accepting balls. 28728 [2021-12-21 22:24:15,150 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 211046 states to 114375 states and 214990 transitions. [2021-12-21 22:24:15,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 114345 [2021-12-21 22:24:15,279 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114346 [2021-12-21 22:24:15,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114375 states and 214990 transitions. [2021-12-21 22:24:15,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 22:24:15,281 INFO L681 BuchiCegarLoop]: Abstraction has 114375 states and 214990 transitions. [2021-12-21 22:24:15,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114375 states and 214990 transitions. [2021-12-21 22:24:16,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114375 to 32246. [2021-12-21 22:24:16,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32246 states, 32246 states have (on average 1.8769769893940333) internal successors, (60525), 32245 states have internal predecessors, (60525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:24:16,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32246 states to 32246 states and 60525 transitions. [2021-12-21 22:24:16,626 INFO L704 BuchiCegarLoop]: Abstraction has 32246 states and 60525 transitions. [2021-12-21 22:24:16,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:24:16,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 22:24:16,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 22:24:16,632 INFO L87 Difference]: Start difference. First operand 32246 states and 60525 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) [2021-12-21 22:24:17,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:24:17,779 INFO L93 Difference]: Finished difference Result 46585 states and 87289 transitions. [2021-12-21 22:24:17,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 22:24:17,780 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46585 states and 87289 transitions. [2021-12-21 22:24:17,984 INFO L131 ngComponentsAnalysis]: Automaton has 78 accepting balls. 15466 [2021-12-21 22:24:18,193 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46585 states to 46572 states and 87276 transitions. [2021-12-21 22:24:18,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46553 [2021-12-21 22:24:18,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46553 [2021-12-21 22:24:18,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46572 states and 87276 transitions. [2021-12-21 22:24:18,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 22:24:18,341 INFO L681 BuchiCegarLoop]: Abstraction has 46572 states and 87276 transitions. [2021-12-21 22:24:18,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46572 states and 87276 transitions. [2021-12-21 22:24:18,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46572 to 17929. [2021-12-21 22:24:18,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17929 states, 17929 states have (on average 1.874003011880194) internal successors, (33599), 17928 states have internal predecessors, (33599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:24:19,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17929 states to 17929 states and 33599 transitions. [2021-12-21 22:24:19,009 INFO L704 BuchiCegarLoop]: Abstraction has 17929 states and 33599 transitions. [2021-12-21 22:24:19,009 INFO L587 BuchiCegarLoop]: Abstraction has 17929 states and 33599 transitions. [2021-12-21 22:24:19,009 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-21 22:24:19,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17929 states and 33599 transitions. [2021-12-21 22:24:19,067 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4072 [2021-12-21 22:24:19,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:24:19,069 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:24:19,070 INFO L842 BuchiCegarLoop]: 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] [2021-12-21 22:24:19,071 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-21 22:24:19,071 INFO L791 eck$LassoCheckResult]: Stem: 320413#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(10, 4);call #Ultimate.allocInit(4, 5);call write~init~int(91, 5, 0, 1);call write~init~int(95, 5, 1, 1);call write~init~int(93, 5, 2, 1);call write~init~int(0, 5, 3, 1);call #Ultimate.allocInit(4, 6);call write~init~int(91, 6, 0, 1);call write~init~int(93, 6, 1, 1);call write~init~int(32, 6, 2, 1);call write~init~int(0, 6, 3, 1);call #Ultimate.allocInit(5, 7);call write~init~int(32, 7, 0, 1);call write~init~int(97, 7, 1, 1);call write~init~int(116, 7, 2, 1);call write~init~int(32, 7, 3, 1);call write~init~int(0, 7, 4, 1);call #Ultimate.allocInit(3, 8);call write~init~int(37, 8, 0, 1);call write~init~int(105, 8, 1, 1);call write~init~int(0, 8, 2, 1);call #Ultimate.allocInit(10, 9);call #Ultimate.allocInit(3, 10);call write~init~int(117, 10, 0, 1);call write~init~int(112, 10, 1, 1);call write~init~int(0, 10, 2, 1);call #Ultimate.allocInit(5, 11);call write~init~int(100, 11, 0, 1);call write~init~int(111, 11, 1, 1);call write~init~int(119, 11, 2, 1);call write~init~int(110, 11, 3, 1);call write~init~int(0, 11, 4, 1);call #Ultimate.allocInit(7, 12);call write~init~int(32, 12, 0, 1);call write~init~int(73, 12, 1, 1);call write~init~int(76, 12, 2, 1);call write~init~int(95, 12, 3, 1);call write~init~int(112, 12, 4, 1);call write~init~int(58, 12, 5, 1);call write~init~int(0, 12, 6, 1);call #Ultimate.allocInit(4, 13);call write~init~int(32, 13, 0, 1);call write~init~int(37, 13, 1, 1);call write~init~int(105, 13, 2, 1);call write~init~int(0, 13, 3, 1);call #Ultimate.allocInit(4, 14);call write~init~int(32, 14, 0, 1);call write~init~int(37, 14, 1, 1);call write~init~int(105, 14, 2, 1);call write~init~int(0, 14, 3, 1);call #Ultimate.allocInit(4, 15);call write~init~int(32, 15, 0, 1);call write~init~int(37, 15, 1, 1);call write~init~int(105, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(4, 16);call write~init~int(32, 16, 0, 1);call write~init~int(37, 16, 1, 1);call write~init~int(105, 16, 2, 1);call write~init~int(0, 16, 3, 1);call #Ultimate.allocInit(4, 17);call write~init~int(32, 17, 0, 1);call write~init~int(37, 17, 1, 1);call write~init~int(105, 17, 2, 1);call write~init~int(0, 17, 3, 1);call #Ultimate.allocInit(6, 18);call write~init~int(32, 18, 0, 1);call write~init~int(70, 18, 1, 1);call write~init~int(95, 18, 2, 1);call write~init~int(112, 18, 3, 1);call write~init~int(58, 18, 4, 1);call write~init~int(0, 18, 5, 1);call #Ultimate.allocInit(4, 19);call write~init~int(32, 19, 0, 1);call write~init~int(37, 19, 1, 1);call write~init~int(105, 19, 2, 1);call write~init~int(0, 19, 3, 1);call #Ultimate.allocInit(4, 20);call write~init~int(32, 20, 0, 1);call write~init~int(37, 20, 1, 1);call write~init~int(105, 20, 2, 1);call write~init~int(0, 20, 3, 1);call #Ultimate.allocInit(4, 21);call write~init~int(32, 21, 0, 1);call write~init~int(37, 21, 1, 1);call write~init~int(105, 21, 2, 1);call write~init~int(0, 21, 3, 1);call #Ultimate.allocInit(4, 22);call write~init~int(32, 22, 0, 1);call write~init~int(37, 22, 1, 1);call write~init~int(105, 22, 2, 1);call write~init~int(0, 22, 3, 1);call #Ultimate.allocInit(4, 23);call write~init~int(32, 23, 0, 1);call write~init~int(37, 23, 1, 1);call write~init~int(105, 23, 2, 1);call write~init~int(0, 23, 3, 1);call #Ultimate.allocInit(2, 24);call write~init~int(10, 24, 0, 1);call write~init~int(0, 24, 1, 1);call #Ultimate.allocInit(9, 25);call #Ultimate.allocInit(30, 26);call #Ultimate.allocInit(9, 27);call #Ultimate.allocInit(21, 28);call #Ultimate.allocInit(30, 29);call #Ultimate.allocInit(9, 30);call #Ultimate.allocInit(21, 31);call #Ultimate.allocInit(30, 32);call #Ultimate.allocInit(9, 33);call #Ultimate.allocInit(25, 34);call #Ultimate.allocInit(30, 35);call #Ultimate.allocInit(9, 36);call #Ultimate.allocInit(25, 37);~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;~weight~0 := 0;~maximumWeight~0 := 100;~blocked~0 := 0;~prevDir~0 := 0;~cleanupTimeShifts~0 := 12;~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;~head~0.base, ~head~0.offset := 0, 0; 316584#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_~retValue_acc~7#1, main_~tmp~9#1;havoc main_~retValue_acc~7#1;havoc main_~tmp~9#1;assume { :begin_inline_select_helpers } true; 315985#L2983 assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 315986#L2976 assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~24#1;havoc valid_product_~retValue_acc~24#1;valid_product_~retValue_acc~24#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~24#1; 322607#L2991 main_#t~ret24#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~9#1 := main_#t~ret24#1;havoc main_#t~ret24#1; 322176#L1277 assume 0 != main_~tmp~9#1;assume { :begin_inline_setup } true; 320135#L1250 assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret13#1, aliceCall_~tmp~2#1;havoc aliceCall_~tmp~2#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~1#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~1#1; 313400#L95 assume !(0 == getOrigin_~person#1); 309723#L99 assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~1#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~1#1; 309724#L120 aliceCall_#t~ret13#1 := getOrigin_#res#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~2#1 := aliceCall_#t~ret13#1;havoc aliceCall_#t~ret13#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~2#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 323765#L530 assume 0 == initPersonOnFloor_~floor#1; 324233#L531 assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_0~0 := 1; 308129#L638-1 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 324879#L322 assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1; 308359#L334-2 assume { :end_inline_callOnFloor } true; 324608#L674 assume { :end_inline_initPersonOnFloor } true; 324843#L1006 assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret14#1, angelinaCall_~tmp~3#1;havoc angelinaCall_~tmp~3#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~1#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~1#1; 308212#L95-1 assume !(0 == getOrigin_~person#1); 308213#L99-1 assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~1#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~1#1; 308963#L120-1 angelinaCall_#t~ret14#1 := getOrigin_#res#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~3#1 := angelinaCall_#t~ret14#1;havoc angelinaCall_#t~ret14#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~3#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 320181#L530-1 assume 0 == initPersonOnFloor_~floor#1; 320182#L531-2 assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_0~0 := 1; 308492#L638-3 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 314273#L322-2 assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1; 309037#L334-5 assume { :end_inline_callOnFloor } true; 316591#L674-1 assume { :end_inline_initPersonOnFloor } true; 318096#L1017 assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret84#1, timeShift_~tmp~24#1;havoc timeShift_~tmp~24#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret4#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~12#1;havoc getCurrentHeading_~retValue_acc~12#1;getCurrentHeading_~retValue_acc~12#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~12#1; 316925#L1680 __utac_acc__Specification13_spec__1_#t~ret4#1 := getCurrentHeading_#res#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret4#1;havoc __utac_acc__Specification13_spec__1_#t~ret4#1; 316926#L851 assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~10#1;havoc areDoorsOpen_~retValue_acc~10#1;areDoorsOpen_~retValue_acc~10#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~10#1; 325877#L1637 timeShift_#t~ret84#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~24#1 := timeShift_#t~ret84#1;havoc timeShift_#t~ret84#1; 313394#L2587 assume 0 != timeShift_~tmp~24#1; 313395#L2588 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 314966#L2587-1 assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret5#1, __utac_acc__Specification13_spec__2_#t~ret6#1, __utac_acc__Specification13_spec__2_#t~ret7#1, __utac_acc__Specification13_spec__2_#t~ret8#1, __utac_acc__Specification13_spec__2_#t~ret9#1, __utac_acc__Specification13_spec__2_#t~ret10#1, __utac_acc__Specification13_spec__2_~tmp~0#1, __utac_acc__Specification13_spec__2_~tmp___0~0#1, __utac_acc__Specification13_spec__2_~tmp___1~0#1, __utac_acc__Specification13_spec__2_~tmp___2~0#1, __utac_acc__Specification13_spec__2_~tmp___3~0#1, __utac_acc__Specification13_spec__2_~tmp___4~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;havoc __utac_acc__Specification13_spec__2_~tmp~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~0#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3); 317681#L869 assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1; 315501#L870 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~22#1, existInLiftCallsInDirection_~i~3#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~22#1;havoc existInLiftCallsInDirection_~i~3#1;havoc existInLiftCallsInDirection_~i___0~0#1; 315502#L2807 assume !(1 == existInLiftCallsInDirection_~d#1); 317726#L2873 assume 0 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i___0~0#1 := 0;existInLiftCallsInDirection_~i___0~0#1 := ~currentFloorID~0 - 1; 317727#L2877-2 [2021-12-21 22:24:19,071 INFO L793 eck$LassoCheckResult]: Loop: 317727#L2877-2 assume !false; 314226#L2878 assume existInLiftCallsInDirection_~i___0~0#1 >= 0; 314227#L2879 existInLiftCallsInDirection_~i___0~0#1 := 1 + ~currentFloorID~0; 312509#L2886-2 assume !false; 312510#L2887 assume !(existInLiftCallsInDirection_~i___0~0#1 < 5); 313476#L2945 existInLiftCallsInDirection_~i___0~0#1 := existInLiftCallsInDirection_~i___0~0#1 - 1; 317727#L2877-2 [2021-12-21 22:24:19,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:24:19,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1898401259, now seen corresponding path program 1 times [2021-12-21 22:24:19,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:24:19,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107653596] [2021-12-21 22:24:19,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:24:19,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:24:19,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:24:19,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:24:19,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:24:19,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107653596] [2021-12-21 22:24:19,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107653596] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:24:19,183 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:24:19,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 22:24:19,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959806222] [2021-12-21 22:24:19,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:24:19,184 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:24:19,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:24:19,185 INFO L85 PathProgramCache]: Analyzing trace with hash 2078933803, now seen corresponding path program 1 times [2021-12-21 22:24:19,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:24:19,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920150482] [2021-12-21 22:24:19,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:24:19,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:24:19,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:24:19,190 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:24:19,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:24:19,200 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:24:19,236 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:24:19,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 22:24:19,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 22:24:19,237 INFO L87 Difference]: Start difference. First operand 17929 states and 33599 transitions. cyclomatic complexity: 15704 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) [2021-12-21 22:24:20,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:24:20,424 INFO L93 Difference]: Finished difference Result 53570 states and 100367 transitions. [2021-12-21 22:24:20,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 22:24:20,425 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53570 states and 100367 transitions. [2021-12-21 22:24:20,637 INFO L131 ngComponentsAnalysis]: Automaton has 99 accepting balls. 12216 [2021-12-21 22:24:21,122 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53570 states to 53570 states and 100367 transitions. [2021-12-21 22:24:21,123 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53513 [2021-12-21 22:24:21,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53513 [2021-12-21 22:24:21,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53570 states and 100367 transitions. [2021-12-21 22:24:21,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 22:24:21,173 INFO L681 BuchiCegarLoop]: Abstraction has 53570 states and 100367 transitions. [2021-12-21 22:24:21,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53570 states and 100367 transitions. [2021-12-21 22:24:21,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53570 to 17944. [2021-12-21 22:24:21,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17944 states, 17944 states have (on average 1.873272403031654) internal successors, (33614), 17943 states have internal predecessors, (33614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:24:21,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17944 states to 17944 states and 33614 transitions. [2021-12-21 22:24:21,668 INFO L704 BuchiCegarLoop]: Abstraction has 17944 states and 33614 transitions. [2021-12-21 22:24:21,669 INFO L587 BuchiCegarLoop]: Abstraction has 17944 states and 33614 transitions. [2021-12-21 22:24:21,669 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-21 22:24:21,669 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17944 states and 33614 transitions. [2021-12-21 22:24:21,744 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4072 [2021-12-21 22:24:21,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:24:21,750 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:24:21,754 INFO L842 BuchiCegarLoop]: 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] [2021-12-21 22:24:21,754 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-21 22:24:21,754 INFO L791 eck$LassoCheckResult]: Stem: 391919#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(10, 4);call #Ultimate.allocInit(4, 5);call write~init~int(91, 5, 0, 1);call write~init~int(95, 5, 1, 1);call write~init~int(93, 5, 2, 1);call write~init~int(0, 5, 3, 1);call #Ultimate.allocInit(4, 6);call write~init~int(91, 6, 0, 1);call write~init~int(93, 6, 1, 1);call write~init~int(32, 6, 2, 1);call write~init~int(0, 6, 3, 1);call #Ultimate.allocInit(5, 7);call write~init~int(32, 7, 0, 1);call write~init~int(97, 7, 1, 1);call write~init~int(116, 7, 2, 1);call write~init~int(32, 7, 3, 1);call write~init~int(0, 7, 4, 1);call #Ultimate.allocInit(3, 8);call write~init~int(37, 8, 0, 1);call write~init~int(105, 8, 1, 1);call write~init~int(0, 8, 2, 1);call #Ultimate.allocInit(10, 9);call #Ultimate.allocInit(3, 10);call write~init~int(117, 10, 0, 1);call write~init~int(112, 10, 1, 1);call write~init~int(0, 10, 2, 1);call #Ultimate.allocInit(5, 11);call write~init~int(100, 11, 0, 1);call write~init~int(111, 11, 1, 1);call write~init~int(119, 11, 2, 1);call write~init~int(110, 11, 3, 1);call write~init~int(0, 11, 4, 1);call #Ultimate.allocInit(7, 12);call write~init~int(32, 12, 0, 1);call write~init~int(73, 12, 1, 1);call write~init~int(76, 12, 2, 1);call write~init~int(95, 12, 3, 1);call write~init~int(112, 12, 4, 1);call write~init~int(58, 12, 5, 1);call write~init~int(0, 12, 6, 1);call #Ultimate.allocInit(4, 13);call write~init~int(32, 13, 0, 1);call write~init~int(37, 13, 1, 1);call write~init~int(105, 13, 2, 1);call write~init~int(0, 13, 3, 1);call #Ultimate.allocInit(4, 14);call write~init~int(32, 14, 0, 1);call write~init~int(37, 14, 1, 1);call write~init~int(105, 14, 2, 1);call write~init~int(0, 14, 3, 1);call #Ultimate.allocInit(4, 15);call write~init~int(32, 15, 0, 1);call write~init~int(37, 15, 1, 1);call write~init~int(105, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(4, 16);call write~init~int(32, 16, 0, 1);call write~init~int(37, 16, 1, 1);call write~init~int(105, 16, 2, 1);call write~init~int(0, 16, 3, 1);call #Ultimate.allocInit(4, 17);call write~init~int(32, 17, 0, 1);call write~init~int(37, 17, 1, 1);call write~init~int(105, 17, 2, 1);call write~init~int(0, 17, 3, 1);call #Ultimate.allocInit(6, 18);call write~init~int(32, 18, 0, 1);call write~init~int(70, 18, 1, 1);call write~init~int(95, 18, 2, 1);call write~init~int(112, 18, 3, 1);call write~init~int(58, 18, 4, 1);call write~init~int(0, 18, 5, 1);call #Ultimate.allocInit(4, 19);call write~init~int(32, 19, 0, 1);call write~init~int(37, 19, 1, 1);call write~init~int(105, 19, 2, 1);call write~init~int(0, 19, 3, 1);call #Ultimate.allocInit(4, 20);call write~init~int(32, 20, 0, 1);call write~init~int(37, 20, 1, 1);call write~init~int(105, 20, 2, 1);call write~init~int(0, 20, 3, 1);call #Ultimate.allocInit(4, 21);call write~init~int(32, 21, 0, 1);call write~init~int(37, 21, 1, 1);call write~init~int(105, 21, 2, 1);call write~init~int(0, 21, 3, 1);call #Ultimate.allocInit(4, 22);call write~init~int(32, 22, 0, 1);call write~init~int(37, 22, 1, 1);call write~init~int(105, 22, 2, 1);call write~init~int(0, 22, 3, 1);call #Ultimate.allocInit(4, 23);call write~init~int(32, 23, 0, 1);call write~init~int(37, 23, 1, 1);call write~init~int(105, 23, 2, 1);call write~init~int(0, 23, 3, 1);call #Ultimate.allocInit(2, 24);call write~init~int(10, 24, 0, 1);call write~init~int(0, 24, 1, 1);call #Ultimate.allocInit(9, 25);call #Ultimate.allocInit(30, 26);call #Ultimate.allocInit(9, 27);call #Ultimate.allocInit(21, 28);call #Ultimate.allocInit(30, 29);call #Ultimate.allocInit(9, 30);call #Ultimate.allocInit(21, 31);call #Ultimate.allocInit(30, 32);call #Ultimate.allocInit(9, 33);call #Ultimate.allocInit(25, 34);call #Ultimate.allocInit(30, 35);call #Ultimate.allocInit(9, 36);call #Ultimate.allocInit(25, 37);~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;~weight~0 := 0;~maximumWeight~0 := 100;~blocked~0 := 0;~prevDir~0 := 0;~cleanupTimeShifts~0 := 12;~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;~head~0.base, ~head~0.offset := 0, 0; 388091#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_~retValue_acc~7#1, main_~tmp~9#1;havoc main_~retValue_acc~7#1;havoc main_~tmp~9#1;assume { :begin_inline_select_helpers } true; 387492#L2983 assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 387493#L2976 assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~24#1;havoc valid_product_~retValue_acc~24#1;valid_product_~retValue_acc~24#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~24#1; 394112#L2991 main_#t~ret24#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~9#1 := main_#t~ret24#1;havoc main_#t~ret24#1; 393683#L1277 assume 0 != main_~tmp~9#1;assume { :begin_inline_setup } true; 391642#L1250 assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret13#1, aliceCall_~tmp~2#1;havoc aliceCall_~tmp~2#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~1#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~1#1; 384907#L95 assume !(0 == getOrigin_~person#1); 381225#L99 assume !(1 == getOrigin_~person#1); 381227#L103 assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~1#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~1#1; 384582#L120 aliceCall_#t~ret13#1 := getOrigin_#res#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~2#1 := aliceCall_#t~ret13#1;havoc aliceCall_#t~ret13#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~2#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 395272#L530 assume 0 == initPersonOnFloor_~floor#1; 395739#L531 assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_0~0 := 1; 379637#L638-1 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 396388#L322 assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1; 379867#L334-2 assume { :end_inline_callOnFloor } true; 396115#L674 assume { :end_inline_initPersonOnFloor } true; 396352#L1006 assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret14#1, angelinaCall_~tmp~3#1;havoc angelinaCall_~tmp~3#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~1#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~1#1; 379714#L95-1 assume !(0 == getOrigin_~person#1); 379715#L99-1 assume !(1 == getOrigin_~person#1); 391989#L103-1 assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~1#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~1#1; 380470#L120-1 angelinaCall_#t~ret14#1 := getOrigin_#res#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~3#1 := angelinaCall_#t~ret14#1;havoc angelinaCall_#t~ret14#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~3#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 396845#L530-1 assume 0 == initPersonOnFloor_~floor#1; 396344#L531-2 assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_0~0 := 1; 380000#L638-3 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 385780#L322-2 assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1; 380544#L334-5 assume { :end_inline_callOnFloor } true; 388098#L674-1 assume { :end_inline_initPersonOnFloor } true; 389603#L1017 assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret84#1, timeShift_~tmp~24#1;havoc timeShift_~tmp~24#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret4#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~12#1;havoc getCurrentHeading_~retValue_acc~12#1;getCurrentHeading_~retValue_acc~12#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~12#1; 388432#L1680 __utac_acc__Specification13_spec__1_#t~ret4#1 := getCurrentHeading_#res#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret4#1;havoc __utac_acc__Specification13_spec__1_#t~ret4#1; 388433#L851 assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~10#1;havoc areDoorsOpen_~retValue_acc~10#1;areDoorsOpen_~retValue_acc~10#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~10#1; 397389#L1637 timeShift_#t~ret84#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~24#1 := timeShift_#t~ret84#1;havoc timeShift_#t~ret84#1; 384901#L2587 assume 0 != timeShift_~tmp~24#1; 384902#L2588 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 386474#L2587-1 assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret5#1, __utac_acc__Specification13_spec__2_#t~ret6#1, __utac_acc__Specification13_spec__2_#t~ret7#1, __utac_acc__Specification13_spec__2_#t~ret8#1, __utac_acc__Specification13_spec__2_#t~ret9#1, __utac_acc__Specification13_spec__2_#t~ret10#1, __utac_acc__Specification13_spec__2_~tmp~0#1, __utac_acc__Specification13_spec__2_~tmp___0~0#1, __utac_acc__Specification13_spec__2_~tmp___1~0#1, __utac_acc__Specification13_spec__2_~tmp___2~0#1, __utac_acc__Specification13_spec__2_~tmp___3~0#1, __utac_acc__Specification13_spec__2_~tmp___4~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;havoc __utac_acc__Specification13_spec__2_~tmp~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~0#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3); 389188#L869 assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1; 387007#L870 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~22#1, existInLiftCallsInDirection_~i~3#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~22#1;havoc existInLiftCallsInDirection_~i~3#1;havoc existInLiftCallsInDirection_~i___0~0#1; 387008#L2807 assume !(1 == existInLiftCallsInDirection_~d#1); 389231#L2873 assume 0 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i___0~0#1 := 0;existInLiftCallsInDirection_~i___0~0#1 := ~currentFloorID~0 - 1; 389232#L2877-2 [2021-12-21 22:24:21,755 INFO L793 eck$LassoCheckResult]: Loop: 389232#L2877-2 assume !false; 385731#L2878 assume existInLiftCallsInDirection_~i___0~0#1 >= 0; 385732#L2879 existInLiftCallsInDirection_~i___0~0#1 := 1 + ~currentFloorID~0; 384015#L2886-2 assume !false; 384016#L2887 assume !(existInLiftCallsInDirection_~i___0~0#1 < 5); 384981#L2945 existInLiftCallsInDirection_~i___0~0#1 := existInLiftCallsInDirection_~i___0~0#1 - 1; 389232#L2877-2 [2021-12-21 22:24:21,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:24:21,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1378400671, now seen corresponding path program 1 times [2021-12-21 22:24:21,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:24:21,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303335137] [2021-12-21 22:24:21,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:24:21,759 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:24:21,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:24:21,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:24:21,804 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:24:21,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303335137] [2021-12-21 22:24:21,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303335137] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:24:21,805 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:24:21,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 22:24:21,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669012296] [2021-12-21 22:24:21,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:24:21,806 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:24:21,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:24:21,806 INFO L85 PathProgramCache]: Analyzing trace with hash 2078933803, now seen corresponding path program 2 times [2021-12-21 22:24:21,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:24:21,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5020959] [2021-12-21 22:24:21,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:24:21,814 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:24:21,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:24:21,818 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:24:21,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:24:21,827 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:24:21,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:24:21,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 22:24:21,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 22:24:21,853 INFO L87 Difference]: Start difference. First operand 17944 states and 33614 transitions. cyclomatic complexity: 15704 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) [2021-12-21 22:24:22,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:24:22,497 INFO L93 Difference]: Finished difference Result 35709 states and 66901 transitions. [2021-12-21 22:24:22,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 22:24:22,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35709 states and 66901 transitions. [2021-12-21 22:24:22,623 INFO L131 ngComponentsAnalysis]: Automaton has 66 accepting balls. 8144 [2021-12-21 22:24:22,738 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35709 states to 35709 states and 66901 transitions. [2021-12-21 22:24:22,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35671 [2021-12-21 22:24:22,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35671 [2021-12-21 22:24:22,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35709 states and 66901 transitions. [2021-12-21 22:24:22,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 22:24:22,764 INFO L681 BuchiCegarLoop]: Abstraction has 35709 states and 66901 transitions. [2021-12-21 22:24:22,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35709 states and 66901 transitions. [2021-12-21 22:24:23,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35709 to 17910. [2021-12-21 22:24:23,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17910 states, 17910 states have (on average 1.8730318257956449) internal successors, (33546), 17909 states have internal predecessors, (33546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:24:23,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17910 states to 17910 states and 33546 transitions. [2021-12-21 22:24:23,107 INFO L704 BuchiCegarLoop]: Abstraction has 17910 states and 33546 transitions. [2021-12-21 22:24:23,107 INFO L587 BuchiCegarLoop]: Abstraction has 17910 states and 33546 transitions. [2021-12-21 22:24:23,107 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-21 22:24:23,107 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17910 states and 33546 transitions. [2021-12-21 22:24:23,168 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4072 [2021-12-21 22:24:23,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:24:23,168 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:24:23,169 INFO L842 BuchiCegarLoop]: 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] [2021-12-21 22:24:23,169 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-21 22:24:23,170 INFO L791 eck$LassoCheckResult]: Stem: 445560#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(10, 4);call #Ultimate.allocInit(4, 5);call write~init~int(91, 5, 0, 1);call write~init~int(95, 5, 1, 1);call write~init~int(93, 5, 2, 1);call write~init~int(0, 5, 3, 1);call #Ultimate.allocInit(4, 6);call write~init~int(91, 6, 0, 1);call write~init~int(93, 6, 1, 1);call write~init~int(32, 6, 2, 1);call write~init~int(0, 6, 3, 1);call #Ultimate.allocInit(5, 7);call write~init~int(32, 7, 0, 1);call write~init~int(97, 7, 1, 1);call write~init~int(116, 7, 2, 1);call write~init~int(32, 7, 3, 1);call write~init~int(0, 7, 4, 1);call #Ultimate.allocInit(3, 8);call write~init~int(37, 8, 0, 1);call write~init~int(105, 8, 1, 1);call write~init~int(0, 8, 2, 1);call #Ultimate.allocInit(10, 9);call #Ultimate.allocInit(3, 10);call write~init~int(117, 10, 0, 1);call write~init~int(112, 10, 1, 1);call write~init~int(0, 10, 2, 1);call #Ultimate.allocInit(5, 11);call write~init~int(100, 11, 0, 1);call write~init~int(111, 11, 1, 1);call write~init~int(119, 11, 2, 1);call write~init~int(110, 11, 3, 1);call write~init~int(0, 11, 4, 1);call #Ultimate.allocInit(7, 12);call write~init~int(32, 12, 0, 1);call write~init~int(73, 12, 1, 1);call write~init~int(76, 12, 2, 1);call write~init~int(95, 12, 3, 1);call write~init~int(112, 12, 4, 1);call write~init~int(58, 12, 5, 1);call write~init~int(0, 12, 6, 1);call #Ultimate.allocInit(4, 13);call write~init~int(32, 13, 0, 1);call write~init~int(37, 13, 1, 1);call write~init~int(105, 13, 2, 1);call write~init~int(0, 13, 3, 1);call #Ultimate.allocInit(4, 14);call write~init~int(32, 14, 0, 1);call write~init~int(37, 14, 1, 1);call write~init~int(105, 14, 2, 1);call write~init~int(0, 14, 3, 1);call #Ultimate.allocInit(4, 15);call write~init~int(32, 15, 0, 1);call write~init~int(37, 15, 1, 1);call write~init~int(105, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(4, 16);call write~init~int(32, 16, 0, 1);call write~init~int(37, 16, 1, 1);call write~init~int(105, 16, 2, 1);call write~init~int(0, 16, 3, 1);call #Ultimate.allocInit(4, 17);call write~init~int(32, 17, 0, 1);call write~init~int(37, 17, 1, 1);call write~init~int(105, 17, 2, 1);call write~init~int(0, 17, 3, 1);call #Ultimate.allocInit(6, 18);call write~init~int(32, 18, 0, 1);call write~init~int(70, 18, 1, 1);call write~init~int(95, 18, 2, 1);call write~init~int(112, 18, 3, 1);call write~init~int(58, 18, 4, 1);call write~init~int(0, 18, 5, 1);call #Ultimate.allocInit(4, 19);call write~init~int(32, 19, 0, 1);call write~init~int(37, 19, 1, 1);call write~init~int(105, 19, 2, 1);call write~init~int(0, 19, 3, 1);call #Ultimate.allocInit(4, 20);call write~init~int(32, 20, 0, 1);call write~init~int(37, 20, 1, 1);call write~init~int(105, 20, 2, 1);call write~init~int(0, 20, 3, 1);call #Ultimate.allocInit(4, 21);call write~init~int(32, 21, 0, 1);call write~init~int(37, 21, 1, 1);call write~init~int(105, 21, 2, 1);call write~init~int(0, 21, 3, 1);call #Ultimate.allocInit(4, 22);call write~init~int(32, 22, 0, 1);call write~init~int(37, 22, 1, 1);call write~init~int(105, 22, 2, 1);call write~init~int(0, 22, 3, 1);call #Ultimate.allocInit(4, 23);call write~init~int(32, 23, 0, 1);call write~init~int(37, 23, 1, 1);call write~init~int(105, 23, 2, 1);call write~init~int(0, 23, 3, 1);call #Ultimate.allocInit(2, 24);call write~init~int(10, 24, 0, 1);call write~init~int(0, 24, 1, 1);call #Ultimate.allocInit(9, 25);call #Ultimate.allocInit(30, 26);call #Ultimate.allocInit(9, 27);call #Ultimate.allocInit(21, 28);call #Ultimate.allocInit(30, 29);call #Ultimate.allocInit(9, 30);call #Ultimate.allocInit(21, 31);call #Ultimate.allocInit(30, 32);call #Ultimate.allocInit(9, 33);call #Ultimate.allocInit(25, 34);call #Ultimate.allocInit(30, 35);call #Ultimate.allocInit(9, 36);call #Ultimate.allocInit(25, 37);~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;~weight~0 := 0;~maximumWeight~0 := 100;~blocked~0 := 0;~prevDir~0 := 0;~cleanupTimeShifts~0 := 12;~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;~head~0.base, ~head~0.offset := 0, 0; 441736#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_~retValue_acc~7#1, main_~tmp~9#1;havoc main_~retValue_acc~7#1;havoc main_~tmp~9#1;assume { :begin_inline_select_helpers } true; 441137#L2983 assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 441138#L2976 assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~24#1;havoc valid_product_~retValue_acc~24#1;valid_product_~retValue_acc~24#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~24#1; 447753#L2991 main_#t~ret24#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~9#1 := main_#t~ret24#1;havoc main_#t~ret24#1; 447324#L1277 assume 0 != main_~tmp~9#1;assume { :begin_inline_setup } true; 445283#L1250 assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret13#1, aliceCall_~tmp~2#1;havoc aliceCall_~tmp~2#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~1#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~1#1; 438558#L95 assume !(0 == getOrigin_~person#1); 434882#L99 assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~1#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~1#1; 434883#L120 aliceCall_#t~ret13#1 := getOrigin_#res#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~2#1 := aliceCall_#t~ret13#1;havoc aliceCall_#t~ret13#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~2#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 448910#L530 assume !(0 == initPersonOnFloor_~floor#1); 449658#L557 assume !(1 == initPersonOnFloor_~floor#1); 436861#L584 assume !(2 == initPersonOnFloor_~floor#1); 436862#L611 assume 3 == initPersonOnFloor_~floor#1; 448376#L612 assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_3~0 := 1; 433296#L638-1 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 450018#L322 assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1; 433526#L334-2 assume { :end_inline_callOnFloor } true; 449749#L674 assume { :end_inline_initPersonOnFloor } true; 449982#L1006 assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret14#1, angelinaCall_~tmp~3#1;havoc angelinaCall_~tmp~3#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~1#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~1#1; 433373#L95-1 assume !(0 == getOrigin_~person#1); 433374#L99-1 assume !(1 == getOrigin_~person#1); 445630#L103-1 assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~1#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~1#1; 434127#L120-1 angelinaCall_#t~ret14#1 := getOrigin_#res#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~3#1 := angelinaCall_#t~ret14#1;havoc angelinaCall_#t~ret14#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~3#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 451056#L530-1 assume 0 == initPersonOnFloor_~floor#1; 449976#L531-2 assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_0~0 := 1; 433659#L638-3 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 439429#L322-2 assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1; 434201#L334-5 assume { :end_inline_callOnFloor } true; 441743#L674-1 assume { :end_inline_initPersonOnFloor } true; 443246#L1017 assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret84#1, timeShift_~tmp~24#1;havoc timeShift_~tmp~24#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret4#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~12#1;havoc getCurrentHeading_~retValue_acc~12#1;getCurrentHeading_~retValue_acc~12#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~12#1; 442077#L1680 __utac_acc__Specification13_spec__1_#t~ret4#1 := getCurrentHeading_#res#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret4#1;havoc __utac_acc__Specification13_spec__1_#t~ret4#1; 442078#L851 assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~10#1;havoc areDoorsOpen_~retValue_acc~10#1;areDoorsOpen_~retValue_acc~10#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~10#1; 451017#L1637 timeShift_#t~ret84#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~24#1 := timeShift_#t~ret84#1;havoc timeShift_#t~ret84#1; 438552#L2587 assume 0 != timeShift_~tmp~24#1; 438553#L2588 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 440121#L2587-1 assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret5#1, __utac_acc__Specification13_spec__2_#t~ret6#1, __utac_acc__Specification13_spec__2_#t~ret7#1, __utac_acc__Specification13_spec__2_#t~ret8#1, __utac_acc__Specification13_spec__2_#t~ret9#1, __utac_acc__Specification13_spec__2_#t~ret10#1, __utac_acc__Specification13_spec__2_~tmp~0#1, __utac_acc__Specification13_spec__2_~tmp___0~0#1, __utac_acc__Specification13_spec__2_~tmp___1~0#1, __utac_acc__Specification13_spec__2_~tmp___2~0#1, __utac_acc__Specification13_spec__2_~tmp___3~0#1, __utac_acc__Specification13_spec__2_~tmp___4~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;havoc __utac_acc__Specification13_spec__2_~tmp~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~0#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3); 442831#L869 assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1; 440654#L870 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~22#1, existInLiftCallsInDirection_~i~3#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~22#1;havoc existInLiftCallsInDirection_~i~3#1;havoc existInLiftCallsInDirection_~i___0~0#1; 440655#L2807 assume !(1 == existInLiftCallsInDirection_~d#1); 442874#L2873 assume 0 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i___0~0#1 := 0;existInLiftCallsInDirection_~i___0~0#1 := ~currentFloorID~0 - 1; 442875#L2877-2 [2021-12-21 22:24:23,170 INFO L793 eck$LassoCheckResult]: Loop: 442875#L2877-2 assume !false; 439380#L2878 assume existInLiftCallsInDirection_~i___0~0#1 >= 0; 439381#L2879 existInLiftCallsInDirection_~i___0~0#1 := 1 + ~currentFloorID~0; 437669#L2886-2 assume !false; 437670#L2887 assume !(existInLiftCallsInDirection_~i___0~0#1 < 5); 438632#L2945 existInLiftCallsInDirection_~i___0~0#1 := existInLiftCallsInDirection_~i___0~0#1 - 1; 442875#L2877-2 [2021-12-21 22:24:23,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:24:23,171 INFO L85 PathProgramCache]: Analyzing trace with hash 368657234, now seen corresponding path program 1 times [2021-12-21 22:24:23,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:24:23,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928969498] [2021-12-21 22:24:23,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:24:23,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:24:23,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:24:23,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:24:23,238 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:24:23,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928969498] [2021-12-21 22:24:23,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928969498] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:24:23,239 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:24:23,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 22:24:23,239 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971109333] [2021-12-21 22:24:23,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:24:23,240 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:24:23,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:24:23,240 INFO L85 PathProgramCache]: Analyzing trace with hash 2078933803, now seen corresponding path program 3 times [2021-12-21 22:24:23,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:24:23,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306691952] [2021-12-21 22:24:23,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:24:23,242 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:24:23,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:24:23,248 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:24:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:24:23,259 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:24:23,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:24:23,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 22:24:23,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 22:24:23,277 INFO L87 Difference]: Start difference. First operand 17910 states and 33546 transitions. cyclomatic complexity: 15670 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) [2021-12-21 22:24:23,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:24:23,922 INFO L93 Difference]: Finished difference Result 25046 states and 46910 transitions. [2021-12-21 22:24:23,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 22:24:23,924 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25046 states and 46910 transitions. [2021-12-21 22:24:24,026 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 7780 [2021-12-21 22:24:24,125 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25046 states to 25046 states and 46910 transitions. [2021-12-21 22:24:24,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25027 [2021-12-21 22:24:24,150 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25027 [2021-12-21 22:24:24,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25046 states and 46910 transitions. [2021-12-21 22:24:24,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 22:24:24,173 INFO L681 BuchiCegarLoop]: Abstraction has 25046 states and 46910 transitions. [2021-12-21 22:24:24,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25046 states and 46910 transitions. [2021-12-21 22:24:24,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25046 to 17910. [2021-12-21 22:24:24,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17910 states, 17910 states have (on average 1.8726968174204355) internal successors, (33540), 17909 states have internal predecessors, (33540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:24:24,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17910 states to 17910 states and 33540 transitions. [2021-12-21 22:24:24,490 INFO L704 BuchiCegarLoop]: Abstraction has 17910 states and 33540 transitions. [2021-12-21 22:24:24,490 INFO L587 BuchiCegarLoop]: Abstraction has 17910 states and 33540 transitions. [2021-12-21 22:24:24,490 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-21 22:24:24,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17910 states and 33540 transitions. [2021-12-21 22:24:24,554 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4072 [2021-12-21 22:24:24,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:24:24,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:24:24,557 INFO L842 BuchiCegarLoop]: 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] [2021-12-21 22:24:24,557 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-21 22:24:24,558 INFO L791 eck$LassoCheckResult]: Stem: 488528#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(10, 4);call #Ultimate.allocInit(4, 5);call write~init~int(91, 5, 0, 1);call write~init~int(95, 5, 1, 1);call write~init~int(93, 5, 2, 1);call write~init~int(0, 5, 3, 1);call #Ultimate.allocInit(4, 6);call write~init~int(91, 6, 0, 1);call write~init~int(93, 6, 1, 1);call write~init~int(32, 6, 2, 1);call write~init~int(0, 6, 3, 1);call #Ultimate.allocInit(5, 7);call write~init~int(32, 7, 0, 1);call write~init~int(97, 7, 1, 1);call write~init~int(116, 7, 2, 1);call write~init~int(32, 7, 3, 1);call write~init~int(0, 7, 4, 1);call #Ultimate.allocInit(3, 8);call write~init~int(37, 8, 0, 1);call write~init~int(105, 8, 1, 1);call write~init~int(0, 8, 2, 1);call #Ultimate.allocInit(10, 9);call #Ultimate.allocInit(3, 10);call write~init~int(117, 10, 0, 1);call write~init~int(112, 10, 1, 1);call write~init~int(0, 10, 2, 1);call #Ultimate.allocInit(5, 11);call write~init~int(100, 11, 0, 1);call write~init~int(111, 11, 1, 1);call write~init~int(119, 11, 2, 1);call write~init~int(110, 11, 3, 1);call write~init~int(0, 11, 4, 1);call #Ultimate.allocInit(7, 12);call write~init~int(32, 12, 0, 1);call write~init~int(73, 12, 1, 1);call write~init~int(76, 12, 2, 1);call write~init~int(95, 12, 3, 1);call write~init~int(112, 12, 4, 1);call write~init~int(58, 12, 5, 1);call write~init~int(0, 12, 6, 1);call #Ultimate.allocInit(4, 13);call write~init~int(32, 13, 0, 1);call write~init~int(37, 13, 1, 1);call write~init~int(105, 13, 2, 1);call write~init~int(0, 13, 3, 1);call #Ultimate.allocInit(4, 14);call write~init~int(32, 14, 0, 1);call write~init~int(37, 14, 1, 1);call write~init~int(105, 14, 2, 1);call write~init~int(0, 14, 3, 1);call #Ultimate.allocInit(4, 15);call write~init~int(32, 15, 0, 1);call write~init~int(37, 15, 1, 1);call write~init~int(105, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(4, 16);call write~init~int(32, 16, 0, 1);call write~init~int(37, 16, 1, 1);call write~init~int(105, 16, 2, 1);call write~init~int(0, 16, 3, 1);call #Ultimate.allocInit(4, 17);call write~init~int(32, 17, 0, 1);call write~init~int(37, 17, 1, 1);call write~init~int(105, 17, 2, 1);call write~init~int(0, 17, 3, 1);call #Ultimate.allocInit(6, 18);call write~init~int(32, 18, 0, 1);call write~init~int(70, 18, 1, 1);call write~init~int(95, 18, 2, 1);call write~init~int(112, 18, 3, 1);call write~init~int(58, 18, 4, 1);call write~init~int(0, 18, 5, 1);call #Ultimate.allocInit(4, 19);call write~init~int(32, 19, 0, 1);call write~init~int(37, 19, 1, 1);call write~init~int(105, 19, 2, 1);call write~init~int(0, 19, 3, 1);call #Ultimate.allocInit(4, 20);call write~init~int(32, 20, 0, 1);call write~init~int(37, 20, 1, 1);call write~init~int(105, 20, 2, 1);call write~init~int(0, 20, 3, 1);call #Ultimate.allocInit(4, 21);call write~init~int(32, 21, 0, 1);call write~init~int(37, 21, 1, 1);call write~init~int(105, 21, 2, 1);call write~init~int(0, 21, 3, 1);call #Ultimate.allocInit(4, 22);call write~init~int(32, 22, 0, 1);call write~init~int(37, 22, 1, 1);call write~init~int(105, 22, 2, 1);call write~init~int(0, 22, 3, 1);call #Ultimate.allocInit(4, 23);call write~init~int(32, 23, 0, 1);call write~init~int(37, 23, 1, 1);call write~init~int(105, 23, 2, 1);call write~init~int(0, 23, 3, 1);call #Ultimate.allocInit(2, 24);call write~init~int(10, 24, 0, 1);call write~init~int(0, 24, 1, 1);call #Ultimate.allocInit(9, 25);call #Ultimate.allocInit(30, 26);call #Ultimate.allocInit(9, 27);call #Ultimate.allocInit(21, 28);call #Ultimate.allocInit(30, 29);call #Ultimate.allocInit(9, 30);call #Ultimate.allocInit(21, 31);call #Ultimate.allocInit(30, 32);call #Ultimate.allocInit(9, 33);call #Ultimate.allocInit(25, 34);call #Ultimate.allocInit(30, 35);call #Ultimate.allocInit(9, 36);call #Ultimate.allocInit(25, 37);~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;~weight~0 := 0;~maximumWeight~0 := 100;~blocked~0 := 0;~prevDir~0 := 0;~cleanupTimeShifts~0 := 12;~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;~head~0.base, ~head~0.offset := 0, 0; 484704#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_~retValue_acc~7#1, main_~tmp~9#1;havoc main_~retValue_acc~7#1;havoc main_~tmp~9#1;assume { :begin_inline_select_helpers } true; 484105#L2983 assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 484106#L2976 assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~24#1;havoc valid_product_~retValue_acc~24#1;valid_product_~retValue_acc~24#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~24#1; 490722#L2991 main_#t~ret24#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~9#1 := main_#t~ret24#1;havoc main_#t~ret24#1; 490292#L1277 assume 0 != main_~tmp~9#1;assume { :begin_inline_setup } true; 488251#L1250 assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret13#1, aliceCall_~tmp~2#1;havoc aliceCall_~tmp~2#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~1#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~1#1; 481527#L95 assume !(0 == getOrigin_~person#1); 477854#L99 assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~1#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~1#1; 477855#L120 aliceCall_#t~ret13#1 := getOrigin_#res#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~2#1 := aliceCall_#t~ret13#1;havoc aliceCall_#t~ret13#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~2#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 491879#L530 assume !(0 == initPersonOnFloor_~floor#1); 492627#L557 assume !(1 == initPersonOnFloor_~floor#1); 479830#L584 assume !(2 == initPersonOnFloor_~floor#1); 479831#L611 assume 3 == initPersonOnFloor_~floor#1; 491345#L612 assume !(0 == initPersonOnFloor_~person#1); 491346#L615 assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_3~0 := 1; 476265#L638-1 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 492987#L322 assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1; 476495#L334-2 assume { :end_inline_callOnFloor } true; 492718#L674 assume { :end_inline_initPersonOnFloor } true; 492951#L1006 assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret14#1, angelinaCall_~tmp~3#1;havoc angelinaCall_~tmp~3#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~1#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~1#1; 476342#L95-1 assume !(0 == getOrigin_~person#1); 476343#L99-1 assume !(1 == getOrigin_~person#1); 488598#L103-1 assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~1#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~1#1; 477096#L120-1 angelinaCall_#t~ret14#1 := getOrigin_#res#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~3#1 := angelinaCall_#t~ret14#1;havoc angelinaCall_#t~ret14#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~3#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 494026#L530-1 assume 0 == initPersonOnFloor_~floor#1; 492945#L531-2 assume !(0 == initPersonOnFloor_~person#1); 492780#L534-2 assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_0~0 := 1; 476628#L638-3 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 482398#L322-2 assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1; 477170#L334-5 assume { :end_inline_callOnFloor } true; 484711#L674-1 assume { :end_inline_initPersonOnFloor } true; 486214#L1017 assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret84#1, timeShift_~tmp~24#1;havoc timeShift_~tmp~24#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret4#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~12#1;havoc getCurrentHeading_~retValue_acc~12#1;getCurrentHeading_~retValue_acc~12#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~12#1; 485045#L1680 __utac_acc__Specification13_spec__1_#t~ret4#1 := getCurrentHeading_#res#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret4#1;havoc __utac_acc__Specification13_spec__1_#t~ret4#1; 485046#L851 assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~10#1;havoc areDoorsOpen_~retValue_acc~10#1;areDoorsOpen_~retValue_acc~10#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~10#1; 493987#L1637 timeShift_#t~ret84#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~24#1 := timeShift_#t~ret84#1;havoc timeShift_#t~ret84#1; 481521#L2587 assume 0 != timeShift_~tmp~24#1; 481522#L2588 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 483089#L2587-1 assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret5#1, __utac_acc__Specification13_spec__2_#t~ret6#1, __utac_acc__Specification13_spec__2_#t~ret7#1, __utac_acc__Specification13_spec__2_#t~ret8#1, __utac_acc__Specification13_spec__2_#t~ret9#1, __utac_acc__Specification13_spec__2_#t~ret10#1, __utac_acc__Specification13_spec__2_~tmp~0#1, __utac_acc__Specification13_spec__2_~tmp___0~0#1, __utac_acc__Specification13_spec__2_~tmp___1~0#1, __utac_acc__Specification13_spec__2_~tmp___2~0#1, __utac_acc__Specification13_spec__2_~tmp___3~0#1, __utac_acc__Specification13_spec__2_~tmp___4~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;havoc __utac_acc__Specification13_spec__2_~tmp~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~0#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3); 485799#L869 assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1; 483624#L870 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~22#1, existInLiftCallsInDirection_~i~3#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~22#1;havoc existInLiftCallsInDirection_~i~3#1;havoc existInLiftCallsInDirection_~i___0~0#1; 483625#L2807 assume !(1 == existInLiftCallsInDirection_~d#1); 485842#L2873 assume 0 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i___0~0#1 := 0;existInLiftCallsInDirection_~i___0~0#1 := ~currentFloorID~0 - 1; 485843#L2877-2 [2021-12-21 22:24:24,559 INFO L793 eck$LassoCheckResult]: Loop: 485843#L2877-2 assume !false; 482351#L2878 assume existInLiftCallsInDirection_~i___0~0#1 >= 0; 482352#L2879 existInLiftCallsInDirection_~i___0~0#1 := 1 + ~currentFloorID~0; 480638#L2886-2 assume !false; 480639#L2887 assume !(existInLiftCallsInDirection_~i___0~0#1 < 5); 481603#L2945 existInLiftCallsInDirection_~i___0~0#1 := existInLiftCallsInDirection_~i___0~0#1 - 1; 485843#L2877-2 [2021-12-21 22:24:24,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:24:24,559 INFO L85 PathProgramCache]: Analyzing trace with hash 590101782, now seen corresponding path program 1 times [2021-12-21 22:24:24,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:24:24,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909111871] [2021-12-21 22:24:24,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:24:24,563 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:24:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:24:24,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:24:24,612 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:24:24,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909111871] [2021-12-21 22:24:24,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909111871] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:24:24,613 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:24:24,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 22:24:24,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489526988] [2021-12-21 22:24:24,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:24:24,614 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:24:24,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:24:24,615 INFO L85 PathProgramCache]: Analyzing trace with hash 2078933803, now seen corresponding path program 4 times [2021-12-21 22:24:24,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:24:24,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454156819] [2021-12-21 22:24:24,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:24:24,615 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:24:24,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:24:24,620 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:24:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:24:24,630 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:24:24,648 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:24:24,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 22:24:24,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 22:24:24,649 INFO L87 Difference]: Start difference. First operand 17910 states and 33540 transitions. cyclomatic complexity: 15664 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) [2021-12-21 22:24:25,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:24:25,809 INFO L93 Difference]: Finished difference Result 53529 states and 100281 transitions. [2021-12-21 22:24:25,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 22:24:25,810 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53529 states and 100281 transitions. [2021-12-21 22:24:26,035 INFO L131 ngComponentsAnalysis]: Automaton has 99 accepting balls. 12216 [2021-12-21 22:24:26,204 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53529 states to 53529 states and 100281 transitions. [2021-12-21 22:24:26,205 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53472 [2021-12-21 22:24:26,244 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53472 [2021-12-21 22:24:26,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53529 states and 100281 transitions. [2021-12-21 22:24:26,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 22:24:26,270 INFO L681 BuchiCegarLoop]: Abstraction has 53529 states and 100281 transitions. [2021-12-21 22:24:26,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53529 states and 100281 transitions. [2021-12-21 22:24:26,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53529 to 17914. [2021-12-21 22:24:26,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17914 states, 17914 states have (on average 1.8724461315172491) internal successors, (33543), 17913 states have internal predecessors, (33543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:24:26,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17914 states to 17914 states and 33543 transitions. [2021-12-21 22:24:26,688 INFO L704 BuchiCegarLoop]: Abstraction has 17914 states and 33543 transitions. [2021-12-21 22:24:26,689 INFO L587 BuchiCegarLoop]: Abstraction has 17914 states and 33543 transitions. [2021-12-21 22:24:26,689 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-21 22:24:26,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17914 states and 33543 transitions. [2021-12-21 22:24:26,745 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4072 [2021-12-21 22:24:26,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:24:26,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:24:26,746 INFO L842 BuchiCegarLoop]: 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] [2021-12-21 22:24:26,746 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-21 22:24:26,747 INFO L791 eck$LassoCheckResult]: Stem: 559979#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(10, 4);call #Ultimate.allocInit(4, 5);call write~init~int(91, 5, 0, 1);call write~init~int(95, 5, 1, 1);call write~init~int(93, 5, 2, 1);call write~init~int(0, 5, 3, 1);call #Ultimate.allocInit(4, 6);call write~init~int(91, 6, 0, 1);call write~init~int(93, 6, 1, 1);call write~init~int(32, 6, 2, 1);call write~init~int(0, 6, 3, 1);call #Ultimate.allocInit(5, 7);call write~init~int(32, 7, 0, 1);call write~init~int(97, 7, 1, 1);call write~init~int(116, 7, 2, 1);call write~init~int(32, 7, 3, 1);call write~init~int(0, 7, 4, 1);call #Ultimate.allocInit(3, 8);call write~init~int(37, 8, 0, 1);call write~init~int(105, 8, 1, 1);call write~init~int(0, 8, 2, 1);call #Ultimate.allocInit(10, 9);call #Ultimate.allocInit(3, 10);call write~init~int(117, 10, 0, 1);call write~init~int(112, 10, 1, 1);call write~init~int(0, 10, 2, 1);call #Ultimate.allocInit(5, 11);call write~init~int(100, 11, 0, 1);call write~init~int(111, 11, 1, 1);call write~init~int(119, 11, 2, 1);call write~init~int(110, 11, 3, 1);call write~init~int(0, 11, 4, 1);call #Ultimate.allocInit(7, 12);call write~init~int(32, 12, 0, 1);call write~init~int(73, 12, 1, 1);call write~init~int(76, 12, 2, 1);call write~init~int(95, 12, 3, 1);call write~init~int(112, 12, 4, 1);call write~init~int(58, 12, 5, 1);call write~init~int(0, 12, 6, 1);call #Ultimate.allocInit(4, 13);call write~init~int(32, 13, 0, 1);call write~init~int(37, 13, 1, 1);call write~init~int(105, 13, 2, 1);call write~init~int(0, 13, 3, 1);call #Ultimate.allocInit(4, 14);call write~init~int(32, 14, 0, 1);call write~init~int(37, 14, 1, 1);call write~init~int(105, 14, 2, 1);call write~init~int(0, 14, 3, 1);call #Ultimate.allocInit(4, 15);call write~init~int(32, 15, 0, 1);call write~init~int(37, 15, 1, 1);call write~init~int(105, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(4, 16);call write~init~int(32, 16, 0, 1);call write~init~int(37, 16, 1, 1);call write~init~int(105, 16, 2, 1);call write~init~int(0, 16, 3, 1);call #Ultimate.allocInit(4, 17);call write~init~int(32, 17, 0, 1);call write~init~int(37, 17, 1, 1);call write~init~int(105, 17, 2, 1);call write~init~int(0, 17, 3, 1);call #Ultimate.allocInit(6, 18);call write~init~int(32, 18, 0, 1);call write~init~int(70, 18, 1, 1);call write~init~int(95, 18, 2, 1);call write~init~int(112, 18, 3, 1);call write~init~int(58, 18, 4, 1);call write~init~int(0, 18, 5, 1);call #Ultimate.allocInit(4, 19);call write~init~int(32, 19, 0, 1);call write~init~int(37, 19, 1, 1);call write~init~int(105, 19, 2, 1);call write~init~int(0, 19, 3, 1);call #Ultimate.allocInit(4, 20);call write~init~int(32, 20, 0, 1);call write~init~int(37, 20, 1, 1);call write~init~int(105, 20, 2, 1);call write~init~int(0, 20, 3, 1);call #Ultimate.allocInit(4, 21);call write~init~int(32, 21, 0, 1);call write~init~int(37, 21, 1, 1);call write~init~int(105, 21, 2, 1);call write~init~int(0, 21, 3, 1);call #Ultimate.allocInit(4, 22);call write~init~int(32, 22, 0, 1);call write~init~int(37, 22, 1, 1);call write~init~int(105, 22, 2, 1);call write~init~int(0, 22, 3, 1);call #Ultimate.allocInit(4, 23);call write~init~int(32, 23, 0, 1);call write~init~int(37, 23, 1, 1);call write~init~int(105, 23, 2, 1);call write~init~int(0, 23, 3, 1);call #Ultimate.allocInit(2, 24);call write~init~int(10, 24, 0, 1);call write~init~int(0, 24, 1, 1);call #Ultimate.allocInit(9, 25);call #Ultimate.allocInit(30, 26);call #Ultimate.allocInit(9, 27);call #Ultimate.allocInit(21, 28);call #Ultimate.allocInit(30, 29);call #Ultimate.allocInit(9, 30);call #Ultimate.allocInit(21, 31);call #Ultimate.allocInit(30, 32);call #Ultimate.allocInit(9, 33);call #Ultimate.allocInit(25, 34);call #Ultimate.allocInit(30, 35);call #Ultimate.allocInit(9, 36);call #Ultimate.allocInit(25, 37);~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;~weight~0 := 0;~maximumWeight~0 := 100;~blocked~0 := 0;~prevDir~0 := 0;~cleanupTimeShifts~0 := 12;~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;~head~0.base, ~head~0.offset := 0, 0; 556155#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_~retValue_acc~7#1, main_~tmp~9#1;havoc main_~retValue_acc~7#1;havoc main_~tmp~9#1;assume { :begin_inline_select_helpers } true; 555556#L2983 assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 555557#L2976 assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~24#1;havoc valid_product_~retValue_acc~24#1;valid_product_~retValue_acc~24#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~24#1; 562173#L2991 main_#t~ret24#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~9#1 := main_#t~ret24#1;havoc main_#t~ret24#1; 561743#L1277 assume 0 != main_~tmp~9#1;assume { :begin_inline_setup } true; 559702#L1250 assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret13#1, aliceCall_~tmp~2#1;havoc aliceCall_~tmp~2#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~1#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~1#1; 552975#L95 assume !(0 == getOrigin_~person#1); 549302#L99 assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~1#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~1#1; 549303#L120 aliceCall_#t~ret13#1 := getOrigin_#res#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~2#1 := aliceCall_#t~ret13#1;havoc aliceCall_#t~ret13#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~2#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 563330#L530 assume !(0 == initPersonOnFloor_~floor#1); 564078#L557 assume !(1 == initPersonOnFloor_~floor#1); 551278#L584 assume !(2 == initPersonOnFloor_~floor#1); 551279#L611 assume 3 == initPersonOnFloor_~floor#1; 562796#L612 assume !(0 == initPersonOnFloor_~person#1); 562797#L615 assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_3~0 := 1; 547713#L638-1 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 564438#L322 assume !(0 == callOnFloor_~floorID#1); 548119#L325 assume 1 == callOnFloor_~floorID#1;~calls_1~0 := 1; 547943#L334-2 assume { :end_inline_callOnFloor } true; 564169#L674 assume { :end_inline_initPersonOnFloor } true; 564402#L1006 assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret14#1, angelinaCall_~tmp~3#1;havoc angelinaCall_~tmp~3#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~1#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~1#1; 547790#L95-1 assume !(0 == getOrigin_~person#1); 547791#L99-1 assume !(1 == getOrigin_~person#1); 560049#L103-1 assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~1#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~1#1; 548544#L120-1 angelinaCall_#t~ret14#1 := getOrigin_#res#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~3#1 := angelinaCall_#t~ret14#1;havoc angelinaCall_#t~ret14#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~3#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 564895#L530-1 assume 0 == initPersonOnFloor_~floor#1; 564396#L531-2 assume !(0 == initPersonOnFloor_~person#1); 564231#L534-2 assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_0~0 := 1; 553868#L638-3 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 562597#L322-2 assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1; 548618#L334-5 assume { :end_inline_callOnFloor } true; 556162#L674-1 assume { :end_inline_initPersonOnFloor } true; 557665#L1017 assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret84#1, timeShift_~tmp~24#1;havoc timeShift_~tmp~24#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret4#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~12#1;havoc getCurrentHeading_~retValue_acc~12#1;getCurrentHeading_~retValue_acc~12#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~12#1; 556496#L1680 __utac_acc__Specification13_spec__1_#t~ret4#1 := getCurrentHeading_#res#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret4#1;havoc __utac_acc__Specification13_spec__1_#t~ret4#1; 556497#L851 assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~10#1;havoc areDoorsOpen_~retValue_acc~10#1;areDoorsOpen_~retValue_acc~10#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~10#1; 565438#L1637 timeShift_#t~ret84#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~24#1 := timeShift_#t~ret84#1;havoc timeShift_#t~ret84#1; 552969#L2587 assume 0 != timeShift_~tmp~24#1; 552970#L2588 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 554539#L2587-1 assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret5#1, __utac_acc__Specification13_spec__2_#t~ret6#1, __utac_acc__Specification13_spec__2_#t~ret7#1, __utac_acc__Specification13_spec__2_#t~ret8#1, __utac_acc__Specification13_spec__2_#t~ret9#1, __utac_acc__Specification13_spec__2_#t~ret10#1, __utac_acc__Specification13_spec__2_~tmp~0#1, __utac_acc__Specification13_spec__2_~tmp___0~0#1, __utac_acc__Specification13_spec__2_~tmp___1~0#1, __utac_acc__Specification13_spec__2_~tmp___2~0#1, __utac_acc__Specification13_spec__2_~tmp___3~0#1, __utac_acc__Specification13_spec__2_~tmp___4~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;havoc __utac_acc__Specification13_spec__2_~tmp~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~0#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3); 557250#L869 assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1; 555074#L870 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~22#1, existInLiftCallsInDirection_~i~3#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~22#1;havoc existInLiftCallsInDirection_~i~3#1;havoc existInLiftCallsInDirection_~i___0~0#1; 555075#L2807 assume !(1 == existInLiftCallsInDirection_~d#1); 557293#L2873 assume 0 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i___0~0#1 := 0;existInLiftCallsInDirection_~i___0~0#1 := ~currentFloorID~0 - 1; 557294#L2877-2 [2021-12-21 22:24:26,747 INFO L793 eck$LassoCheckResult]: Loop: 557294#L2877-2 assume !false; 553797#L2878 assume existInLiftCallsInDirection_~i___0~0#1 >= 0; 553798#L2879 existInLiftCallsInDirection_~i___0~0#1 := 1 + ~currentFloorID~0; 552086#L2886-2 assume !false; 552087#L2887 assume !(existInLiftCallsInDirection_~i___0~0#1 < 5); 553051#L2945 existInLiftCallsInDirection_~i___0~0#1 := existInLiftCallsInDirection_~i___0~0#1 - 1; 557294#L2877-2 [2021-12-21 22:24:26,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:24:26,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1215423119, now seen corresponding path program 1 times [2021-12-21 22:24:26,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:24:26,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998454406] [2021-12-21 22:24:26,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:24:26,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:24:26,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:24:26,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:24:26,782 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:24:26,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998454406] [2021-12-21 22:24:26,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998454406] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:24:26,783 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:24:26,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 22:24:26,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425220636] [2021-12-21 22:24:26,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:24:26,784 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:24:26,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:24:26,784 INFO L85 PathProgramCache]: Analyzing trace with hash 2078933803, now seen corresponding path program 5 times [2021-12-21 22:24:26,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:24:26,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429534666] [2021-12-21 22:24:26,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:24:26,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:24:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:24:26,789 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:24:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:24:26,792 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:24:26,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:24:26,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 22:24:26,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 22:24:26,809 INFO L87 Difference]: Start difference. First operand 17914 states and 33543 transitions. cyclomatic complexity: 15663 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) [2021-12-21 22:24:27,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:24:27,601 INFO L93 Difference]: Finished difference Result 53534 states and 100283 transitions. [2021-12-21 22:24:27,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 22:24:27,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53534 states and 100283 transitions. [2021-12-21 22:24:28,024 INFO L131 ngComponentsAnalysis]: Automaton has 99 accepting balls. 12216 [2021-12-21 22:24:28,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53534 states to 53534 states and 100283 transitions. [2021-12-21 22:24:28,176 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53477 [2021-12-21 22:24:28,218 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53477 [2021-12-21 22:24:28,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53534 states and 100283 transitions. [2021-12-21 22:24:28,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 22:24:28,219 INFO L681 BuchiCegarLoop]: Abstraction has 53534 states and 100283 transitions. [2021-12-21 22:24:28,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53534 states and 100283 transitions. [2021-12-21 22:24:28,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53534 to 17920. [2021-12-21 22:24:28,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17920 states, 17920 states have (on average 1.8720982142857143) internal successors, (33548), 17919 states have internal predecessors, (33548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:24:28,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17920 states to 17920 states and 33548 transitions. [2021-12-21 22:24:28,561 INFO L704 BuchiCegarLoop]: Abstraction has 17920 states and 33548 transitions. [2021-12-21 22:24:28,561 INFO L587 BuchiCegarLoop]: Abstraction has 17920 states and 33548 transitions. [2021-12-21 22:24:28,561 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-21 22:24:28,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17920 states and 33548 transitions. [2021-12-21 22:24:28,608 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4072 [2021-12-21 22:24:28,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:24:28,608 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:24:28,609 INFO L842 BuchiCegarLoop]: 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] [2021-12-21 22:24:28,609 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-21 22:24:28,609 INFO L791 eck$LassoCheckResult]: Stem: 631439#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(10, 4);call #Ultimate.allocInit(4, 5);call write~init~int(91, 5, 0, 1);call write~init~int(95, 5, 1, 1);call write~init~int(93, 5, 2, 1);call write~init~int(0, 5, 3, 1);call #Ultimate.allocInit(4, 6);call write~init~int(91, 6, 0, 1);call write~init~int(93, 6, 1, 1);call write~init~int(32, 6, 2, 1);call write~init~int(0, 6, 3, 1);call #Ultimate.allocInit(5, 7);call write~init~int(32, 7, 0, 1);call write~init~int(97, 7, 1, 1);call write~init~int(116, 7, 2, 1);call write~init~int(32, 7, 3, 1);call write~init~int(0, 7, 4, 1);call #Ultimate.allocInit(3, 8);call write~init~int(37, 8, 0, 1);call write~init~int(105, 8, 1, 1);call write~init~int(0, 8, 2, 1);call #Ultimate.allocInit(10, 9);call #Ultimate.allocInit(3, 10);call write~init~int(117, 10, 0, 1);call write~init~int(112, 10, 1, 1);call write~init~int(0, 10, 2, 1);call #Ultimate.allocInit(5, 11);call write~init~int(100, 11, 0, 1);call write~init~int(111, 11, 1, 1);call write~init~int(119, 11, 2, 1);call write~init~int(110, 11, 3, 1);call write~init~int(0, 11, 4, 1);call #Ultimate.allocInit(7, 12);call write~init~int(32, 12, 0, 1);call write~init~int(73, 12, 1, 1);call write~init~int(76, 12, 2, 1);call write~init~int(95, 12, 3, 1);call write~init~int(112, 12, 4, 1);call write~init~int(58, 12, 5, 1);call write~init~int(0, 12, 6, 1);call #Ultimate.allocInit(4, 13);call write~init~int(32, 13, 0, 1);call write~init~int(37, 13, 1, 1);call write~init~int(105, 13, 2, 1);call write~init~int(0, 13, 3, 1);call #Ultimate.allocInit(4, 14);call write~init~int(32, 14, 0, 1);call write~init~int(37, 14, 1, 1);call write~init~int(105, 14, 2, 1);call write~init~int(0, 14, 3, 1);call #Ultimate.allocInit(4, 15);call write~init~int(32, 15, 0, 1);call write~init~int(37, 15, 1, 1);call write~init~int(105, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(4, 16);call write~init~int(32, 16, 0, 1);call write~init~int(37, 16, 1, 1);call write~init~int(105, 16, 2, 1);call write~init~int(0, 16, 3, 1);call #Ultimate.allocInit(4, 17);call write~init~int(32, 17, 0, 1);call write~init~int(37, 17, 1, 1);call write~init~int(105, 17, 2, 1);call write~init~int(0, 17, 3, 1);call #Ultimate.allocInit(6, 18);call write~init~int(32, 18, 0, 1);call write~init~int(70, 18, 1, 1);call write~init~int(95, 18, 2, 1);call write~init~int(112, 18, 3, 1);call write~init~int(58, 18, 4, 1);call write~init~int(0, 18, 5, 1);call #Ultimate.allocInit(4, 19);call write~init~int(32, 19, 0, 1);call write~init~int(37, 19, 1, 1);call write~init~int(105, 19, 2, 1);call write~init~int(0, 19, 3, 1);call #Ultimate.allocInit(4, 20);call write~init~int(32, 20, 0, 1);call write~init~int(37, 20, 1, 1);call write~init~int(105, 20, 2, 1);call write~init~int(0, 20, 3, 1);call #Ultimate.allocInit(4, 21);call write~init~int(32, 21, 0, 1);call write~init~int(37, 21, 1, 1);call write~init~int(105, 21, 2, 1);call write~init~int(0, 21, 3, 1);call #Ultimate.allocInit(4, 22);call write~init~int(32, 22, 0, 1);call write~init~int(37, 22, 1, 1);call write~init~int(105, 22, 2, 1);call write~init~int(0, 22, 3, 1);call #Ultimate.allocInit(4, 23);call write~init~int(32, 23, 0, 1);call write~init~int(37, 23, 1, 1);call write~init~int(105, 23, 2, 1);call write~init~int(0, 23, 3, 1);call #Ultimate.allocInit(2, 24);call write~init~int(10, 24, 0, 1);call write~init~int(0, 24, 1, 1);call #Ultimate.allocInit(9, 25);call #Ultimate.allocInit(30, 26);call #Ultimate.allocInit(9, 27);call #Ultimate.allocInit(21, 28);call #Ultimate.allocInit(30, 29);call #Ultimate.allocInit(9, 30);call #Ultimate.allocInit(21, 31);call #Ultimate.allocInit(30, 32);call #Ultimate.allocInit(9, 33);call #Ultimate.allocInit(25, 34);call #Ultimate.allocInit(30, 35);call #Ultimate.allocInit(9, 36);call #Ultimate.allocInit(25, 37);~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;~weight~0 := 0;~maximumWeight~0 := 100;~blocked~0 := 0;~prevDir~0 := 0;~cleanupTimeShifts~0 := 12;~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;~head~0.base, ~head~0.offset := 0, 0; 627614#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_~retValue_acc~7#1, main_~tmp~9#1;havoc main_~retValue_acc~7#1;havoc main_~tmp~9#1;assume { :begin_inline_select_helpers } true; 627015#L2983 assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 627016#L2976 assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~24#1;havoc valid_product_~retValue_acc~24#1;valid_product_~retValue_acc~24#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~24#1; 633632#L2991 main_#t~ret24#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~9#1 := main_#t~ret24#1;havoc main_#t~ret24#1; 633203#L1277 assume 0 != main_~tmp~9#1;assume { :begin_inline_setup } true; 631162#L1250 assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret13#1, aliceCall_~tmp~2#1;havoc aliceCall_~tmp~2#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~1#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~1#1; 624433#L95 assume !(0 == getOrigin_~person#1); 620755#L99 assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~1#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~1#1; 620756#L120 aliceCall_#t~ret13#1 := getOrigin_#res#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~2#1 := aliceCall_#t~ret13#1;havoc aliceCall_#t~ret13#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~2#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 634789#L530 assume !(0 == initPersonOnFloor_~floor#1); 635537#L557 assume !(1 == initPersonOnFloor_~floor#1); 622734#L584 assume !(2 == initPersonOnFloor_~floor#1); 622735#L611 assume 3 == initPersonOnFloor_~floor#1; 634255#L612 assume !(0 == initPersonOnFloor_~person#1); 634256#L615 assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_3~0 := 1; 619170#L638-1 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 635897#L322 assume !(0 == callOnFloor_~floorID#1); 619576#L325 assume !(1 == callOnFloor_~floorID#1); 619577#L328 assume 2 == callOnFloor_~floorID#1;~calls_2~0 := 1; 619400#L334-2 assume { :end_inline_callOnFloor } true; 635628#L674 assume { :end_inline_initPersonOnFloor } true; 635861#L1006 assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret14#1, angelinaCall_~tmp~3#1;havoc angelinaCall_~tmp~3#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~1#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~1#1; 619247#L95-1 assume !(0 == getOrigin_~person#1); 619248#L99-1 assume !(1 == getOrigin_~person#1); 631509#L103-1 assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~1#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~1#1; 620001#L120-1 angelinaCall_#t~ret14#1 := getOrigin_#res#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~3#1 := angelinaCall_#t~ret14#1;havoc angelinaCall_#t~ret14#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~3#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 636354#L530-1 assume 0 == initPersonOnFloor_~floor#1; 635855#L531-2 assume !(0 == initPersonOnFloor_~person#1); 635690#L534-2 assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_0~0 := 1; 625327#L638-3 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 636947#L322-2 assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1; 623560#L334-5 assume { :end_inline_callOnFloor } true; 627621#L674-1 assume { :end_inline_initPersonOnFloor } true; 629124#L1017 assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret84#1, timeShift_~tmp~24#1;havoc timeShift_~tmp~24#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret4#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~12#1;havoc getCurrentHeading_~retValue_acc~12#1;getCurrentHeading_~retValue_acc~12#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~12#1; 627955#L1680 __utac_acc__Specification13_spec__1_#t~ret4#1 := getCurrentHeading_#res#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret4#1;havoc __utac_acc__Specification13_spec__1_#t~ret4#1; 627956#L851 assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~10#1;havoc areDoorsOpen_~retValue_acc~10#1;areDoorsOpen_~retValue_acc~10#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~10#1; 636898#L1637 timeShift_#t~ret84#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~24#1 := timeShift_#t~ret84#1;havoc timeShift_#t~ret84#1; 624427#L2587 assume 0 != timeShift_~tmp~24#1; 624428#L2588 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 625998#L2587-1 assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret5#1, __utac_acc__Specification13_spec__2_#t~ret6#1, __utac_acc__Specification13_spec__2_#t~ret7#1, __utac_acc__Specification13_spec__2_#t~ret8#1, __utac_acc__Specification13_spec__2_#t~ret9#1, __utac_acc__Specification13_spec__2_#t~ret10#1, __utac_acc__Specification13_spec__2_~tmp~0#1, __utac_acc__Specification13_spec__2_~tmp___0~0#1, __utac_acc__Specification13_spec__2_~tmp___1~0#1, __utac_acc__Specification13_spec__2_~tmp___2~0#1, __utac_acc__Specification13_spec__2_~tmp___3~0#1, __utac_acc__Specification13_spec__2_~tmp___4~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;havoc __utac_acc__Specification13_spec__2_~tmp~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~0#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3); 628709#L869 assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1; 626531#L870 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~22#1, existInLiftCallsInDirection_~i~3#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~22#1;havoc existInLiftCallsInDirection_~i~3#1;havoc existInLiftCallsInDirection_~i___0~0#1; 626532#L2807 assume !(1 == existInLiftCallsInDirection_~d#1); 628752#L2873 assume 0 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i___0~0#1 := 0;existInLiftCallsInDirection_~i___0~0#1 := ~currentFloorID~0 - 1; 628753#L2877-2 [2021-12-21 22:24:28,609 INFO L793 eck$LassoCheckResult]: Loop: 628753#L2877-2 assume !false; 625255#L2878 assume existInLiftCallsInDirection_~i___0~0#1 >= 0; 625256#L2879 existInLiftCallsInDirection_~i___0~0#1 := 1 + ~currentFloorID~0; 623543#L2886-2 assume !false; 623544#L2887 assume !(existInLiftCallsInDirection_~i___0~0#1 < 5); 624507#L2945 existInLiftCallsInDirection_~i___0~0#1 := existInLiftCallsInDirection_~i___0~0#1 - 1; 628753#L2877-2 [2021-12-21 22:24:28,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:24:28,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1197021167, now seen corresponding path program 1 times [2021-12-21 22:24:28,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:24:28,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14305323] [2021-12-21 22:24:28,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:24:28,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:24:28,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:24:28,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:24:28,657 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:24:28,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14305323] [2021-12-21 22:24:28,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14305323] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:24:28,658 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:24:28,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 22:24:28,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099618162] [2021-12-21 22:24:28,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:24:28,658 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:24:28,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:24:28,659 INFO L85 PathProgramCache]: Analyzing trace with hash 2078933803, now seen corresponding path program 6 times [2021-12-21 22:24:28,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:24:28,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531908684] [2021-12-21 22:24:28,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:24:28,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:24:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:24:28,663 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:24:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:24:28,666 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:24:28,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:24:28,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 22:24:28,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 22:24:28,683 INFO L87 Difference]: Start difference. First operand 17920 states and 33548 transitions. cyclomatic complexity: 15662 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) [2021-12-21 22:24:29,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:24:29,521 INFO L93 Difference]: Finished difference Result 53541 states and 100287 transitions. [2021-12-21 22:24:29,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 22:24:29,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53541 states and 100287 transitions. [2021-12-21 22:24:29,731 INFO L131 ngComponentsAnalysis]: Automaton has 99 accepting balls. 12216 [2021-12-21 22:24:29,888 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53541 states to 53541 states and 100287 transitions. [2021-12-21 22:24:29,888 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53484 [2021-12-21 22:24:29,925 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53484 [2021-12-21 22:24:29,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53541 states and 100287 transitions.