./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ebb73aa3b2fe06c298821e537034d0c16e316e18b31a7db411eb85fc916df11 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 05:01:38,005 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 05:01:38,094 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-14 05:01:38,098 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 05:01:38,099 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 05:01:38,120 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 05:01:38,120 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 05:01:38,121 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 05:01:38,121 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 05:01:38,121 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 05:01:38,121 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 05:01:38,121 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 05:01:38,121 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 05:01:38,122 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 05:01:38,122 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 05:01:38,122 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 05:01:38,122 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 05:01:38,122 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 05:01:38,122 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 05:01:38,122 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 05:01:38,122 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 05:01:38,122 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 05:01:38,123 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 05:01:38,123 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 05:01:38,123 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 05:01:38,123 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 05:01:38,123 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 05:01:38,123 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 05:01:38,123 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 05:01:38,123 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 05:01:38,123 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 05:01:38,123 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 05:01:38,124 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 05:01:38,124 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 05:01:38,124 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 05:01:38,124 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 05:01:38,124 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 05:01:38,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 05:01:38,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:01:38,125 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 05:01:38,125 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 05:01:38,125 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 05:01:38,125 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 05:01:38,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 05:01:38,126 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 05:01:38,126 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 05:01:38,126 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 05:01:38,126 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 4ebb73aa3b2fe06c298821e537034d0c16e316e18b31a7db411eb85fc916df11 [2024-11-14 05:01:38,512 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 05:01:38,528 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 05:01:38,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 05:01:38,534 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 05:01:38,535 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 05:01:38,538 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c Unable to find full path for "g++" [2024-11-14 05:01:40,543 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 05:01:40,862 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 05:01:40,870 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c [2024-11-14 05:01:40,889 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/data/cabdb87d1/0b2d113b401b43d1af8cdebb93b0bd52/FLAG77519f930 [2024-11-14 05:01:40,908 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/data/cabdb87d1/0b2d113b401b43d1af8cdebb93b0bd52 [2024-11-14 05:01:40,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 05:01:40,915 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 05:01:40,918 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 05:01:40,918 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 05:01:40,923 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 05:01:40,923 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:01:40" (1/1) ... [2024-11-14 05:01:40,925 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62c1ce2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:01:40, skipping insertion in model container [2024-11-14 05:01:40,927 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:01:40" (1/1) ... [2024-11-14 05:01:40,971 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:01:41,147 WARN L250 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_83265b91-0e5e-43a9-aea4-5405e4004f46/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c[911,924] [2024-11-14 05:01:41,239 WARN L250 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_83265b91-0e5e-43a9-aea4-5405e4004f46/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c[8416,8429] [2024-11-14 05:01:41,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:01:41,311 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 05:01:41,323 WARN L250 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_83265b91-0e5e-43a9-aea4-5405e4004f46/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c[911,924] [2024-11-14 05:01:41,357 WARN L250 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_83265b91-0e5e-43a9-aea4-5405e4004f46/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c[8416,8429] [2024-11-14 05:01:41,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:01:41,400 INFO L204 MainTranslator]: Completed translation [2024-11-14 05:01:41,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:01:41 WrapperNode [2024-11-14 05:01:41,401 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 05:01:41,402 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 05:01:41,402 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 05:01:41,402 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 05:01:41,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:01:41" (1/1) ... [2024-11-14 05:01:41,419 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:01:41" (1/1) ... [2024-11-14 05:01:41,464 INFO L138 Inliner]: procedures = 59, calls = 67, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 497 [2024-11-14 05:01:41,464 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 05:01:41,465 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 05:01:41,465 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 05:01:41,465 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 05:01:41,478 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:01:41" (1/1) ... [2024-11-14 05:01:41,478 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:01:41" (1/1) ... [2024-11-14 05:01:41,481 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:01:41" (1/1) ... [2024-11-14 05:01:41,482 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:01:41" (1/1) ... [2024-11-14 05:01:41,496 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:01:41" (1/1) ... [2024-11-14 05:01:41,512 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:01:41" (1/1) ... [2024-11-14 05:01:41,517 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:01:41" (1/1) ... [2024-11-14 05:01:41,519 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:01:41" (1/1) ... [2024-11-14 05:01:41,529 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 05:01:41,530 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 05:01:41,530 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 05:01:41,530 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 05:01:41,531 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:01:41" (1/1) ... [2024-11-14 05:01:41,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:01:41,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:01:41,568 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 05:01:41,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 05:01:41,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 05:01:41,596 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-14 05:01:41,597 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-14 05:01:41,597 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-14 05:01:41,597 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-14 05:01:41,597 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-14 05:01:41,597 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-14 05:01:41,597 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-14 05:01:41,597 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-14 05:01:41,597 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-11-14 05:01:41,597 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-11-14 05:01:41,597 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-14 05:01:41,597 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-14 05:01:41,597 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-14 05:01:41,597 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-14 05:01:41,598 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-11-14 05:01:41,598 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-11-14 05:01:41,598 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-14 05:01:41,598 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-14 05:01:41,598 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-11-14 05:01:41,598 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-11-14 05:01:41,598 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-14 05:01:41,598 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-14 05:01:41,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 05:01:41,598 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-14 05:01:41,598 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-14 05:01:41,598 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-11-14 05:01:41,599 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-11-14 05:01:41,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 05:01:41,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 05:01:41,599 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-14 05:01:41,599 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-14 05:01:41,726 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 05:01:41,729 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 05:01:42,341 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2024-11-14 05:01:42,342 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2024-11-14 05:01:42,492 INFO L? ?]: Removed 70 outVars from TransFormulas that were not future-live. [2024-11-14 05:01:42,494 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 05:01:42,781 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 05:01:42,783 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-14 05:01:42,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:01:42 BoogieIcfgContainer [2024-11-14 05:01:42,784 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 05:01:42,786 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 05:01:42,786 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 05:01:42,792 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 05:01:42,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:01:40" (1/3) ... [2024-11-14 05:01:42,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2025dee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:01:42, skipping insertion in model container [2024-11-14 05:01:42,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:01:41" (2/3) ... [2024-11-14 05:01:42,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2025dee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:01:42, skipping insertion in model container [2024-11-14 05:01:42,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:01:42" (3/3) ... [2024-11-14 05:01:42,795 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.02.cil-1.c [2024-11-14 05:01:42,811 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 05:01:42,813 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_3.cil+token_ring.02.cil-1.c that has 15 procedures, 160 locations, 1 initial locations, 9 loop locations, and 2 error locations. [2024-11-14 05:01:42,887 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 05:01:42,903 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5a346bc4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 05:01:42,904 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-14 05:01:42,911 INFO L276 IsEmpty]: Start isEmpty. Operand has 160 states, 111 states have (on average 1.4774774774774775) internal successors, (164), 117 states have internal predecessors, (164), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-14 05:01:42,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-14 05:01:42,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:01:42,921 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:01:42,923 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:01:42,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:01:42,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1835982356, now seen corresponding path program 1 times [2024-11-14 05:01:42,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:01:42,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439128899] [2024-11-14 05:01:42,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:01:42,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:01:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:01:43,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:01:43,470 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:01:43,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439128899] [2024-11-14 05:01:43,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439128899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:01:43,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:01:43,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:01:43,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335939133] [2024-11-14 05:01:43,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:01:43,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:01:43,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:01:43,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:01:43,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:01:43,506 INFO L87 Difference]: Start difference. First operand has 160 states, 111 states have (on average 1.4774774774774775) internal successors, (164), 117 states have internal predecessors, (164), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-14 05:01:44,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:01:44,371 INFO L93 Difference]: Finished difference Result 589 states and 865 transitions. [2024-11-14 05:01:44,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:01:44,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2024-11-14 05:01:44,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:01:44,385 INFO L225 Difference]: With dead ends: 589 [2024-11-14 05:01:44,386 INFO L226 Difference]: Without dead ends: 424 [2024-11-14 05:01:44,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:01:44,393 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 569 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:01:44,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 542 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 05:01:44,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2024-11-14 05:01:44,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 413. [2024-11-14 05:01:44,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 297 states have (on average 1.367003367003367) internal successors, (406), 304 states have internal predecessors, (406), 77 states have call successors, (77), 38 states have call predecessors, (77), 37 states have return successors, (97), 72 states have call predecessors, (97), 75 states have call successors, (97) [2024-11-14 05:01:44,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 580 transitions. [2024-11-14 05:01:44,520 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 580 transitions. Word has length 37 [2024-11-14 05:01:44,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:01:44,522 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 580 transitions. [2024-11-14 05:01:44,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-14 05:01:44,522 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 580 transitions. [2024-11-14 05:01:44,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-14 05:01:44,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:01:44,526 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:01:44,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 05:01:44,527 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:01:44,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:01:44,527 INFO L85 PathProgramCache]: Analyzing trace with hash -453519554, now seen corresponding path program 1 times [2024-11-14 05:01:44,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:01:44,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124942674] [2024-11-14 05:01:44,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:01:44,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:01:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:01:44,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:01:44,695 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:01:44,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124942674] [2024-11-14 05:01:44,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124942674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:01:44,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:01:44,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:01:44,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480532035] [2024-11-14 05:01:44,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:01:44,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:01:44,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:01:44,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:01:44,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:01:44,700 INFO L87 Difference]: Start difference. First operand 413 states and 580 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-14 05:01:45,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:01:45,110 INFO L93 Difference]: Finished difference Result 613 states and 857 transitions. [2024-11-14 05:01:45,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:01:45,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 44 [2024-11-14 05:01:45,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:01:45,119 INFO L225 Difference]: With dead ends: 613 [2024-11-14 05:01:45,121 INFO L226 Difference]: Without dead ends: 542 [2024-11-14 05:01:45,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:01:45,124 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 271 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:01:45,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 402 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:01:45,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2024-11-14 05:01:45,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 531. [2024-11-14 05:01:45,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 381 states have (on average 1.3595800524934383) internal successors, (518), 388 states have internal predecessors, (518), 97 states have call successors, (97), 52 states have call predecessors, (97), 51 states have return successors, (120), 92 states have call predecessors, (120), 95 states have call successors, (120) [2024-11-14 05:01:45,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 735 transitions. [2024-11-14 05:01:45,239 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 735 transitions. Word has length 44 [2024-11-14 05:01:45,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:01:45,240 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 735 transitions. [2024-11-14 05:01:45,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-14 05:01:45,240 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 735 transitions. [2024-11-14 05:01:45,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-14 05:01:45,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:01:45,244 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:01:45,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 05:01:45,244 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:01:45,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:01:45,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1142268036, now seen corresponding path program 1 times [2024-11-14 05:01:45,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:01:45,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046481898] [2024-11-14 05:01:45,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:01:45,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:01:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:01:45,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:01:45,402 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:01:45,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046481898] [2024-11-14 05:01:45,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046481898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:01:45,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:01:45,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 05:01:45,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139365534] [2024-11-14 05:01:45,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:01:45,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:01:45,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:01:45,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:01:45,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:01:45,406 INFO L87 Difference]: Start difference. First operand 531 states and 735 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-14 05:01:46,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:01:46,427 INFO L93 Difference]: Finished difference Result 1068 states and 1458 transitions. [2024-11-14 05:01:46,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 05:01:46,428 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 45 [2024-11-14 05:01:46,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:01:46,434 INFO L225 Difference]: With dead ends: 1068 [2024-11-14 05:01:46,436 INFO L226 Difference]: Without dead ends: 602 [2024-11-14 05:01:46,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:01:46,440 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 671 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-14 05:01:46,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 712 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-14 05:01:46,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-11-14 05:01:46,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 517. [2024-11-14 05:01:46,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 367 states have (on average 1.3215258855585832) internal successors, (485), 374 states have internal predecessors, (485), 97 states have call successors, (97), 52 states have call predecessors, (97), 51 states have return successors, (117), 92 states have call predecessors, (117), 95 states have call successors, (117) [2024-11-14 05:01:46,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 699 transitions. [2024-11-14 05:01:46,514 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 699 transitions. Word has length 45 [2024-11-14 05:01:46,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:01:46,515 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 699 transitions. [2024-11-14 05:01:46,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-14 05:01:46,515 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 699 transitions. [2024-11-14 05:01:46,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-14 05:01:46,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:01:46,517 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:01:46,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 05:01:46,517 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:01:46,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:01:46,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1843522067, now seen corresponding path program 1 times [2024-11-14 05:01:46,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:01:46,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803495582] [2024-11-14 05:01:46,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:01:46,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:01:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:01:46,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:01:46,629 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:01:46,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803495582] [2024-11-14 05:01:46,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803495582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:01:46,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:01:46,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 05:01:46,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935749085] [2024-11-14 05:01:46,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:01:46,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:01:46,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:01:46,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:01:46,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:01:46,631 INFO L87 Difference]: Start difference. First operand 517 states and 699 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-14 05:01:47,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:01:47,477 INFO L93 Difference]: Finished difference Result 983 states and 1307 transitions. [2024-11-14 05:01:47,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:01:47,478 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 46 [2024-11-14 05:01:47,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:01:47,483 INFO L225 Difference]: With dead ends: 983 [2024-11-14 05:01:47,483 INFO L226 Difference]: Without dead ends: 806 [2024-11-14 05:01:47,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:01:47,485 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 574 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:01:47,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 684 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 05:01:47,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2024-11-14 05:01:47,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 781. [2024-11-14 05:01:47,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 548 states have (on average 1.2846715328467153) internal successors, (704), 555 states have internal predecessors, (704), 146 states have call successors, (146), 86 states have call predecessors, (146), 85 states have return successors, (183), 141 states have call predecessors, (183), 144 states have call successors, (183) [2024-11-14 05:01:47,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1033 transitions. [2024-11-14 05:01:47,592 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1033 transitions. Word has length 46 [2024-11-14 05:01:47,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:01:47,593 INFO L471 AbstractCegarLoop]: Abstraction has 781 states and 1033 transitions. [2024-11-14 05:01:47,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-14 05:01:47,593 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1033 transitions. [2024-11-14 05:01:47,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-14 05:01:47,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:01:47,598 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:01:47,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 05:01:47,599 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:01:47,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:01:47,599 INFO L85 PathProgramCache]: Analyzing trace with hash 557974545, now seen corresponding path program 1 times [2024-11-14 05:01:47,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:01:47,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710115707] [2024-11-14 05:01:47,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:01:47,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:01:47,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:01:47,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:01:47,711 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:01:47,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710115707] [2024-11-14 05:01:47,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710115707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:01:47,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:01:47,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:01:47,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527379903] [2024-11-14 05:01:47,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:01:47,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:01:47,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:01:47,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:01:47,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:01:47,715 INFO L87 Difference]: Start difference. First operand 781 states and 1033 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-14 05:01:47,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:01:47,843 INFO L93 Difference]: Finished difference Result 782 states and 1034 transitions. [2024-11-14 05:01:47,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:01:47,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2024-11-14 05:01:47,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:01:47,849 INFO L225 Difference]: With dead ends: 782 [2024-11-14 05:01:47,849 INFO L226 Difference]: Without dead ends: 338 [2024-11-14 05:01:47,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:01:47,851 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 177 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:01:47,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 161 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:01:47,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-11-14 05:01:47,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2024-11-14 05:01:47,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 246 states have (on average 1.3495934959349594) internal successors, (332), 250 states have internal predecessors, (332), 61 states have call successors, (61), 30 states have call predecessors, (61), 30 states have return successors, (83), 58 states have call predecessors, (83), 61 states have call successors, (83) [2024-11-14 05:01:47,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 476 transitions. [2024-11-14 05:01:47,893 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 476 transitions. Word has length 50 [2024-11-14 05:01:47,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:01:47,893 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 476 transitions. [2024-11-14 05:01:47,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-14 05:01:47,893 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 476 transitions. [2024-11-14 05:01:47,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-14 05:01:47,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:01:47,895 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:01:47,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 05:01:47,896 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:01:47,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:01:47,896 INFO L85 PathProgramCache]: Analyzing trace with hash 2002386002, now seen corresponding path program 1 times [2024-11-14 05:01:47,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:01:47,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941728122] [2024-11-14 05:01:47,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:01:47,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:01:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:01:48,346 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-14 05:01:48,346 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:01:48,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941728122] [2024-11-14 05:01:48,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941728122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:01:48,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:01:48,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 05:01:48,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939839444] [2024-11-14 05:01:48,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:01:48,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:01:48,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:01:48,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:01:48,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:01:48,347 INFO L87 Difference]: Start difference. First operand 338 states and 476 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-14 05:01:48,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:01:48,745 INFO L93 Difference]: Finished difference Result 874 states and 1243 transitions. [2024-11-14 05:01:48,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 05:01:48,746 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 67 [2024-11-14 05:01:48,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:01:48,752 INFO L225 Difference]: With dead ends: 874 [2024-11-14 05:01:48,752 INFO L226 Difference]: Without dead ends: 543 [2024-11-14 05:01:48,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-14 05:01:48,758 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 213 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:01:48,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 328 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:01:48,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2024-11-14 05:01:48,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 523. [2024-11-14 05:01:48,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 380 states have (on average 1.331578947368421) internal successors, (506), 386 states have internal predecessors, (506), 94 states have call successors, (94), 48 states have call predecessors, (94), 48 states have return successors, (131), 89 states have call predecessors, (131), 94 states have call successors, (131) [2024-11-14 05:01:48,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 731 transitions. [2024-11-14 05:01:48,837 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 731 transitions. Word has length 67 [2024-11-14 05:01:48,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:01:48,838 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 731 transitions. [2024-11-14 05:01:48,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-14 05:01:48,839 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 731 transitions. [2024-11-14 05:01:48,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-14 05:01:48,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:01:48,841 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:01:48,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 05:01:48,842 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:01:48,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:01:48,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1909403338, now seen corresponding path program 1 times [2024-11-14 05:01:48,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:01:48,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333410417] [2024-11-14 05:01:48,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:01:48,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:01:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:01:49,214 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-14 05:01:49,214 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:01:49,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333410417] [2024-11-14 05:01:49,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333410417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:01:49,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:01:49,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 05:01:49,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457604742] [2024-11-14 05:01:49,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:01:49,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:01:49,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:01:49,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:01:49,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:01:49,217 INFO L87 Difference]: Start difference. First operand 523 states and 731 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-14 05:01:49,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:01:49,643 INFO L93 Difference]: Finished difference Result 1547 states and 2187 transitions. [2024-11-14 05:01:49,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 05:01:49,643 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 69 [2024-11-14 05:01:49,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:01:49,655 INFO L225 Difference]: With dead ends: 1547 [2024-11-14 05:01:49,656 INFO L226 Difference]: Without dead ends: 1031 [2024-11-14 05:01:49,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-14 05:01:49,661 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 213 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:01:49,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 249 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:01:49,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2024-11-14 05:01:49,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 989. [2024-11-14 05:01:49,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 716 states have (on average 1.3072625698324023) internal successors, (936), 727 states have internal predecessors, (936), 176 states have call successors, (176), 96 states have call predecessors, (176), 96 states have return successors, (243), 166 states have call predecessors, (243), 176 states have call successors, (243) [2024-11-14 05:01:49,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1355 transitions. [2024-11-14 05:01:49,838 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1355 transitions. Word has length 69 [2024-11-14 05:01:49,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:01:49,838 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1355 transitions. [2024-11-14 05:01:49,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-14 05:01:49,839 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1355 transitions. [2024-11-14 05:01:49,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-14 05:01:49,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:01:49,845 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:01:49,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-14 05:01:49,845 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:01:49,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:01:49,846 INFO L85 PathProgramCache]: Analyzing trace with hash 46772754, now seen corresponding path program 1 times [2024-11-14 05:01:49,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:01:49,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060223619] [2024-11-14 05:01:49,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:01:49,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:01:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:01:49,951 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-14 05:01:49,951 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:01:49,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060223619] [2024-11-14 05:01:49,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060223619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:01:49,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:01:49,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:01:49,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826278086] [2024-11-14 05:01:49,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:01:49,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:01:49,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:01:49,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:01:49,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:01:49,953 INFO L87 Difference]: Start difference. First operand 989 states and 1355 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-14 05:01:50,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:01:50,152 INFO L93 Difference]: Finished difference Result 2062 states and 2854 transitions. [2024-11-14 05:01:50,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:01:50,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2024-11-14 05:01:50,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:01:50,163 INFO L225 Difference]: With dead ends: 2062 [2024-11-14 05:01:50,163 INFO L226 Difference]: Without dead ends: 1204 [2024-11-14 05:01:50,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:01:50,168 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 36 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:01:50,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 222 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:01:50,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2024-11-14 05:01:50,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1087. [2024-11-14 05:01:50,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1087 states, 802 states have (on average 1.314214463840399) internal successors, (1054), 813 states have internal predecessors, (1054), 182 states have call successors, (182), 102 states have call predecessors, (182), 102 states have return successors, (249), 172 states have call predecessors, (249), 182 states have call successors, (249) [2024-11-14 05:01:50,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1485 transitions. [2024-11-14 05:01:50,329 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1485 transitions. Word has length 71 [2024-11-14 05:01:50,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:01:50,331 INFO L471 AbstractCegarLoop]: Abstraction has 1087 states and 1485 transitions. [2024-11-14 05:01:50,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-14 05:01:50,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1485 transitions. [2024-11-14 05:01:50,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-14 05:01:50,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:01:50,340 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:01:50,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-14 05:01:50,344 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:01:50,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:01:50,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1627710685, now seen corresponding path program 1 times [2024-11-14 05:01:50,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:01:50,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37941105] [2024-11-14 05:01:50,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:01:50,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:01:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:01:50,419 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-14 05:01:50,420 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:01:50,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37941105] [2024-11-14 05:01:50,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37941105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:01:50,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:01:50,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:01:50,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772454572] [2024-11-14 05:01:50,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:01:50,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:01:50,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:01:50,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:01:50,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:01:50,423 INFO L87 Difference]: Start difference. First operand 1087 states and 1485 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-14 05:01:50,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:01:50,677 INFO L93 Difference]: Finished difference Result 2704 states and 3743 transitions. [2024-11-14 05:01:50,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:01:50,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 90 [2024-11-14 05:01:50,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:01:50,692 INFO L225 Difference]: With dead ends: 2704 [2024-11-14 05:01:50,692 INFO L226 Difference]: Without dead ends: 1623 [2024-11-14 05:01:50,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:01:50,698 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 74 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:01:50,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 195 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:01:50,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2024-11-14 05:01:50,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 1610. [2024-11-14 05:01:50,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1189 states have (on average 1.295206055508831) internal successors, (1540), 1205 states have internal predecessors, (1540), 267 states have call successors, (267), 153 states have call predecessors, (267), 153 states have return successors, (364), 252 states have call predecessors, (364), 267 states have call successors, (364) [2024-11-14 05:01:50,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2171 transitions. [2024-11-14 05:01:50,989 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2171 transitions. Word has length 90 [2024-11-14 05:01:50,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:01:50,990 INFO L471 AbstractCegarLoop]: Abstraction has 1610 states and 2171 transitions. [2024-11-14 05:01:50,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-14 05:01:50,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2171 transitions. [2024-11-14 05:01:51,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-14 05:01:51,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:01:51,004 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:01:51,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-14 05:01:51,005 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:01:51,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:01:51,005 INFO L85 PathProgramCache]: Analyzing trace with hash -667073749, now seen corresponding path program 1 times [2024-11-14 05:01:51,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:01:51,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761406096] [2024-11-14 05:01:51,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:01:51,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:01:51,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:01:51,139 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-14 05:01:51,139 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:01:51,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761406096] [2024-11-14 05:01:51,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761406096] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:01:51,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101978741] [2024-11-14 05:01:51,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:01:51,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:01:51,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:01:51,142 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:01:51,144 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 05:01:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:01:51,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-14 05:01:51,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:01:51,420 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-14 05:01:51,420 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:01:51,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101978741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:01:51,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:01:51,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-14 05:01:51,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472561698] [2024-11-14 05:01:51,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:01:51,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:01:51,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:01:51,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:01:51,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:01:51,425 INFO L87 Difference]: Start difference. First operand 1610 states and 2171 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-14 05:01:51,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:01:51,671 INFO L93 Difference]: Finished difference Result 3135 states and 4274 transitions. [2024-11-14 05:01:51,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:01:51,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 105 [2024-11-14 05:01:51,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:01:51,686 INFO L225 Difference]: With dead ends: 3135 [2024-11-14 05:01:51,686 INFO L226 Difference]: Without dead ends: 1951 [2024-11-14 05:01:51,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:01:51,691 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 72 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:01:51,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 118 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:01:51,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1951 states. [2024-11-14 05:01:51,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1951 to 1895. [2024-11-14 05:01:51,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1895 states, 1436 states have (on average 1.286908077994429) internal successors, (1848), 1449 states have internal predecessors, (1848), 273 states have call successors, (273), 183 states have call predecessors, (273), 185 states have return successors, (369), 263 states have call predecessors, (369), 273 states have call successors, (369) [2024-11-14 05:01:51,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1895 states to 1895 states and 2490 transitions. [2024-11-14 05:01:51,953 INFO L78 Accepts]: Start accepts. Automaton has 1895 states and 2490 transitions. Word has length 105 [2024-11-14 05:01:51,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:01:51,954 INFO L471 AbstractCegarLoop]: Abstraction has 1895 states and 2490 transitions. [2024-11-14 05:01:51,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-14 05:01:51,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1895 states and 2490 transitions. [2024-11-14 05:01:51,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-14 05:01:51,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:01:51,961 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:01:51,983 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 05:01:52,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:01:52,166 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:01:52,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:01:52,167 INFO L85 PathProgramCache]: Analyzing trace with hash 2037498570, now seen corresponding path program 1 times [2024-11-14 05:01:52,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:01:52,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433657608] [2024-11-14 05:01:52,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:01:52,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:01:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:01:52,319 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-14 05:01:52,320 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:01:52,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433657608] [2024-11-14 05:01:52,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433657608] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:01:52,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4972556] [2024-11-14 05:01:52,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:01:52,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:01:52,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:01:52,323 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:01:52,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 05:01:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:01:52,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-14 05:01:52,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:01:52,515 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-14 05:01:52,519 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:01:52,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4972556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:01:52,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:01:52,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-14 05:01:52,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300206050] [2024-11-14 05:01:52,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:01:52,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:01:52,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:01:52,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:01:52,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:01:52,521 INFO L87 Difference]: Start difference. First operand 1895 states and 2490 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-14 05:01:52,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:01:52,874 INFO L93 Difference]: Finished difference Result 3617 states and 4818 transitions. [2024-11-14 05:01:52,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:01:52,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 105 [2024-11-14 05:01:52,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:01:52,893 INFO L225 Difference]: With dead ends: 3617 [2024-11-14 05:01:52,894 INFO L226 Difference]: Without dead ends: 2337 [2024-11-14 05:01:52,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:01:52,900 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 53 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:01:52,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 228 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:01:52,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2024-11-14 05:01:53,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2042. [2024-11-14 05:01:53,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2042 states, 1561 states have (on average 1.2953235105701473) internal successors, (2022), 1574 states have internal predecessors, (2022), 284 states have call successors, (284), 194 states have call predecessors, (284), 196 states have return successors, (380), 274 states have call predecessors, (380), 284 states have call successors, (380) [2024-11-14 05:01:53,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 2686 transitions. [2024-11-14 05:01:53,238 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 2686 transitions. Word has length 105 [2024-11-14 05:01:53,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:01:53,239 INFO L471 AbstractCegarLoop]: Abstraction has 2042 states and 2686 transitions. [2024-11-14 05:01:53,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-14 05:01:53,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 2686 transitions. [2024-11-14 05:01:53,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-14 05:01:53,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:01:53,246 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:01:53,267 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 05:01:53,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-14 05:01:53,450 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:01:53,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:01:53,451 INFO L85 PathProgramCache]: Analyzing trace with hash 90139175, now seen corresponding path program 2 times [2024-11-14 05:01:53,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:01:53,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550125354] [2024-11-14 05:01:53,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:01:53,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:01:53,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:01:53,688 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-14 05:01:53,688 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:01:53,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550125354] [2024-11-14 05:01:53,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550125354] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:01:53,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229764497] [2024-11-14 05:01:53,688 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:01:53,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:01:53,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:01:53,691 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:01:53,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 05:01:53,817 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 05:01:53,817 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:01:53,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:01:53,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:01:53,889 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:01:53,889 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:01:53,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229764497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:01:53,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:01:53,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2024-11-14 05:01:53,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567514438] [2024-11-14 05:01:53,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:01:53,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:01:53,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:01:53,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:01:53,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:01:53,893 INFO L87 Difference]: Start difference. First operand 2042 states and 2686 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-14 05:01:54,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:01:54,244 INFO L93 Difference]: Finished difference Result 3667 states and 4814 transitions. [2024-11-14 05:01:54,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:01:54,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 105 [2024-11-14 05:01:54,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:01:54,259 INFO L225 Difference]: With dead ends: 3667 [2024-11-14 05:01:54,260 INFO L226 Difference]: Without dead ends: 2173 [2024-11-14 05:01:54,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:01:54,266 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 81 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:01:54,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 350 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:01:54,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2173 states. [2024-11-14 05:01:54,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2173 to 2127. [2024-11-14 05:01:54,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2127 states, 1621 states have (on average 1.2905613818630475) internal successors, (2092), 1640 states have internal predecessors, (2092), 292 states have call successors, (292), 199 states have call predecessors, (292), 213 states have return successors, (406), 288 states have call predecessors, (406), 292 states have call successors, (406) [2024-11-14 05:01:54,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 2127 states and 2790 transitions. [2024-11-14 05:01:54,534 INFO L78 Accepts]: Start accepts. Automaton has 2127 states and 2790 transitions. Word has length 105 [2024-11-14 05:01:54,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:01:54,534 INFO L471 AbstractCegarLoop]: Abstraction has 2127 states and 2790 transitions. [2024-11-14 05:01:54,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-14 05:01:54,535 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 2790 transitions. [2024-11-14 05:01:54,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-14 05:01:54,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:01:54,542 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:01:54,563 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-14 05:01:54,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-14 05:01:54,743 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:01:54,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:01:54,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1803303000, now seen corresponding path program 2 times [2024-11-14 05:01:54,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:01:54,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308637914] [2024-11-14 05:01:54,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:01:54,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:01:54,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:01:54,934 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-14 05:01:54,935 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:01:54,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308637914] [2024-11-14 05:01:54,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308637914] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:01:54,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162313181] [2024-11-14 05:01:54,935 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:01:54,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:01:54,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:01:54,937 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:01:54,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 05:01:55,064 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 05:01:55,064 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:01:55,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:01:55,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:01:55,120 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-14 05:01:55,120 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:01:55,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162313181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:01:55,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:01:55,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-14 05:01:55,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005033962] [2024-11-14 05:01:55,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:01:55,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:01:55,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:01:55,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:01:55,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:01:55,122 INFO L87 Difference]: Start difference. First operand 2127 states and 2790 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-14 05:01:55,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:01:55,427 INFO L93 Difference]: Finished difference Result 3596 states and 4909 transitions. [2024-11-14 05:01:55,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:01:55,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 105 [2024-11-14 05:01:55,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:01:55,442 INFO L225 Difference]: With dead ends: 3596 [2024-11-14 05:01:55,442 INFO L226 Difference]: Without dead ends: 2137 [2024-11-14 05:01:55,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:01:55,449 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 85 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:01:55,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 224 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:01:55,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2137 states. [2024-11-14 05:01:55,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2137 to 2121. [2024-11-14 05:01:55,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2121 states, 1615 states have (on average 1.256965944272446) internal successors, (2030), 1634 states have internal predecessors, (2030), 292 states have call successors, (292), 199 states have call predecessors, (292), 213 states have return successors, (406), 288 states have call predecessors, (406), 292 states have call successors, (406) [2024-11-14 05:01:55,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 2728 transitions. [2024-11-14 05:01:55,763 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 2728 transitions. Word has length 105 [2024-11-14 05:01:55,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:01:55,764 INFO L471 AbstractCegarLoop]: Abstraction has 2121 states and 2728 transitions. [2024-11-14 05:01:55,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-14 05:01:55,764 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 2728 transitions. [2024-11-14 05:01:55,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-14 05:01:55,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:01:55,772 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:01:55,794 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-14 05:01:55,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-14 05:01:55,976 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:01:55,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:01:55,977 INFO L85 PathProgramCache]: Analyzing trace with hash 445288648, now seen corresponding path program 1 times [2024-11-14 05:01:55,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:01:55,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662646087] [2024-11-14 05:01:55,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:01:55,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:01:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:01:56,179 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-14 05:01:56,180 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:01:56,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662646087] [2024-11-14 05:01:56,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662646087] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:01:56,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534092325] [2024-11-14 05:01:56,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:01:56,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:01:56,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:01:56,182 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:01:56,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 05:01:56,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:01:56,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:01:56,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:01:56,389 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 05:01:56,390 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:01:56,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534092325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:01:56,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:01:56,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-14 05:01:56,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870785926] [2024-11-14 05:01:56,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:01:56,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:01:56,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:01:56,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:01:56,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:01:56,395 INFO L87 Difference]: Start difference. First operand 2121 states and 2728 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-14 05:01:56,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:01:56,754 INFO L93 Difference]: Finished difference Result 4083 states and 5403 transitions. [2024-11-14 05:01:56,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:01:56,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 105 [2024-11-14 05:01:56,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:01:56,772 INFO L225 Difference]: With dead ends: 4083 [2024-11-14 05:01:56,772 INFO L226 Difference]: Without dead ends: 2547 [2024-11-14 05:01:56,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:01:56,778 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 77 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:01:56,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 236 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:01:56,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2547 states. [2024-11-14 05:01:57,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2547 to 2485. [2024-11-14 05:01:57,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2485 states, 1905 states have (on average 1.2430446194225722) internal successors, (2368), 1927 states have internal predecessors, (2368), 335 states have call successors, (335), 232 states have call predecessors, (335), 244 states have return successors, (484), 326 states have call predecessors, (484), 335 states have call successors, (484) [2024-11-14 05:01:57,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2485 states to 2485 states and 3187 transitions. [2024-11-14 05:01:57,089 INFO L78 Accepts]: Start accepts. Automaton has 2485 states and 3187 transitions. Word has length 105 [2024-11-14 05:01:57,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:01:57,090 INFO L471 AbstractCegarLoop]: Abstraction has 2485 states and 3187 transitions. [2024-11-14 05:01:57,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-14 05:01:57,091 INFO L276 IsEmpty]: Start isEmpty. Operand 2485 states and 3187 transitions. [2024-11-14 05:01:57,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-14 05:01:57,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:01:57,098 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:01:57,118 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-14 05:01:57,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:01:57,299 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:01:57,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:01:57,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1161822752, now seen corresponding path program 1 times [2024-11-14 05:01:57,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:01:57,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133695223] [2024-11-14 05:01:57,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:01:57,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:01:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:01:57,499 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-14 05:01:57,499 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:01:57,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133695223] [2024-11-14 05:01:57,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133695223] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:01:57,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519509299] [2024-11-14 05:01:57,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:01:57,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:01:57,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:01:57,502 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:01:57,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 05:01:57,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:01:57,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:01:57,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:01:57,671 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-14 05:01:57,671 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:01:57,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519509299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:01:57,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:01:57,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-14 05:01:57,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307455992] [2024-11-14 05:01:57,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:01:57,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:01:57,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:01:57,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:01:57,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:01:57,673 INFO L87 Difference]: Start difference. First operand 2485 states and 3187 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-14 05:01:57,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:01:57,960 INFO L93 Difference]: Finished difference Result 3544 states and 4576 transitions. [2024-11-14 05:01:57,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:01:57,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 107 [2024-11-14 05:01:57,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:01:57,976 INFO L225 Difference]: With dead ends: 3544 [2024-11-14 05:01:57,976 INFO L226 Difference]: Without dead ends: 2418 [2024-11-14 05:01:57,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:01:57,981 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 16 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:01:57,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 186 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:01:57,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2418 states. [2024-11-14 05:01:58,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2418 to 2418. [2024-11-14 05:01:58,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2418 states, 1850 states have (on average 1.2416216216216216) internal successors, (2297), 1869 states have internal predecessors, (2297), 335 states have call successors, (335), 232 states have call predecessors, (335), 232 states have return successors, (466), 317 states have call predecessors, (466), 335 states have call successors, (466) [2024-11-14 05:01:58,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 3098 transitions. [2024-11-14 05:01:58,273 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 3098 transitions. Word has length 107 [2024-11-14 05:01:58,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:01:58,273 INFO L471 AbstractCegarLoop]: Abstraction has 2418 states and 3098 transitions. [2024-11-14 05:01:58,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-14 05:01:58,274 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 3098 transitions. [2024-11-14 05:01:58,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-14 05:01:58,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:01:58,279 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:01:58,300 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-14 05:01:58,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:01:58,480 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:01:58,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:01:58,480 INFO L85 PathProgramCache]: Analyzing trace with hash -2021344472, now seen corresponding path program 1 times [2024-11-14 05:01:58,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:01:58,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460593212] [2024-11-14 05:01:58,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:01:58,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:01:58,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:01:58,656 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-14 05:01:58,656 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:01:58,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460593212] [2024-11-14 05:01:58,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460593212] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:01:58,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546734586] [2024-11-14 05:01:58,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:01:58,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:01:58,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:01:58,660 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:01:58,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-14 05:01:58,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:01:58,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:01:58,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:01:58,847 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-14 05:01:58,848 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:01:58,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546734586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:01:58,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:01:58,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-14 05:01:58,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985628746] [2024-11-14 05:01:58,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:01:58,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:01:58,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:01:58,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:01:58,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:01:58,850 INFO L87 Difference]: Start difference. First operand 2418 states and 3098 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-14 05:01:59,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:01:59,457 INFO L93 Difference]: Finished difference Result 5702 states and 7345 transitions. [2024-11-14 05:01:59,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:01:59,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 108 [2024-11-14 05:01:59,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:01:59,480 INFO L225 Difference]: With dead ends: 5702 [2024-11-14 05:01:59,480 INFO L226 Difference]: Without dead ends: 3330 [2024-11-14 05:01:59,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:01:59,489 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 41 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:01:59,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 187 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:01:59,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3330 states. [2024-11-14 05:01:59,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3330 to 2693. [2024-11-14 05:01:59,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2693 states, 2083 states have (on average 1.2467594815170426) internal successors, (2597), 2103 states have internal predecessors, (2597), 356 states have call successors, (356), 253 states have call predecessors, (356), 253 states have return successors, (487), 337 states have call predecessors, (487), 356 states have call successors, (487) [2024-11-14 05:01:59,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2693 states to 2693 states and 3440 transitions. [2024-11-14 05:01:59,881 INFO L78 Accepts]: Start accepts. Automaton has 2693 states and 3440 transitions. Word has length 108 [2024-11-14 05:01:59,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:01:59,883 INFO L471 AbstractCegarLoop]: Abstraction has 2693 states and 3440 transitions. [2024-11-14 05:01:59,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-14 05:01:59,884 INFO L276 IsEmpty]: Start isEmpty. Operand 2693 states and 3440 transitions. [2024-11-14 05:01:59,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-14 05:01:59,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:01:59,890 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:01:59,910 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-14 05:02:00,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:02:00,094 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:02:00,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:02:00,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1003542790, now seen corresponding path program 1 times [2024-11-14 05:02:00,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:02:00,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242421833] [2024-11-14 05:02:00,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:02:00,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:02:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:02:00,249 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 26 proven. 11 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-14 05:02:00,249 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:02:00,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242421833] [2024-11-14 05:02:00,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242421833] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:02:00,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867010362] [2024-11-14 05:02:00,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:02:00,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:02:00,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:02:00,254 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:02:00,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-14 05:02:00,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:02:00,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 05:02:00,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:02:00,463 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:02:00,464 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:02:00,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867010362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:02:00,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:02:00,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2024-11-14 05:02:00,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446167936] [2024-11-14 05:02:00,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:02:00,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:02:00,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:02:00,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:02:00,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:02:00,466 INFO L87 Difference]: Start difference. First operand 2693 states and 3440 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-14 05:02:00,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:02:00,804 INFO L93 Difference]: Finished difference Result 4916 states and 6433 transitions. [2024-11-14 05:02:00,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:02:00,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 110 [2024-11-14 05:02:00,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:02:00,823 INFO L225 Difference]: With dead ends: 4916 [2024-11-14 05:02:00,827 INFO L226 Difference]: Without dead ends: 3075 [2024-11-14 05:02:00,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:02:00,834 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 64 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:02:00,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 133 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:02:00,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3075 states. [2024-11-14 05:02:01,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3075 to 3031. [2024-11-14 05:02:01,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3031 states, 2389 states have (on average 1.222687316868983) internal successors, (2921), 2409 states have internal predecessors, (2921), 358 states have call successors, (358), 283 states have call predecessors, (358), 283 states have return successors, (535), 339 states have call predecessors, (535), 358 states have call successors, (535) [2024-11-14 05:02:01,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3031 states to 3031 states and 3814 transitions. [2024-11-14 05:02:01,207 INFO L78 Accepts]: Start accepts. Automaton has 3031 states and 3814 transitions. Word has length 110 [2024-11-14 05:02:01,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:02:01,207 INFO L471 AbstractCegarLoop]: Abstraction has 3031 states and 3814 transitions. [2024-11-14 05:02:01,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-14 05:02:01,209 INFO L276 IsEmpty]: Start isEmpty. Operand 3031 states and 3814 transitions. [2024-11-14 05:02:01,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-14 05:02:01,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:02:01,217 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:02:01,237 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-14 05:02:01,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-14 05:02:01,418 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:02:01,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:02:01,418 INFO L85 PathProgramCache]: Analyzing trace with hash -802398267, now seen corresponding path program 1 times [2024-11-14 05:02:01,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:02:01,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235412864] [2024-11-14 05:02:01,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:02:01,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:02:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:02:01,503 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-14 05:02:01,503 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:02:01,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235412864] [2024-11-14 05:02:01,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235412864] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:02:01,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869333511] [2024-11-14 05:02:01,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:02:01,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:02:01,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:02:01,506 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:02:01,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-14 05:02:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:02:01,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-14 05:02:01,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:02:01,682 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-14 05:02:01,683 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:02:01,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869333511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:02:01,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:02:01,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-14 05:02:01,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76156960] [2024-11-14 05:02:01,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:02:01,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:02:01,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:02:01,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:02:01,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:02:01,685 INFO L87 Difference]: Start difference. First operand 3031 states and 3814 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-14 05:02:02,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:02:02,090 INFO L93 Difference]: Finished difference Result 4738 states and 5933 transitions. [2024-11-14 05:02:02,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:02:02,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 106 [2024-11-14 05:02:02,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:02:02,112 INFO L225 Difference]: With dead ends: 4738 [2024-11-14 05:02:02,112 INFO L226 Difference]: Without dead ends: 3429 [2024-11-14 05:02:02,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:02:02,117 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 43 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:02:02,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 226 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:02:02,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3429 states. [2024-11-14 05:02:02,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3429 to 3219. [2024-11-14 05:02:02,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3219 states, 2545 states have (on average 1.2263261296660117) internal successors, (3121), 2565 states have internal predecessors, (3121), 374 states have call successors, (374), 299 states have call predecessors, (374), 299 states have return successors, (551), 355 states have call predecessors, (551), 374 states have call successors, (551) [2024-11-14 05:02:02,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3219 states to 3219 states and 4046 transitions. [2024-11-14 05:02:02,566 INFO L78 Accepts]: Start accepts. Automaton has 3219 states and 4046 transitions. Word has length 106 [2024-11-14 05:02:02,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:02:02,566 INFO L471 AbstractCegarLoop]: Abstraction has 3219 states and 4046 transitions. [2024-11-14 05:02:02,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-14 05:02:02,567 INFO L276 IsEmpty]: Start isEmpty. Operand 3219 states and 4046 transitions. [2024-11-14 05:02:02,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-14 05:02:02,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:02:02,575 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:02:02,596 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-14 05:02:02,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-14 05:02:02,777 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:02:02,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:02:02,777 INFO L85 PathProgramCache]: Analyzing trace with hash -841303771, now seen corresponding path program 1 times [2024-11-14 05:02:02,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:02:02,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542583048] [2024-11-14 05:02:02,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:02:02,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:02:02,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:02:03,359 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 13 proven. 34 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-14 05:02:03,359 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:02:03,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542583048] [2024-11-14 05:02:03,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542583048] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:02:03,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392649] [2024-11-14 05:02:03,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:02:03,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:02:03,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:02:03,362 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:02:03,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-14 05:02:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:02:03,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 05:02:03,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:02:03,655 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-14 05:02:03,655 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:02:03,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:02:03,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:02:03,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 18 [2024-11-14 05:02:03,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739448804] [2024-11-14 05:02:03,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:02:03,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:02:03,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:02:03,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:02:03,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-14 05:02:03,658 INFO L87 Difference]: Start difference. First operand 3219 states and 4046 transitions. Second operand has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-14 05:02:04,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:02:04,171 INFO L93 Difference]: Finished difference Result 5957 states and 7552 transitions. [2024-11-14 05:02:04,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:02:04,172 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 112 [2024-11-14 05:02:04,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:02:04,191 INFO L225 Difference]: With dead ends: 5957 [2024-11-14 05:02:04,192 INFO L226 Difference]: Without dead ends: 3131 [2024-11-14 05:02:04,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2024-11-14 05:02:04,199 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 60 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:02:04,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 598 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:02:04,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3131 states. [2024-11-14 05:02:04,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3131 to 2910. [2024-11-14 05:02:04,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2910 states, 2304 states have (on average 1.2213541666666667) internal successors, (2814), 2319 states have internal predecessors, (2814), 336 states have call successors, (336), 269 states have call predecessors, (336), 269 states have return successors, (483), 322 states have call predecessors, (483), 336 states have call successors, (483) [2024-11-14 05:02:04,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2910 states and 3633 transitions. [2024-11-14 05:02:04,578 INFO L78 Accepts]: Start accepts. Automaton has 2910 states and 3633 transitions. Word has length 112 [2024-11-14 05:02:04,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:02:04,579 INFO L471 AbstractCegarLoop]: Abstraction has 2910 states and 3633 transitions. [2024-11-14 05:02:04,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-14 05:02:04,579 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 3633 transitions. [2024-11-14 05:02:04,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-14 05:02:04,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:02:04,584 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:02:04,605 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-14 05:02:04,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:02:04,788 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:02:04,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:02:04,789 INFO L85 PathProgramCache]: Analyzing trace with hash 949043780, now seen corresponding path program 1 times [2024-11-14 05:02:04,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:02:04,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747399359] [2024-11-14 05:02:04,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:02:04,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:02:04,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:02:04,957 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 36 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-14 05:02:04,957 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:02:04,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747399359] [2024-11-14 05:02:04,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747399359] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:02:04,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780381412] [2024-11-14 05:02:04,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:02:04,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:02:04,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:02:04,959 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:02:04,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-14 05:02:05,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:02:05,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 05:02:05,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:02:05,210 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 05:02:05,210 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:02:05,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780381412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:02:05,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:02:05,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-14 05:02:05,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453141023] [2024-11-14 05:02:05,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:02:05,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:02:05,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:02:05,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:02:05,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:02:05,212 INFO L87 Difference]: Start difference. First operand 2910 states and 3633 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-14 05:02:05,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:02:05,816 INFO L93 Difference]: Finished difference Result 6116 states and 7682 transitions. [2024-11-14 05:02:05,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:02:05,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 108 [2024-11-14 05:02:05,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:02:05,835 INFO L225 Difference]: With dead ends: 6116 [2024-11-14 05:02:05,835 INFO L226 Difference]: Without dead ends: 3656 [2024-11-14 05:02:05,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:02:05,842 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 112 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:02:05,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 254 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:02:05,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3656 states. [2024-11-14 05:02:06,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3656 to 3276. [2024-11-14 05:02:06,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3276 states, 2628 states have (on average 1.2050989345509893) internal successors, (3167), 2650 states have internal predecessors, (3167), 347 states have call successors, (347), 296 states have call predecessors, (347), 300 states have return successors, (505), 330 states have call predecessors, (505), 347 states have call successors, (505) [2024-11-14 05:02:06,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3276 states to 3276 states and 4019 transitions. [2024-11-14 05:02:06,217 INFO L78 Accepts]: Start accepts. Automaton has 3276 states and 4019 transitions. Word has length 108 [2024-11-14 05:02:06,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:02:06,218 INFO L471 AbstractCegarLoop]: Abstraction has 3276 states and 4019 transitions. [2024-11-14 05:02:06,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-14 05:02:06,218 INFO L276 IsEmpty]: Start isEmpty. Operand 3276 states and 4019 transitions. [2024-11-14 05:02:06,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-14 05:02:06,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:02:06,223 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:02:06,244 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-14 05:02:06,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:02:06,424 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:02:06,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:02:06,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1663274549, now seen corresponding path program 1 times [2024-11-14 05:02:06,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:02:06,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731664809] [2024-11-14 05:02:06,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:02:06,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:02:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:02:06,571 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 39 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-14 05:02:06,572 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:02:06,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731664809] [2024-11-14 05:02:06,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731664809] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:02:06,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166671944] [2024-11-14 05:02:06,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:02:06,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:02:06,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:02:06,574 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:02:06,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-14 05:02:06,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:02:06,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-14 05:02:06,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:02:06,780 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:02:06,780 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:02:06,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166671944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:02:06,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:02:06,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2024-11-14 05:02:06,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549332538] [2024-11-14 05:02:06,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:02:06,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:02:06,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:02:06,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:02:06,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:02:06,782 INFO L87 Difference]: Start difference. First operand 3276 states and 4019 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-14 05:02:07,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:02:07,502 INFO L93 Difference]: Finished difference Result 6922 states and 8592 transitions. [2024-11-14 05:02:07,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:02:07,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 109 [2024-11-14 05:02:07,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:02:07,526 INFO L225 Difference]: With dead ends: 6922 [2024-11-14 05:02:07,526 INFO L226 Difference]: Without dead ends: 4354 [2024-11-14 05:02:07,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:02:07,533 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 71 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:02:07,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 323 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:02:07,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4354 states. [2024-11-14 05:02:08,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4354 to 4125. [2024-11-14 05:02:08,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4125 states, 3294 states have (on average 1.1982392228293868) internal successors, (3947), 3324 states have internal predecessors, (3947), 446 states have call successors, (446), 377 states have call predecessors, (446), 384 states have return successors, (690), 424 states have call predecessors, (690), 446 states have call successors, (690) [2024-11-14 05:02:08,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4125 states to 4125 states and 5083 transitions. [2024-11-14 05:02:08,207 INFO L78 Accepts]: Start accepts. Automaton has 4125 states and 5083 transitions. Word has length 109 [2024-11-14 05:02:08,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:02:08,208 INFO L471 AbstractCegarLoop]: Abstraction has 4125 states and 5083 transitions. [2024-11-14 05:02:08,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-14 05:02:08,208 INFO L276 IsEmpty]: Start isEmpty. Operand 4125 states and 5083 transitions. [2024-11-14 05:02:08,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-14 05:02:08,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:02:08,215 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:02:08,235 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-14 05:02:08,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:02:08,416 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:02:08,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:02:08,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1894382074, now seen corresponding path program 1 times [2024-11-14 05:02:08,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:02:08,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621909965] [2024-11-14 05:02:08,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:02:08,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:02:08,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:02:08,606 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-14 05:02:08,606 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:02:08,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621909965] [2024-11-14 05:02:08,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621909965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:02:08,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:02:08,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:02:08,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813673879] [2024-11-14 05:02:08,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:02:08,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:02:08,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:02:08,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:02:08,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:02:08,609 INFO L87 Difference]: Start difference. First operand 4125 states and 5083 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-14 05:02:09,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:02:09,754 INFO L93 Difference]: Finished difference Result 10141 states and 12567 transitions. [2024-11-14 05:02:09,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:02:09,754 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 109 [2024-11-14 05:02:09,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:02:09,781 INFO L225 Difference]: With dead ends: 10141 [2024-11-14 05:02:09,782 INFO L226 Difference]: Without dead ends: 5282 [2024-11-14 05:02:09,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:02:09,793 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 67 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:02:09,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 364 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:02:09,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5282 states. [2024-11-14 05:02:10,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5282 to 5137. [2024-11-14 05:02:10,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5137 states, 4057 states have (on average 1.1838797140744393) internal successors, (4803), 4095 states have internal predecessors, (4803), 584 states have call successors, (584), 487 states have call predecessors, (584), 495 states have return successors, (908), 555 states have call predecessors, (908), 584 states have call successors, (908) [2024-11-14 05:02:10,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5137 states to 5137 states and 6295 transitions. [2024-11-14 05:02:10,501 INFO L78 Accepts]: Start accepts. Automaton has 5137 states and 6295 transitions. Word has length 109 [2024-11-14 05:02:10,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:02:10,502 INFO L471 AbstractCegarLoop]: Abstraction has 5137 states and 6295 transitions. [2024-11-14 05:02:10,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-14 05:02:10,502 INFO L276 IsEmpty]: Start isEmpty. Operand 5137 states and 6295 transitions. [2024-11-14 05:02:10,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-14 05:02:10,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:02:10,508 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:02:10,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-14 05:02:10,508 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:02:10,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:02:10,509 INFO L85 PathProgramCache]: Analyzing trace with hash -986558, now seen corresponding path program 1 times [2024-11-14 05:02:10,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:02:10,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654671986] [2024-11-14 05:02:10,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:02:10,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:02:10,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:02:10,924 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 13 proven. 34 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-14 05:02:10,925 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:02:10,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654671986] [2024-11-14 05:02:10,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654671986] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:02:10,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71113965] [2024-11-14 05:02:10,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:02:10,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:02:10,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:02:10,928 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:02:10,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-14 05:02:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:02:11,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 05:02:11,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:02:11,232 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-14 05:02:11,232 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:02:11,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71113965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:02:11,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:02:11,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 19 [2024-11-14 05:02:11,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443130725] [2024-11-14 05:02:11,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:02:11,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 05:02:11,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:02:11,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 05:02:11,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-11-14 05:02:11,234 INFO L87 Difference]: Start difference. First operand 5137 states and 6295 transitions. Second operand has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-14 05:02:11,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:02:11,949 INFO L93 Difference]: Finished difference Result 8015 states and 9733 transitions. [2024-11-14 05:02:11,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 05:02:11,950 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 115 [2024-11-14 05:02:11,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:02:11,978 INFO L225 Difference]: With dead ends: 8015 [2024-11-14 05:02:11,978 INFO L226 Difference]: Without dead ends: 5266 [2024-11-14 05:02:11,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2024-11-14 05:02:11,985 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 69 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:02:11,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 643 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:02:11,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5266 states. [2024-11-14 05:02:12,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5266 to 5178. [2024-11-14 05:02:12,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5178 states, 4092 states have (on average 1.1837732160312806) internal successors, (4844), 4130 states have internal predecessors, (4844), 587 states have call successors, (587), 490 states have call predecessors, (587), 498 states have return successors, (911), 558 states have call predecessors, (911), 587 states have call successors, (911) [2024-11-14 05:02:12,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5178 states to 5178 states and 6342 transitions. [2024-11-14 05:02:12,629 INFO L78 Accepts]: Start accepts. Automaton has 5178 states and 6342 transitions. Word has length 115 [2024-11-14 05:02:12,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:02:12,629 INFO L471 AbstractCegarLoop]: Abstraction has 5178 states and 6342 transitions. [2024-11-14 05:02:12,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-14 05:02:12,630 INFO L276 IsEmpty]: Start isEmpty. Operand 5178 states and 6342 transitions. [2024-11-14 05:02:12,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-14 05:02:12,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:02:12,636 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:02:12,657 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-14 05:02:12,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:02:12,840 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:02:12,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:02:12,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1990979012, now seen corresponding path program 1 times [2024-11-14 05:02:12,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:02:12,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455106273] [2024-11-14 05:02:12,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:02:12,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:02:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:02:13,608 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 21 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-14 05:02:13,608 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:02:13,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455106273] [2024-11-14 05:02:13,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455106273] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:02:13,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248518339] [2024-11-14 05:02:13,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:02:13,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:02:13,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:02:13,611 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:02:13,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-14 05:02:13,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:02:13,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-14 05:02:13,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:02:14,271 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-14 05:02:14,272 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:02:14,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248518339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:02:14,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:02:14,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [18] total 25 [2024-11-14 05:02:14,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851808208] [2024-11-14 05:02:14,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:02:14,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 05:02:14,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:02:14,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 05:02:14,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2024-11-14 05:02:14,275 INFO L87 Difference]: Start difference. First operand 5178 states and 6342 transitions. Second operand has 9 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-14 05:02:15,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:02:15,696 INFO L93 Difference]: Finished difference Result 8241 states and 9989 transitions. [2024-11-14 05:02:15,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 05:02:15,696 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 117 [2024-11-14 05:02:15,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:02:15,720 INFO L225 Difference]: With dead ends: 8241 [2024-11-14 05:02:15,720 INFO L226 Difference]: Without dead ends: 3907 [2024-11-14 05:02:15,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=868, Unknown=0, NotChecked=0, Total=992 [2024-11-14 05:02:15,731 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 255 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:02:15,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 292 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 05:02:15,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3907 states. [2024-11-14 05:02:16,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3907 to 3002. [2024-11-14 05:02:16,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3002 states, 2350 states have (on average 1.1548936170212767) internal successors, (2714), 2364 states have internal predecessors, (2714), 356 states have call successors, (356), 289 states have call predecessors, (356), 295 states have return successors, (434), 349 states have call predecessors, (434), 356 states have call successors, (434) [2024-11-14 05:02:16,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3002 states to 3002 states and 3504 transitions. [2024-11-14 05:02:16,220 INFO L78 Accepts]: Start accepts. Automaton has 3002 states and 3504 transitions. Word has length 117 [2024-11-14 05:02:16,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:02:16,220 INFO L471 AbstractCegarLoop]: Abstraction has 3002 states and 3504 transitions. [2024-11-14 05:02:16,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-14 05:02:16,221 INFO L276 IsEmpty]: Start isEmpty. Operand 3002 states and 3504 transitions. [2024-11-14 05:02:16,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-14 05:02:16,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:02:16,225 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:02:16,246 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-14 05:02:16,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:02:16,426 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:02:16,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:02:16,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1346349796, now seen corresponding path program 1 times [2024-11-14 05:02:16,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:02:16,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824874757] [2024-11-14 05:02:16,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:02:16,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:02:16,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:02:17,083 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-14 05:02:17,084 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:02:17,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824874757] [2024-11-14 05:02:17,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824874757] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:02:17,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517902863] [2024-11-14 05:02:17,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:02:17,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:02:17,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:02:17,088 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:02:17,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-14 05:02:17,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:02:17,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-14 05:02:17,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:02:17,559 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-14 05:02:17,560 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:02:17,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517902863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:02:17,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:02:17,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [18] total 22 [2024-11-14 05:02:17,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198384486] [2024-11-14 05:02:17,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:02:17,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 05:02:17,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:02:17,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 05:02:17,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2024-11-14 05:02:17,562 INFO L87 Difference]: Start difference. First operand 3002 states and 3504 transitions. Second operand has 9 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-14 05:02:18,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:02:18,580 INFO L93 Difference]: Finished difference Result 6346 states and 7392 transitions. [2024-11-14 05:02:18,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 05:02:18,581 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 118 [2024-11-14 05:02:18,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:02:18,599 INFO L225 Difference]: With dead ends: 6346 [2024-11-14 05:02:18,599 INFO L226 Difference]: Without dead ends: 3833 [2024-11-14 05:02:18,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2024-11-14 05:02:18,607 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 368 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:02:18,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 253 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 05:02:18,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3833 states. [2024-11-14 05:02:19,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3833 to 3194. [2024-11-14 05:02:19,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3194 states, 2496 states have (on average 1.1498397435897436) internal successors, (2870), 2510 states have internal predecessors, (2870), 380 states have call successors, (380), 309 states have call predecessors, (380), 317 states have return successors, (438), 375 states have call predecessors, (438), 380 states have call successors, (438) [2024-11-14 05:02:19,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3194 states to 3194 states and 3688 transitions. [2024-11-14 05:02:19,171 INFO L78 Accepts]: Start accepts. Automaton has 3194 states and 3688 transitions. Word has length 118 [2024-11-14 05:02:19,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:02:19,173 INFO L471 AbstractCegarLoop]: Abstraction has 3194 states and 3688 transitions. [2024-11-14 05:02:19,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-14 05:02:19,173 INFO L276 IsEmpty]: Start isEmpty. Operand 3194 states and 3688 transitions. [2024-11-14 05:02:19,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-14 05:02:19,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:02:19,177 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:02:19,198 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-14 05:02:19,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-14 05:02:19,382 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:02:19,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:02:19,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1685005505, now seen corresponding path program 1 times [2024-11-14 05:02:19,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:02:19,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298703159] [2024-11-14 05:02:19,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:02:19,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:02:19,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:02:19,601 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-14 05:02:19,601 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:02:19,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298703159] [2024-11-14 05:02:19,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298703159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:02:19,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:02:19,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:02:19,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315825048] [2024-11-14 05:02:19,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:02:19,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:02:19,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:02:19,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:02:19,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:02:19,604 INFO L87 Difference]: Start difference. First operand 3194 states and 3688 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-14 05:02:21,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:02:21,132 INFO L93 Difference]: Finished difference Result 9640 states and 11141 transitions. [2024-11-14 05:02:21,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:02:21,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 133 [2024-11-14 05:02:21,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:02:21,163 INFO L225 Difference]: With dead ends: 9640 [2024-11-14 05:02:21,163 INFO L226 Difference]: Without dead ends: 7761 [2024-11-14 05:02:21,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:02:21,169 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 238 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:02:21,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 544 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:02:21,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7761 states. [2024-11-14 05:02:22,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7761 to 5641. [2024-11-14 05:02:22,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5641 states, 4396 states have (on average 1.1583257506824385) internal successors, (5092), 4413 states have internal predecessors, (5092), 682 states have call successors, (682), 549 states have call predecessors, (682), 562 states have return successors, (772), 679 states have call predecessors, (772), 682 states have call successors, (772) [2024-11-14 05:02:22,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5641 states to 5641 states and 6546 transitions. [2024-11-14 05:02:22,173 INFO L78 Accepts]: Start accepts. Automaton has 5641 states and 6546 transitions. Word has length 133 [2024-11-14 05:02:22,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:02:22,173 INFO L471 AbstractCegarLoop]: Abstraction has 5641 states and 6546 transitions. [2024-11-14 05:02:22,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-14 05:02:22,174 INFO L276 IsEmpty]: Start isEmpty. Operand 5641 states and 6546 transitions. [2024-11-14 05:02:22,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-14 05:02:22,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:02:22,180 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:02:22,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-14 05:02:22,180 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:02:22,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:02:22,181 INFO L85 PathProgramCache]: Analyzing trace with hash -269579828, now seen corresponding path program 1 times [2024-11-14 05:02:22,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:02:22,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33738829] [2024-11-14 05:02:22,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:02:22,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:02:22,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:02:22,321 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 67 proven. 43 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-14 05:02:22,321 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:02:22,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33738829] [2024-11-14 05:02:22,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33738829] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:02:22,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821879096] [2024-11-14 05:02:22,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:02:22,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:02:22,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:02:22,324 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:02:22,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-14 05:02:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:02:22,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:02:22,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:02:22,534 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-11-14 05:02:22,534 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:02:22,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821879096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:02:22,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:02:22,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2024-11-14 05:02:22,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397923827] [2024-11-14 05:02:22,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:02:22,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:02:22,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:02:22,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:02:22,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:02:22,536 INFO L87 Difference]: Start difference. First operand 5641 states and 6546 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-14 05:02:23,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:02:23,176 INFO L93 Difference]: Finished difference Result 8606 states and 9988 transitions. [2024-11-14 05:02:23,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:02:23,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 165 [2024-11-14 05:02:23,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:02:23,198 INFO L225 Difference]: With dead ends: 8606 [2024-11-14 05:02:23,198 INFO L226 Difference]: Without dead ends: 4414 [2024-11-14 05:02:23,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:02:23,207 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 83 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:02:23,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 375 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:02:23,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4414 states. [2024-11-14 05:02:23,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4414 to 4333. [2024-11-14 05:02:23,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4333 states, 3394 states have (on average 1.1499705362404242) internal successors, (3903), 3410 states have internal predecessors, (3903), 509 states have call successors, (509), 412 states have call predecessors, (509), 429 states have return successors, (575), 511 states have call predecessors, (575), 509 states have call successors, (575) [2024-11-14 05:02:24,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4333 states to 4333 states and 4987 transitions. [2024-11-14 05:02:24,015 INFO L78 Accepts]: Start accepts. Automaton has 4333 states and 4987 transitions. Word has length 165 [2024-11-14 05:02:24,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:02:24,016 INFO L471 AbstractCegarLoop]: Abstraction has 4333 states and 4987 transitions. [2024-11-14 05:02:24,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-14 05:02:24,016 INFO L276 IsEmpty]: Start isEmpty. Operand 4333 states and 4987 transitions. [2024-11-14 05:02:24,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-14 05:02:24,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:02:24,021 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:02:24,042 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-14 05:02:24,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:02:24,222 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:02:24,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:02:24,227 INFO L85 PathProgramCache]: Analyzing trace with hash 984699628, now seen corresponding path program 2 times [2024-11-14 05:02:24,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:02:24,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248116058] [2024-11-14 05:02:24,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:02:24,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:02:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:02:24,295 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2024-11-14 05:02:24,295 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:02:24,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248116058] [2024-11-14 05:02:24,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248116058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:02:24,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:02:24,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:02:24,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613348132] [2024-11-14 05:02:24,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:02:24,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:02:24,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:02:24,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:02:24,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:02:24,298 INFO L87 Difference]: Start difference. First operand 4333 states and 4987 transitions. Second operand has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 3 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-14 05:02:25,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:02:25,223 INFO L93 Difference]: Finished difference Result 7190 states and 8304 transitions. [2024-11-14 05:02:25,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:02:25,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 3 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 166 [2024-11-14 05:02:25,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:02:25,247 INFO L225 Difference]: With dead ends: 7190 [2024-11-14 05:02:25,248 INFO L226 Difference]: Without dead ends: 4359 [2024-11-14 05:02:25,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:02:25,254 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 109 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:02:25,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 218 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:02:25,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4359 states. [2024-11-14 05:02:25,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4359 to 4097. [2024-11-14 05:02:25,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4097 states, 3210 states have (on average 1.149221183800623) internal successors, (3689), 3219 states have internal predecessors, (3689), 491 states have call successors, (491), 394 states have call predecessors, (491), 395 states have return successors, (535), 484 states have call predecessors, (535), 491 states have call successors, (535) [2024-11-14 05:02:25,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4097 states to 4097 states and 4715 transitions. [2024-11-14 05:02:26,009 INFO L78 Accepts]: Start accepts. Automaton has 4097 states and 4715 transitions. Word has length 166 [2024-11-14 05:02:26,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:02:26,010 INFO L471 AbstractCegarLoop]: Abstraction has 4097 states and 4715 transitions. [2024-11-14 05:02:26,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 3 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-14 05:02:26,010 INFO L276 IsEmpty]: Start isEmpty. Operand 4097 states and 4715 transitions. [2024-11-14 05:02:26,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-14 05:02:26,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:02:26,015 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:02:26,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-14 05:02:26,015 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:02:26,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:02:26,016 INFO L85 PathProgramCache]: Analyzing trace with hash -335831768, now seen corresponding path program 1 times [2024-11-14 05:02:26,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:02:26,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614908327] [2024-11-14 05:02:26,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:02:26,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:02:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:02:26,144 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 71 proven. 43 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-14 05:02:26,145 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:02:26,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614908327] [2024-11-14 05:02:26,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614908327] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:02:26,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492095944] [2024-11-14 05:02:26,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:02:26,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:02:26,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:02:26,147 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:02:26,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-14 05:02:26,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:02:26,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:02:26,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:02:26,348 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-14 05:02:26,349 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:02:26,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492095944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:02:26,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:02:26,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-14 05:02:26,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105615459] [2024-11-14 05:02:26,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:02:26,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:02:26,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:02:26,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:02:26,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:02:26,351 INFO L87 Difference]: Start difference. First operand 4097 states and 4715 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-14 05:02:27,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:02:27,385 INFO L93 Difference]: Finished difference Result 9306 states and 10621 transitions. [2024-11-14 05:02:27,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:02:27,386 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 167 [2024-11-14 05:02:27,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:02:27,406 INFO L225 Difference]: With dead ends: 9306 [2024-11-14 05:02:27,407 INFO L226 Difference]: Without dead ends: 5268 [2024-11-14 05:02:27,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:02:27,414 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 64 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:02:27,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 390 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:02:27,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5268 states. [2024-11-14 05:02:28,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5268 to 5266. [2024-11-14 05:02:28,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5266 states, 4079 states have (on average 1.1149791615592057) internal successors, (4548), 4088 states have internal predecessors, (4548), 661 states have call successors, (661), 524 states have call predecessors, (661), 525 states have return successors, (705), 654 states have call predecessors, (705), 661 states have call successors, (705) [2024-11-14 05:02:28,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5266 states to 5266 states and 5914 transitions. [2024-11-14 05:02:28,193 INFO L78 Accepts]: Start accepts. Automaton has 5266 states and 5914 transitions. Word has length 167 [2024-11-14 05:02:28,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:02:28,193 INFO L471 AbstractCegarLoop]: Abstraction has 5266 states and 5914 transitions. [2024-11-14 05:02:28,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-14 05:02:28,194 INFO L276 IsEmpty]: Start isEmpty. Operand 5266 states and 5914 transitions. [2024-11-14 05:02:28,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-14 05:02:28,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:02:28,197 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:02:28,211 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-14 05:02:28,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-14 05:02:28,398 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:02:28,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:02:28,398 INFO L85 PathProgramCache]: Analyzing trace with hash -354760426, now seen corresponding path program 1 times [2024-11-14 05:02:28,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:02:28,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507378617] [2024-11-14 05:02:28,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:02:28,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:02:28,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:02:28,599 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 97 proven. 15 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-14 05:02:28,599 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:02:28,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507378617] [2024-11-14 05:02:28,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507378617] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:02:28,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953018855] [2024-11-14 05:02:28,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:02:28,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:02:28,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:02:28,602 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:02:28,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-14 05:02:28,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:02:28,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-14 05:02:28,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:02:28,825 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-14 05:02:28,826 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:02:28,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953018855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:02:28,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:02:28,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2024-11-14 05:02:28,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050285719] [2024-11-14 05:02:28,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:02:28,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:02:28,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:02:28,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:02:28,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:02:28,828 INFO L87 Difference]: Start difference. First operand 5266 states and 5914 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 4 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-14 05:02:29,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:02:29,311 INFO L93 Difference]: Finished difference Result 5756 states and 6459 transitions. [2024-11-14 05:02:29,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:02:29,312 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 4 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 169 [2024-11-14 05:02:29,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:02:29,322 INFO L225 Difference]: With dead ends: 5756 [2024-11-14 05:02:29,323 INFO L226 Difference]: Without dead ends: 0 [2024-11-14 05:02:29,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:02:29,331 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 63 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:02:29,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 350 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:02:29,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-14 05:02:29,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-14 05:02:29,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:02:29,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-14 05:02:29,341 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 169 [2024-11-14 05:02:29,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:02:29,341 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-14 05:02:29,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 4 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-14 05:02:29,342 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-14 05:02:29,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-14 05:02:29,345 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-14 05:02:29,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-14 05:02:29,367 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-14 05:02:29,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:02:29,554 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:02:29,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-14 05:03:14,335 WARN L286 SmtUtils]: Spent 7.55s on a formula simplification. DAG size of input: 904 DAG size of output: 95 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-14 05:03:42,479 WARN L286 SmtUtils]: Spent 5.14s on a formula simplification. DAG size of input: 740 DAG size of output: 79 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-14 05:03:56,783 WARN L286 SmtUtils]: Spent 13.12s on a formula simplification. DAG size of input: 881 DAG size of output: 138 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-14 05:04:13,344 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 05:04:13,548 WARN L162 FloydHoareUtils]: Requires clause for immediate_notify contained old-variable. Original clause: (let ((.cse26 (= 0 ~t2_pc~0)) (.cse28 (= ~m_st~0 |old(~m_st~0)|)) (.cse22 (= ~m_pc~0 ~t1_pc~0))) (let ((.cse3 (= 2 |old(~t2_st~0)|)) (.cse2 (= ~m_pc~0 1)) (.cse0 (not .cse22)) (.cse1 (and .cse28 (= ~t1_st~0 0))) (.cse23 (= ~E_1~0 1)) (.cse16 (= |old(~t1_st~0)| 2)) (.cse27 (not .cse26))) (and (or .cse0 .cse1 .cse2) (or (= 2 ~t2_st~0) (not .cse3)) (let ((.cse19 (= ~E_2~0 1))) (let ((.cse18 (= (+ ~local~0 1) ~token~0)) (.cse9 (not .cse19)) (.cse4 (<= 2 ~E_1~0)) (.cse21 (not (= ~E_M~0 1))) (.cse5 (= 2 |old(~m_st~0)|)) (.cse7 (not .cse2)) (.cse10 (= |old(~t1_st~0)| 0)) (.cse11 (= ~t2_pc~0 1)) (.cse14 (= ~t1_pc~0 1)) (.cse17 (= |old(~t2_st~0)| 0)) (.cse6 (= ~t1_i~0 1)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse15 (= ~E_2~0 2)) (.cse24 (not (= |old(~m_st~0)| 0))) (.cse12 (= ~t2_i~0 1)) (.cse13 (= ~c_dr_pc~0 0)) (.cse20 (= ~E_M~0 2)) (.cse25 (= ~token~0 ~local~0))) (or (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse4 .cse6 .cse8 .cse11 .cse15 .cse16 (= ~token~0 (+ 2 ~local~0)) .cse12 .cse13) (and .cse14 .cse17 .cse4 .cse5 .cse6 .cse18 .cse19 .cse8 .cse11 .cse12 .cse13 .cse20) (and .cse14 .cse4 .cse5 .cse6 .cse18 .cse19 .cse8 .cse11 .cse3 .cse12 .cse13 .cse20) (and .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse21) (and .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13) (and .cse6 .cse22 .cse23 .cse7 .cse8 .cse10 .cse11 .cse15 .cse3 .cse24 .cse12 .cse13 .cse20 .cse25) (and .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 .cse12 .cse13 .cse26 .cse21) (and .cse14 .cse17 .cse5 .cse6 .cse19 .cse8 .cse12 .cse13 .cse26 .cse20 (= ~E_1~0 2)) (and .cse17 .cse6 .cse22 .cse23 .cse7 .cse8 .cse10 .cse15 .cse24 .cse12 .cse13 .cse26 .cse20 .cse25) (and .cse14 .cse6 .cse23 .cse8 .cse11 .cse15 .cse16 .cse3 .cse24 .cse12 .cse13 .cse20 .cse25) (and .cse14 .cse17 .cse6 .cse23 .cse8 .cse15 .cse16 .cse24 .cse12 .cse13 .cse26 .cse20 .cse25)))) (or .cse0 .cse1 (not .cse23) .cse27) (or (and .cse28 (= 2 ~t1_st~0)) (not .cse16)) (or .cse27 (= 0 ~t2_st~0)) (or (and (= ~m_st~0 2) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~t2_st~0)| ~t2_st~0)) (< ~E_1~0 2))))) Eliminated clause: (let ((.cse15 (= 0 ~t2_pc~0))) (let ((.cse27 (not .cse15))) (and (exists ((|old(~t2_st~0)| Int) (|old(~t1_st~0)| Int) (|old(~m_st~0)| Int)) (let ((.cse28 (= ~m_st~0 |old(~m_st~0)|)) (.cse23 (= ~m_pc~0 ~t1_pc~0))) (let ((.cse2 (= ~m_pc~0 1)) (.cse25 (= 2 |old(~t2_st~0)|)) (.cse0 (not .cse23)) (.cse1 (and .cse28 (= ~t1_st~0 0))) (.cse13 (= ~E_1~0 1)) (.cse9 (= |old(~t1_st~0)| 2))) (and (or .cse0 .cse1 .cse2) (let ((.cse19 (= ~E_2~0 1))) (let ((.cse21 (not .cse19)) (.cse22 (= |old(~t1_st~0)| 0)) (.cse20 (not .cse2)) (.cse26 (not (= ~E_M~0 1))) (.cse8 (= ~E_2~0 2)) (.cse14 (not (= |old(~m_st~0)| 0))) (.cse17 (= ~token~0 ~local~0)) (.cse3 (= ~t1_pc~0 1)) (.cse12 (= |old(~t2_st~0)| 0)) (.cse4 (= ~p_dw_pc~0 0)) (.cse5 (<= 2 ~E_1~0)) (.cse18 (= 2 |old(~m_st~0)|)) (.cse6 (= ~t1_i~0 1)) (.cse24 (= (+ ~local~0 1) ~token~0)) (.cse7 (= ~t2_pc~0 1)) (.cse10 (= ~t2_i~0 1)) (.cse11 (= ~c_dr_pc~0 0)) (.cse16 (= ~E_M~0 2))) (or (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~token~0 (+ 2 ~local~0)) .cse10 .cse11) (and .cse3 .cse12 .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse10 .cse11 .cse15 .cse16 .cse17) (and .cse3 .cse12 .cse4 .cse18 .cse6 .cse19 .cse10 .cse11 .cse15 .cse16 (= ~E_1~0 2)) (and .cse4 .cse5 .cse18 .cse6 .cse20 .cse21 .cse22 .cse7 .cse10 .cse11) (and .cse3 .cse4 .cse5 .cse18 .cse6 .cse20 .cse21 .cse7 .cse10 .cse11) (and .cse12 .cse4 .cse6 .cse23 .cse13 .cse20 .cse22 .cse8 .cse14 .cse10 .cse11 .cse15 .cse16 .cse17) (and .cse3 .cse4 .cse5 .cse18 .cse6 .cse24 .cse19 .cse7 .cse25 .cse10 .cse11 .cse16) (and .cse4 .cse6 .cse23 .cse13 .cse20 .cse22 .cse7 .cse8 .cse25 .cse14 .cse10 .cse11 .cse16 .cse17) (and .cse3 .cse4 .cse5 .cse18 .cse6 .cse20 .cse10 .cse11 .cse15 .cse26) (and .cse3 .cse4 .cse5 .cse18 .cse6 .cse20 .cse7 .cse10 .cse11 .cse26) (and .cse3 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse25 .cse14 .cse10 .cse11 .cse16 .cse17) (and .cse3 .cse12 .cse4 .cse5 .cse18 .cse6 .cse24 .cse19 .cse7 .cse10 .cse11 .cse16)))) (or (= 2 ~t2_st~0) (not .cse25)) (or .cse0 .cse1 (not .cse13) .cse27) (or (and .cse28 (= 2 ~t1_st~0)) (not .cse9)) (or (and (= ~m_st~0 2) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~t2_st~0)| ~t2_st~0)) (< ~E_1~0 2)))))) (or .cse27 (= 0 ~t2_st~0))))) [2024-11-14 05:04:13,668 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-14 05:04:13,964 WARN L162 FloydHoareUtils]: Requires clause for activate_threads2 contained old-variable. Original clause: (let ((.cse25 (= 2 |old(~t2_st~0)|)) (.cse18 (= |old(~t1_st~0)| 2)) (.cse22 (= 0 ~t2_pc~0)) (.cse6 (= ~m_st~0 |old(~m_st~0)|)) (.cse7 (= ~t1_st~0 0)) (.cse34 (= 0 ~t2_st~0)) (.cse28 (= ~m_pc~0 ~t1_pc~0))) (let ((.cse0 (not .cse28)) (.cse1 (and .cse6 .cse7 .cse34)) (.cse4 (= 2 |old(~m_st~0)|)) (.cse9 (= ~E_1~0 1)) (.cse2 (= ~m_pc~0 1)) (.cse3 (not .cse22)) (.cse5 (= 2 ~t2_st~0)) (.cse33 (= 2 ~t1_st~0)) (.cse35 (not .cse18)) (.cse8 (not .cse25))) (and (or .cse0 .cse1 .cse2 .cse3) (or (and (= ~m_st~0 2) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~t2_st~0)| ~t2_st~0)) (not .cse4)) (or (and .cse5 .cse6 .cse7) .cse0 .cse2 .cse8) (or .cse0 .cse1 (not .cse9) .cse3) (let ((.cse27 (= |old(~m_st~0)| 0))) (let ((.cse14 (= (+ ~local~0 1) ~token~0)) (.cse24 (= ~E_2~0 1)) (.cse26 (= ~token~0 (+ 2 ~local~0))) (.cse31 (not .cse27)) (.cse11 (= |old(~t2_st~0)| 0)) (.cse30 (= |old(~t1_st~0)| 0)) (.cse10 (= ~t1_pc~0 1)) (.cse12 (<= 2 ~E_1~0)) (.cse13 (= ~t1_i~0 1)) (.cse29 (not .cse2)) (.cse15 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse16 (= ~t2_pc~0 1)) (.cse17 (= ~E_2~0 2)) (.cse19 (= ~t2_i~0 1)) (.cse20 (= ~c_dr_pc~0 0)) (.cse21 (= ~E_M~0 2)) (.cse32 (= ~token~0 ~local~0)) (.cse23 (= ~E_1~0 2))) (or (and .cse10 .cse11 .cse12 .cse4 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse10 .cse11 .cse12 .cse4 .cse13 .cse15 .cse17 .cse18 .cse19 .cse20 .cse22 .cse21 .cse23) (and .cse10 .cse11 .cse12 .cse4 .cse13 .cse14 .cse24 .cse15 .cse16 .cse19 .cse20 .cse21) (and .cse10 .cse12 .cse4 .cse13 .cse14 .cse24 .cse15 .cse16 .cse25 .cse19 .cse20 .cse21) (and .cse10 .cse12 .cse4 .cse13 .cse15 .cse16 .cse17 .cse18 .cse26 .cse19 .cse20) (and .cse10 .cse11 .cse12 .cse4 .cse13 .cse24 .cse15 .cse19 .cse20 .cse22 .cse21 .cse23) (and .cse10 .cse12 .cse13 .cse27 .cse15 .cse16 .cse17 .cse18 .cse26 .cse25 .cse19 .cse20 .cse21) (and .cse13 .cse28 .cse9 .cse29 .cse15 .cse30 .cse16 .cse17 .cse25 .cse31 .cse19 .cse20 .cse21 .cse32) (and .cse10 .cse12 .cse4 .cse13 .cse29 .cse15 .cse16 .cse19 .cse20) (and .cse10 .cse11 .cse12 .cse13 .cse29 .cse15 .cse17 .cse18 .cse19 .cse20 .cse22 .cse21 .cse32 .cse23) (and .cse11 .cse13 .cse28 .cse9 .cse29 .cse15 .cse30 .cse17 .cse31 .cse19 .cse20 .cse22 .cse21 .cse32) (and .cse13 .cse28 .cse29 .cse15 .cse30 .cse16 .cse17 .cse25 .cse19 .cse20 .cse21 .cse32 .cse23) (and .cse10 .cse13 .cse9 .cse15 .cse16 .cse17 .cse18 .cse25 .cse31 .cse19 .cse20 .cse21 .cse32) (and .cse12 .cse4 .cse13 .cse29 .cse15 .cse30 .cse16 .cse19 .cse20) (and .cse10 .cse12 .cse4 .cse13 .cse15 .cse16 .cse17 .cse18 .cse25 .cse19 .cse20 .cse21) (and .cse10 .cse11 .cse12 .cse4 .cse13 .cse29 .cse15 .cse19 .cse20 .cse22) (and .cse10 .cse11 .cse13 .cse9 .cse15 .cse17 .cse18 .cse31 .cse19 .cse20 .cse22 .cse21 .cse32) (and .cse11 .cse13 .cse28 .cse29 .cse15 .cse30 .cse17 .cse19 .cse20 .cse22 .cse21 .cse32 .cse23) (and .cse10 .cse12 .cse13 .cse29 .cse15 .cse16 .cse17 .cse18 .cse25 .cse19 .cse20 .cse21 .cse32 .cse23)))) (or (and .cse6 .cse33 .cse34) .cse35 .cse3) (or (and .cse5 .cse6 .cse33) .cse35 .cse8)))) Eliminated clause: (exists ((|old(~t2_st~0)| Int) (|old(~t1_st~0)| Int) (|old(~m_st~0)| Int)) (let ((.cse27 (= 2 |old(~t2_st~0)|)) (.cse11 (= |old(~t1_st~0)| 2)) (.cse15 (= 0 ~t2_pc~0)) (.cse30 (= ~m_st~0 |old(~m_st~0)|)) (.cse31 (= ~t1_st~0 0)) (.cse34 (= 0 ~t2_st~0)) (.cse21 (= ~m_pc~0 ~t1_pc~0))) (let ((.cse4 (= 2 |old(~m_st~0)|)) (.cse2 (= ~m_pc~0 1)) (.cse0 (not .cse21)) (.cse1 (and .cse30 .cse31 .cse34)) (.cse9 (= ~E_1~0 1)) (.cse3 (not .cse15)) (.cse29 (= 2 ~t2_st~0)) (.cse33 (= 2 ~t1_st~0)) (.cse35 (not .cse11)) (.cse32 (not .cse27))) (and (or .cse0 .cse1 .cse2 .cse3) (or (and (= ~m_st~0 2) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~t2_st~0)| ~t2_st~0)) (not .cse4)) (let ((.cse28 (= |old(~m_st~0)| 0))) (let ((.cse26 (= ~token~0 (+ 2 ~local~0))) (.cse23 (= |old(~t1_st~0)| 0)) (.cse12 (not .cse28)) (.cse6 (= |old(~t2_st~0)| 0)) (.cse18 (<= 2 ~E_1~0)) (.cse19 (= (+ ~local~0 1) ~token~0)) (.cse25 (= ~E_2~0 1)) (.cse5 (= ~t1_pc~0 1)) (.cse7 (= ~p_dw_pc~0 0)) (.cse8 (= ~t1_i~0 1)) (.cse22 (not .cse2)) (.cse20 (= ~t2_pc~0 1)) (.cse10 (= ~E_2~0 2)) (.cse13 (= ~t2_i~0 1)) (.cse14 (= ~c_dr_pc~0 0)) (.cse16 (= ~E_M~0 2)) (.cse17 (= ~token~0 ~local~0)) (.cse24 (= ~E_1~0 2))) (or (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse5 .cse6 .cse7 .cse18 .cse4 .cse8 .cse19 .cse20 .cse10 .cse11 .cse13 .cse14 .cse16) (and .cse6 .cse7 .cse8 .cse21 .cse22 .cse23 .cse10 .cse13 .cse14 .cse15 .cse16 .cse17 .cse24) (and .cse5 .cse6 .cse7 .cse4 .cse8 .cse25 .cse13 .cse14 .cse15 .cse16 .cse24) (and .cse5 .cse6 .cse7 .cse18 .cse4 .cse8 .cse22 .cse13 .cse14 .cse15) (and .cse5 .cse6 .cse7 .cse4 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse24) (and .cse5 .cse7 .cse18 .cse4 .cse8 .cse20 .cse10 .cse11 .cse26 .cse13 .cse14) (and .cse5 .cse6 .cse7 .cse8 .cse22 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse24) (and .cse7 .cse8 .cse21 .cse22 .cse23 .cse20 .cse10 .cse27 .cse13 .cse14 .cse16 .cse17 .cse24) (and .cse5 .cse7 .cse18 .cse8 .cse28 .cse20 .cse10 .cse11 .cse26 .cse27 .cse13 .cse14 .cse16) (and .cse6 .cse7 .cse8 .cse21 .cse9 .cse22 .cse23 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse7 .cse18 .cse4 .cse8 .cse22 .cse23 .cse20 .cse13 .cse14) (and .cse5 .cse7 .cse18 .cse4 .cse8 .cse19 .cse25 .cse20 .cse27 .cse13 .cse14 .cse16) (and .cse5 .cse7 .cse18 .cse4 .cse8 .cse22 .cse20 .cse13 .cse14) (and .cse5 .cse7 .cse18 .cse4 .cse8 .cse20 .cse10 .cse11 .cse27 .cse13 .cse14 .cse16) (and .cse7 .cse8 .cse21 .cse9 .cse22 .cse23 .cse20 .cse10 .cse27 .cse12 .cse13 .cse14 .cse16 .cse17) (and .cse5 .cse7 .cse8 .cse9 .cse20 .cse10 .cse11 .cse27 .cse12 .cse13 .cse14 .cse16 .cse17) (and .cse5 .cse6 .cse7 .cse18 .cse4 .cse8 .cse19 .cse25 .cse20 .cse13 .cse14 .cse16) (and .cse5 .cse7 .cse8 .cse22 .cse20 .cse10 .cse11 .cse27 .cse13 .cse14 .cse16 .cse17 .cse24)))) (or (and .cse29 .cse30 .cse31) .cse0 .cse2 .cse32) (or .cse0 .cse1 (not .cse9) .cse3) (or (and .cse30 .cse33 .cse34) .cse35 .cse3) (or (and .cse29 .cse30 .cse33) .cse35 .cse32))))) [2024-11-14 05:04:14,170 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-14 05:04:14,447 WARN L162 FloydHoareUtils]: Requires clause for fire_delta_events2 contained old-variable. Original clause: (let ((.cse7 (= 2 |old(~E_M~0)|)) (.cse6 (= 2 ~t2_st~0)) (.cse3 (= 2 |old(~E_1~0)|)) (.cse9 (= 2 |old(~E_2~0)|)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse19 (= 0 ~t2_pc~0)) (.cse18 (= 2 ~t1_st~0)) (.cse31 (= ~E_2~0 2)) (.cse32 (= ~E_M~0 2))) (let ((.cse20 (= 0 ~t2_st~0)) (.cse12 (= ~t2_pc~0 1)) (.cse24 (= (+ ~local~0 1) ~token~0)) (.cse28 (and .cse31 (= ~E_1~0 |old(~E_1~0)|) .cse32)) (.cse27 (not .cse18)) (.cse1 (not .cse19)) (.cse0 (not .cse5)) (.cse25 (not .cse9)) (.cse30 (not .cse3)) (.cse29 (not .cse6)) (.cse26 (not .cse7)) (.cse2 (and .cse31 .cse32 (= ~E_1~0 2))) (.cse15 (= ~token~0 ~local~0))) (and (<= 2 ~E_1~0) (or .cse0 .cse1 .cse2) (let ((.cse11 (= ~t1_st~0 0)) (.cse16 (= ~t1_pc~0 1)) (.cse21 (not (= |old(~E_M~0)| 1))) (.cse17 (= ~m_st~0 2)) (.cse4 (= ~t1_i~0 1)) (.cse8 (not (= ~m_pc~0 1))) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse22 (<= 2 |old(~E_1~0)|)) (.cse23 (not (= |old(~E_2~0)| 1))) (.cse13 (= ~t2_i~0 1)) (.cse14 (= ~c_dr_pc~0 0))) (or (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse3 .cse17 .cse4 .cse7 .cse9 .cse18 .cse10 .cse13 .cse14 .cse19 .cse20) (and .cse16 .cse21 .cse17 .cse4 .cse8 .cse10 .cse22 .cse23 .cse13 .cse14 .cse19 .cse20) (and .cse16 .cse4 .cse6 .cse7 (= ~m_st~0 0) .cse9 .cse18 .cse10 .cse12 .cse22 .cse23 (= ~token~0 (+ 2 ~local~0)) .cse13 .cse14) (and .cse16 .cse17 .cse4 .cse6 .cse7 .cse9 .cse18 .cse10 .cse12 .cse22 .cse23 .cse13 .cse14) (and .cse16 .cse3 .cse21 .cse4 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse12 .cse22 .cse23 .cse13 .cse14 .cse15) (and .cse21 .cse17 .cse4 .cse8 .cse10 .cse11 .cse12 .cse22 .cse23 .cse13 .cse14) (and .cse16 .cse17 .cse4 .cse24 .cse7 .cse9 .cse18 .cse10 .cse12 .cse13 .cse14 .cse20) (and .cse16 .cse3 .cse21 .cse4 .cse7 .cse8 .cse9 .cse18 .cse10 .cse22 .cse23 .cse13 .cse14 .cse19 .cse20 .cse15) (and .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse19 .cse20 .cse15) (and .cse16 .cse21 .cse17 .cse4 .cse8 .cse10 .cse12 .cse22 .cse23 .cse13 .cse14))) (not (= ~E_2~0 1)) (or .cse25 .cse26 .cse27 .cse28 (not .cse20) (not .cse12) (not .cse24)) (or .cse25 .cse29 .cse26 .cse27 .cse28) (or .cse25 .cse30 .cse26 .cse27 .cse1 .cse2) (or .cse0 .cse25 .cse30 .cse29 .cse26 .cse2 (not .cse15)) (not (= ~E_M~0 1))))) Eliminated clause: (let ((.cse31 (= ~E_2~0 2)) (.cse32 (= ~E_M~0 2)) (.cse6 (= ~m_pc~0 ~t1_pc~0)) (.cse16 (= 0 ~t2_pc~0))) (let ((.cse1 (not .cse16)) (.cse0 (not .cse6)) (.cse2 (and .cse31 .cse32 (= ~E_1~0 2)))) (and (<= 2 ~E_1~0) (or .cse0 .cse1 .cse2) (not (= ~E_2~0 1)) (exists ((|old(~E_2~0)| Int) (|old(~E_1~0)| Int) (|old(~E_M~0)| Int)) (let ((.cse8 (= 2 |old(~E_M~0)|)) (.cse7 (= 2 ~t2_st~0)) (.cse4 (= 2 |old(~E_1~0)|)) (.cse10 (= 2 |old(~E_2~0)|)) (.cse19 (= 2 ~t1_st~0))) (let ((.cse17 (= 0 ~t2_st~0)) (.cse12 (= ~t2_pc~0 1)) (.cse24 (= (+ ~local~0 1) ~token~0)) (.cse28 (and .cse31 (= ~E_1~0 |old(~E_1~0)|) .cse32)) (.cse27 (not .cse19)) (.cse25 (not .cse10)) (.cse30 (not .cse4)) (.cse29 (not .cse7)) (.cse26 (not .cse8)) (.cse15 (= ~token~0 ~local~0))) (and (let ((.cse11 (= ~t1_st~0 0)) (.cse21 (not (= |old(~E_M~0)| 1))) (.cse9 (not (= ~m_pc~0 1))) (.cse20 (<= 2 |old(~E_1~0)|)) (.cse23 (not (= |old(~E_2~0)| 1))) (.cse18 (= ~t1_pc~0 1)) (.cse3 (= ~p_dw_pc~0 0)) (.cse22 (= ~m_st~0 2)) (.cse5 (= ~t1_i~0 1)) (.cse13 (= ~t2_i~0 1)) (.cse14 (= ~c_dr_pc~0 0))) (or (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse15) (and .cse18 .cse3 .cse5 .cse7 .cse8 (= ~m_st~0 0) .cse10 .cse19 .cse12 .cse20 (= ~token~0 (+ 2 ~local~0)) .cse13 .cse14) (and .cse3 .cse21 .cse22 .cse5 .cse9 .cse11 .cse12 .cse20 .cse23 .cse13 .cse14) (and .cse18 .cse3 .cse22 .cse5 .cse7 .cse8 .cse10 .cse19 .cse12 .cse20 .cse13 .cse14) (and .cse18 .cse3 .cse4 .cse22 .cse5 .cse8 .cse10 .cse19 .cse13 .cse14 .cse16 .cse17) (and .cse18 .cse3 .cse4 .cse5 .cse8 .cse9 .cse10 .cse19 .cse13 .cse14 .cse16 .cse17 .cse15) (and .cse18 .cse3 .cse21 .cse22 .cse5 .cse9 .cse20 .cse23 .cse13 .cse14 .cse16 .cse17) (and .cse18 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse19 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse3 .cse21 .cse22 .cse5 .cse9 .cse12 .cse20 .cse23 .cse13 .cse14) (and .cse18 .cse3 .cse22 .cse5 .cse24 .cse8 .cse10 .cse19 .cse12 .cse13 .cse14 .cse17))) (or .cse25 .cse26 .cse27 .cse28 (not .cse17) (not .cse12) (not .cse24)) (or .cse25 .cse29 .cse26 .cse27 .cse28) (or .cse25 .cse30 .cse26 .cse27 .cse1 .cse2) (or .cse0 .cse25 .cse30 .cse29 .cse26 .cse2 (not .cse15)))))) (not (= ~E_M~0 1))))) [2024-11-14 05:04:14,543 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-14 05:04:14,847 WARN L162 FloydHoareUtils]: Requires clause for reset_delta_events2 contained old-variable. Original clause: (let ((.cse14 (= 2 |old(~E_M~0)|)) (.cse13 (= 2 ~t2_st~0)) (.cse10 (= 2 |old(~E_1~0)|)) (.cse16 (= 2 |old(~E_2~0)|)) (.cse12 (= ~m_pc~0 ~t1_pc~0)) (.cse25 (= 0 ~t2_pc~0)) (.cse24 (= 2 ~t1_st~0)) (.cse29 (= ~E_2~0 2)) (.cse30 (= ~E_M~0 2))) (let ((.cse9 (= (+ ~local~0 1) ~token~0)) (.cse8 (= ~t2_pc~0 1)) (.cse7 (= 0 ~t2_st~0)) (.cse6 (and .cse29 (= ~E_1~0 |old(~E_1~0)|) .cse30)) (.cse5 (not .cse24)) (.cse1 (not .cse25)) (.cse0 (not .cse12)) (.cse3 (not .cse16)) (.cse28 (not .cse10)) (.cse27 (not .cse13)) (.cse4 (not .cse14)) (.cse2 (and .cse29 .cse30 (= ~E_1~0 2))) (.cse21 (= ~token~0 ~local~0))) (and (<= 2 ~E_1~0) (or .cse0 .cse1 .cse2) (or .cse3 .cse4 .cse5 .cse6 (not .cse7) (not .cse8) (not .cse9)) (let ((.cse22 (= ~t1_pc~0 1)) (.cse23 (= ~m_st~0 2)) (.cse26 (<= 2 |old(~E_1~0)|)) (.cse11 (= ~t1_i~0 1)) (.cse15 (not (= ~m_pc~0 1))) (.cse17 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (= ~t1_st~0 0)) (.cse19 (= ~t2_i~0 1)) (.cse20 (= ~c_dr_pc~0 0))) (or (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse8 .cse19 .cse20 .cse21) (and .cse22 .cse10 .cse23 .cse11 .cse14 .cse16 .cse24 .cse17 .cse19 .cse20 .cse25 .cse7) (and .cse23 .cse11 .cse15 .cse17 .cse18 .cse8 .cse26 .cse19 .cse20) (and .cse22 .cse10 .cse11 .cse14 .cse15 .cse16 .cse24 .cse17 .cse19 .cse20 .cse25 .cse7 .cse21) (and .cse22 .cse11 .cse13 .cse14 (= ~m_st~0 0) .cse16 .cse24 .cse17 .cse8 .cse26 (= ~token~0 (+ 2 ~local~0)) .cse19 .cse20) (and .cse22 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse24 .cse17 .cse8 .cse26 .cse19 .cse20 .cse21) (and .cse22 .cse23 .cse11 .cse9 .cse14 .cse16 .cse24 .cse17 .cse8 .cse26 .cse19 .cse20 .cse7) (and .cse22 .cse23 .cse11 .cse15 .cse17 .cse8 .cse26 .cse19 .cse20) (and .cse22 .cse23 .cse11 .cse15 .cse17 .cse26 .cse19 .cse20 .cse25 .cse7) (and .cse22 .cse23 .cse11 .cse13 .cse14 .cse16 .cse24 .cse17 .cse8 .cse26 .cse19 .cse20) (and .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse25 .cse7 .cse21))) (or .cse3 .cse27 .cse4 .cse5 .cse6) (or .cse3 .cse28 .cse4 .cse5 .cse1 .cse2) (or .cse0 .cse3 .cse28 .cse27 .cse4 .cse2 (not .cse21))))) Eliminated clause: (let ((.cse29 (= ~E_2~0 2)) (.cse30 (= ~E_M~0 2)) (.cse14 (= ~m_pc~0 ~t1_pc~0)) (.cse23 (= 0 ~t2_pc~0))) (let ((.cse1 (not .cse23)) (.cse0 (not .cse14)) (.cse2 (and .cse29 .cse30 (= ~E_1~0 2)))) (and (<= 2 ~E_1~0) (or .cse0 .cse1 .cse2) (exists ((|old(~E_2~0)| Int) (|old(~E_1~0)| Int) (|old(~E_M~0)| Int)) (let ((.cse16 (= 2 |old(~E_M~0)|)) (.cse15 (= 2 ~t2_st~0)) (.cse12 (= 2 |old(~E_1~0)|)) (.cse18 (= 2 |old(~E_2~0)|)) (.cse27 (= 2 ~t1_st~0))) (let ((.cse6 (and .cse29 (= ~E_1~0 |old(~E_1~0)|) .cse30)) (.cse9 (= (+ ~local~0 1) ~token~0)) (.cse7 (= 0 ~t2_st~0)) (.cse8 (= ~t2_pc~0 1)) (.cse5 (not .cse27)) (.cse3 (not .cse18)) (.cse28 (not .cse12)) (.cse10 (not .cse15)) (.cse4 (not .cse16)) (.cse22 (= ~token~0 ~local~0))) (and (or .cse3 .cse4 .cse5 .cse6 (not .cse7) (not .cse8) (not .cse9)) (or .cse3 .cse10 .cse4 .cse5 .cse6) (let ((.cse19 (= ~t1_st~0 0)) (.cse26 (= ~t1_pc~0 1)) (.cse11 (= ~p_dw_pc~0 0)) (.cse24 (= ~m_st~0 2)) (.cse13 (= ~t1_i~0 1)) (.cse17 (not (= ~m_pc~0 1))) (.cse25 (<= 2 |old(~E_1~0)|)) (.cse20 (= ~t2_i~0 1)) (.cse21 (= ~c_dr_pc~0 0))) (or (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse8 .cse20 .cse21 .cse22) (and .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse7 .cse22) (and .cse11 .cse24 .cse13 .cse17 .cse19 .cse8 .cse25 .cse20 .cse21) (and .cse26 .cse11 .cse24 .cse13 .cse9 .cse16 .cse18 .cse27 .cse8 .cse25 .cse20 .cse21 .cse7) (and .cse26 .cse11 .cse24 .cse13 .cse17 .cse25 .cse20 .cse21 .cse23 .cse7) (and .cse26 .cse11 .cse13 .cse15 .cse16 (= ~m_st~0 0) .cse18 .cse27 .cse8 .cse25 (= ~token~0 (+ 2 ~local~0)) .cse20 .cse21) (and .cse26 .cse11 .cse24 .cse13 .cse15 .cse16 .cse18 .cse27 .cse8 .cse25 .cse20 .cse21) (and .cse26 .cse11 .cse12 .cse24 .cse13 .cse16 .cse18 .cse27 .cse20 .cse21 .cse23 .cse7) (and .cse26 .cse11 .cse12 .cse13 .cse16 .cse17 .cse18 .cse27 .cse20 .cse21 .cse23 .cse7 .cse22) (and .cse26 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse27 .cse8 .cse20 .cse21 .cse22) (and .cse26 .cse11 .cse24 .cse13 .cse17 .cse8 .cse25 .cse20 .cse21))) (or .cse3 .cse28 .cse4 .cse5 .cse1 .cse2) (or .cse0 .cse3 .cse28 .cse10 .cse4 .cse2 (not .cse22))))))))) [2024-11-14 05:04:14,951 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-14 05:04:14,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 05:04:14 BoogieIcfgContainer [2024-11-14 05:04:14,953 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 05:04:14,954 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 05:04:14,954 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 05:04:14,954 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 05:04:14,955 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:01:42" (3/4) ... [2024-11-14 05:04:14,957 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-14 05:04:14,962 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2024-11-14 05:04:14,963 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels1 [2024-11-14 05:04:14,963 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2024-11-14 05:04:14,963 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads1 [2024-11-14 05:04:14,963 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2024-11-14 05:04:14,963 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2024-11-14 05:04:14,963 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events1 [2024-11-14 05:04:14,963 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2024-11-14 05:04:14,963 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2024-11-14 05:04:14,963 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2024-11-14 05:04:14,963 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2024-11-14 05:04:14,964 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2024-11-14 05:04:14,964 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events1 [2024-11-14 05:04:14,964 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2024-11-14 05:04:14,975 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 85 nodes and edges [2024-11-14 05:04:14,976 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2024-11-14 05:04:14,977 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-14 05:04:14,978 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-14 05:04:15,147 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/witness.graphml [2024-11-14 05:04:15,147 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/witness.yml [2024-11-14 05:04:15,148 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 05:04:15,148 INFO L158 Benchmark]: Toolchain (without parser) took 154233.73ms. Allocated memory was 117.4MB in the beginning and 260.0MB in the end (delta: 142.6MB). Free memory was 92.1MB in the beginning and 134.3MB in the end (delta: -42.2MB). Peak memory consumption was 99.2MB. Max. memory is 16.1GB. [2024-11-14 05:04:15,149 INFO L158 Benchmark]: CDTParser took 1.04ms. Allocated memory is still 117.4MB. Free memory is still 74.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 05:04:15,149 INFO L158 Benchmark]: CACSL2BoogieTranslator took 483.18ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 74.2MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 05:04:15,149 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.58ms. Allocated memory is still 117.4MB. Free memory was 73.9MB in the beginning and 71.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 05:04:15,149 INFO L158 Benchmark]: Boogie Preprocessor took 64.50ms. Allocated memory is still 117.4MB. Free memory was 71.5MB in the beginning and 69.2MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 05:04:15,150 INFO L158 Benchmark]: RCFGBuilder took 1253.73ms. Allocated memory is still 117.4MB. Free memory was 69.2MB in the beginning and 52.7MB in the end (delta: 16.5MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. [2024-11-14 05:04:15,150 INFO L158 Benchmark]: TraceAbstraction took 152167.34ms. Allocated memory was 117.4MB in the beginning and 260.0MB in the end (delta: 142.6MB). Free memory was 52.2MB in the beginning and 153.9MB in the end (delta: -101.7MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-11-14 05:04:15,151 INFO L158 Benchmark]: Witness Printer took 193.70ms. Allocated memory is still 260.0MB. Free memory was 153.9MB in the beginning and 134.3MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 05:04:15,151 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.04ms. Allocated memory is still 117.4MB. Free memory is still 74.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 483.18ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 74.2MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.58ms. Allocated memory is still 117.4MB. Free memory was 73.9MB in the beginning and 71.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 64.50ms. Allocated memory is still 117.4MB. Free memory was 71.5MB in the beginning and 69.2MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1253.73ms. Allocated memory is still 117.4MB. Free memory was 69.2MB in the beginning and 52.7MB in the end (delta: 16.5MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. * TraceAbstraction took 152167.34ms. Allocated memory was 117.4MB in the beginning and 260.0MB in the end (delta: 142.6MB). Free memory was 52.2MB in the beginning and 153.9MB in the end (delta: -101.7MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 193.70ms. Allocated memory is still 260.0MB. Free memory was 153.9MB in the beginning and 134.3MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 599]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 27]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 160 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 46.7s, OverallIterations: 30, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 19.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4969 SdHoareTripleChecker+Valid, 6.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4889 mSDsluCounter, 9987 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5585 mSDsCounter, 1177 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4980 IncrementalHoareTripleChecker+Invalid, 6157 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1177 mSolverCounterUnsat, 4402 mSDtfsCounter, 4980 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2436 GetRequests, 2219 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5641occurred in iteration=26, InterpolantAutomatonStates: 164, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.2s AutomataMinimizationTime, 30 MinimizatonAttempts, 6762 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 5199 NumberOfCodeBlocks, 5111 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 5151 ConstructedInterpolants, 0 QuantifiedInterpolants, 9655 SizeOfPredicates, 5 NumberOfNonLiveVariables, 8354 ConjunctsInSsa, 138 ConjunctsInUnsatCore, 48 InterpolantComputations, 30 PerfectInterpolantSequences, 3338/3692 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 262]: Location Invariant Derived location invariant: ((((m_pc == t1_pc) && (m_pc != 1)) && (c_dr_pc == 1)) || (((m_pc == t1_pc) && (m_pc != 1)) && (c_dr_pc == 0))) - InvariantResult [Line: 640]: Location Invariant Derived location invariant: (((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 == t2_st)) && (m_pc != 1)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (t1_i == 1)) && (m_pc != 1)) && (2 == t1_st)) && (E_2 == 2)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (E_1 == 2))) || ((((((((((((((p_dw_pc == 0) && (t1_i == 1)) && (m_pc == t1_pc)) && (2 == t2_st)) && (m_pc != 1)) && (t1_st == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 == t2_st)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (token == ((long long) 2 + local))) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2))) || ((((((((((((((p_dw_pc == 0) && (t1_i == 1)) && (m_pc == t1_pc)) && (m_pc != 1)) && (t1_st == 0)) && (E_2 == 2)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) - InvariantResult [Line: 499]: Loop Invariant Derived loop invariant: ((((m_pc == t1_pc) && (m_pc != 1)) && (c_dr_pc == 1)) || (((m_pc == t1_pc) && (m_pc != 1)) && (c_dr_pc == 0))) - InvariantResult [Line: 295]: Location Invariant Derived location invariant: ((((m_pc == t1_pc) && (m_pc != 1)) && (c_dr_pc == 1)) || (((m_pc == t1_pc) && (m_pc != 1)) && (c_dr_pc == 0))) - InvariantResult [Line: 720]: Location Invariant Derived location invariant: ((((((((((((((((p_dw_pc == 0) && (m_st == 2)) && (t1_i == 1)) && (t1_st == 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) || (((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (t1_i == 1)) && (m_pc != 1)) && (2 == t1_st)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || ((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && (2 == t1_st)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2))) || (((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (m_st == 0)) && (2 == t1_st)) && (E_2 == 2)) && (token == ((long long) 2 + local))) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2))) || (((((((((((p_dw_pc == 0) && (t1_i == 1)) && (m_pc == t1_pc)) && (m_pc != 1)) && (t1_st == 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || ((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && (m_pc != 1)) && (E_2 != 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M != 1))) || ((((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && (m_pc != 1)) && (E_2 != 1)) && (t1_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M != 1))) - InvariantResult [Line: 1132]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (m_st == 2)) && (t1_i == 1)) && (2 == t1_st)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (E_1 == 2)) || (((((((((((((p_dw_pc == 0) && (t1_i == 1)) && (m_pc == t1_pc)) && (m_pc != 1)) && (t1_st == 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && (2 == t2_st)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && (m_pc != 1)) && (E_2 != 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && (E_M != 1))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 == t2_st)) && (m_st == 0)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (token == ((long long) 2 + local))) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (t1_i == 1)) && (2 == t2_st)) && (m_pc != 1)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (0 == t2_st))) || (((((((((((((p_dw_pc == 0) && (t1_i == 1)) && (m_pc == t1_pc)) && (2 == t2_st)) && (m_pc != 1)) && (t1_st == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && (m_pc != 1)) && (E_2 != 1)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M != 1))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (t1_i == 1)) && (m_pc != 1)) && (2 == t1_st)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && (m_pc != 1)) && (E_2 != 1)) && (t1_st == 0)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M != 1))) - InvariantResult [Line: 172]: Location Invariant Derived location invariant: ((((m_pc == t1_pc) && (m_pc != 1)) && (c_dr_pc == 1)) || (((m_pc == t1_pc) && (m_pc != 1)) && (c_dr_pc == 0))) - InvariantResult [Line: 860]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (m_st == 2)) && (t1_i == 1)) && (2 == t1_st)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (E_1 == 2)) || (((((((((((((p_dw_pc == 0) && (t1_i == 1)) && (m_pc == t1_pc)) && (m_pc != 1)) && (t1_st == 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && (2 == t2_st)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && (m_pc != 1)) && (E_2 != 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && (E_M != 1))) || ((((((((((((p_dw_pc == 0) && (m_st == 2)) && (t1_i == 1)) && (2 == t2_st)) && (t1_st == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 == t2_st)) && (m_st == 0)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (token == ((long long) 2 + local))) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (t1_i == 1)) && (2 == t2_st)) && (m_pc != 1)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (0 == t2_st))) || (((((((((((((p_dw_pc == 0) && (t1_i == 1)) && (m_pc == t1_pc)) && (2 == t2_st)) && (m_pc != 1)) && (t1_st == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && (m_pc != 1)) && (E_2 != 1)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M != 1))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (t1_i == 1)) && (m_pc != 1)) && (2 == t1_st)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((p_dw_pc == 0) && (m_st == 2)) && (t1_i == 1)) && (t1_st == 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && (m_pc != 1)) && (E_2 != 1)) && (t1_st == 0)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M != 1))) - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: ((((m_pc == t1_pc) && (m_pc != 1)) && (c_dr_pc == 1)) || (((m_pc == t1_pc) && (m_pc != 1)) && (c_dr_pc == 0))) - InvariantResult [Line: 829]: Location Invariant Derived location invariant: (((((((((((((((((((((((((t1_i == 1) && (m_pc == t1_pc)) && (m_pc != 1)) && (c_dr_pc == p_dw_pc)) && (t1_st == 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) || ((((((((((((t1_pc == 1) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && (2 == t2_st)) && (2 == t1_st)) && (c_dr_pc == p_dw_pc)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2))) || (((((((((((((t1_pc == 1) && (t1_i == 1)) && (m_pc != 1)) && (2 == t1_st)) && (c_dr_pc == p_dw_pc)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((m_st == 2) && (t1_i == 1)) && (c_dr_pc == p_dw_pc)) && (t1_st == 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((t1_pc == 1) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && (m_pc != 1)) && (c_dr_pc == p_dw_pc)) && (E_2 != 1)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M != 1))) || (((((((((((((t1_pc == 1) && (2 <= E_1)) && (t1_i == 1)) && (2 == t2_st)) && (m_st == 0)) && (2 == t1_st)) && (c_dr_pc == p_dw_pc)) && (t2_pc == 1)) && (E_2 == 2)) && (token == ((long long) 2 + local))) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2))) || (((((((((((((t1_pc == 1) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (2 == t1_st)) && (c_dr_pc == p_dw_pc)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (0 == t2_st))) || (((((((((((((t1_i == 1) && (m_pc == t1_pc)) && (2 == t2_st)) && (m_pc != 1)) && (c_dr_pc == p_dw_pc)) && (t1_st == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((2 <= E_1) && (m_st == 2)) && (t1_i == 1)) && (m_pc != 1)) && (c_dr_pc == p_dw_pc)) && (E_2 != 1)) && (t1_st == 0)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M != 1))) || ((((((((((((m_st == 2) && (t1_i == 1)) && (2 == t2_st)) && (c_dr_pc == p_dw_pc)) && (t1_st == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((((t1_pc == 1) && (t1_i == 1)) && (2 == t2_st)) && (m_pc != 1)) && (2 == t1_st)) && (c_dr_pc == p_dw_pc)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || ((((((((((((t1_pc == 1) && (m_st == 2)) && (t1_i == 1)) && (2 == t1_st)) && (c_dr_pc == p_dw_pc)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (E_1 == 2))) || ((((((((((((t1_pc == 1) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && (m_pc != 1)) && (c_dr_pc == p_dw_pc)) && (E_2 != 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && (E_M != 1))) - InvariantResult [Line: 218]: Location Invariant Derived location invariant: ((m_pc == t1_pc) && (m_pc != 1)) - InvariantResult [Line: 684]: Location Invariant Derived location invariant: (((((((((((((((((p_dw_pc == 0) && (t1_i == 1)) && (2 == t2_st)) && (m_pc != 1)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) || ((((((((((p_dw_pc == 0) && (m_st == 2)) && (t1_i == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (E_1 == 2))) || ((((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && (m_pc != 1)) && (E_2 != 1)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M != 1))) || (((((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (0 == t2_st))) || (((((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && (2 == t2_st)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local))) || (((((((((((p_dw_pc == 0) && (t1_i == 1)) && (m_pc != 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && (m_pc != 1)) && (E_2 != 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && (E_M != 1))) - ProcedureContractResult [Line: 1029]: Procedure Contract for immediate_notify Derived contract for procedure immediate_notify. Requires: ((0 != t2_pc) || (0 == t2_st)) Ensures: (((((((((((((((m_st == 2) && (\old(t1_st) == t1_st)) && (0 == t2_st)) || ((((((t1_pc == 1) && (\old(t2_st) == 0)) && (m_pc != 1)) && (t2_pc == 1)) && (0 == t2_st)) && (E_M != 1))) || (((((E_M != 2) || (E_2 != 1)) || (((long long) local + 1) != token)) || (2 != \old(t2_st))) && ((((E_M != 2) || (\old(t2_st) != 0)) || (t2_pc != 1)) || (((long long) local + 1) != token)))) && ((((\old(t1_st) != 0) || (E_2 == 1)) || (t1_st == 0)) || (t2_pc != 1))) && ((((m_st == 2) && (0 == t2_st)) || (E_1 < 2)) || (0 != t2_pc))) && (((\old(t1_st) == t1_st) || (m_pc != 1)) || (0 != t2_pc))) && (((((2 == t2_st) && (m_st == \old(m_st))) && (t1_st == 0)) || (E_1 != 1)) || (2 != \old(t2_st)))) && ((((((\old(t2_st) != 0) || (t1_pc != 1)) || (m_pc == 1)) || (0 == t2_st)) || (t2_pc != 1)) || (E_M == 1))) && (((m_st == 2) || (m_pc == 1)) || (E_1 < 2))) && ((((((m_pc != 1) && (\old(t2_st) == t2_st)) || ((((m_st == 0) && (2 == t1_st)) && (\old(t2_st) == t2_st)) && (E_M != 0))) || (E_2 == 1)) || ((((m_st == 2) && (2 == t1_st)) && (\old(t2_st) == t2_st)) && (E_M != 1))) || (E_1 < 2))) && ((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 == \old(m_st))) && (t1_i == 1)) && (E_2 != 1)) && (\old(t1_st) == 0)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) || (((((((((((((t1_pc == 1) && (\old(t2_st) == 0)) && (p_dw_pc == 0)) && (t1_i == 1)) && (E_1 == 1)) && (E_2 == 2)) && (\old(t1_st) == 2)) && (\old(m_st) != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (token == local))) || (((((((((((t1_pc == 1) && (\old(t2_st) == 0)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 == \old(m_st))) && (t1_i == 1)) && (m_pc != 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M != 1))) || (((((((((((t1_pc == 1) && (\old(t2_st) == 0)) && (p_dw_pc == 0)) && (2 == \old(m_st))) && (t1_i == 1)) && (E_2 == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (E_1 == 2))) || (((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 == \old(m_st))) && (t1_i == 1)) && (t2_pc == 1)) && (E_2 == 2)) && (\old(t1_st) == 2)) && (token == ((long long) 2 + local))) && (t2_i == 1)) && (c_dr_pc == 0))) || ((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 == \old(m_st))) && (t1_i == 1)) && (m_pc != 1)) && (E_2 != 1)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0))) || ((((((((((((((\old(t2_st) == 0) && (p_dw_pc == 0)) && (t1_i == 1)) && (m_pc == t1_pc)) && (E_1 == 1)) && (m_pc != 1)) && (\old(t1_st) == 0)) && (E_2 == 2)) && (\old(m_st) != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (token == local))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 == \old(m_st))) && (t1_i == 1)) && (((long long) local + 1) == token)) && (E_2 == 1)) && (t2_pc == 1)) && (2 == \old(t2_st))) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2))) || ((((((((((((((p_dw_pc == 0) && (t1_i == 1)) && (m_pc == t1_pc)) && (E_1 == 1)) && (m_pc != 1)) && (\old(t1_st) == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (2 == \old(t2_st))) && (\old(m_st) != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local))) || ((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 == \old(m_st))) && (t1_i == 1)) && (m_pc != 1)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M != 1))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (t1_i == 1)) && (E_1 == 1)) && (t2_pc == 1)) && (E_2 == 2)) && (\old(t1_st) == 2)) && (2 == \old(t2_st))) && (\old(m_st) != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local))) || ((((((((((((t1_pc == 1) && (\old(t2_st) == 0)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 == \old(m_st))) && (t1_i == 1)) && (((long long) local + 1) == token)) && (E_2 == 1)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)))) && (((((m_st == \old(m_st)) && (t1_st == 0)) && (0 == t2_st)) || (E_1 != 1)) || (0 != t2_pc))) && ((((((((((((((((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (t2_pc == \old(t2_pc))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (t2_i == \old(t2_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (T2_E == \old(T2_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (E_2 == \old(E_2))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 262]: Procedure Contract for update_channels1 Derived contract for procedure update_channels1. Requires: ((((m_pc == t1_pc) && (m_pc != 1)) && (c_dr_pc == 1)) || (((m_pc == t1_pc) && (m_pc != 1)) && (c_dr_pc == 0))) Ensures: (((((m_pc == t1_pc) && (m_pc != 1)) && (c_dr_pc == 1)) || (((m_pc == t1_pc) && (m_pc != 1)) && (c_dr_pc == 0))) && (((((((((((((((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (t2_pc == \old(t2_pc))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (t2_st == \old(t2_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (t2_i == \old(t2_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (T2_E == \old(T2_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (E_2 == \old(E_2))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 995]: Procedure Contract for activate_threads2 Derived contract for procedure activate_threads2. Ensures: (((((((((((((((((((((((((((((m_st == 2) && (m_pc != 1)) || (t2_i != 1)) || (token != ((long long) 2 + local))) || (c_dr_pc != 0)) || (E_2 == 1)) || (t1_pc != 1)) || (((m_st == 0) && (2 == t1_st)) && (E_M != 0))) || (t1_i != 1)) || (p_dw_pc != 0)) || (((m_st == 2) && (2 == t1_st)) && (E_M != 1))) || (E_1 < 2)) || (t2_pc != 1)) && (((((((E_2 != 2) || (E_M != 2)) || (E_1 != 2)) || ((m_st == \old(m_st)) && (2 == t1_st))) || (\old(t1_st) != 2)) || (0 != t2_pc)) || (token != local))) && (((m_st == \old(m_st)) && (t1_st == 0)) || (E_1 != 1))) && ((((m_pc != t1_pc) || ((\old(t1_st) == 0) && (E_2 == 2))) || (m_pc == 1)) || (0 != t2_pc))) && ((\old(t2_st) != 0) || (0 == t2_st))) && (((((((((((((t2_i != 1) || (E_M != 2)) || (c_dr_pc != 0)) || (E_2 == 1)) || (((m_st == 2) && (2 == t1_st)) && (\old(t1_st) == 2))) || (m_pc != 1)) || (t1_pc != 1)) || (t1_i != 1)) || (p_dw_pc != 0)) || (E_1 < 2)) || (2 != \old(m_st))) || (t2_pc != 1)) || (2 != \old(t2_st)))) && ((m_st == \old(m_st)) || (m_pc == 1))) && ((((((((((((((((((((((((((((t1_pc == 1) && (\old(t2_st) == 0)) && (E_1 == 1)) && (E_2 == 2)) && (\old(t1_st) == 2)) && (\old(m_st) != 0)) && (t2_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (token == local)) || (((((((((((((t1_pc == 1) && (\old(t2_st) == 0)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 == \old(m_st))) && (t1_i == 1)) && (((long long) local + 1) == token)) && (t2_pc == 1)) && (E_2 == 2)) && (\old(t1_st) == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2))) || ((((((((\old(t2_st) == 0) && (m_pc == t1_pc)) && (m_pc != 1)) && (t2_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((t1_pc == 1) && (\old(t2_st) == 0)) && (p_dw_pc == 0)) && (2 == \old(m_st))) && (t1_i == 1)) && (E_2 == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (E_1 == 2))) || ((((((((((t1_pc == 1) && (\old(t2_st) == 0)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 == \old(m_st))) && (t1_i == 1)) && (m_pc != 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc))) || (((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 == \old(m_st))) && (t1_i == 1)) && (t2_pc == 1)) && (E_2 == 2)) && (\old(t1_st) == 2)) && (token == ((long long) 2 + local))) && (t2_i == 1)) && (c_dr_pc == 0))) || (((((((((((((t1_pc == 1) && (\old(t2_st) == 0)) && (p_dw_pc == 0)) && (t1_i == 1)) && (m_pc != 1)) && (E_2 == 2)) && (\old(t1_st) == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((((p_dw_pc == 0) && (t1_i == 1)) && (m_pc == t1_pc)) && (m_pc != 1)) && (\old(t1_st) == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (2 == \old(t2_st))) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((t1_pc == 1) && (\old(t2_st) == 0)) && (p_dw_pc == 0)) && (2 == \old(m_st))) && (t1_i == 1)) && (\old(t1_st) == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (E_1 == 2))) || (((((((((p_dw_pc == 0) && (2 <= E_1)) && (2 == \old(m_st))) && (t1_i == 1)) && (m_pc != 1)) && (\old(t1_st) == 0)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 == \old(m_st))) && (t1_i == 1)) && (((long long) local + 1) == token)) && (E_2 == 1)) && (t2_pc == 1)) && (2 == \old(t2_st))) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2))) || (((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 == \old(m_st))) && (t1_i == 1)) && (t2_pc == 1)) && (E_2 == 2)) && (2 == \old(t2_st))) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2))) || (((((((((\old(t2_st) == 0) && (m_pc == t1_pc)) && (E_1 == 1)) && (m_pc != 1)) && (\old(m_st) != 0)) && (t2_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (token == local))) || (((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 == \old(m_st))) && (t1_i == 1)) && (m_pc != 1)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0))) || ((((((((((((((p_dw_pc == 0) && (t1_i == 1)) && (m_pc == t1_pc)) && (E_1 == 1)) && (m_pc != 1)) && (\old(t1_st) == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (2 == \old(t2_st))) && (\old(m_st) != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (t1_i == 1)) && (E_1 == 1)) && (t2_pc == 1)) && (E_2 == 2)) && (\old(t1_st) == 2)) && (2 == \old(t2_st))) && (\old(m_st) != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local))) || ((((((((((((t1_pc == 1) && (\old(t2_st) == 0)) && (p_dw_pc == 0)) && (2 <= E_1)) && (2 == \old(m_st))) && (t1_i == 1)) && (((long long) local + 1) == token)) && (E_2 == 1)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (\old(m_st) == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (\old(t1_st) == 2)) && (token == ((long long) 2 + local))) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (t1_i == 1)) && (m_pc != 1)) && (t2_pc == 1)) && (E_2 == 2)) && (\old(t1_st) == 2)) && (2 == \old(t2_st))) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2)))) && ((((\old(t1_st) == t1_st) && (0 == t2_st)) || ((\old(t2_st) == 0) && (E_1 == 2))) || ((((((((((((t2_i != 1) || (E_M != 2)) || (c_dr_pc != 0)) || (t1_pc != 1)) || (t1_i != 1)) || (E_2 != 1)) || (p_dw_pc != 0)) || (E_1 < 2)) || (t2_pc != 1)) || (((long long) local + 1) != token)) || (2 != \old(t2_st))) && (((((E_M != 2) || (\old(t2_st) != 0)) || (E_2 != 1)) || (t2_pc != 1)) || (((long long) local + 1) != token))))) && (((((((E_2 != 2) || (E_M != 2)) || (E_1 != 2)) || ((m_st == \old(m_st)) && (2 == t1_st))) || (\old(t1_st) != 2)) || (2 != \old(t2_st))) || (token != local))) && (((token != ((long long) 2 + local)) || (\old(m_st) != 0)) || ((2 == t2_st) && (m_st == 0)))) && ((((E_2 != 2) || ((m_st == 2) && (2 == t1_st))) || (((long long) local + 1) != token)) || ((((p_dw_pc == 0) && (t1_i == 1)) && (m_pc != 1)) && (c_dr_pc == 0)))) && ((\old(t1_st) != 0) || (t1_st == 0))) && ((((m_st == 2) && (\old(t1_st) == t1_st)) || (E_2 != 1)) || ((((p_dw_pc == 0) && (t1_i == 1)) && (m_pc != 1)) && (c_dr_pc == 0)))) && ((((E_2 == 1) || (((m_st == 2) && (2 == t1_st)) && (E_2 == 2))) || (0 != t2_pc)) || ((((p_dw_pc == 0) && (t1_i == 1)) && (m_pc != 1)) && (c_dr_pc == 0)))) && ((E_2 == 1) || (\old(t2_st) == t2_st))) && ((((((((((((((((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (t2_pc == \old(t2_pc))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (t2_i == \old(t2_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (T2_E == \old(T2_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (E_2 == \old(E_2))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 387]: Procedure Contract for activate_threads1 Derived contract for procedure activate_threads1. Requires: ((((m_pc == t1_pc) && (m_pc != 1)) && (c_dr_pc == 1)) || (((m_pc == t1_pc) && (m_pc != 1)) && (c_dr_pc == 0))) Ensures: (((((m_pc == t1_pc) && (m_pc != 1)) && (c_dr_pc == 1)) || (((m_pc == t1_pc) && (m_pc != 1)) && (c_dr_pc == 0))) && (((((((((((((((((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (t2_pc == \old(t2_pc))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (t2_st == \old(t2_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (t2_i == \old(t2_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (T2_E == \old(T2_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (E_2 == \old(E_2))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 798]: Procedure Contract for update_channels2 Derived contract for procedure update_channels2. Requires: ((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (m_st == 2)) && (t1_i == 1)) && (2 == t1_st)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (E_1 == 2)) || (((((((((((((p_dw_pc == 0) && (t1_i == 1)) && (m_pc == t1_pc)) && (m_pc != 1)) && (t1_st == 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && (2 == t2_st)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && (m_pc != 1)) && (E_2 != 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && (E_M != 1))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 == t2_st)) && (m_st == 0)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (token == ((long long) 2 + local))) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (t1_i == 1)) && (2 == t2_st)) && (m_pc != 1)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (0 == t2_st))) || (((((((((((((p_dw_pc == 0) && (t1_i == 1)) && (m_pc == t1_pc)) && (2 == t2_st)) && (m_pc != 1)) && (t1_st == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && (m_pc != 1)) && (E_2 != 1)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M != 1))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (t1_i == 1)) && (m_pc != 1)) && (2 == t1_st)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && (m_pc != 1)) && (E_2 != 1)) && (t1_st == 0)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M != 1))) Ensures: (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (m_st == 2)) && (t1_i == 1)) && (2 == t1_st)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (E_1 == 2)) || (((((((((((((p_dw_pc == 0) && (t1_i == 1)) && (m_pc == t1_pc)) && (m_pc != 1)) && (t1_st == 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && (2 == t2_st)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && (m_pc != 1)) && (E_2 != 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && (E_M != 1))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 == t2_st)) && (m_st == 0)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (token == ((long long) 2 + local))) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (t1_i == 1)) && (2 == t2_st)) && (m_pc != 1)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (0 == t2_st))) || (((((((((((((p_dw_pc == 0) && (t1_i == 1)) && (m_pc == t1_pc)) && (2 == t2_st)) && (m_pc != 1)) && (t1_st == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && (m_pc != 1)) && (E_2 != 1)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M != 1))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (t1_i == 1)) && (m_pc != 1)) && (2 == t1_st)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && (m_pc != 1)) && (E_2 != 1)) && (t1_st == 0)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M != 1))) && (((((((((((((((((((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (t2_pc == \old(t2_pc))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (t2_st == \old(t2_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (t2_i == \old(t2_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (T2_E == \old(T2_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (E_2 == \old(E_2))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 919]: Procedure Contract for fire_delta_events2 Derived contract for procedure fire_delta_events2. Requires: ((((2 <= E_1) && (((m_pc != t1_pc) || (0 != t2_pc)) || (((E_2 == 2) && (E_M == 2)) && (E_1 == 2)))) && (E_2 != 1)) && (E_M != 1)) Ensures: ((((((((2 <= E_1) && (((m_pc != t1_pc) || (0 != t2_pc)) || (((E_2 == 2) && (E_M == 2)) && (E_1 == 2)))) && (((((((((((((((((((((((p_dw_pc == 0) && (2 == \old(E_1))) && (t1_i == 1)) && (m_pc == t1_pc)) && (2 == t2_st)) && (2 == \old(E_M))) && (m_pc != 1)) && (2 == \old(E_2))) && (t1_st == 0)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local)) || (((((((((((((p_dw_pc == 0) && (2 == \old(E_1))) && (t1_i == 1)) && (m_pc == t1_pc)) && (2 == \old(E_M))) && (m_pc != 1)) && (2 == \old(E_2))) && (t1_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && (token == local))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (t1_i == 1)) && (2 == t2_st)) && (2 == \old(E_M))) && (m_st == 0)) && (2 == \old(E_2))) && (2 == t1_st)) && (t2_pc == 1)) && (2 <= \old(E_1))) && (token == ((long long) 2 + local))) && (t2_i == 1)) && (c_dr_pc == 0))) || (((((((((((p_dw_pc == 0) && (\old(E_M) != 1)) && (m_st == 2)) && (t1_i == 1)) && (m_pc != 1)) && (t1_st == 0)) && (t2_pc == 1)) && (2 <= \old(E_1))) && (\old(E_2) != 1)) && (t2_i == 1)) && (c_dr_pc == 0))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (m_st == 2)) && (t1_i == 1)) && (2 == t2_st)) && (2 == \old(E_M))) && (2 == \old(E_2))) && (2 == t1_st)) && (t2_pc == 1)) && (2 <= \old(E_1))) && (t2_i == 1)) && (c_dr_pc == 0))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 == \old(E_1))) && (m_st == 2)) && (t1_i == 1)) && (2 == \old(E_M))) && (2 == \old(E_2))) && (2 == t1_st)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (0 == t2_st))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 == \old(E_1))) && (t1_i == 1)) && (2 == \old(E_M))) && (m_pc != 1)) && (2 == \old(E_2))) && (2 == t1_st)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && (token == local))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (\old(E_M) != 1)) && (m_st == 2)) && (t1_i == 1)) && (m_pc != 1)) && (2 <= \old(E_1))) && (\old(E_2) != 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (0 == t2_st))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 == \old(E_1))) && (t1_i == 1)) && (2 == t2_st)) && (2 == \old(E_M))) && (m_pc != 1)) && (2 == \old(E_2))) && (2 == t1_st)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local))) || (((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (\old(E_M) != 1)) && (m_st == 2)) && (t1_i == 1)) && (m_pc != 1)) && (t2_pc == 1)) && (2 <= \old(E_1))) && (\old(E_2) != 1)) && (t2_i == 1)) && (c_dr_pc == 0))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (m_st == 2)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (2 == \old(E_M))) && (2 == \old(E_2))) && (2 == t1_st)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st)))) && (((((((2 != \old(E_2)) || (2 != \old(E_M))) || (2 != t1_st)) || (((E_2 == 2) && (E_1 == \old(E_1))) && (E_M == 2))) || (0 != t2_st)) || (t2_pc != 1)) || (((long long) local + 1) != token))) && (((((2 != \old(E_2)) || (2 != t2_st)) || (2 != \old(E_M))) || (2 != t1_st)) || (((E_2 == 2) && (E_1 == \old(E_1))) && (E_M == 2)))) && ((((((2 != \old(E_2)) || (2 != \old(E_1))) || (2 != \old(E_M))) || (2 != t1_st)) || (0 != t2_pc)) || (((E_2 == 2) && (E_M == 2)) && (E_1 == 2)))) && (((((((m_pc != t1_pc) || (2 != \old(E_2))) || (2 != \old(E_1))) || (2 != t2_st)) || (2 != \old(E_M))) || (((E_2 == 2) && (E_M == 2)) && (E_1 == 2))) || (token != local))) && (((((((((((((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (t2_pc == \old(t2_pc))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (t2_st == \old(t2_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (t2_i == \old(t2_i))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 315]: Procedure Contract for fire_delta_events1 Derived contract for procedure fire_delta_events1. Requires: ((((m_pc == t1_pc) && (m_pc != 1)) && (c_dr_pc == 1)) || (((m_pc == t1_pc) && (m_pc != 1)) && (c_dr_pc == 0))) Ensures: (((((m_pc == t1_pc) && (m_pc != 1)) && (c_dr_pc == 1)) || (((m_pc == t1_pc) && (m_pc != 1)) && (c_dr_pc == 0))) && (((((((((((((((((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (t2_pc == \old(t2_pc))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (t2_st == \old(t2_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (t2_i == \old(t2_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (T2_E == \old(T2_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (E_2 == \old(E_2))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 99]: Procedure Contract for is_do_read_c_triggered Derived contract for procedure is_do_read_c_triggered. Requires: ((((m_pc == t1_pc) && (m_pc != 1)) && (c_dr_pc == 1)) || (((m_pc == t1_pc) && (m_pc != 1)) && (c_dr_pc == 0))) Ensures: (((((m_pc == t1_pc) && (m_pc != 1)) && (c_dr_pc == 1)) || (((m_pc == t1_pc) && (m_pc != 1)) && (c_dr_pc == 0))) && (((((((((((((((((((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (t2_pc == \old(t2_pc))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (t2_st == \old(t2_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (t2_i == \old(t2_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (T2_E == \old(T2_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (E_2 == \old(E_2))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 70]: Procedure Contract for is_do_write_p_triggered Derived contract for procedure is_do_write_p_triggered. Requires: ((((m_pc == t1_pc) && (m_pc != 1)) && (c_dr_pc == 1)) || (((m_pc == t1_pc) && (m_pc != 1)) && (c_dr_pc == 0))) Ensures: (((((m_pc == t1_pc) && (m_pc != 1)) && (c_dr_pc == 1)) || (((m_pc == t1_pc) && (m_pc != 1)) && (c_dr_pc == 0))) && (((((((((((((((((((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (t2_pc == \old(t2_pc))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (t2_st == \old(t2_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (t2_i == \old(t2_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (T2_E == \old(T2_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (E_2 == \old(E_2))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 295]: Procedure Contract for exists_runnable_thread1 Derived contract for procedure exists_runnable_thread1. Requires: ((((m_pc == t1_pc) && (m_pc != 1)) && (c_dr_pc == 1)) || (((m_pc == t1_pc) && (m_pc != 1)) && (c_dr_pc == 0))) Ensures: (((((m_pc == t1_pc) && (m_pc != 1)) && (c_dr_pc == 1)) || (((m_pc == t1_pc) && (m_pc != 1)) && (c_dr_pc == 0))) && (((((((((((((((((((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (t2_pc == \old(t2_pc))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (t2_st == \old(t2_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (t2_i == \old(t2_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (T2_E == \old(T2_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (E_2 == \old(E_2))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 23]: Procedure Contract for error1 Derived contract for procedure error1. Requires: 0 Ensures: (0 && (((((((((((((((((((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (t2_pc == \old(t2_pc))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (t2_st == \old(t2_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (t2_i == \old(t2_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (T2_E == \old(T2_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (E_2 == \old(E_2))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 829]: Procedure Contract for exists_runnable_thread2 Derived contract for procedure exists_runnable_thread2. Requires: ((((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (m_st == 2)) && (t1_i == 1)) && (2 == t1_st)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (E_1 == 2)) || (((((((((((((p_dw_pc == 0) && (t1_i == 1)) && (m_pc == t1_pc)) && (m_pc != 1)) && (t1_st == 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && (2 == t2_st)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && (m_pc != 1)) && (E_2 != 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && (E_M != 1))) || ((((((((((((p_dw_pc == 0) && (m_st == 2)) && (t1_i == 1)) && (2 == t2_st)) && (t1_st == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 == t2_st)) && (m_st == 0)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (token == ((long long) 2 + local))) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (t1_i == 1)) && (2 == t2_st)) && (m_pc != 1)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (0 == t2_st))) || (((((((((((((p_dw_pc == 0) && (t1_i == 1)) && (m_pc == t1_pc)) && (2 == t2_st)) && (m_pc != 1)) && (t1_st == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && (m_pc != 1)) && (E_2 != 1)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M != 1))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (t1_i == 1)) && (m_pc != 1)) && (2 == t1_st)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((p_dw_pc == 0) && (m_st == 2)) && (t1_i == 1)) && (t1_st == 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && (m_pc != 1)) && (E_2 != 1)) && (t1_st == 0)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M != 1))) Ensures: ((((((((((((((E_2 != 2) || (E_M != 2)) || (\result == 1)) || (E_1 != 2)) || (2 != t1_st)) || (m_st != 2)) || (0 != t2_pc)) || (token != local)) && ((((((((E_2 != 2) || (E_M != 2)) || (m_pc == t1_pc)) || (\result == 1)) || (2 != t2_st)) || (E_1 != 2)) || (t1_st != 0)) || (token != local))) && ((((((((E_2 != 2) || (E_M != 2)) || (t1_pc != 1)) || (\result == 1)) || (2 != t2_st)) || (E_1 != 2)) || (t1_st != 0)) || (token != local))) && ((((((((E_2 != 2) || (E_M != 2)) || (m_pc == t1_pc)) || (\result == 1)) || (E_1 != 2)) || (0 != t2_pc)) || (t1_st != 0)) || (token != local))) && ((((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (m_st == 2)) && (t1_i == 1)) && (2 == t1_st)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (E_1 == 2)) || (((((((((((((p_dw_pc == 0) && (t1_i == 1)) && (m_pc == t1_pc)) && (m_pc != 1)) && (t1_st == 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && (2 == t2_st)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && (m_pc != 1)) && (E_2 != 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && (E_M != 1))) || ((((((((((((p_dw_pc == 0) && (m_st == 2)) && (t1_i == 1)) && (2 == t2_st)) && (t1_st == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (2 == t2_st)) && (m_st == 0)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (token == ((long long) 2 + local))) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (t1_i == 1)) && (2 == t2_st)) && (m_pc != 1)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (2 == t1_st)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (0 == t2_st))) || (((((((((((((p_dw_pc == 0) && (t1_i == 1)) && (m_pc == t1_pc)) && (2 == t2_st)) && (m_pc != 1)) && (t1_st == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && (m_pc != 1)) && (E_2 != 1)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M != 1))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (t1_i == 1)) && (m_pc != 1)) && (2 == t1_st)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((p_dw_pc == 0) && (m_st == 2)) && (t1_i == 1)) && (t1_st == 0)) && (E_2 == 2)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((p_dw_pc == 0) && (2 <= E_1)) && (m_st == 2)) && (t1_i == 1)) && (m_pc != 1)) && (E_2 != 1)) && (t1_st == 0)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (E_M != 1)))) && ((((((((E_2 != 2) || (E_M != 2)) || (t1_pc != 1)) || (\result == 1)) || (E_1 != 2)) || (0 != t2_pc)) || (t1_st != 0)) || (token != local))) && (((((((((((((((((((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (t2_pc == \old(t2_pc))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (t2_st == \old(t2_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (t2_i == \old(t2_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (T2_E == \old(T2_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (E_2 == \old(E_2))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 333]: Procedure Contract for reset_delta_events1 Derived contract for procedure reset_delta_events1. Requires: ((((m_pc == t1_pc) && (m_pc != 1)) && (c_dr_pc == 1)) || (((m_pc == t1_pc) && (m_pc != 1)) && (c_dr_pc == 0))) Ensures: (((((m_pc == t1_pc) && (m_pc != 1)) && (c_dr_pc == 1)) || (((m_pc == t1_pc) && (m_pc != 1)) && (c_dr_pc == 0))) && (((((((((((((((((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (t2_pc == \old(t2_pc))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (t2_st == \old(t2_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (t2_i == \old(t2_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (T2_E == \old(T2_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (E_2 == \old(E_2))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 957]: Procedure Contract for reset_delta_events2 Derived contract for procedure reset_delta_events2. Requires: ((2 <= E_1) && (((m_pc != t1_pc) || (0 != t2_pc)) || (((E_2 == 2) && (E_M == 2)) && (E_1 == 2)))) Ensures: (((((((((((2 <= E_1) && (((((2 != \old(E_2)) || (2 != t2_st)) || (2 != \old(E_M))) || (2 != t1_st)) || ((E_2 == 2) && (E_M == 2)))) && (((m_pc != t1_pc) || (0 != t2_pc)) || (((E_2 == 2) && (E_M == 2)) && (E_1 == 2)))) && ((((((((m_pc != t1_pc) || (2 != \old(E_2))) || (2 != \old(E_1))) || (2 != t2_st)) || (2 != \old(E_M))) || (t1_st != 0)) || (((E_2 == 2) && (E_M == 2)) && (E_1 == 2))) || (token != local))) && (((((((2 != \old(E_2)) || (2 != \old(E_M))) || (2 != t1_st)) || (0 != t2_st)) || ((E_2 == 2) && (E_M == 2))) || (t2_pc != 1)) || (((long long) local + 1) != token))) && (E_2 != 1)) && (((((((((((((((((((((((p_dw_pc == 0) && (2 == \old(E_1))) && (t1_i == 1)) && (m_pc == t1_pc)) && (2 == t2_st)) && (2 == \old(E_M))) && (m_pc != 1)) && (2 == \old(E_2))) && (t1_st == 0)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local)) || (((((((((((((p_dw_pc == 0) && (2 == \old(E_1))) && (t1_i == 1)) && (m_pc == t1_pc)) && (2 == \old(E_M))) && (m_pc != 1)) && (2 == \old(E_2))) && (t1_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && (token == local))) || (((((((((p_dw_pc == 0) && (m_st == 2)) && (t1_i == 1)) && (m_pc != 1)) && (t1_st == 0)) && (t2_pc == 1)) && (2 <= \old(E_1))) && (t2_i == 1)) && (c_dr_pc == 0))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (m_st == 2)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (2 == \old(E_M))) && (2 == \old(E_2))) && (2 == t1_st)) && (t2_pc == 1)) && (2 <= \old(E_1))) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_st))) || ((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (m_st == 2)) && (t1_i == 1)) && (m_pc != 1)) && (2 <= \old(E_1))) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (0 == t2_st))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (t1_i == 1)) && (2 == t2_st)) && (2 == \old(E_M))) && (m_st == 0)) && (2 == \old(E_2))) && (2 == t1_st)) && (t2_pc == 1)) && (2 <= \old(E_1))) && (token == ((long long) 2 + local))) && (t2_i == 1)) && (c_dr_pc == 0))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (m_st == 2)) && (t1_i == 1)) && (2 == t2_st)) && (2 == \old(E_M))) && (2 == \old(E_2))) && (2 == t1_st)) && (t2_pc == 1)) && (2 <= \old(E_1))) && (t2_i == 1)) && (c_dr_pc == 0))) || ((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 == \old(E_1))) && (m_st == 2)) && (t1_i == 1)) && (2 == \old(E_M))) && (2 == \old(E_2))) && (2 == t1_st)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (0 == t2_st))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 == \old(E_1))) && (t1_i == 1)) && (2 == \old(E_M))) && (m_pc != 1)) && (2 == \old(E_2))) && (2 == t1_st)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (0 == t2_st)) && (token == local))) || (((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 == \old(E_1))) && (t1_i == 1)) && (2 == t2_st)) && (2 == \old(E_M))) && (m_pc != 1)) && (2 == \old(E_2))) && (2 == t1_st)) && (t2_pc == 1)) && (t2_i == 1)) && (c_dr_pc == 0)) && (token == local))) || (((((((((t1_pc == 1) && (p_dw_pc == 0)) && (m_st == 2)) && (t1_i == 1)) && (m_pc != 1)) && (t2_pc == 1)) && (2 <= \old(E_1))) && (t2_i == 1)) && (c_dr_pc == 0)))) && ((((((2 != \old(E_2)) || (2 != \old(E_1))) || (2 != \old(E_M))) || (2 != t1_st)) || (0 != t2_pc)) || (((E_2 == 2) && (E_M == 2)) && (E_1 == 2)))) && ((((((((2 != \old(E_2)) || (2 != \old(E_1))) || (2 != t2_st)) || (2 != \old(E_M))) || (2 != t1_st)) || (m_pc == 1)) || (((E_2 == 2) && (E_M == 2)) && (E_1 == 2))) || (token != local))) && (E_M != 1)) && (((((((((((((((((((((((((((((((fast_clk_edge == \old(fast_clk_edge)) && (slow_clk_edge == \old(slow_clk_edge))) && (q_buf_0 == \old(q_buf_0))) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (t == \old(t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (t2_pc == \old(t2_pc))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (t2_st == \old(t2_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (t2_i == \old(t2_i))) && (token == \old(token))) && (local == \old(local)))) RESULT: Ultimate proved your program to be correct! [2024-11-14 05:04:15,200 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83265b91-0e5e-43a9-aea4-5405e4004f46/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE