./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/product-lines/elevator_spec13_product24.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f8e1c903 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/product-lines/elevator_spec13_product24.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX --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 89950477a2818e2be847e3014c0e2f9e906834037b4e328723302699ed4d9564 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-f8e1c90 [2021-11-09 08:45:15,146 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-09 08:45:15,150 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-09 08:45:15,214 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-09 08:45:15,215 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-09 08:45:15,217 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-09 08:45:15,219 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-09 08:45:15,222 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-09 08:45:15,225 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-09 08:45:15,226 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-09 08:45:15,228 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-09 08:45:15,230 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-09 08:45:15,231 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-09 08:45:15,233 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-09 08:45:15,235 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-09 08:45:15,237 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-09 08:45:15,239 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-09 08:45:15,240 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-09 08:45:15,243 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-09 08:45:15,246 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-09 08:45:15,249 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-09 08:45:15,251 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-09 08:45:15,253 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-09 08:45:15,255 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-09 08:45:15,259 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-09 08:45:15,260 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-09 08:45:15,261 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-09 08:45:15,262 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-09 08:45:15,263 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-09 08:45:15,265 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-09 08:45:15,265 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-09 08:45:15,267 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-09 08:45:15,268 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-09 08:45:15,270 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-09 08:45:15,272 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-09 08:45:15,272 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-09 08:45:15,274 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-09 08:45:15,274 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-09 08:45:15,275 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-09 08:45:15,277 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-09 08:45:15,278 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-09 08:45:15,279 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-11-09 08:45:15,328 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-09 08:45:15,336 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-09 08:45:15,337 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-09 08:45:15,337 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-09 08:45:15,339 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-09 08:45:15,340 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-09 08:45:15,340 INFO L138 SettingsManager]: * Use SBE=true [2021-11-09 08:45:15,340 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-11-09 08:45:15,341 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-11-09 08:45:15,341 INFO L138 SettingsManager]: * Use old map elimination=false [2021-11-09 08:45:15,342 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-11-09 08:45:15,343 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-11-09 08:45:15,343 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-11-09 08:45:15,343 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-09 08:45:15,344 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-09 08:45:15,344 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-09 08:45:15,344 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-09 08:45:15,344 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-09 08:45:15,345 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-09 08:45:15,345 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-11-09 08:45:15,345 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-11-09 08:45:15,346 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-11-09 08:45:15,346 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-09 08:45:15,346 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-09 08:45:15,346 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-11-09 08:45:15,347 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-09 08:45:15,349 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-11-09 08:45:15,350 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-09 08:45:15,350 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-09 08:45:15,350 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-09 08:45:15,351 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-09 08:45:15,351 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-09 08:45:15,353 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-11-09 08:45:15,353 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX 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 -> 89950477a2818e2be847e3014c0e2f9e906834037b4e328723302699ed4d9564 [2021-11-09 08:45:15,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-09 08:45:15,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-09 08:45:15,743 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-09 08:45:15,745 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-09 08:45:15,746 INFO L275 PluginConnector]: CDTParser initialized [2021-11-09 08:45:15,747 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/../../sv-benchmarks/c/product-lines/elevator_spec13_product24.cil.c [2021-11-09 08:45:15,833 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/data/49e5f2679/a4bbcbee4f6d48639f756aca49f8be18/FLAG17bbf0be8 [2021-11-09 08:45:16,639 INFO L306 CDTParser]: Found 1 translation units. [2021-11-09 08:45:16,640 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/sv-benchmarks/c/product-lines/elevator_spec13_product24.cil.c [2021-11-09 08:45:16,667 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/data/49e5f2679/a4bbcbee4f6d48639f756aca49f8be18/FLAG17bbf0be8 [2021-11-09 08:45:16,714 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/data/49e5f2679/a4bbcbee4f6d48639f756aca49f8be18 [2021-11-09 08:45:16,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-09 08:45:16,720 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-09 08:45:16,726 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-09 08:45:16,726 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-09 08:45:16,731 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-09 08:45:16,732 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:45:16" (1/1) ... [2021-11-09 08:45:16,735 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@783c32c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:45:16, skipping insertion in model container [2021-11-09 08:45:16,736 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:45:16" (1/1) ... [2021-11-09 08:45:16,745 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-09 08:45:16,876 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-09 08:45:17,618 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/sv-benchmarks/c/product-lines/elevator_spec13_product24.cil.c[51490,51503] [2021-11-09 08:45:17,678 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 08:45:17,693 INFO L203 MainTranslator]: Completed pre-run [2021-11-09 08:45:17,834 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/sv-benchmarks/c/product-lines/elevator_spec13_product24.cil.c[51490,51503] [2021-11-09 08:45:17,859 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 08:45:17,910 INFO L208 MainTranslator]: Completed translation [2021-11-09 08:45:17,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:45:17 WrapperNode [2021-11-09 08:45:17,911 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-09 08:45:17,913 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-09 08:45:17,914 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-09 08:45:17,914 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-09 08:45:17,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:45:17" (1/1) ... [2021-11-09 08:45:18,007 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:45:17" (1/1) ... [2021-11-09 08:45:19,628 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-09 08:45:19,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-09 08:45:19,629 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-09 08:45:19,630 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-09 08:45:19,661 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:45:17" (1/1) ... [2021-11-09 08:45:19,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:45:17" (1/1) ... [2021-11-09 08:45:19,931 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:45:17" (1/1) ... [2021-11-09 08:45:19,931 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:45:17" (1/1) ... [2021-11-09 08:45:20,601 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:45:17" (1/1) ... [2021-11-09 08:45:21,474 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:45:17" (1/1) ... [2021-11-09 08:45:21,594 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:45:17" (1/1) ... [2021-11-09 08:45:21,960 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-09 08:45:21,961 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-09 08:45:21,962 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-09 08:45:21,962 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-09 08:45:21,978 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:45:17" (1/1) ... [2021-11-09 08:45:21,996 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 08:45:22,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 08:45:22,067 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 08:45:22,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-11-09 08:45:22,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-09 08:45:22,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-09 08:45:22,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-09 08:45:22,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-09 08:45:51,388 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-09 08:45:51,389 INFO L299 CfgBuilder]: Removed 3931 assume(true) statements. [2021-11-09 08:45:51,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:45:51 BoogieIcfgContainer [2021-11-09 08:45:51,411 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-09 08:45:51,413 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-11-09 08:45:51,413 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-11-09 08:45:51,417 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-11-09 08:45:51,418 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-09 08:45:51,419 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 08:45:16" (1/3) ... [2021-11-09 08:45:51,420 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@737573f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 08:45:51, skipping insertion in model container [2021-11-09 08:45:51,421 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-09 08:45:51,421 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:45:17" (2/3) ... [2021-11-09 08:45:51,421 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@737573f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 08:45:51, skipping insertion in model container [2021-11-09 08:45:51,422 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-09 08:45:51,422 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:45:51" (3/3) ... [2021-11-09 08:45:51,424 INFO L389 chiAutomizerObserver]: Analyzing ICFG elevator_spec13_product24.cil.c [2021-11-09 08:45:51,501 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-11-09 08:45:51,502 INFO L360 BuchiCegarLoop]: Hoare is false [2021-11-09 08:45:51,502 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-11-09 08:45:51,502 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-11-09 08:45:51,502 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-11-09 08:45:51,502 INFO L364 BuchiCegarLoop]: Difference is false [2021-11-09 08:45:51,503 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-11-09 08:45:51,503 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-11-09 08:45:51,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17676 states, 17675 states have (on average 1.8907496463932107) internal successors, (33419), 17675 states have internal predecessors, (33419), 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-11-09 08:45:52,373 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4023 [2021-11-09 08:45:52,374 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 08:45:52,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 08:45:52,385 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] [2021-11-09 08:45:52,386 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:45:52,386 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-11-09 08:45:52,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17676 states, 17675 states have (on average 1.8907496463932107) internal successors, (33419), 17675 states have internal predecessors, (33419), 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-11-09 08:45:52,715 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4023 [2021-11-09 08:45:52,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 08:45:52,715 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 08:45:52,718 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] [2021-11-09 08:45:52,718 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:45:52,726 INFO L791 eck$LassoCheckResult]: Stem: 7122#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(30);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(9);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(21);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(30);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(9);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(21);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(30);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(9);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(25);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(30);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(9);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(25);call #t~string102.base, #t~string102.offset := #Ultimate.allocOnStack(10);call #t~string104.base, #t~string104.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string104.base, #t~string104.offset, 1);call write~init~int(95, #t~string104.base, 1 + #t~string104.offset, 1);call write~init~int(93, #t~string104.base, 2 + #t~string104.offset, 1);call write~init~int(0, #t~string104.base, 3 + #t~string104.offset, 1);call #t~string106.base, #t~string106.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string106.base, #t~string106.offset, 1);call write~init~int(93, #t~string106.base, 1 + #t~string106.offset, 1);call write~init~int(32, #t~string106.base, 2 + #t~string106.offset, 1);call write~init~int(0, #t~string106.base, 3 + #t~string106.offset, 1);call #t~string108.base, #t~string108.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string108.base, #t~string108.offset, 1);call write~init~int(97, #t~string108.base, 1 + #t~string108.offset, 1);call write~init~int(116, #t~string108.base, 2 + #t~string108.offset, 1);call write~init~int(32, #t~string108.base, 3 + #t~string108.offset, 1);call write~init~int(0, #t~string108.base, 4 + #t~string108.offset, 1);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string110.base, #t~string110.offset, 1);call write~init~int(105, #t~string110.base, 1 + #t~string110.offset, 1);call write~init~int(0, #t~string110.base, 2 + #t~string110.offset, 1);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(10);call #t~string114.base, #t~string114.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string114.base, #t~string114.offset, 1);call write~init~int(112, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 2 + #t~string114.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string116.base, #t~string116.offset, 1);call write~init~int(111, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(119, #t~string116.base, 2 + #t~string116.offset, 1);call write~init~int(110, #t~string116.base, 3 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 4 + #t~string116.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string118.base, #t~string118.offset, 1);call write~init~int(73, #t~string118.base, 1 + #t~string118.offset, 1);call write~init~int(76, #t~string118.base, 2 + #t~string118.offset, 1);call write~init~int(95, #t~string118.base, 3 + #t~string118.offset, 1);call write~init~int(112, #t~string118.base, 4 + #t~string118.offset, 1);call write~init~int(58, #t~string118.base, 5 + #t~string118.offset, 1);call write~init~int(0, #t~string118.base, 6 + #t~string118.offset, 1);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string120.base, #t~string120.offset, 1);call write~init~int(37, #t~string120.base, 1 + #t~string120.offset, 1);call write~init~int(105, #t~string120.base, 2 + #t~string120.offset, 1);call write~init~int(0, #t~string120.base, 3 + #t~string120.offset, 1);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string122.base, #t~string122.offset, 1);call write~init~int(37, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(105, #t~string122.base, 2 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 3 + #t~string122.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string124.base, #t~string124.offset, 1);call write~init~int(37, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(105, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 3 + #t~string124.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string126.base, #t~string126.offset, 1);call write~init~int(37, #t~string126.base, 1 + #t~string126.offset, 1);call write~init~int(105, #t~string126.base, 2 + #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 3 + #t~string126.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(37, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(105, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string130.base, #t~string130.offset, 1);call write~init~int(70, #t~string130.base, 1 + #t~string130.offset, 1);call write~init~int(95, #t~string130.base, 2 + #t~string130.offset, 1);call write~init~int(112, #t~string130.base, 3 + #t~string130.offset, 1);call write~init~int(58, #t~string130.base, 4 + #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 5 + #t~string130.offset, 1);call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string133.base, #t~string133.offset, 1);call write~init~int(37, #t~string133.base, 1 + #t~string133.offset, 1);call write~init~int(105, #t~string133.base, 2 + #t~string133.offset, 1);call write~init~int(0, #t~string133.base, 3 + #t~string133.offset, 1);call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string136.base, #t~string136.offset, 1);call write~init~int(37, #t~string136.base, 1 + #t~string136.offset, 1);call write~init~int(105, #t~string136.base, 2 + #t~string136.offset, 1);call write~init~int(0, #t~string136.base, 3 + #t~string136.offset, 1);call #t~string139.base, #t~string139.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string139.base, #t~string139.offset, 1);call write~init~int(37, #t~string139.base, 1 + #t~string139.offset, 1);call write~init~int(105, #t~string139.base, 2 + #t~string139.offset, 1);call write~init~int(0, #t~string139.base, 3 + #t~string139.offset, 1);call #t~string142.base, #t~string142.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string142.base, #t~string142.offset, 1);call write~init~int(37, #t~string142.base, 1 + #t~string142.offset, 1);call write~init~int(105, #t~string142.base, 2 + #t~string142.offset, 1);call write~init~int(0, #t~string142.base, 3 + #t~string142.offset, 1);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string145.base, #t~string145.offset, 1);call write~init~int(37, #t~string145.base, 1 + #t~string145.offset, 1);call write~init~int(105, #t~string145.base, 2 + #t~string145.offset, 1);call write~init~int(0, #t~string145.base, 3 + #t~string145.offset, 1);call #t~string147.base, #t~string147.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string147.base, #t~string147.offset, 1);call write~init~int(0, #t~string147.base, 1 + #t~string147.offset, 1);call #t~string150.base, #t~string150.offset := #Ultimate.allocOnStack(9);~head~0.base, ~head~0.offset := 0, 0;~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;~cleanupTimeShifts~0 := 12;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~prevDir~0 := 0; 4261#L-1true havoc main_#res;havoc main_#t~ret166, main_~retValue_acc~23, main_~tmp~27;havoc main_~retValue_acc~23;havoc main_~tmp~27; 1342#L3440true havoc valid_product_#res;havoc valid_product_~retValue_acc~31;havoc valid_product_~retValue_acc~31;valid_product_~retValue_acc~31 := 1;valid_product_#res := valid_product_~retValue_acc~31; 2893#L3448true main_#t~ret166 := valid_product_#res;main_~tmp~27 := main_#t~ret166;havoc main_#t~ret166; 16833#L2436true assume 0 != main_~tmp~27; 15533#L2410true havoc aliceCall_#t~ret155, aliceCall_~tmp~20;havoc aliceCall_~tmp~20;getOrigin_#in~person := 1;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~28;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~28; 10753#L3343true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~28 := 4;getOrigin_#res := getOrigin_~retValue_acc~28; 1358#L3368true aliceCall_#t~ret155 := getOrigin_#res;aliceCall_~tmp~20 := aliceCall_#t~ret155;havoc aliceCall_#t~ret155;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 1, aliceCall_~tmp~20;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 10752#L2903true assume 0 == initPersonOnFloor_~floor; 4979#L2904true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 11999#L3011-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 4349#L2695true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 7985#L2707-2true havoc angelinaCall_#t~ret156, angelinaCall_~tmp~21;havoc angelinaCall_~tmp~21;getOrigin_#in~person := 2;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~28;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~28; 17268#L3343-1true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~28 := 4;getOrigin_#res := getOrigin_~retValue_acc~28; 4100#L3368-1true angelinaCall_#t~ret156 := getOrigin_#res;angelinaCall_~tmp~21 := angelinaCall_#t~ret156;havoc angelinaCall_#t~ret156;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 2, angelinaCall_~tmp~21;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 4570#L2903-1true assume 0 == initPersonOnFloor_~floor; 1134#L2904-2true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 2933#L3011-3true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 11359#L2695-2true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 17605#L2707-5true havoc timeShift_#t~ret101, timeShift_~tmp~16;havoc timeShift_~tmp~16;havoc __utac_acc__Specification13_spec__1_#t~ret173;havoc getCurrentHeading_#res;havoc getCurrentHeading_~retValue_acc~7;havoc getCurrentHeading_~retValue_acc~7;getCurrentHeading_~retValue_acc~7 := ~currentHeading~0;getCurrentHeading_#res := getCurrentHeading_~retValue_acc~7; 6734#L732true __utac_acc__Specification13_spec__1_#t~ret173 := getCurrentHeading_#res;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret173;havoc __utac_acc__Specification13_spec__1_#t~ret173; 4896#L3219true havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 10633#L689true timeShift_#t~ret101 := areDoorsOpen_#res;timeShift_~tmp~16 := timeShift_#t~ret101;havoc timeShift_#t~ret101; 16751#L1702true assume 0 != timeShift_~tmp~16; 8401#L1703true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 7854#L1345-11true havoc __utac_acc__Specification13_spec__2_#t~ret174, __utac_acc__Specification13_spec__2_#t~ret175, __utac_acc__Specification13_spec__2_#t~ret176, __utac_acc__Specification13_spec__2_#t~ret177, __utac_acc__Specification13_spec__2_#t~ret178, __utac_acc__Specification13_spec__2_#t~ret179, __utac_acc__Specification13_spec__2_~tmp~30, __utac_acc__Specification13_spec__2_~tmp___0~13, __utac_acc__Specification13_spec__2_~tmp___1~8, __utac_acc__Specification13_spec__2_~tmp___2~6, __utac_acc__Specification13_spec__2_~tmp___3~5, __utac_acc__Specification13_spec__2_~tmp___4~3, __utac_acc__Specification13_spec__2_~__cil_tmp7~7, __utac_acc__Specification13_spec__2_~__cil_tmp8~8;havoc __utac_acc__Specification13_spec__2_~tmp~30;havoc __utac_acc__Specification13_spec__2_~tmp___0~13;havoc __utac_acc__Specification13_spec__2_~tmp___1~8;havoc __utac_acc__Specification13_spec__2_~tmp___2~6;havoc __utac_acc__Specification13_spec__2_~tmp___3~5;havoc __utac_acc__Specification13_spec__2_~tmp___4~3;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~7;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~8;__utac_acc__Specification13_spec__2_~__cil_tmp7~7 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~8 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~7 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~7 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~7 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~7 / 3); 1545#L3236true assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~8; 7652#L3237true assume 1 == ~prevDir~0;existInLiftCallsInDirection_#in~d := 0;havoc existInLiftCallsInDirection_#res;havoc existInLiftCallsInDirection_~d, existInLiftCallsInDirection_~retValue_acc~19, existInLiftCallsInDirection_~i~0, existInLiftCallsInDirection_~i___0~0;existInLiftCallsInDirection_~d := existInLiftCallsInDirection_#in~d;havoc existInLiftCallsInDirection_~retValue_acc~19;havoc existInLiftCallsInDirection_~i~0;havoc existInLiftCallsInDirection_~i___0~0; 17085#L1922true assume 1 == existInLiftCallsInDirection_~d;existInLiftCallsInDirection_~i~0 := 0;existInLiftCallsInDirection_~i~0 := 1 + ~currentFloorID~0; 13477#L1926-2true [2021-11-09 08:45:52,726 INFO L793 eck$LassoCheckResult]: Loop: 13477#L1926-2true assume !false; 16955#L1927true assume existInLiftCallsInDirection_~i~0 < 5; 17294#L1928true assume !(0 == existInLiftCallsInDirection_~i~0); 6069#L1941true assume !(1 == existInLiftCallsInDirection_~i~0); 17120#L1950true assume !(2 == existInLiftCallsInDirection_~i~0); 11131#L1959true assume !(3 == existInLiftCallsInDirection_~i~0); 54#L1968true assume !(4 == existInLiftCallsInDirection_~i~0); 12921#L1969-1true existInLiftCallsInDirection_~i~0 := 1 + existInLiftCallsInDirection_~i~0; 13477#L1926-2true [2021-11-09 08:45:52,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:45:52,733 INFO L85 PathProgramCache]: Analyzing trace with hash -553743226, now seen corresponding path program 1 times [2021-11-09 08:45:52,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:45:52,745 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951095269] [2021-11-09 08:45:52,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:45:52,746 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:45:52,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:45:53,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:45:53,214 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:45:53,215 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951095269] [2021-11-09 08:45:53,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951095269] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:45:53,217 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:45:53,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 08:45:53,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966800925] [2021-11-09 08:45:53,248 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 08:45:53,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:45:53,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1388460285, now seen corresponding path program 1 times [2021-11-09 08:45:53,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:45:53,250 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434006748] [2021-11-09 08:45:53,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:45:53,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:45:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 08:45:53,277 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 08:45:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 08:45:53,333 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 08:45:53,411 INFO L210 LassoAnalysis]: Preferences: [2021-11-09 08:45:53,411 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-09 08:45:53,411 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-09 08:45:53,412 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-09 08:45:53,412 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-11-09 08:45:53,412 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 08:45:53,412 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-09 08:45:53,412 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-09 08:45:53,413 INFO L133 ssoRankerPreferences]: Filename of dumped script: elevator_spec13_product24.cil.c_Iteration1_Loop [2021-11-09 08:45:53,413 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-09 08:45:53,413 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-09 08:45:53,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-09 08:45:53,513 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-09 08:45:53,514 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-11-09 08:45:53,647 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 08:45:53,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 08:45:53,659 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 08:45:53,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-11-09 08:45:53,674 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-09 08:45:53,674 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-09 08:45:53,754 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-11-09 08:45:53,754 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 08:45:53,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 08:45:53,757 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 08:45:53,767 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-11-09 08:45:53,768 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-09 08:45:53,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-11-09 08:45:53,850 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-11-09 08:45:53,857 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-11-09 08:45:53,858 INFO L210 LassoAnalysis]: Preferences: [2021-11-09 08:45:53,859 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-09 08:45:53,859 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-09 08:45:53,859 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-09 08:45:53,859 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-09 08:45:53,859 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 08:45:53,860 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-09 08:45:53,860 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-09 08:45:53,860 INFO L133 ssoRankerPreferences]: Filename of dumped script: elevator_spec13_product24.cil.c_Iteration1_Loop [2021-11-09 08:45:53,860 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-09 08:45:53,860 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-09 08:45:53,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-09 08:45:53,949 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-09 08:45:53,955 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-09 08:45:53,956 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 08:45:53,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 08:45:53,958 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 08:45:53,970 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-11-09 08:45:53,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 08:45:53,983 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-09 08:45:53,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 08:45:53,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 08:45:53,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 08:45:53,988 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-09 08:45:53,989 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-09 08:45:53,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-11-09 08:45:54,013 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-09 08:45:54,059 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-11-09 08:45:54,060 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-11-09 08:45:54,062 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 08:45:54,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 08:45:54,101 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 08:45:54,170 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-09 08:45:54,170 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-11-09 08:45:54,171 INFO L513 LassoAnalysis]: Proved termination. [2021-11-09 08:45:54,171 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_existInLiftCallsInDirection_~i~0) = -1*ULTIMATE.start_existInLiftCallsInDirection_~i~0 Supporting invariants [] [2021-11-09 08:45:54,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-11-09 08:45:54,245 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-11-09 08:45:54,248 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-11-09 08:45:54,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:45:54,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:45:54,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-09 08:45:54,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 08:45:54,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:45:54,666 WARN L261 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-09 08:45:54,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 08:45:54,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:45:55,008 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-11-09 08:45:55,049 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 17676 states, 17675 states have (on average 1.8907496463932107) internal successors, (33419), 17675 states have internal predecessors, (33419), 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.111111111111111) internal successors, (37), 9 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-11-09 08:45:56,395 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-11-09 08:46:07,340 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 17676 states, 17675 states have (on average 1.8907496463932107) internal successors, (33419), 17675 states have internal predecessors, (33419), 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.111111111111111) internal successors, (37), 9 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) Result 208046 states and 393183 transitions. Complement of second has 18 states. [2021-11-09 08:46:07,341 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-11-09 08:46:07,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 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-11-09 08:46:07,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 213316 transitions. [2021-11-09 08:46:07,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 213316 transitions. Stem has 29 letters. Loop has 8 letters. [2021-11-09 08:46:07,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-09 08:46:07,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 213316 transitions. Stem has 37 letters. Loop has 8 letters. [2021-11-09 08:46:07,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-09 08:46:07,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 213316 transitions. Stem has 29 letters. Loop has 16 letters. [2021-11-09 08:46:07,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-09 08:46:07,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 208046 states and 393183 transitions. [2021-11-09 08:46:10,352 INFO L131 ngComponentsAnalysis]: Automaton has 66 accepting balls. 28350 [2021-11-09 08:46:11,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 208046 states to 112779 states and 213064 transitions. [2021-11-09 08:46:11,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 112749 [2021-11-09 08:46:12,051 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 112750 [2021-11-09 08:46:12,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112779 states and 213064 transitions. [2021-11-09 08:46:12,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-09 08:46:12,055 INFO L681 BuchiCegarLoop]: Abstraction has 112779 states and 213064 transitions. [2021-11-09 08:46:12,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112779 states and 213064 transitions. [2021-11-09 08:46:13,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112779 to 31802. [2021-11-09 08:46:13,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31802 states, 31802 states have (on average 1.8863907930318848) internal successors, (59991), 31801 states have internal predecessors, (59991), 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-11-09 08:46:13,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31802 states to 31802 states and 59991 transitions. [2021-11-09 08:46:13,821 INFO L704 BuchiCegarLoop]: Abstraction has 31802 states and 59991 transitions. [2021-11-09 08:46:13,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:46:13,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 08:46:13,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-09 08:46:13,830 INFO L87 Difference]: Start difference. First operand 31802 states and 59991 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-11-09 08:46:15,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 08:46:15,592 INFO L93 Difference]: Finished difference Result 45958 states and 86532 transitions. [2021-11-09 08:46:15,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 08:46:15,593 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45958 states and 86532 transitions. [2021-11-09 08:46:15,879 INFO L131 ngComponentsAnalysis]: Automaton has 78 accepting balls. 15278 [2021-11-09 08:46:16,134 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45958 states to 45945 states and 86519 transitions. [2021-11-09 08:46:16,135 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45926 [2021-11-09 08:46:16,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45926 [2021-11-09 08:46:16,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45945 states and 86519 transitions. [2021-11-09 08:46:16,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-09 08:46:16,304 INFO L681 BuchiCegarLoop]: Abstraction has 45945 states and 86519 transitions. [2021-11-09 08:46:16,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45945 states and 86519 transitions. [2021-11-09 08:46:17,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45945 to 17686. [2021-11-09 08:46:17,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17686 states, 17686 states have (on average 1.8831844396697954) internal successors, (33306), 17685 states have internal predecessors, (33306), 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-11-09 08:46:17,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17686 states to 17686 states and 33306 transitions. [2021-11-09 08:46:17,467 INFO L704 BuchiCegarLoop]: Abstraction has 17686 states and 33306 transitions. [2021-11-09 08:46:17,467 INFO L587 BuchiCegarLoop]: Abstraction has 17686 states and 33306 transitions. [2021-11-09 08:46:17,467 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-11-09 08:46:17,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17686 states and 33306 transitions. [2021-11-09 08:46:17,553 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4025 [2021-11-09 08:46:17,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 08:46:17,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 08:46:17,555 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] [2021-11-09 08:46:17,556 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 08:46:17,556 INFO L791 eck$LassoCheckResult]: Stem: 315906#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(30);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(9);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(21);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(30);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(9);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(21);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(30);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(9);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(25);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(30);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(9);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(25);call #t~string102.base, #t~string102.offset := #Ultimate.allocOnStack(10);call #t~string104.base, #t~string104.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string104.base, #t~string104.offset, 1);call write~init~int(95, #t~string104.base, 1 + #t~string104.offset, 1);call write~init~int(93, #t~string104.base, 2 + #t~string104.offset, 1);call write~init~int(0, #t~string104.base, 3 + #t~string104.offset, 1);call #t~string106.base, #t~string106.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string106.base, #t~string106.offset, 1);call write~init~int(93, #t~string106.base, 1 + #t~string106.offset, 1);call write~init~int(32, #t~string106.base, 2 + #t~string106.offset, 1);call write~init~int(0, #t~string106.base, 3 + #t~string106.offset, 1);call #t~string108.base, #t~string108.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string108.base, #t~string108.offset, 1);call write~init~int(97, #t~string108.base, 1 + #t~string108.offset, 1);call write~init~int(116, #t~string108.base, 2 + #t~string108.offset, 1);call write~init~int(32, #t~string108.base, 3 + #t~string108.offset, 1);call write~init~int(0, #t~string108.base, 4 + #t~string108.offset, 1);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string110.base, #t~string110.offset, 1);call write~init~int(105, #t~string110.base, 1 + #t~string110.offset, 1);call write~init~int(0, #t~string110.base, 2 + #t~string110.offset, 1);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(10);call #t~string114.base, #t~string114.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string114.base, #t~string114.offset, 1);call write~init~int(112, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 2 + #t~string114.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string116.base, #t~string116.offset, 1);call write~init~int(111, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(119, #t~string116.base, 2 + #t~string116.offset, 1);call write~init~int(110, #t~string116.base, 3 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 4 + #t~string116.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string118.base, #t~string118.offset, 1);call write~init~int(73, #t~string118.base, 1 + #t~string118.offset, 1);call write~init~int(76, #t~string118.base, 2 + #t~string118.offset, 1);call write~init~int(95, #t~string118.base, 3 + #t~string118.offset, 1);call write~init~int(112, #t~string118.base, 4 + #t~string118.offset, 1);call write~init~int(58, #t~string118.base, 5 + #t~string118.offset, 1);call write~init~int(0, #t~string118.base, 6 + #t~string118.offset, 1);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string120.base, #t~string120.offset, 1);call write~init~int(37, #t~string120.base, 1 + #t~string120.offset, 1);call write~init~int(105, #t~string120.base, 2 + #t~string120.offset, 1);call write~init~int(0, #t~string120.base, 3 + #t~string120.offset, 1);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string122.base, #t~string122.offset, 1);call write~init~int(37, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(105, #t~string122.base, 2 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 3 + #t~string122.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string124.base, #t~string124.offset, 1);call write~init~int(37, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(105, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 3 + #t~string124.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string126.base, #t~string126.offset, 1);call write~init~int(37, #t~string126.base, 1 + #t~string126.offset, 1);call write~init~int(105, #t~string126.base, 2 + #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 3 + #t~string126.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(37, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(105, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string130.base, #t~string130.offset, 1);call write~init~int(70, #t~string130.base, 1 + #t~string130.offset, 1);call write~init~int(95, #t~string130.base, 2 + #t~string130.offset, 1);call write~init~int(112, #t~string130.base, 3 + #t~string130.offset, 1);call write~init~int(58, #t~string130.base, 4 + #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 5 + #t~string130.offset, 1);call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string133.base, #t~string133.offset, 1);call write~init~int(37, #t~string133.base, 1 + #t~string133.offset, 1);call write~init~int(105, #t~string133.base, 2 + #t~string133.offset, 1);call write~init~int(0, #t~string133.base, 3 + #t~string133.offset, 1);call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string136.base, #t~string136.offset, 1);call write~init~int(37, #t~string136.base, 1 + #t~string136.offset, 1);call write~init~int(105, #t~string136.base, 2 + #t~string136.offset, 1);call write~init~int(0, #t~string136.base, 3 + #t~string136.offset, 1);call #t~string139.base, #t~string139.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string139.base, #t~string139.offset, 1);call write~init~int(37, #t~string139.base, 1 + #t~string139.offset, 1);call write~init~int(105, #t~string139.base, 2 + #t~string139.offset, 1);call write~init~int(0, #t~string139.base, 3 + #t~string139.offset, 1);call #t~string142.base, #t~string142.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string142.base, #t~string142.offset, 1);call write~init~int(37, #t~string142.base, 1 + #t~string142.offset, 1);call write~init~int(105, #t~string142.base, 2 + #t~string142.offset, 1);call write~init~int(0, #t~string142.base, 3 + #t~string142.offset, 1);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string145.base, #t~string145.offset, 1);call write~init~int(37, #t~string145.base, 1 + #t~string145.offset, 1);call write~init~int(105, #t~string145.base, 2 + #t~string145.offset, 1);call write~init~int(0, #t~string145.base, 3 + #t~string145.offset, 1);call #t~string147.base, #t~string147.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string147.base, #t~string147.offset, 1);call write~init~int(0, #t~string147.base, 1 + #t~string147.offset, 1);call #t~string150.base, #t~string150.offset := #Ultimate.allocOnStack(9);~head~0.base, ~head~0.offset := 0, 0;~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;~cleanupTimeShifts~0 := 12;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~prevDir~0 := 0; 312045#L-1 havoc main_#res;havoc main_#t~ret166, main_~retValue_acc~23, main_~tmp~27;havoc main_~retValue_acc~23;havoc main_~tmp~27; 306834#L3440 havoc valid_product_#res;havoc valid_product_~retValue_acc~31;havoc valid_product_~retValue_acc~31;valid_product_~retValue_acc~31 := 1;valid_product_#res := valid_product_~retValue_acc~31; 306835#L3448 main_#t~ret166 := valid_product_#res;main_~tmp~27 := main_#t~ret166;havoc main_#t~ret166; 309776#L2436 assume 0 != main_~tmp~27; 321108#L2410 havoc aliceCall_#t~ret155, aliceCall_~tmp~20;havoc aliceCall_~tmp~20;getOrigin_#in~person := 1;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~28;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~28; 319022#L3343 assume !(0 == getOrigin_~person); 319023#L3347 assume 1 == getOrigin_~person;getOrigin_~retValue_acc~28 := 3;getOrigin_#res := getOrigin_~retValue_acc~28; 306870#L3368 aliceCall_#t~ret155 := getOrigin_#res;aliceCall_~tmp~20 := aliceCall_#t~ret155;havoc aliceCall_#t~ret155;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 1, aliceCall_~tmp~20;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 306871#L2903 assume 0 == initPersonOnFloor_~floor; 313076#L2904 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 306396#L3011-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 312170#L2695 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 311115#L2707-2 havoc angelinaCall_#t~ret156, angelinaCall_~tmp~21;havoc angelinaCall_~tmp~21;getOrigin_#in~person := 2;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~28;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~28; 316815#L3343-1 assume !(0 == getOrigin_~person); 321316#L3347-1 assume 1 == getOrigin_~person;getOrigin_~retValue_acc~28 := 3;getOrigin_#res := getOrigin_~retValue_acc~28; 306522#L3368-1 angelinaCall_#t~ret156 := getOrigin_#res;angelinaCall_~tmp~21 := angelinaCall_#t~ret156;havoc angelinaCall_#t~ret156;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 2, angelinaCall_~tmp~21;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 311808#L2903-1 assume 0 == initPersonOnFloor_~floor; 306398#L2904-2 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 303685#L3011-3 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 309845#L2695-2 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 317334#L2707-5 havoc timeShift_#t~ret101, timeShift_~tmp~16;havoc timeShift_~tmp~16;havoc __utac_acc__Specification13_spec__1_#t~ret173;havoc getCurrentHeading_#res;havoc getCurrentHeading_~retValue_acc~7;havoc getCurrentHeading_~retValue_acc~7;getCurrentHeading_~retValue_acc~7 := ~currentHeading~0;getCurrentHeading_#res := getCurrentHeading_~retValue_acc~7; 315431#L732 __utac_acc__Specification13_spec__1_#t~ret173 := getCurrentHeading_#res;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret173;havoc __utac_acc__Specification13_spec__1_#t~ret173; 312963#L3219 havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 312964#L689 timeShift_#t~ret101 := areDoorsOpen_#res;timeShift_~tmp~16 := timeShift_#t~ret101;havoc timeShift_#t~ret101; 318935#L1702 assume 0 != timeShift_~tmp~16; 317180#L1703 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 304845#L1345-11 havoc __utac_acc__Specification13_spec__2_#t~ret174, __utac_acc__Specification13_spec__2_#t~ret175, __utac_acc__Specification13_spec__2_#t~ret176, __utac_acc__Specification13_spec__2_#t~ret177, __utac_acc__Specification13_spec__2_#t~ret178, __utac_acc__Specification13_spec__2_#t~ret179, __utac_acc__Specification13_spec__2_~tmp~30, __utac_acc__Specification13_spec__2_~tmp___0~13, __utac_acc__Specification13_spec__2_~tmp___1~8, __utac_acc__Specification13_spec__2_~tmp___2~6, __utac_acc__Specification13_spec__2_~tmp___3~5, __utac_acc__Specification13_spec__2_~tmp___4~3, __utac_acc__Specification13_spec__2_~__cil_tmp7~7, __utac_acc__Specification13_spec__2_~__cil_tmp8~8;havoc __utac_acc__Specification13_spec__2_~tmp~30;havoc __utac_acc__Specification13_spec__2_~tmp___0~13;havoc __utac_acc__Specification13_spec__2_~tmp___1~8;havoc __utac_acc__Specification13_spec__2_~tmp___2~6;havoc __utac_acc__Specification13_spec__2_~tmp___3~5;havoc __utac_acc__Specification13_spec__2_~tmp___4~3;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~7;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~8;__utac_acc__Specification13_spec__2_~__cil_tmp7~7 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~8 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~7 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~7 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~7 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~7 / 3); 307256#L3236 assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~8; 307257#L3237 assume !(1 == ~prevDir~0); 306162#L3263 assume 0 == ~prevDir~0;existInLiftCallsInDirection_#in~d := 1;havoc existInLiftCallsInDirection_#res;havoc existInLiftCallsInDirection_~d, existInLiftCallsInDirection_~retValue_acc~19, existInLiftCallsInDirection_~i~0, existInLiftCallsInDirection_~i___0~0;existInLiftCallsInDirection_~d := existInLiftCallsInDirection_#in~d;havoc existInLiftCallsInDirection_~retValue_acc~19;havoc existInLiftCallsInDirection_~i~0;havoc existInLiftCallsInDirection_~i___0~0; 306164#L1922-2 assume 1 == existInLiftCallsInDirection_~d;existInLiftCallsInDirection_~i~0 := 0;existInLiftCallsInDirection_~i~0 := 1 + ~currentFloorID~0; 317587#L1926-8 [2021-11-09 08:46:17,558 INFO L793 eck$LassoCheckResult]: Loop: 317587#L1926-8 assume !false; 318589#L1927-2 assume existInLiftCallsInDirection_~i~0 < 5; 305534#L1928-2 assume !(0 == existInLiftCallsInDirection_~i~0); 305535#L1941-2 assume !(1 == existInLiftCallsInDirection_~i~0); 315871#L1950-2 assume !(2 == existInLiftCallsInDirection_~i~0); 315873#L1959-2 assume !(3 == existInLiftCallsInDirection_~i~0); 314578#L1968-2 assume !(4 == existInLiftCallsInDirection_~i~0); 313351#L1969-5 existInLiftCallsInDirection_~i~0 := 1 + existInLiftCallsInDirection_~i~0; 317587#L1926-8 [2021-11-09 08:46:17,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:46:17,559 INFO L85 PathProgramCache]: Analyzing trace with hash -534036671, now seen corresponding path program 1 times [2021-11-09 08:46:17,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:46:17,560 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412593315] [2021-11-09 08:46:17,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:46:17,561 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:46:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:46:17,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-11-09 08:46:17,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:46:17,783 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412593315] [2021-11-09 08:46:17,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412593315] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:46:17,784 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:46:17,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 08:46:17,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972427964] [2021-11-09 08:46:17,785 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 08:46:17,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:46:17,786 INFO L85 PathProgramCache]: Analyzing trace with hash 805801853, now seen corresponding path program 1 times [2021-11-09 08:46:17,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:46:17,786 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129407417] [2021-11-09 08:46:17,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:46:17,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:46:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 08:46:17,800 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 08:46:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 08:46:17,821 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 08:46:17,886 INFO L210 LassoAnalysis]: Preferences: [2021-11-09 08:46:17,886 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-09 08:46:17,886 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-09 08:46:17,886 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-09 08:46:17,887 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-11-09 08:46:17,887 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 08:46:17,887 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-09 08:46:17,887 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-09 08:46:17,887 INFO L133 ssoRankerPreferences]: Filename of dumped script: elevator_spec13_product24.cil.c_Iteration2_Loop [2021-11-09 08:46:17,888 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-09 08:46:17,888 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-09 08:46:17,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-09 08:46:17,966 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-09 08:46:17,966 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-11-09 08:46:17,966 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 08:46:17,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 08:46:17,967 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 08:46:17,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-11-09 08:46:17,973 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-09 08:46:17,973 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-09 08:46:18,042 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-11-09 08:46:18,047 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 08:46:18,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 08:46:18,054 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 08:46:18,060 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-11-09 08:46:18,060 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-09 08:46:18,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-11-09 08:46:18,136 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-11-09 08:46:18,144 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-11-09 08:46:18,145 INFO L210 LassoAnalysis]: Preferences: [2021-11-09 08:46:18,145 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-09 08:46:18,145 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-09 08:46:18,145 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-09 08:46:18,145 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-09 08:46:18,145 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 08:46:18,146 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-09 08:46:18,146 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-09 08:46:18,146 INFO L133 ssoRankerPreferences]: Filename of dumped script: elevator_spec13_product24.cil.c_Iteration2_Loop [2021-11-09 08:46:18,146 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-09 08:46:18,146 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-09 08:46:18,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-09 08:46:18,217 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-09 08:46:18,217 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-09 08:46:18,217 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 08:46:18,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 08:46:18,219 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 08:46:18,225 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-11-09 08:46:18,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 08:46:18,237 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-09 08:46:18,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 08:46:18,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 08:46:18,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 08:46:18,239 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-09 08:46:18,239 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-09 08:46:18,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-11-09 08:46:18,248 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-09 08:46:18,251 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2021-11-09 08:46:18,251 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-11-09 08:46:18,251 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 08:46:18,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 08:46:18,253 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 08:46:18,259 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-09 08:46:18,259 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-11-09 08:46:18,260 INFO L513 LassoAnalysis]: Proved termination. [2021-11-09 08:46:18,260 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_existInLiftCallsInDirection_~i~0) = -1*ULTIMATE.start_existInLiftCallsInDirection_~i~0 Supporting invariants [] [2021-11-09 08:46:18,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-11-09 08:46:18,310 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-11-09 08:46:18,310 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-11-09 08:46:18,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:46:18,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:46:18,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-09 08:46:18,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 08:46:18,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:46:18,604 WARN L261 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-09 08:46:18,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 08:46:18,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:46:18,884 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-11-09 08:46:18,884 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17686 states and 33306 transitions. cyclomatic complexity: 15654 Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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-11-09 08:46:20,377 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a28086a-2ec2-4fc1-b890-cc82abf3947b/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2021-11-09 08:46:27,763 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17686 states and 33306 transitions. cyclomatic complexity: 15654. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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 193754 states and 365976 transitions. Complement of second has 17 states. [2021-11-09 08:46:27,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2021-11-09 08:46:27,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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-11-09 08:46:27,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 186283 transitions. [2021-11-09 08:46:27,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 186283 transitions. Stem has 32 letters. Loop has 8 letters. [2021-11-09 08:46:27,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-09 08:46:27,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 186283 transitions. Stem has 40 letters. Loop has 8 letters. [2021-11-09 08:46:27,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-09 08:46:27,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 186283 transitions. Stem has 32 letters. Loop has 16 letters. [2021-11-09 08:46:27,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-09 08:46:27,970 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 193754 states and 365976 transitions. [2021-11-09 08:46:29,072 INFO L131 ngComponentsAnalysis]: Automaton has 66 accepting balls. 28352 [2021-11-09 08:46:29,963 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 193754 states to 112794 states and 212980 transitions. [2021-11-09 08:46:29,963 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 112745 [2021-11-09 08:46:30,121 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 112746 [2021-11-09 08:46:30,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112794 states and 212980 transitions. [2021-11-09 08:46:30,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-09 08:46:30,122 INFO L681 BuchiCegarLoop]: Abstraction has 112794 states and 212980 transitions. [2021-11-09 08:46:30,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112794 states and 212980 transitions. [2021-11-09 08:46:31,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112794 to 17710. [2021-11-09 08:46:31,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17710 states, 17710 states have (on average 1.8827780914737438) internal successors, (33344), 17709 states have internal predecessors, (33344), 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-11-09 08:46:31,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17710 states to 17710 states and 33344 transitions. [2021-11-09 08:46:31,966 INFO L704 BuchiCegarLoop]: Abstraction has 17710 states and 33344 transitions. [2021-11-09 08:46:31,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:46:31,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 08:46:31,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 08:46:31,968 INFO L87 Difference]: Start difference. First operand 17710 states and 33344 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-11-09 08:46:33,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 08:46:33,918 INFO L93 Difference]: Finished difference Result 52915 states and 99604 transitions. [2021-11-09 08:46:33,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 08:46:33,919 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52915 states and 99604 transitions. [2021-11-09 08:46:34,214 INFO L131 ngComponentsAnalysis]: Automaton has 99 accepting balls. 12087 [2021-11-09 08:46:34,523 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52915 states to 52915 states and 99604 transitions. [2021-11-09 08:46:34,523 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52801 [2021-11-09 08:46:34,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52801 [2021-11-09 08:46:34,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52915 states and 99604 transitions. [2021-11-09 08:46:34,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-09 08:46:34,647 INFO L681 BuchiCegarLoop]: Abstraction has 52915 states and 99604 transitions. [2021-11-09 08:46:34,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52915 states and 99604 transitions. [2021-11-09 08:46:35,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52915 to 17725. [2021-11-09 08:46:35,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17725 states, 17725 states have (on average 1.882031029619182) internal successors, (33359), 17724 states have internal predecessors, (33359), 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-11-09 08:46:35,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17725 states to 17725 states and 33359 transitions. [2021-11-09 08:46:35,188 INFO L704 BuchiCegarLoop]: Abstraction has 17725 states and 33359 transitions. [2021-11-09 08:46:35,189 INFO L587 BuchiCegarLoop]: Abstraction has 17725 states and 33359 transitions. [2021-11-09 08:46:35,189 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-11-09 08:46:35,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17725 states and 33359 transitions. [2021-11-09 08:46:35,288 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4029 [2021-11-09 08:46:35,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 08:46:35,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 08:46:35,292 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-11-09 08:46:35,293 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-11-09 08:46:35,293 INFO L791 eck$LassoCheckResult]: Stem: 598149#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(30);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(9);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(21);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(30);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(9);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(21);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(30);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(9);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(25);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(30);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(9);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(25);call #t~string102.base, #t~string102.offset := #Ultimate.allocOnStack(10);call #t~string104.base, #t~string104.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string104.base, #t~string104.offset, 1);call write~init~int(95, #t~string104.base, 1 + #t~string104.offset, 1);call write~init~int(93, #t~string104.base, 2 + #t~string104.offset, 1);call write~init~int(0, #t~string104.base, 3 + #t~string104.offset, 1);call #t~string106.base, #t~string106.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string106.base, #t~string106.offset, 1);call write~init~int(93, #t~string106.base, 1 + #t~string106.offset, 1);call write~init~int(32, #t~string106.base, 2 + #t~string106.offset, 1);call write~init~int(0, #t~string106.base, 3 + #t~string106.offset, 1);call #t~string108.base, #t~string108.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string108.base, #t~string108.offset, 1);call write~init~int(97, #t~string108.base, 1 + #t~string108.offset, 1);call write~init~int(116, #t~string108.base, 2 + #t~string108.offset, 1);call write~init~int(32, #t~string108.base, 3 + #t~string108.offset, 1);call write~init~int(0, #t~string108.base, 4 + #t~string108.offset, 1);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string110.base, #t~string110.offset, 1);call write~init~int(105, #t~string110.base, 1 + #t~string110.offset, 1);call write~init~int(0, #t~string110.base, 2 + #t~string110.offset, 1);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(10);call #t~string114.base, #t~string114.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string114.base, #t~string114.offset, 1);call write~init~int(112, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 2 + #t~string114.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string116.base, #t~string116.offset, 1);call write~init~int(111, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(119, #t~string116.base, 2 + #t~string116.offset, 1);call write~init~int(110, #t~string116.base, 3 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 4 + #t~string116.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string118.base, #t~string118.offset, 1);call write~init~int(73, #t~string118.base, 1 + #t~string118.offset, 1);call write~init~int(76, #t~string118.base, 2 + #t~string118.offset, 1);call write~init~int(95, #t~string118.base, 3 + #t~string118.offset, 1);call write~init~int(112, #t~string118.base, 4 + #t~string118.offset, 1);call write~init~int(58, #t~string118.base, 5 + #t~string118.offset, 1);call write~init~int(0, #t~string118.base, 6 + #t~string118.offset, 1);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string120.base, #t~string120.offset, 1);call write~init~int(37, #t~string120.base, 1 + #t~string120.offset, 1);call write~init~int(105, #t~string120.base, 2 + #t~string120.offset, 1);call write~init~int(0, #t~string120.base, 3 + #t~string120.offset, 1);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string122.base, #t~string122.offset, 1);call write~init~int(37, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(105, #t~string122.base, 2 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 3 + #t~string122.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string124.base, #t~string124.offset, 1);call write~init~int(37, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(105, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 3 + #t~string124.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string126.base, #t~string126.offset, 1);call write~init~int(37, #t~string126.base, 1 + #t~string126.offset, 1);call write~init~int(105, #t~string126.base, 2 + #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 3 + #t~string126.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(37, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(105, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string130.base, #t~string130.offset, 1);call write~init~int(70, #t~string130.base, 1 + #t~string130.offset, 1);call write~init~int(95, #t~string130.base, 2 + #t~string130.offset, 1);call write~init~int(112, #t~string130.base, 3 + #t~string130.offset, 1);call write~init~int(58, #t~string130.base, 4 + #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 5 + #t~string130.offset, 1);call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string133.base, #t~string133.offset, 1);call write~init~int(37, #t~string133.base, 1 + #t~string133.offset, 1);call write~init~int(105, #t~string133.base, 2 + #t~string133.offset, 1);call write~init~int(0, #t~string133.base, 3 + #t~string133.offset, 1);call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string136.base, #t~string136.offset, 1);call write~init~int(37, #t~string136.base, 1 + #t~string136.offset, 1);call write~init~int(105, #t~string136.base, 2 + #t~string136.offset, 1);call write~init~int(0, #t~string136.base, 3 + #t~string136.offset, 1);call #t~string139.base, #t~string139.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string139.base, #t~string139.offset, 1);call write~init~int(37, #t~string139.base, 1 + #t~string139.offset, 1);call write~init~int(105, #t~string139.base, 2 + #t~string139.offset, 1);call write~init~int(0, #t~string139.base, 3 + #t~string139.offset, 1);call #t~string142.base, #t~string142.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string142.base, #t~string142.offset, 1);call write~init~int(37, #t~string142.base, 1 + #t~string142.offset, 1);call write~init~int(105, #t~string142.base, 2 + #t~string142.offset, 1);call write~init~int(0, #t~string142.base, 3 + #t~string142.offset, 1);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string145.base, #t~string145.offset, 1);call write~init~int(37, #t~string145.base, 1 + #t~string145.offset, 1);call write~init~int(105, #t~string145.base, 2 + #t~string145.offset, 1);call write~init~int(0, #t~string145.base, 3 + #t~string145.offset, 1);call #t~string147.base, #t~string147.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string147.base, #t~string147.offset, 1);call write~init~int(0, #t~string147.base, 1 + #t~string147.offset, 1);call #t~string150.base, #t~string150.offset := #Ultimate.allocOnStack(9);~head~0.base, ~head~0.offset := 0, 0;~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;~cleanupTimeShifts~0 := 12;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~prevDir~0 := 0; 594281#L-1 havoc main_#res;havoc main_#t~ret166, main_~retValue_acc~23, main_~tmp~27;havoc main_~retValue_acc~23;havoc main_~tmp~27; 589068#L3440 havoc valid_product_#res;havoc valid_product_~retValue_acc~31;havoc valid_product_~retValue_acc~31;valid_product_~retValue_acc~31 := 1;valid_product_#res := valid_product_~retValue_acc~31; 589069#L3448 main_#t~ret166 := valid_product_#res;main_~tmp~27 := main_#t~ret166;havoc main_#t~ret166; 592009#L2436 assume 0 != main_~tmp~27; 603361#L2410 havoc aliceCall_#t~ret155, aliceCall_~tmp~20;havoc aliceCall_~tmp~20;getOrigin_#in~person := 1;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~28;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~28; 601266#L3343 assume !(0 == getOrigin_~person); 601267#L3347 assume !(1 == getOrigin_~person); 601979#L3351 assume 2 == getOrigin_~person;getOrigin_~retValue_acc~28 := 2;getOrigin_#res := getOrigin_~retValue_acc~28; 590927#L3368 aliceCall_#t~ret155 := getOrigin_#res;aliceCall_~tmp~20 := aliceCall_#t~ret155;havoc aliceCall_#t~ret155;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 1, aliceCall_~tmp~20;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 603591#L2903 assume 0 == initPersonOnFloor_~floor; 595312#L2904 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 588624#L3011-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 594405#L2695 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 593348#L2707-2 havoc angelinaCall_#t~ret156, angelinaCall_~tmp~21;havoc angelinaCall_~tmp~21;getOrigin_#in~person := 2;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~28;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~28; 599058#L3343-1 assume !(0 == getOrigin_~person); 603572#L3347-1 assume !(1 == getOrigin_~person); 588755#L3351-1 assume 2 == getOrigin_~person;getOrigin_~retValue_acc~28 := 2;getOrigin_#res := getOrigin_~retValue_acc~28; 588756#L3368-1 angelinaCall_#t~ret156 := getOrigin_#res;angelinaCall_~tmp~21 := angelinaCall_#t~ret156;havoc angelinaCall_#t~ret156;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 2, angelinaCall_~tmp~21;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 603582#L2903-1 assume 0 == initPersonOnFloor_~floor; 588632#L2904-2 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 585913#L3011-3 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 592078#L2695-2 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 599579#L2707-5 havoc timeShift_#t~ret101, timeShift_~tmp~16;havoc timeShift_~tmp~16;havoc __utac_acc__Specification13_spec__1_#t~ret173;havoc getCurrentHeading_#res;havoc getCurrentHeading_~retValue_acc~7;havoc getCurrentHeading_~retValue_acc~7;getCurrentHeading_~retValue_acc~7 := ~currentHeading~0;getCurrentHeading_#res := getCurrentHeading_~retValue_acc~7; 597671#L732 __utac_acc__Specification13_spec__1_#t~ret173 := getCurrentHeading_#res;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret173;havoc __utac_acc__Specification13_spec__1_#t~ret173; 595199#L3219 havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 595200#L689 timeShift_#t~ret101 := areDoorsOpen_#res;timeShift_~tmp~16 := timeShift_#t~ret101;havoc timeShift_#t~ret101; 601181#L1702 assume 0 != timeShift_~tmp~16; 599425#L1703 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 587076#L1345-11 havoc __utac_acc__Specification13_spec__2_#t~ret174, __utac_acc__Specification13_spec__2_#t~ret175, __utac_acc__Specification13_spec__2_#t~ret176, __utac_acc__Specification13_spec__2_#t~ret177, __utac_acc__Specification13_spec__2_#t~ret178, __utac_acc__Specification13_spec__2_#t~ret179, __utac_acc__Specification13_spec__2_~tmp~30, __utac_acc__Specification13_spec__2_~tmp___0~13, __utac_acc__Specification13_spec__2_~tmp___1~8, __utac_acc__Specification13_spec__2_~tmp___2~6, __utac_acc__Specification13_spec__2_~tmp___3~5, __utac_acc__Specification13_spec__2_~tmp___4~3, __utac_acc__Specification13_spec__2_~__cil_tmp7~7, __utac_acc__Specification13_spec__2_~__cil_tmp8~8;havoc __utac_acc__Specification13_spec__2_~tmp~30;havoc __utac_acc__Specification13_spec__2_~tmp___0~13;havoc __utac_acc__Specification13_spec__2_~tmp___1~8;havoc __utac_acc__Specification13_spec__2_~tmp___2~6;havoc __utac_acc__Specification13_spec__2_~tmp___3~5;havoc __utac_acc__Specification13_spec__2_~tmp___4~3;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~7;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~8;__utac_acc__Specification13_spec__2_~__cil_tmp7~7 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~8 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~7 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~7 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~7 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~7 / 3); 589490#L3236 assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~8; 589491#L3237 assume 1 == ~prevDir~0;existInLiftCallsInDirection_#in~d := 0;havoc existInLiftCallsInDirection_#res;havoc existInLiftCallsInDirection_~d, existInLiftCallsInDirection_~retValue_acc~19, existInLiftCallsInDirection_~i~0, existInLiftCallsInDirection_~i___0~0;existInLiftCallsInDirection_~d := existInLiftCallsInDirection_#in~d;havoc existInLiftCallsInDirection_~retValue_acc~19;havoc existInLiftCallsInDirection_~i~0;havoc existInLiftCallsInDirection_~i___0~0; 598736#L1922 assume !(1 == existInLiftCallsInDirection_~d); 600347#L1988 assume 0 == existInLiftCallsInDirection_~d;existInLiftCallsInDirection_~i___0~0 := 0;existInLiftCallsInDirection_~i___0~0 := ~currentFloorID~0 - 1; 596361#L1992-2 [2021-11-09 08:46:35,294 INFO L793 eck$LassoCheckResult]: Loop: 596361#L1992-2 assume !false; 591884#L1993 assume existInLiftCallsInDirection_~i___0~0 >= 0; 586051#L1994 existInLiftCallsInDirection_~i___0~0 := 1 + ~currentFloorID~0; 586052#L2001-2 assume !false; 591397#L2002 assume !(existInLiftCallsInDirection_~i___0~0 < 5); 596360#L2060 existInLiftCallsInDirection_~i___0~0 := existInLiftCallsInDirection_~i___0~0 - 1; 596361#L1992-2 [2021-11-09 08:46:35,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:46:35,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1062886761, now seen corresponding path program 1 times [2021-11-09 08:46:35,295 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:46:35,296 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085908464] [2021-11-09 08:46:35,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:46:35,297 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:46:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:46:35,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:46:35,452 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:46:35,453 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085908464] [2021-11-09 08:46:35,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085908464] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:46:35,453 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:46:35,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 08:46:35,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117514460] [2021-11-09 08:46:35,454 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 08:46:35,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:46:35,455 INFO L85 PathProgramCache]: Analyzing trace with hash -613160693, now seen corresponding path program 1 times [2021-11-09 08:46:35,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:46:35,457 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287093890] [2021-11-09 08:46:35,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:46:35,458 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:46:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 08:46:35,469 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 08:46:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 08:46:35,482 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 08:46:35,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:46:35,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 08:46:35,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 08:46:35,532 INFO L87 Difference]: Start difference. First operand 17725 states and 33359 transitions. cyclomatic complexity: 15669 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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-11-09 08:46:36,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 08:46:36,511 INFO L93 Difference]: Finished difference Result 35274 states and 66394 transitions. [2021-11-09 08:46:36,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 08:46:36,512 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35274 states and 66394 transitions. [2021-11-09 08:46:36,650 INFO L131 ngComponentsAnalysis]: Automaton has 66 accepting balls. 8058 [2021-11-09 08:46:36,791 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35274 states to 35274 states and 66394 transitions. [2021-11-09 08:46:36,791 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35198 [2021-11-09 08:46:36,821 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35198 [2021-11-09 08:46:36,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35274 states and 66394 transitions. [2021-11-09 08:46:36,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-09 08:46:36,823 INFO L681 BuchiCegarLoop]: Abstraction has 35274 states and 66394 transitions. [2021-11-09 08:46:36,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35274 states and 66394 transitions. [2021-11-09 08:46:37,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35274 to 17691. [2021-11-09 08:46:37,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17691 states, 17691 states have (on average 1.8818043072748856) internal successors, (33291), 17690 states have internal predecessors, (33291), 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-11-09 08:46:37,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17691 states to 17691 states and 33291 transitions. [2021-11-09 08:46:37,194 INFO L704 BuchiCegarLoop]: Abstraction has 17691 states and 33291 transitions. [2021-11-09 08:46:37,194 INFO L587 BuchiCegarLoop]: Abstraction has 17691 states and 33291 transitions. [2021-11-09 08:46:37,194 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-11-09 08:46:37,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17691 states and 33291 transitions. [2021-11-09 08:46:37,256 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4029 [2021-11-09 08:46:37,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 08:46:37,256 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 08:46:37,257 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] [2021-11-09 08:46:37,258 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-11-09 08:46:37,258 INFO L791 eck$LassoCheckResult]: Stem: 651134#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(30);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(9);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(21);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(30);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(9);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(21);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(30);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(9);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(25);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(30);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(9);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(25);call #t~string102.base, #t~string102.offset := #Ultimate.allocOnStack(10);call #t~string104.base, #t~string104.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string104.base, #t~string104.offset, 1);call write~init~int(95, #t~string104.base, 1 + #t~string104.offset, 1);call write~init~int(93, #t~string104.base, 2 + #t~string104.offset, 1);call write~init~int(0, #t~string104.base, 3 + #t~string104.offset, 1);call #t~string106.base, #t~string106.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string106.base, #t~string106.offset, 1);call write~init~int(93, #t~string106.base, 1 + #t~string106.offset, 1);call write~init~int(32, #t~string106.base, 2 + #t~string106.offset, 1);call write~init~int(0, #t~string106.base, 3 + #t~string106.offset, 1);call #t~string108.base, #t~string108.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string108.base, #t~string108.offset, 1);call write~init~int(97, #t~string108.base, 1 + #t~string108.offset, 1);call write~init~int(116, #t~string108.base, 2 + #t~string108.offset, 1);call write~init~int(32, #t~string108.base, 3 + #t~string108.offset, 1);call write~init~int(0, #t~string108.base, 4 + #t~string108.offset, 1);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string110.base, #t~string110.offset, 1);call write~init~int(105, #t~string110.base, 1 + #t~string110.offset, 1);call write~init~int(0, #t~string110.base, 2 + #t~string110.offset, 1);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(10);call #t~string114.base, #t~string114.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string114.base, #t~string114.offset, 1);call write~init~int(112, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 2 + #t~string114.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string116.base, #t~string116.offset, 1);call write~init~int(111, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(119, #t~string116.base, 2 + #t~string116.offset, 1);call write~init~int(110, #t~string116.base, 3 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 4 + #t~string116.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string118.base, #t~string118.offset, 1);call write~init~int(73, #t~string118.base, 1 + #t~string118.offset, 1);call write~init~int(76, #t~string118.base, 2 + #t~string118.offset, 1);call write~init~int(95, #t~string118.base, 3 + #t~string118.offset, 1);call write~init~int(112, #t~string118.base, 4 + #t~string118.offset, 1);call write~init~int(58, #t~string118.base, 5 + #t~string118.offset, 1);call write~init~int(0, #t~string118.base, 6 + #t~string118.offset, 1);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string120.base, #t~string120.offset, 1);call write~init~int(37, #t~string120.base, 1 + #t~string120.offset, 1);call write~init~int(105, #t~string120.base, 2 + #t~string120.offset, 1);call write~init~int(0, #t~string120.base, 3 + #t~string120.offset, 1);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string122.base, #t~string122.offset, 1);call write~init~int(37, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(105, #t~string122.base, 2 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 3 + #t~string122.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string124.base, #t~string124.offset, 1);call write~init~int(37, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(105, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 3 + #t~string124.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string126.base, #t~string126.offset, 1);call write~init~int(37, #t~string126.base, 1 + #t~string126.offset, 1);call write~init~int(105, #t~string126.base, 2 + #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 3 + #t~string126.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(37, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(105, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string130.base, #t~string130.offset, 1);call write~init~int(70, #t~string130.base, 1 + #t~string130.offset, 1);call write~init~int(95, #t~string130.base, 2 + #t~string130.offset, 1);call write~init~int(112, #t~string130.base, 3 + #t~string130.offset, 1);call write~init~int(58, #t~string130.base, 4 + #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 5 + #t~string130.offset, 1);call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string133.base, #t~string133.offset, 1);call write~init~int(37, #t~string133.base, 1 + #t~string133.offset, 1);call write~init~int(105, #t~string133.base, 2 + #t~string133.offset, 1);call write~init~int(0, #t~string133.base, 3 + #t~string133.offset, 1);call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string136.base, #t~string136.offset, 1);call write~init~int(37, #t~string136.base, 1 + #t~string136.offset, 1);call write~init~int(105, #t~string136.base, 2 + #t~string136.offset, 1);call write~init~int(0, #t~string136.base, 3 + #t~string136.offset, 1);call #t~string139.base, #t~string139.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string139.base, #t~string139.offset, 1);call write~init~int(37, #t~string139.base, 1 + #t~string139.offset, 1);call write~init~int(105, #t~string139.base, 2 + #t~string139.offset, 1);call write~init~int(0, #t~string139.base, 3 + #t~string139.offset, 1);call #t~string142.base, #t~string142.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string142.base, #t~string142.offset, 1);call write~init~int(37, #t~string142.base, 1 + #t~string142.offset, 1);call write~init~int(105, #t~string142.base, 2 + #t~string142.offset, 1);call write~init~int(0, #t~string142.base, 3 + #t~string142.offset, 1);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string145.base, #t~string145.offset, 1);call write~init~int(37, #t~string145.base, 1 + #t~string145.offset, 1);call write~init~int(105, #t~string145.base, 2 + #t~string145.offset, 1);call write~init~int(0, #t~string145.base, 3 + #t~string145.offset, 1);call #t~string147.base, #t~string147.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string147.base, #t~string147.offset, 1);call write~init~int(0, #t~string147.base, 1 + #t~string147.offset, 1);call #t~string150.base, #t~string150.offset := #Ultimate.allocOnStack(9);~head~0.base, ~head~0.offset := 0, 0;~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;~cleanupTimeShifts~0 := 12;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~prevDir~0 := 0; 647276#L-1 havoc main_#res;havoc main_#t~ret166, main_~retValue_acc~23, main_~tmp~27;havoc main_~retValue_acc~23;havoc main_~tmp~27; 642071#L3440 havoc valid_product_#res;havoc valid_product_~retValue_acc~31;havoc valid_product_~retValue_acc~31;valid_product_~retValue_acc~31 := 1;valid_product_#res := valid_product_~retValue_acc~31; 642072#L3448 main_#t~ret166 := valid_product_#res;main_~tmp~27 := main_#t~ret166;havoc main_#t~ret166; 645009#L2436 assume 0 != main_~tmp~27; 656337#L2410 havoc aliceCall_#t~ret155, aliceCall_~tmp~20;havoc aliceCall_~tmp~20;getOrigin_#in~person := 1;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~28;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~28; 654246#L3343 assume !(0 == getOrigin_~person); 654247#L3347 assume 1 == getOrigin_~person;getOrigin_~retValue_acc~28 := 3;getOrigin_#res := getOrigin_~retValue_acc~28; 642104#L3368 aliceCall_#t~ret155 := getOrigin_#res;aliceCall_~tmp~20 := aliceCall_#t~ret155;havoc aliceCall_#t~ret155;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 1, aliceCall_~tmp~20;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 642105#L2903 assume !(0 == initPersonOnFloor_~floor); 650343#L2930 assume !(1 == initPersonOnFloor_~floor); 648190#L2957 assume !(2 == initPersonOnFloor_~floor); 648191#L2984 assume 3 == initPersonOnFloor_~floor; 650193#L2985 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_3~0 := 1; 641681#L3011-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 647398#L2695 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 646343#L2707-2 havoc angelinaCall_#t~ret156, angelinaCall_~tmp~21;havoc angelinaCall_~tmp~21;getOrigin_#in~person := 2;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~28;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~28; 652041#L3343-1 assume !(0 == getOrigin_~person); 656547#L3347-1 assume !(1 == getOrigin_~person); 641758#L3351-1 assume 2 == getOrigin_~person;getOrigin_~retValue_acc~28 := 2;getOrigin_#res := getOrigin_~retValue_acc~28; 641759#L3368-1 angelinaCall_#t~ret156 := getOrigin_#res;angelinaCall_~tmp~21 := angelinaCall_#t~ret156;havoc angelinaCall_#t~ret156;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 2, angelinaCall_~tmp~21;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 656557#L2903-1 assume 0 == initPersonOnFloor_~floor; 641634#L2904-2 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 638918#L3011-3 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 645078#L2695-2 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 652561#L2707-5 havoc timeShift_#t~ret101, timeShift_~tmp~16;havoc timeShift_~tmp~16;havoc __utac_acc__Specification13_spec__1_#t~ret173;havoc getCurrentHeading_#res;havoc getCurrentHeading_~retValue_acc~7;havoc getCurrentHeading_~retValue_acc~7;getCurrentHeading_~retValue_acc~7 := ~currentHeading~0;getCurrentHeading_#res := getCurrentHeading_~retValue_acc~7; 650657#L732 __utac_acc__Specification13_spec__1_#t~ret173 := getCurrentHeading_#res;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret173;havoc __utac_acc__Specification13_spec__1_#t~ret173; 648192#L3219 havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 648193#L689 timeShift_#t~ret101 := areDoorsOpen_#res;timeShift_~tmp~16 := timeShift_#t~ret101;havoc timeShift_#t~ret101; 654161#L1702 assume 0 != timeShift_~tmp~16; 652408#L1703 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 640081#L1345-11 havoc __utac_acc__Specification13_spec__2_#t~ret174, __utac_acc__Specification13_spec__2_#t~ret175, __utac_acc__Specification13_spec__2_#t~ret176, __utac_acc__Specification13_spec__2_#t~ret177, __utac_acc__Specification13_spec__2_#t~ret178, __utac_acc__Specification13_spec__2_#t~ret179, __utac_acc__Specification13_spec__2_~tmp~30, __utac_acc__Specification13_spec__2_~tmp___0~13, __utac_acc__Specification13_spec__2_~tmp___1~8, __utac_acc__Specification13_spec__2_~tmp___2~6, __utac_acc__Specification13_spec__2_~tmp___3~5, __utac_acc__Specification13_spec__2_~tmp___4~3, __utac_acc__Specification13_spec__2_~__cil_tmp7~7, __utac_acc__Specification13_spec__2_~__cil_tmp8~8;havoc __utac_acc__Specification13_spec__2_~tmp~30;havoc __utac_acc__Specification13_spec__2_~tmp___0~13;havoc __utac_acc__Specification13_spec__2_~tmp___1~8;havoc __utac_acc__Specification13_spec__2_~tmp___2~6;havoc __utac_acc__Specification13_spec__2_~tmp___3~5;havoc __utac_acc__Specification13_spec__2_~tmp___4~3;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~7;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~8;__utac_acc__Specification13_spec__2_~__cil_tmp7~7 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~8 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~7 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~7 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~7 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~7 / 3); 642493#L3236 assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~8; 642494#L3237 assume 1 == ~prevDir~0;existInLiftCallsInDirection_#in~d := 0;havoc existInLiftCallsInDirection_#res;havoc existInLiftCallsInDirection_~d, existInLiftCallsInDirection_~retValue_acc~19, existInLiftCallsInDirection_~i~0, existInLiftCallsInDirection_~i___0~0;existInLiftCallsInDirection_~d := existInLiftCallsInDirection_#in~d;havoc existInLiftCallsInDirection_~retValue_acc~19;havoc existInLiftCallsInDirection_~i~0;havoc existInLiftCallsInDirection_~i___0~0; 651720#L1922 assume !(1 == existInLiftCallsInDirection_~d); 653327#L1988 assume 0 == existInLiftCallsInDirection_~d;existInLiftCallsInDirection_~i___0~0 := 0;existInLiftCallsInDirection_~i___0~0 := ~currentFloorID~0 - 1; 649348#L1992-2 [2021-11-09 08:46:37,259 INFO L793 eck$LassoCheckResult]: Loop: 649348#L1992-2 assume !false; 644884#L1993 assume existInLiftCallsInDirection_~i___0~0 >= 0; 639056#L1994 existInLiftCallsInDirection_~i___0~0 := 1 + ~currentFloorID~0; 639057#L2001-2 assume !false; 644397#L2002 assume !(existInLiftCallsInDirection_~i___0~0 < 5); 649347#L2060 existInLiftCallsInDirection_~i___0~0 := existInLiftCallsInDirection_~i___0~0 - 1; 649348#L1992-2 [2021-11-09 08:46:37,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:46:37,259 INFO L85 PathProgramCache]: Analyzing trace with hash 772077564, now seen corresponding path program 1 times [2021-11-09 08:46:37,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:46:37,260 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128161340] [2021-11-09 08:46:37,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:46:37,261 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:46:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:46:37,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:46:37,348 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:46:37,349 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128161340] [2021-11-09 08:46:37,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128161340] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:46:37,349 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:46:37,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 08:46:37,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576456200] [2021-11-09 08:46:37,350 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 08:46:37,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:46:37,351 INFO L85 PathProgramCache]: Analyzing trace with hash -613160693, now seen corresponding path program 2 times [2021-11-09 08:46:37,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:46:37,351 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111712369] [2021-11-09 08:46:37,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:46:37,352 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:46:37,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 08:46:37,358 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 08:46:37,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 08:46:37,367 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 08:46:37,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:46:37,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 08:46:37,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-09 08:46:37,395 INFO L87 Difference]: Start difference. First operand 17691 states and 33291 transitions. cyclomatic complexity: 15635 Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-11-09 08:46:38,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 08:46:38,258 INFO L93 Difference]: Finished difference Result 24731 states and 46539 transitions. [2021-11-09 08:46:38,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 08:46:38,259 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24731 states and 46539 transitions. [2021-11-09 08:46:38,810 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 7690 [2021-11-09 08:46:38,909 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24731 states to 24731 states and 46539 transitions. [2021-11-09 08:46:38,909 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24693 [2021-11-09 08:46:38,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24693 [2021-11-09 08:46:38,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24731 states and 46539 transitions. [2021-11-09 08:46:38,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-09 08:46:38,933 INFO L681 BuchiCegarLoop]: Abstraction has 24731 states and 46539 transitions. [2021-11-09 08:46:38,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24731 states and 46539 transitions. [2021-11-09 08:46:39,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24731 to 17691. [2021-11-09 08:46:39,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17691 states, 17691 states have (on average 1.8814651517720875) internal successors, (33285), 17690 states have internal predecessors, (33285), 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-11-09 08:46:39,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17691 states to 17691 states and 33285 transitions. [2021-11-09 08:46:39,260 INFO L704 BuchiCegarLoop]: Abstraction has 17691 states and 33285 transitions. [2021-11-09 08:46:39,260 INFO L587 BuchiCegarLoop]: Abstraction has 17691 states and 33285 transitions. [2021-11-09 08:46:39,260 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-11-09 08:46:39,260 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17691 states and 33285 transitions. [2021-11-09 08:46:39,315 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4029 [2021-11-09 08:46:39,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 08:46:39,315 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 08:46:39,316 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] [2021-11-09 08:46:39,316 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-11-09 08:46:39,317 INFO L791 eck$LassoCheckResult]: Stem: 693569#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(30);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(9);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(21);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(30);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(9);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(21);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(30);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(9);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(25);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(30);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(9);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(25);call #t~string102.base, #t~string102.offset := #Ultimate.allocOnStack(10);call #t~string104.base, #t~string104.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string104.base, #t~string104.offset, 1);call write~init~int(95, #t~string104.base, 1 + #t~string104.offset, 1);call write~init~int(93, #t~string104.base, 2 + #t~string104.offset, 1);call write~init~int(0, #t~string104.base, 3 + #t~string104.offset, 1);call #t~string106.base, #t~string106.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string106.base, #t~string106.offset, 1);call write~init~int(93, #t~string106.base, 1 + #t~string106.offset, 1);call write~init~int(32, #t~string106.base, 2 + #t~string106.offset, 1);call write~init~int(0, #t~string106.base, 3 + #t~string106.offset, 1);call #t~string108.base, #t~string108.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string108.base, #t~string108.offset, 1);call write~init~int(97, #t~string108.base, 1 + #t~string108.offset, 1);call write~init~int(116, #t~string108.base, 2 + #t~string108.offset, 1);call write~init~int(32, #t~string108.base, 3 + #t~string108.offset, 1);call write~init~int(0, #t~string108.base, 4 + #t~string108.offset, 1);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string110.base, #t~string110.offset, 1);call write~init~int(105, #t~string110.base, 1 + #t~string110.offset, 1);call write~init~int(0, #t~string110.base, 2 + #t~string110.offset, 1);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(10);call #t~string114.base, #t~string114.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string114.base, #t~string114.offset, 1);call write~init~int(112, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 2 + #t~string114.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string116.base, #t~string116.offset, 1);call write~init~int(111, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(119, #t~string116.base, 2 + #t~string116.offset, 1);call write~init~int(110, #t~string116.base, 3 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 4 + #t~string116.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string118.base, #t~string118.offset, 1);call write~init~int(73, #t~string118.base, 1 + #t~string118.offset, 1);call write~init~int(76, #t~string118.base, 2 + #t~string118.offset, 1);call write~init~int(95, #t~string118.base, 3 + #t~string118.offset, 1);call write~init~int(112, #t~string118.base, 4 + #t~string118.offset, 1);call write~init~int(58, #t~string118.base, 5 + #t~string118.offset, 1);call write~init~int(0, #t~string118.base, 6 + #t~string118.offset, 1);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string120.base, #t~string120.offset, 1);call write~init~int(37, #t~string120.base, 1 + #t~string120.offset, 1);call write~init~int(105, #t~string120.base, 2 + #t~string120.offset, 1);call write~init~int(0, #t~string120.base, 3 + #t~string120.offset, 1);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string122.base, #t~string122.offset, 1);call write~init~int(37, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(105, #t~string122.base, 2 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 3 + #t~string122.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string124.base, #t~string124.offset, 1);call write~init~int(37, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(105, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 3 + #t~string124.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string126.base, #t~string126.offset, 1);call write~init~int(37, #t~string126.base, 1 + #t~string126.offset, 1);call write~init~int(105, #t~string126.base, 2 + #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 3 + #t~string126.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(37, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(105, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string130.base, #t~string130.offset, 1);call write~init~int(70, #t~string130.base, 1 + #t~string130.offset, 1);call write~init~int(95, #t~string130.base, 2 + #t~string130.offset, 1);call write~init~int(112, #t~string130.base, 3 + #t~string130.offset, 1);call write~init~int(58, #t~string130.base, 4 + #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 5 + #t~string130.offset, 1);call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string133.base, #t~string133.offset, 1);call write~init~int(37, #t~string133.base, 1 + #t~string133.offset, 1);call write~init~int(105, #t~string133.base, 2 + #t~string133.offset, 1);call write~init~int(0, #t~string133.base, 3 + #t~string133.offset, 1);call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string136.base, #t~string136.offset, 1);call write~init~int(37, #t~string136.base, 1 + #t~string136.offset, 1);call write~init~int(105, #t~string136.base, 2 + #t~string136.offset, 1);call write~init~int(0, #t~string136.base, 3 + #t~string136.offset, 1);call #t~string139.base, #t~string139.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string139.base, #t~string139.offset, 1);call write~init~int(37, #t~string139.base, 1 + #t~string139.offset, 1);call write~init~int(105, #t~string139.base, 2 + #t~string139.offset, 1);call write~init~int(0, #t~string139.base, 3 + #t~string139.offset, 1);call #t~string142.base, #t~string142.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string142.base, #t~string142.offset, 1);call write~init~int(37, #t~string142.base, 1 + #t~string142.offset, 1);call write~init~int(105, #t~string142.base, 2 + #t~string142.offset, 1);call write~init~int(0, #t~string142.base, 3 + #t~string142.offset, 1);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string145.base, #t~string145.offset, 1);call write~init~int(37, #t~string145.base, 1 + #t~string145.offset, 1);call write~init~int(105, #t~string145.base, 2 + #t~string145.offset, 1);call write~init~int(0, #t~string145.base, 3 + #t~string145.offset, 1);call #t~string147.base, #t~string147.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string147.base, #t~string147.offset, 1);call write~init~int(0, #t~string147.base, 1 + #t~string147.offset, 1);call #t~string150.base, #t~string150.offset := #Ultimate.allocOnStack(9);~head~0.base, ~head~0.offset := 0, 0;~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;~cleanupTimeShifts~0 := 12;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~prevDir~0 := 0; 689711#L-1 havoc main_#res;havoc main_#t~ret166, main_~retValue_acc~23, main_~tmp~27;havoc main_~retValue_acc~23;havoc main_~tmp~27; 684506#L3440 havoc valid_product_#res;havoc valid_product_~retValue_acc~31;havoc valid_product_~retValue_acc~31;valid_product_~retValue_acc~31 := 1;valid_product_#res := valid_product_~retValue_acc~31; 684507#L3448 main_#t~ret166 := valid_product_#res;main_~tmp~27 := main_#t~ret166;havoc main_#t~ret166; 687444#L2436 assume 0 != main_~tmp~27; 698772#L2410 havoc aliceCall_#t~ret155, aliceCall_~tmp~20;havoc aliceCall_~tmp~20;getOrigin_#in~person := 1;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~28;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~28; 696681#L3343 assume !(0 == getOrigin_~person); 696682#L3347 assume 1 == getOrigin_~person;getOrigin_~retValue_acc~28 := 3;getOrigin_#res := getOrigin_~retValue_acc~28; 684539#L3368 aliceCall_#t~ret155 := getOrigin_#res;aliceCall_~tmp~20 := aliceCall_#t~ret155;havoc aliceCall_#t~ret155;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 1, aliceCall_~tmp~20;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 684540#L2903 assume !(0 == initPersonOnFloor_~floor); 692778#L2930 assume !(1 == initPersonOnFloor_~floor); 690625#L2957 assume !(2 == initPersonOnFloor_~floor); 690626#L2984 assume 3 == initPersonOnFloor_~floor; 692628#L2985 assume !(0 == initPersonOnFloor_~person); 695687#L2988 assume 1 == initPersonOnFloor_~person;~personOnFloor_1_3~0 := 1; 684116#L3011-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 689833#L2695 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 688778#L2707-2 havoc angelinaCall_#t~ret156, angelinaCall_~tmp~21;havoc angelinaCall_~tmp~21;getOrigin_#in~person := 2;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~28;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~28; 694476#L3343-1 assume !(0 == getOrigin_~person); 698982#L3347-1 assume !(1 == getOrigin_~person); 684193#L3351-1 assume 2 == getOrigin_~person;getOrigin_~retValue_acc~28 := 2;getOrigin_#res := getOrigin_~retValue_acc~28; 684194#L3368-1 angelinaCall_#t~ret156 := getOrigin_#res;angelinaCall_~tmp~21 := angelinaCall_#t~ret156;havoc angelinaCall_#t~ret156;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 2, angelinaCall_~tmp~21;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 698998#L2903-1 assume 0 == initPersonOnFloor_~floor; 684069#L2904-2 assume !(0 == initPersonOnFloor_~person); 681928#L2907-2 assume 1 == initPersonOnFloor_~person;~personOnFloor_1_0~0 := 1; 681353#L3011-3 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 687513#L2695-2 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 694996#L2707-5 havoc timeShift_#t~ret101, timeShift_~tmp~16;havoc timeShift_~tmp~16;havoc __utac_acc__Specification13_spec__1_#t~ret173;havoc getCurrentHeading_#res;havoc getCurrentHeading_~retValue_acc~7;havoc getCurrentHeading_~retValue_acc~7;getCurrentHeading_~retValue_acc~7 := ~currentHeading~0;getCurrentHeading_#res := getCurrentHeading_~retValue_acc~7; 693092#L732 __utac_acc__Specification13_spec__1_#t~ret173 := getCurrentHeading_#res;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret173;havoc __utac_acc__Specification13_spec__1_#t~ret173; 690627#L3219 havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 690628#L689 timeShift_#t~ret101 := areDoorsOpen_#res;timeShift_~tmp~16 := timeShift_#t~ret101;havoc timeShift_#t~ret101; 696596#L1702 assume 0 != timeShift_~tmp~16; 694843#L1703 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 682516#L1345-11 havoc __utac_acc__Specification13_spec__2_#t~ret174, __utac_acc__Specification13_spec__2_#t~ret175, __utac_acc__Specification13_spec__2_#t~ret176, __utac_acc__Specification13_spec__2_#t~ret177, __utac_acc__Specification13_spec__2_#t~ret178, __utac_acc__Specification13_spec__2_#t~ret179, __utac_acc__Specification13_spec__2_~tmp~30, __utac_acc__Specification13_spec__2_~tmp___0~13, __utac_acc__Specification13_spec__2_~tmp___1~8, __utac_acc__Specification13_spec__2_~tmp___2~6, __utac_acc__Specification13_spec__2_~tmp___3~5, __utac_acc__Specification13_spec__2_~tmp___4~3, __utac_acc__Specification13_spec__2_~__cil_tmp7~7, __utac_acc__Specification13_spec__2_~__cil_tmp8~8;havoc __utac_acc__Specification13_spec__2_~tmp~30;havoc __utac_acc__Specification13_spec__2_~tmp___0~13;havoc __utac_acc__Specification13_spec__2_~tmp___1~8;havoc __utac_acc__Specification13_spec__2_~tmp___2~6;havoc __utac_acc__Specification13_spec__2_~tmp___3~5;havoc __utac_acc__Specification13_spec__2_~tmp___4~3;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~7;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~8;__utac_acc__Specification13_spec__2_~__cil_tmp7~7 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~8 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~7 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~7 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~7 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~7 / 3); 684928#L3236 assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~8; 684929#L3237 assume 1 == ~prevDir~0;existInLiftCallsInDirection_#in~d := 0;havoc existInLiftCallsInDirection_#res;havoc existInLiftCallsInDirection_~d, existInLiftCallsInDirection_~retValue_acc~19, existInLiftCallsInDirection_~i~0, existInLiftCallsInDirection_~i___0~0;existInLiftCallsInDirection_~d := existInLiftCallsInDirection_#in~d;havoc existInLiftCallsInDirection_~retValue_acc~19;havoc existInLiftCallsInDirection_~i~0;havoc existInLiftCallsInDirection_~i___0~0; 694155#L1922 assume !(1 == existInLiftCallsInDirection_~d); 695762#L1988 assume 0 == existInLiftCallsInDirection_~d;existInLiftCallsInDirection_~i___0~0 := 0;existInLiftCallsInDirection_~i___0~0 := ~currentFloorID~0 - 1; 691783#L1992-2 [2021-11-09 08:46:39,317 INFO L793 eck$LassoCheckResult]: Loop: 691783#L1992-2 assume !false; 687319#L1993 assume existInLiftCallsInDirection_~i___0~0 >= 0; 681491#L1994 existInLiftCallsInDirection_~i___0~0 := 1 + ~currentFloorID~0; 681492#L2001-2 assume !false; 686832#L2002 assume !(existInLiftCallsInDirection_~i___0~0 < 5); 691782#L2060 existInLiftCallsInDirection_~i___0~0 := existInLiftCallsInDirection_~i___0~0 - 1; 691783#L1992-2 [2021-11-09 08:46:39,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:46:39,318 INFO L85 PathProgramCache]: Analyzing trace with hash 2126886562, now seen corresponding path program 1 times [2021-11-09 08:46:39,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:46:39,319 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575663923] [2021-11-09 08:46:39,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:46:39,319 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:46:39,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 08:46:39,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 08:46:39,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 08:46:39,397 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575663923] [2021-11-09 08:46:39,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575663923] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 08:46:39,398 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 08:46:39,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 08:46:39,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124879762] [2021-11-09 08:46:39,398 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 08:46:39,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 08:46:39,399 INFO L85 PathProgramCache]: Analyzing trace with hash -613160693, now seen corresponding path program 3 times [2021-11-09 08:46:39,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 08:46:39,400 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582088306] [2021-11-09 08:46:39,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 08:46:39,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 08:46:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 08:46:39,407 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 08:46:39,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 08:46:39,415 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 08:46:39,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 08:46:39,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 08:46:39,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 08:46:39,443 INFO L87 Difference]: Start difference. First operand 17691 states and 33285 transitions. cyclomatic complexity: 15629 Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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)