./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje --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 0792bb078b549cb8c62d642eddb09d42b03fb2451c67a454a8e8576be6796f29 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 05:11:49,451 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 05:11:49,586 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 05:11:49,600 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 05:11:49,601 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 05:11:49,650 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 05:11:49,651 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 05:11:49,651 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 05:11:49,652 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 05:11:49,654 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 05:11:49,654 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 05:11:49,655 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 05:11:49,655 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 05:11:49,656 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 05:11:49,656 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 05:11:49,659 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 05:11:49,660 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 05:11:49,661 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 05:11:49,661 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 05:11:49,662 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 05:11:49,662 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 05:11:49,666 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 05:11:49,667 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 05:11:49,668 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 05:11:49,668 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 05:11:49,668 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 05:11:49,669 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 05:11:49,669 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 05:11:49,669 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 05:11:49,670 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 05:11:49,672 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 05:11:49,672 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 05:11:49,673 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 05:11:49,673 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 05:11:49,673 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 05:11:49,674 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 05:11:49,674 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 05:11:49,674 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 05:11:49,674 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:11:49,675 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 05:11:49,675 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 05:11:49,676 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 05:11:49,676 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 05:11:49,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 05:11:49,677 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 05:11:49,677 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 05:11:49,677 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 05:11:49,678 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje 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 -> 0792bb078b549cb8c62d642eddb09d42b03fb2451c67a454a8e8576be6796f29 [2024-11-09 05:11:50,055 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 05:11:50,092 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 05:11:50,096 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 05:11:50,099 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 05:11:50,099 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 05:11:50,101 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c Unable to find full path for "g++" [2024-11-09 05:11:52,701 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 05:11:52,989 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 05:11:52,990 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c [2024-11-09 05:11:53,015 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/data/aaa949610/a98f00d2457545fcafcc57307f64629d/FLAG6db1fb71e [2024-11-09 05:11:53,305 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/data/aaa949610/a98f00d2457545fcafcc57307f64629d [2024-11-09 05:11:53,307 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 05:11:53,309 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 05:11:53,311 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 05:11:53,311 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 05:11:53,323 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 05:11:53,324 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:11:53" (1/1) ... [2024-11-09 05:11:53,326 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b96dde1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:11:53, skipping insertion in model container [2024-11-09 05:11:53,326 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:11:53" (1/1) ... [2024-11-09 05:11:53,383 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 05:11:53,629 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_ce0ef9df-21d2-40ea-b419-1bc03aff9472/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c[914,927] [2024-11-09 05:11:53,735 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_ce0ef9df-21d2-40ea-b419-1bc03aff9472/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c[7115,7128] [2024-11-09 05:11:53,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:11:53,806 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 05:11:53,831 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_ce0ef9df-21d2-40ea-b419-1bc03aff9472/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c[914,927] [2024-11-09 05:11:53,880 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_ce0ef9df-21d2-40ea-b419-1bc03aff9472/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c[7115,7128] [2024-11-09 05:11:53,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:11:53,954 INFO L204 MainTranslator]: Completed translation [2024-11-09 05:11:53,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:11:53 WrapperNode [2024-11-09 05:11:53,955 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 05:11:53,957 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 05:11:53,957 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 05:11:53,958 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 05:11:53,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:11:53" (1/1) ... [2024-11-09 05:11:53,980 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:11:53" (1/1) ... [2024-11-09 05:11:54,041 INFO L138 Inliner]: procedures = 57, calls = 63, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 459 [2024-11-09 05:11:54,042 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 05:11:54,043 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 05:11:54,043 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 05:11:54,047 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 05:11:54,063 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:11:53" (1/1) ... [2024-11-09 05:11:54,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:11:53" (1/1) ... [2024-11-09 05:11:54,067 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:11:53" (1/1) ... [2024-11-09 05:11:54,068 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:11:53" (1/1) ... [2024-11-09 05:11:54,080 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:11:53" (1/1) ... [2024-11-09 05:11:54,093 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:11:53" (1/1) ... [2024-11-09 05:11:54,100 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:11:53" (1/1) ... [2024-11-09 05:11:54,107 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:11:53" (1/1) ... [2024-11-09 05:11:54,115 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 05:11:54,120 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 05:11:54,120 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 05:11:54,121 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 05:11:54,122 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:11:53" (1/1) ... [2024-11-09 05:11:54,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:11:54,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:11:54,170 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 05:11:54,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 05:11:54,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 05:11:54,226 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-09 05:11:54,226 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-09 05:11:54,226 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-09 05:11:54,226 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-09 05:11:54,227 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-09 05:11:54,227 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-09 05:11:54,227 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-09 05:11:54,227 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-09 05:11:54,227 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-11-09 05:11:54,228 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-11-09 05:11:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-09 05:11:54,228 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-09 05:11:54,229 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-09 05:11:54,229 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-09 05:11:54,230 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-11-09 05:11:54,230 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-11-09 05:11:54,230 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-09 05:11:54,230 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-09 05:11:54,230 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-11-09 05:11:54,231 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-11-09 05:11:54,231 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-09 05:11:54,231 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-09 05:11:54,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 05:11:54,231 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-09 05:11:54,231 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-09 05:11:54,231 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-11-09 05:11:54,232 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-11-09 05:11:54,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 05:11:54,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 05:11:54,232 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-09 05:11:54,232 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-09 05:11:54,440 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 05:11:54,442 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 05:11:55,209 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2024-11-09 05:11:55,209 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 05:11:55,494 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 05:11:55,495 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-09 05:11:55,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:11:55 BoogieIcfgContainer [2024-11-09 05:11:55,496 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 05:11:55,500 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 05:11:55,500 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 05:11:55,504 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 05:11:55,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 05:11:53" (1/3) ... [2024-11-09 05:11:55,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26cc80c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:11:55, skipping insertion in model container [2024-11-09 05:11:55,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:11:53" (2/3) ... [2024-11-09 05:11:55,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26cc80c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:11:55, skipping insertion in model container [2024-11-09 05:11:55,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:11:55" (3/3) ... [2024-11-09 05:11:55,509 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.02.cil-1.c [2024-11-09 05:11:55,527 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 05:11:55,528 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 05:11:55,616 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 05:11:55,625 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;@2970650e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 05:11:55,625 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 05:11:55,632 INFO L276 IsEmpty]: Start isEmpty. Operand has 153 states, 106 states have (on average 1.471698113207547) internal successors, (156), 112 states have internal predecessors, (156), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-09 05:11:55,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 05:11:55,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:11:55,647 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-09 05:11:55,648 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:11:55,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:11:55,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1355357098, now seen corresponding path program 1 times [2024-11-09 05:11:55,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:11:55,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677068604] [2024-11-09 05:11:55,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:11:55,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:11:55,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:11:56,390 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-09 05:11:56,391 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:11:56,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677068604] [2024-11-09 05:11:56,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677068604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:11:56,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:11:56,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:11:56,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500266731] [2024-11-09 05:11:56,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:11:56,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:11:56,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:11:56,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:11:56,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:11:56,440 INFO L87 Difference]: Start difference. First operand has 153 states, 106 states have (on average 1.471698113207547) internal successors, (156), 112 states have internal predecessors, (156), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) 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-09 05:11:57,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:11:57,501 INFO L93 Difference]: Finished difference Result 575 states and 841 transitions. [2024-11-09 05:11:57,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:11:57,504 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-09 05:11:57,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:11:57,531 INFO L225 Difference]: With dead ends: 575 [2024-11-09 05:11:57,531 INFO L226 Difference]: Without dead ends: 417 [2024-11-09 05:11:57,539 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-09 05:11:57,543 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 550 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 05:11:57,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 527 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 05:11:57,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-11-09 05:11:57,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 406. [2024-11-09 05:11:57,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 292 states have (on average 1.356164383561644) internal successors, (396), 299 states have internal predecessors, (396), 75 states have call successors, (75), 38 states have call predecessors, (75), 37 states have return successors, (95), 70 states have call predecessors, (95), 73 states have call successors, (95) [2024-11-09 05:11:57,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 566 transitions. [2024-11-09 05:11:57,698 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 566 transitions. Word has length 37 [2024-11-09 05:11:57,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:11:57,699 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 566 transitions. [2024-11-09 05:11:57,699 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-09 05:11:57,699 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 566 transitions. [2024-11-09 05:11:57,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 05:11:57,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:11:57,703 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-09 05:11:57,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 05:11:57,704 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:11:57,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:11:57,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1449719727, now seen corresponding path program 1 times [2024-11-09 05:11:57,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:11:57,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13000943] [2024-11-09 05:11:57,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:11:57,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:11:57,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:11:57,877 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-09 05:11:57,877 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:11:57,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13000943] [2024-11-09 05:11:57,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13000943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:11:57,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:11:57,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 05:11:57,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925685212] [2024-11-09 05:11:57,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:11:57,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:11:57,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:11:57,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:11:57,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:11:57,882 INFO L87 Difference]: Start difference. First operand 406 states and 566 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-09 05:11:58,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:11:58,980 INFO L93 Difference]: Finished difference Result 881 states and 1196 transitions. [2024-11-09 05:11:58,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 05:11:58,983 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-09 05:11:58,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:11:58,992 INFO L225 Difference]: With dead ends: 881 [2024-11-09 05:11:58,993 INFO L226 Difference]: Without dead ends: 817 [2024-11-09 05:11:58,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-09 05:11:58,996 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 724 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 05:11:58,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 727 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 05:11:59,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2024-11-09 05:11:59,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 746. [2024-11-09 05:11:59,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 529 states have (on average 1.3137996219281665) internal successors, (695), 536 states have internal predecessors, (695), 130 states have call successors, (130), 86 states have call predecessors, (130), 85 states have return successors, (165), 125 states have call predecessors, (165), 128 states have call successors, (165) [2024-11-09 05:11:59,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 990 transitions. [2024-11-09 05:11:59,189 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 990 transitions. Word has length 45 [2024-11-09 05:11:59,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:11:59,190 INFO L471 AbstractCegarLoop]: Abstraction has 746 states and 990 transitions. [2024-11-09 05:11:59,190 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-09 05:11:59,191 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 990 transitions. [2024-11-09 05:11:59,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 05:11:59,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:11:59,196 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-09 05:11:59,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 05:11:59,196 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:11:59,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:11:59,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1120842419, now seen corresponding path program 1 times [2024-11-09 05:11:59,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:11:59,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034197418] [2024-11-09 05:11:59,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:11:59,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:11:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:11:59,611 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-09 05:11:59,611 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:11:59,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034197418] [2024-11-09 05:11:59,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034197418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:11:59,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:11:59,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 05:11:59,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44109247] [2024-11-09 05:11:59,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:11:59,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 05:11:59,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:11:59,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 05:11:59,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:11:59,617 INFO L87 Difference]: Start difference. First operand 746 states and 990 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-09 05:12:00,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:12:00,660 INFO L93 Difference]: Finished difference Result 1507 states and 1937 transitions. [2024-11-09 05:12:00,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 05:12:00,661 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 46 [2024-11-09 05:12:00,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:12:00,670 INFO L225 Difference]: With dead ends: 1507 [2024-11-09 05:12:00,671 INFO L226 Difference]: Without dead ends: 1104 [2024-11-09 05:12:00,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2024-11-09 05:12:00,675 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 312 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 05:12:00,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 607 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 05:12:00,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2024-11-09 05:12:00,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 1075. [2024-11-09 05:12:00,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 752 states have (on average 1.2845744680851063) internal successors, (966), 760 states have internal predecessors, (966), 186 states have call successors, (186), 134 states have call predecessors, (186), 135 states have return successors, (239), 182 states have call predecessors, (239), 184 states have call successors, (239) [2024-11-09 05:12:00,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1391 transitions. [2024-11-09 05:12:00,833 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1391 transitions. Word has length 46 [2024-11-09 05:12:00,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:12:00,834 INFO L471 AbstractCegarLoop]: Abstraction has 1075 states and 1391 transitions. [2024-11-09 05:12:00,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-09 05:12:00,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1391 transitions. [2024-11-09 05:12:00,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 05:12:00,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:12:00,838 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] [2024-11-09 05:12:00,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 05:12:00,838 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:12:00,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:12:00,839 INFO L85 PathProgramCache]: Analyzing trace with hash -612556541, now seen corresponding path program 1 times [2024-11-09 05:12:00,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:12:00,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225219849] [2024-11-09 05:12:00,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:12:00,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:12:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:12:00,900 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-09 05:12:00,902 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:12:00,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225219849] [2024-11-09 05:12:00,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225219849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:12:00,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:12:00,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:12:00,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480128870] [2024-11-09 05:12:00,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:12:00,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:12:00,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:12:00,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:12:00,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:12:00,905 INFO L87 Difference]: Start difference. First operand 1075 states and 1391 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-09 05:12:01,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:12:01,211 INFO L93 Difference]: Finished difference Result 2016 states and 2550 transitions. [2024-11-09 05:12:01,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:12:01,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 47 [2024-11-09 05:12:01,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:12:01,224 INFO L225 Difference]: With dead ends: 2016 [2024-11-09 05:12:01,226 INFO L226 Difference]: Without dead ends: 1334 [2024-11-09 05:12:01,229 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-09 05:12:01,233 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 68 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:12:01,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 322 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:12:01,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2024-11-09 05:12:01,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1312. [2024-11-09 05:12:01,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 913 states have (on average 1.2705366922234391) internal successors, (1160), 921 states have internal predecessors, (1160), 228 states have call successors, (228), 172 states have call predecessors, (228), 169 states have return successors, (285), 220 states have call predecessors, (285), 226 states have call successors, (285) [2024-11-09 05:12:01,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1673 transitions. [2024-11-09 05:12:01,439 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 1673 transitions. Word has length 47 [2024-11-09 05:12:01,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:12:01,442 INFO L471 AbstractCegarLoop]: Abstraction has 1312 states and 1673 transitions. [2024-11-09 05:12:01,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-09 05:12:01,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1673 transitions. [2024-11-09 05:12:01,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 05:12:01,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:12:01,447 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 05:12:01,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 05:12:01,448 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:12:01,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:12:01,449 INFO L85 PathProgramCache]: Analyzing trace with hash 867730867, now seen corresponding path program 1 times [2024-11-09 05:12:01,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:12:01,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612754145] [2024-11-09 05:12:01,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:12:01,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:12:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:12:01,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 05:12:01,559 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:12:01,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612754145] [2024-11-09 05:12:01,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612754145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:12:01,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:12:01,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:12:01,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542885991] [2024-11-09 05:12:01,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:12:01,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:12:01,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:12:01,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:12:01,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:12:01,564 INFO L87 Difference]: Start difference. First operand 1312 states and 1673 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-09 05:12:01,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:12:01,786 INFO L93 Difference]: Finished difference Result 1718 states and 2163 transitions. [2024-11-09 05:12:01,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:12:01,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 53 [2024-11-09 05:12:01,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:12:01,795 INFO L225 Difference]: With dead ends: 1718 [2024-11-09 05:12:01,796 INFO L226 Difference]: Without dead ends: 1163 [2024-11-09 05:12:01,798 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-09 05:12:01,802 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 170 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:12:01,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 238 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:12:01,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2024-11-09 05:12:01,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 957. [2024-11-09 05:12:01,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 677 states have (on average 1.2658788774002954) internal successors, (857), 684 states have internal predecessors, (857), 165 states have call successors, (165), 118 states have call predecessors, (165), 113 states have return successors, (193), 156 states have call predecessors, (193), 163 states have call successors, (193) [2024-11-09 05:12:01,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1215 transitions. [2024-11-09 05:12:01,979 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1215 transitions. Word has length 53 [2024-11-09 05:12:01,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:12:01,983 INFO L471 AbstractCegarLoop]: Abstraction has 957 states and 1215 transitions. [2024-11-09 05:12:01,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-09 05:12:01,984 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1215 transitions. [2024-11-09 05:12:01,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 05:12:01,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:12:01,989 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 05:12:01,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 05:12:01,990 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:12:01,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:12:01,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1673554922, now seen corresponding path program 1 times [2024-11-09 05:12:01,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:12:01,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976072528] [2024-11-09 05:12:01,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:12:01,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:12:02,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:12:02,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:12:02,124 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:12:02,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976072528] [2024-11-09 05:12:02,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976072528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:12:02,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:12:02,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:12:02,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634646278] [2024-11-09 05:12:02,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:12:02,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:12:02,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:12:02,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:12:02,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:12:02,129 INFO L87 Difference]: Start difference. First operand 957 states and 1215 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-09 05:12:02,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:12:02,558 INFO L93 Difference]: Finished difference Result 1212 states and 1516 transitions. [2024-11-09 05:12:02,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:12:02,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 54 [2024-11-09 05:12:02,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:12:02,568 INFO L225 Difference]: With dead ends: 1212 [2024-11-09 05:12:02,568 INFO L226 Difference]: Without dead ends: 1209 [2024-11-09 05:12:02,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:12:02,572 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 319 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:12:02,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 214 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 05:12:02,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2024-11-09 05:12:02,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 956. [2024-11-09 05:12:02,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 677 states have (on average 1.257016248153619) internal successors, (851), 683 states have internal predecessors, (851), 164 states have call successors, (164), 118 states have call predecessors, (164), 113 states have return successors, (193), 156 states have call predecessors, (193), 163 states have call successors, (193) [2024-11-09 05:12:02,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1208 transitions. [2024-11-09 05:12:02,752 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1208 transitions. Word has length 54 [2024-11-09 05:12:02,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:12:02,752 INFO L471 AbstractCegarLoop]: Abstraction has 956 states and 1208 transitions. [2024-11-09 05:12:02,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-09 05:12:02,753 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1208 transitions. [2024-11-09 05:12:02,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 05:12:02,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:12:02,756 INFO L215 NwaCegarLoop]: trace histogram [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-09 05:12:02,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 05:12:02,756 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:12:02,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:12:02,757 INFO L85 PathProgramCache]: Analyzing trace with hash 339896907, now seen corresponding path program 1 times [2024-11-09 05:12:02,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:12:02,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908974635] [2024-11-09 05:12:02,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:12:02,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:12:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:12:02,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:12:02,991 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:12:02,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908974635] [2024-11-09 05:12:02,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908974635] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:12:02,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547111247] [2024-11-09 05:12:02,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:12:02,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:12:02,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:12:02,995 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:12:03,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 05:12:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:12:03,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 05:12:03,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:12:03,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:12:03,575 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:12:03,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:12:03,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547111247] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:12:03,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1496970165] [2024-11-09 05:12:03,748 INFO L159 IcfgInterpreter]: Started Sifa with 54 locations of interest [2024-11-09 05:12:03,749 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:12:03,754 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:12:03,761 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:12:03,762 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:12:07,656 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events1 with input of size 111 for LOIs [2024-11-09 05:12:07,741 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread1 with input of size 107 for LOIs [2024-11-09 05:12:07,844 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads1 with input of size 115 for LOIs [2024-11-09 05:12:08,673 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_write_p_triggered with input of size 111 for LOIs [2024-11-09 05:12:08,805 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_read_c_triggered with input of size 111 for LOIs [2024-11-09 05:12:08,953 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events1 with input of size 111 for LOIs [2024-11-09 05:12:09,016 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels1 with input of size 118 for LOIs [2024-11-09 05:12:09,074 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:12:19,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1496970165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:12:19,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:12:19,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [5, 5, 4] total 36 [2024-11-09 05:12:19,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910072261] [2024-11-09 05:12:19,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:12:19,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-09 05:12:19,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:12:19,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-09 05:12:19,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1061, Unknown=0, NotChecked=0, Total=1260 [2024-11-09 05:12:19,317 INFO L87 Difference]: Start difference. First operand 956 states and 1208 transitions. Second operand has 31 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 7 states have call successors, (8), 7 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-09 05:12:29,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:12:29,301 INFO L93 Difference]: Finished difference Result 1595 states and 1964 transitions. [2024-11-09 05:12:29,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 05:12:29,302 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 7 states have call successors, (8), 7 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Word has length 55 [2024-11-09 05:12:29,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:12:29,310 INFO L225 Difference]: With dead ends: 1595 [2024-11-09 05:12:29,310 INFO L226 Difference]: Without dead ends: 982 [2024-11-09 05:12:29,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 131 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=405, Invalid=1947, Unknown=0, NotChecked=0, Total=2352 [2024-11-09 05:12:29,314 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 140 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 2234 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1502 SdHoareTripleChecker+Invalid, 2364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 2234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:12:29,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1502 Invalid, 2364 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [130 Valid, 2234 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-09 05:12:29,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2024-11-09 05:12:29,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 974. [2024-11-09 05:12:29,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 974 states, 693 states have (on average 1.253968253968254) internal successors, (869), 699 states have internal predecessors, (869), 165 states have call successors, (165), 119 states have call predecessors, (165), 114 states have return successors, (194), 157 states have call predecessors, (194), 164 states have call successors, (194) [2024-11-09 05:12:29,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1228 transitions. [2024-11-09 05:12:29,489 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1228 transitions. Word has length 55 [2024-11-09 05:12:29,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:12:29,490 INFO L471 AbstractCegarLoop]: Abstraction has 974 states and 1228 transitions. [2024-11-09 05:12:29,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 7 states have call successors, (8), 7 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-09 05:12:29,491 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1228 transitions. [2024-11-09 05:12:29,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 05:12:29,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:12:29,493 INFO L215 NwaCegarLoop]: trace histogram [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-09 05:12:29,521 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 05:12:29,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-09 05:12:29,697 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:12:29,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:12:29,698 INFO L85 PathProgramCache]: Analyzing trace with hash -627457117, now seen corresponding path program 1 times [2024-11-09 05:12:29,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:12:29,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229030296] [2024-11-09 05:12:29,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:12:29,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:12:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:12:29,783 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 05:12:29,783 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:12:29,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229030296] [2024-11-09 05:12:29,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229030296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:12:29,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:12:29,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:12:29,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989068032] [2024-11-09 05:12:29,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:12:29,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:12:29,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:12:29,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:12:29,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:12:29,786 INFO L87 Difference]: Start difference. First operand 974 states and 1228 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 05:12:30,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:12:30,096 INFO L93 Difference]: Finished difference Result 1556 states and 1911 transitions. [2024-11-09 05:12:30,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:12:30,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 61 [2024-11-09 05:12:30,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:12:30,107 INFO L225 Difference]: With dead ends: 1556 [2024-11-09 05:12:30,107 INFO L226 Difference]: Without dead ends: 1183 [2024-11-09 05:12:30,109 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-09 05:12:30,110 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 43 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:12:30,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 358 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:12:30,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2024-11-09 05:12:30,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1095. [2024-11-09 05:12:30,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1095 states, 774 states have (on average 1.2428940568475453) internal successors, (962), 784 states have internal predecessors, (962), 187 states have call successors, (187), 141 states have call predecessors, (187), 132 states have return successors, (216), 171 states have call predecessors, (216), 186 states have call successors, (216) [2024-11-09 05:12:30,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1365 transitions. [2024-11-09 05:12:30,334 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1365 transitions. Word has length 61 [2024-11-09 05:12:30,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:12:30,334 INFO L471 AbstractCegarLoop]: Abstraction has 1095 states and 1365 transitions. [2024-11-09 05:12:30,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 05:12:30,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1365 transitions. [2024-11-09 05:12:30,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 05:12:30,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:12:30,337 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-09 05:12:30,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 05:12:30,338 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:12:30,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:12:30,339 INFO L85 PathProgramCache]: Analyzing trace with hash 851359314, now seen corresponding path program 1 times [2024-11-09 05:12:30,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:12:30,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992040214] [2024-11-09 05:12:30,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:12:30,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:12:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:12:30,619 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-09 05:12:30,619 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:12:30,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992040214] [2024-11-09 05:12:30,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992040214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:12:30,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:12:30,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 05:12:30,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527140051] [2024-11-09 05:12:30,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:12:30,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:12:30,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:12:30,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:12:30,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:12:30,623 INFO L87 Difference]: Start difference. First operand 1095 states and 1365 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-09 05:12:31,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:12:31,337 INFO L93 Difference]: Finished difference Result 1631 states and 2132 transitions. [2024-11-09 05:12:31,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 05:12:31,338 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-09 05:12:31,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:12:31,349 INFO L225 Difference]: With dead ends: 1631 [2024-11-09 05:12:31,349 INFO L226 Difference]: Without dead ends: 1300 [2024-11-09 05:12:31,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-09 05:12:31,353 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 308 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:12:31,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 399 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 05:12:31,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2024-11-09 05:12:31,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1280. [2024-11-09 05:12:31,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 908 states have (on average 1.251101321585903) internal successors, (1136), 920 states have internal predecessors, (1136), 220 states have call successors, (220), 159 states have call predecessors, (220), 150 states have return successors, (264), 202 states have call predecessors, (264), 219 states have call successors, (264) [2024-11-09 05:12:31,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1620 transitions. [2024-11-09 05:12:31,623 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1620 transitions. Word has length 67 [2024-11-09 05:12:31,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:12:31,624 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 1620 transitions. [2024-11-09 05:12:31,624 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-09 05:12:31,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1620 transitions. [2024-11-09 05:12:31,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-09 05:12:31,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:12:31,627 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-09 05:12:31,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 05:12:31,627 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:12:31,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:12:31,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1437756938, now seen corresponding path program 1 times [2024-11-09 05:12:31,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:12:31,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058850345] [2024-11-09 05:12:31,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:12:31,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:12:31,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:12:31,876 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-09 05:12:31,877 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:12:31,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058850345] [2024-11-09 05:12:31,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058850345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:12:31,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:12:31,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 05:12:31,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72398562] [2024-11-09 05:12:31,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:12:31,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:12:31,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:12:31,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:12:31,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:12:31,881 INFO L87 Difference]: Start difference. First operand 1280 states and 1620 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-09 05:12:32,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:12:32,682 INFO L93 Difference]: Finished difference Result 2304 states and 3076 transitions. [2024-11-09 05:12:32,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 05:12:32,683 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-09 05:12:32,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:12:32,697 INFO L225 Difference]: With dead ends: 2304 [2024-11-09 05:12:32,697 INFO L226 Difference]: Without dead ends: 1788 [2024-11-09 05:12:32,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-09 05:12:32,701 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 308 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:12:32,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 376 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 05:12:32,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1788 states. [2024-11-09 05:12:33,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1788 to 1746. [2024-11-09 05:12:33,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1746 states, 1244 states have (on average 1.2588424437299035) internal successors, (1566), 1261 states have internal predecessors, (1566), 302 states have call successors, (302), 207 states have call predecessors, (302), 198 states have return successors, (376), 279 states have call predecessors, (376), 301 states have call successors, (376) [2024-11-09 05:12:33,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1746 states to 1746 states and 2244 transitions. [2024-11-09 05:12:33,190 INFO L78 Accepts]: Start accepts. Automaton has 1746 states and 2244 transitions. Word has length 69 [2024-11-09 05:12:33,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:12:33,191 INFO L471 AbstractCegarLoop]: Abstraction has 1746 states and 2244 transitions. [2024-11-09 05:12:33,191 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-09 05:12:33,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1746 states and 2244 transitions. [2024-11-09 05:12:33,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 05:12:33,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:12:33,198 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-09 05:12:33,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 05:12:33,198 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:12:33,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:12:33,199 INFO L85 PathProgramCache]: Analyzing trace with hash 834128274, now seen corresponding path program 1 times [2024-11-09 05:12:33,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:12:33,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447323264] [2024-11-09 05:12:33,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:12:33,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:12:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:12:33,285 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-09 05:12:33,285 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:12:33,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447323264] [2024-11-09 05:12:33,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447323264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:12:33,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:12:33,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:12:33,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310634313] [2024-11-09 05:12:33,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:12:33,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:12:33,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:12:33,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:12:33,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:12:33,288 INFO L87 Difference]: Start difference. First operand 1746 states and 2244 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-09 05:12:33,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:12:33,701 INFO L93 Difference]: Finished difference Result 2819 states and 3743 transitions. [2024-11-09 05:12:33,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:12:33,701 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-09 05:12:33,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:12:33,716 INFO L225 Difference]: With dead ends: 2819 [2024-11-09 05:12:33,717 INFO L226 Difference]: Without dead ends: 1961 [2024-11-09 05:12:33,721 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-09 05:12:33,722 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 36 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:12:33,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 370 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:12:33,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2024-11-09 05:12:34,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1844. [2024-11-09 05:12:34,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1844 states, 1330 states have (on average 1.2661654135338345) internal successors, (1684), 1347 states have internal predecessors, (1684), 308 states have call successors, (308), 213 states have call predecessors, (308), 204 states have return successors, (382), 285 states have call predecessors, (382), 307 states have call successors, (382) [2024-11-09 05:12:34,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 2374 transitions. [2024-11-09 05:12:34,067 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 2374 transitions. Word has length 71 [2024-11-09 05:12:34,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:12:34,067 INFO L471 AbstractCegarLoop]: Abstraction has 1844 states and 2374 transitions. [2024-11-09 05:12:34,067 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-09 05:12:34,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 2374 transitions. [2024-11-09 05:12:34,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-09 05:12:34,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:12:34,073 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-09 05:12:34,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 05:12:34,074 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:12:34,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:12:34,074 INFO L85 PathProgramCache]: Analyzing trace with hash 2108193240, now seen corresponding path program 1 times [2024-11-09 05:12:34,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:12:34,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692297048] [2024-11-09 05:12:34,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:12:34,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:12:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:12:34,170 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-09 05:12:34,171 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:12:34,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692297048] [2024-11-09 05:12:34,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692297048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:12:34,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:12:34,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:12:34,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927486232] [2024-11-09 05:12:34,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:12:34,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:12:34,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:12:34,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:12:34,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:12:34,174 INFO L87 Difference]: Start difference. First operand 1844 states and 2374 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-09 05:12:34,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:12:34,640 INFO L93 Difference]: Finished difference Result 3461 states and 4632 transitions. [2024-11-09 05:12:34,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:12:34,641 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-09 05:12:34,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:12:34,658 INFO L225 Difference]: With dead ends: 3461 [2024-11-09 05:12:34,658 INFO L226 Difference]: Without dead ends: 2380 [2024-11-09 05:12:34,664 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-09 05:12:34,665 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 161 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:12:34,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 269 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:12:34,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2380 states. [2024-11-09 05:12:35,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2380 to 2367. [2024-11-09 05:12:35,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2367 states, 1717 states have (on average 1.2638322655794991) internal successors, (2170), 1739 states have internal predecessors, (2170), 393 states have call successors, (393), 264 states have call predecessors, (393), 255 states have return successors, (497), 365 states have call predecessors, (497), 392 states have call successors, (497) [2024-11-09 05:12:35,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 2367 states and 3060 transitions. [2024-11-09 05:12:35,127 INFO L78 Accepts]: Start accepts. Automaton has 2367 states and 3060 transitions. Word has length 90 [2024-11-09 05:12:35,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:12:35,128 INFO L471 AbstractCegarLoop]: Abstraction has 2367 states and 3060 transitions. [2024-11-09 05:12:35,128 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-09 05:12:35,129 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 3060 transitions. [2024-11-09 05:12:35,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 05:12:35,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:12:35,135 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:12:35,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 05:12:35,135 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:12:35,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:12:35,137 INFO L85 PathProgramCache]: Analyzing trace with hash 981583208, now seen corresponding path program 1 times [2024-11-09 05:12:35,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:12:35,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795363573] [2024-11-09 05:12:35,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:12:35,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:12:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:12:35,633 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-09 05:12:35,634 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:12:35,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795363573] [2024-11-09 05:12:35,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795363573] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:12:35,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641722904] [2024-11-09 05:12:35,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:12:35,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:12:35,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:12:35,636 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:12:35,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 05:12:35,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:12:35,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 05:12:35,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:12:35,880 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 05:12:35,881 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:12:35,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641722904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:12:35,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:12:35,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 17 [2024-11-09 05:12:35,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407538600] [2024-11-09 05:12:35,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:12:35,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:12:35,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:12:35,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:12:35,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-11-09 05:12:35,884 INFO L87 Difference]: Start difference. First operand 2367 states and 3060 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-09 05:12:36,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:12:36,478 INFO L93 Difference]: Finished difference Result 2914 states and 3711 transitions. [2024-11-09 05:12:36,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:12:36,479 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 102 [2024-11-09 05:12:36,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:12:36,541 INFO L225 Difference]: With dead ends: 2914 [2024-11-09 05:12:36,542 INFO L226 Difference]: Without dead ends: 2162 [2024-11-09 05:12:36,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2024-11-09 05:12:36,545 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 126 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:12:36,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 731 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:12:36,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2162 states. [2024-11-09 05:12:36,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2162 to 2139. [2024-11-09 05:12:36,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2139 states, 1575 states have (on average 1.2736507936507937) internal successors, (2006), 1595 states have internal predecessors, (2006), 345 states have call successors, (345), 222 states have call predecessors, (345), 217 states have return successors, (445), 323 states have call predecessors, (445), 344 states have call successors, (445) [2024-11-09 05:12:36,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 2796 transitions. [2024-11-09 05:12:36,913 INFO L78 Accepts]: Start accepts. Automaton has 2139 states and 2796 transitions. Word has length 102 [2024-11-09 05:12:36,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:12:36,914 INFO L471 AbstractCegarLoop]: Abstraction has 2139 states and 2796 transitions. [2024-11-09 05:12:36,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-09 05:12:36,915 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 2796 transitions. [2024-11-09 05:12:36,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 05:12:36,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:12:36,921 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:12:36,946 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 05:12:37,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-09 05:12:37,122 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:12:37,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:12:37,123 INFO L85 PathProgramCache]: Analyzing trace with hash 374440766, now seen corresponding path program 1 times [2024-11-09 05:12:37,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:12:37,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010201948] [2024-11-09 05:12:37,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:12:37,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:12:37,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:12:37,371 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-09 05:12:37,372 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:12:37,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010201948] [2024-11-09 05:12:37,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010201948] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:12:37,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949626799] [2024-11-09 05:12:37,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:12:37,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:12:37,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:12:37,375 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:12:37,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 05:12:37,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:12:37,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 05:12:37,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:12:37,576 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 05:12:37,576 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:12:37,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949626799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:12:37,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:12:37,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-11-09 05:12:37,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066016255] [2024-11-09 05:12:37,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:12:37,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:12:37,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:12:37,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:12:37,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:12:37,579 INFO L87 Difference]: Start difference. First operand 2139 states and 2796 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-09 05:12:38,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:12:38,042 INFO L93 Difference]: Finished difference Result 2438 states and 3154 transitions. [2024-11-09 05:12:38,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:12:38,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 104 [2024-11-09 05:12:38,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:12:38,060 INFO L225 Difference]: With dead ends: 2438 [2024-11-09 05:12:38,060 INFO L226 Difference]: Without dead ends: 1988 [2024-11-09 05:12:38,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:12:38,064 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 53 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:12:38,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 343 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:12:38,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2024-11-09 05:12:38,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1872. [2024-11-09 05:12:38,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1872 states, 1385 states have (on average 1.28014440433213) internal successors, (1773), 1403 states have internal predecessors, (1773), 303 states have call successors, (303), 183 states have call predecessors, (303), 182 states have return successors, (399), 287 states have call predecessors, (399), 302 states have call successors, (399) [2024-11-09 05:12:38,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1872 states and 2475 transitions. [2024-11-09 05:12:38,506 INFO L78 Accepts]: Start accepts. Automaton has 1872 states and 2475 transitions. Word has length 104 [2024-11-09 05:12:38,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:12:38,506 INFO L471 AbstractCegarLoop]: Abstraction has 1872 states and 2475 transitions. [2024-11-09 05:12:38,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-09 05:12:38,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1872 states and 2475 transitions. [2024-11-09 05:12:38,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 05:12:38,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:12:38,513 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:12:38,539 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 05:12:38,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-09 05:12:38,713 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:12:38,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:12:38,714 INFO L85 PathProgramCache]: Analyzing trace with hash -25550433, now seen corresponding path program 1 times [2024-11-09 05:12:38,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:12:38,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285787819] [2024-11-09 05:12:38,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:12:38,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:12:38,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:12:38,977 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-09 05:12:38,977 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:12:38,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285787819] [2024-11-09 05:12:38,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285787819] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:12:38,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589287606] [2024-11-09 05:12:38,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:12:38,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:12:38,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:12:38,980 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:12:38,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 05:12:39,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:12:39,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 05:12:39,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:12:39,632 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 05:12:39,632 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:12:39,849 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-09 05:12:39,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589287606] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:12:39,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [520850340] [2024-11-09 05:12:39,855 INFO L159 IcfgInterpreter]: Started Sifa with 65 locations of interest [2024-11-09 05:12:39,858 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:12:39,859 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:12:39,860 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:12:39,861 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:12:47,988 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events1 with input of size 141 for LOIs [2024-11-09 05:12:48,171 INFO L197 IcfgInterpreter]: Interpreting procedure error1 with input of size 112 for LOIs [2024-11-09 05:12:48,356 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread1 with input of size 58 for LOIs [2024-11-09 05:12:48,381 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads1 with input of size 126 for LOIs [2024-11-09 05:12:49,675 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_write_p_triggered with input of size 127 for LOIs [2024-11-09 05:12:50,551 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_read_c_triggered with input of size 72 for LOIs [2024-11-09 05:12:50,638 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events1 with input of size 120 for LOIs [2024-11-09 05:12:50,740 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels1 with input of size 131 for LOIs [2024-11-09 05:12:50,852 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:13:09,308 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '67942#(and (= ~q_req_up~0 1) (= ~q_free~0 1) (exists ((|v_ULTIMATE.start_eval1_~tmp___0~2#1_16| Int)) (and (not (= |v_ULTIMATE.start_eval1_~tmp___0~2#1_16| 0)) (<= |v_ULTIMATE.start_eval1_~tmp___0~2#1_16| 2147483647) (<= 0 (+ |v_ULTIMATE.start_eval1_~tmp___0~2#1_16| 2147483648)))) (not (= ~c_num_read~0 ~p_num_write~0)) (= ~c_last_read~0 ~q_buf_0~0) (= ~c_dr_pc~0 0) (exists ((v_~c_last_read~0_10 Int) (v_~q_free~0_42 Int)) (and (<= 1 |#StackHeapBarrier|) (= v_~c_last_read~0_10 0) (= ~t1_pc~0 0) (= ~T1_E~0 2) (<= 0 ~p_dw_pc~0) (= ~m_st~0 0) (<= 0 ~p_num_write~0) (= ~T2_E~0 2) (= 1 ~c_dr_i~0) (= ~t2_i~0 0) (= ~t1_st~0 0) (= ~c_num_read~0 1) (or (and (exists ((|v_ULTIMATE.start_eval1_~tmp~2#1_18| Int)) (and (not (= |v_ULTIMATE.start_eval1_~tmp~2#1_18| 0)) (<= |v_ULTIMATE.start_eval1_~tmp~2#1_18| 2147483647) (<= 0 (+ |v_ULTIMATE.start_eval1_~tmp~2#1_18| 2147483648)))) (exists ((|v_ULTIMATE.start_eval1_~tmp___1~0#1_23| Int)) (and (<= 0 |v_ULTIMATE.start_eval1_~tmp___1~0#1_23|) (<= |v_ULTIMATE.start_eval1_~tmp___1~0#1_23| 1) (not (= |v_ULTIMATE.start_eval1_~tmp___1~0#1_23| 0)))) (= ~p_dw_pc~0 1) (= 2 ~p_dw_st~0) (= v_~q_free~0_42 0)) (and (not (= ~p_dw_st~0 0)) (exists ((|v_ULTIMATE.start_eval1_~tmp___1~0#1_23| Int)) (and (<= 0 |v_ULTIMATE.start_eval1_~tmp___1~0#1_23|) (<= |v_ULTIMATE.start_eval1_~tmp___1~0#1_23| 1) (not (= |v_ULTIMATE.start_eval1_~tmp___1~0#1_23| 0)))))) (= ~m_i~0 0) (= ~E_2~0 2) (not (= v_~q_free~0_42 1)) (= ~local~0 0) (= ~token~0 0) (= ~m_pc~0 0) (= ~p_dw_i~0 1) (= 0 ~t2_pc~0) (= ~E_M~0 2) (= ~a_t~0 0) (= 0 ~t2_st~0) (<= v_~q_free~0_42 1) (= ~E_1~0 2) (= ~M_E~0 2) (= ~t1_i~0 0))) (= ~c_last_read~0 ~p_last_write~0) (= ~c_dr_st~0 1))' at error location [2024-11-09 05:13:09,308 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:13:09,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:13:09,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 13 [2024-11-09 05:13:09,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204355896] [2024-11-09 05:13:09,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:13:09,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 05:13:09,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:13:09,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 05:13:09,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=2973, Unknown=0, NotChecked=0, Total=3306 [2024-11-09 05:13:09,312 INFO L87 Difference]: Start difference. First operand 1872 states and 2475 transitions. Second operand has 13 states, 12 states have (on average 13.166666666666666) internal successors, (158), 12 states have internal predecessors, (158), 9 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (41), 10 states have call predecessors, (41), 9 states have call successors, (41) [2024-11-09 05:13:12,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:13:12,922 INFO L93 Difference]: Finished difference Result 2812 states and 3562 transitions. [2024-11-09 05:13:12,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-11-09 05:13:12,924 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 13.166666666666666) internal successors, (158), 12 states have internal predecessors, (158), 9 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (41), 10 states have call predecessors, (41), 9 states have call successors, (41) Word has length 104 [2024-11-09 05:13:12,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:13:12,940 INFO L225 Difference]: With dead ends: 2812 [2024-11-09 05:13:12,940 INFO L226 Difference]: Without dead ends: 2630 [2024-11-09 05:13:12,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 272 SyntacticMatches, 8 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 4820 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=1088, Invalid=12252, Unknown=0, NotChecked=0, Total=13340 [2024-11-09 05:13:12,947 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 891 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 1675 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 1324 SdHoareTripleChecker+Invalid, 2047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 1675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:13:12,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 1324 Invalid, 2047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 1675 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 05:13:12,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2024-11-09 05:13:13,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 2267. [2024-11-09 05:13:13,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2267 states, 1670 states have (on average 1.2622754491017965) internal successors, (2108), 1688 states have internal predecessors, (2108), 361 states have call successors, (361), 235 states have call predecessors, (361), 234 states have return successors, (457), 345 states have call predecessors, (457), 360 states have call successors, (457) [2024-11-09 05:13:13,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 2267 states and 2926 transitions. [2024-11-09 05:13:13,349 INFO L78 Accepts]: Start accepts. Automaton has 2267 states and 2926 transitions. Word has length 104 [2024-11-09 05:13:13,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:13:13,349 INFO L471 AbstractCegarLoop]: Abstraction has 2267 states and 2926 transitions. [2024-11-09 05:13:13,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 13.166666666666666) internal successors, (158), 12 states have internal predecessors, (158), 9 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (41), 10 states have call predecessors, (41), 9 states have call successors, (41) [2024-11-09 05:13:13,350 INFO L276 IsEmpty]: Start isEmpty. Operand 2267 states and 2926 transitions. [2024-11-09 05:13:13,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 05:13:13,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:13:13,357 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:13:13,385 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 05:13:13,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 05:13:13,558 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:13:13,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:13:13,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1150054377, now seen corresponding path program 1 times [2024-11-09 05:13:13,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:13:13,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234241718] [2024-11-09 05:13:13,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:13:13,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:13:13,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:13:13,617 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-09 05:13:13,617 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:13:13,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234241718] [2024-11-09 05:13:13,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234241718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:13:13,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:13:13,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:13:13,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824424604] [2024-11-09 05:13:13,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:13:13,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:13:13,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:13:13,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:13:13,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:13:13,620 INFO L87 Difference]: Start difference. First operand 2267 states and 2926 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 05:13:14,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:13:14,083 INFO L93 Difference]: Finished difference Result 2766 states and 3498 transitions. [2024-11-09 05:13:14,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:13:14,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 108 [2024-11-09 05:13:14,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:13:14,099 INFO L225 Difference]: With dead ends: 2766 [2024-11-09 05:13:14,100 INFO L226 Difference]: Without dead ends: 2257 [2024-11-09 05:13:14,102 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-09 05:13:14,103 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 172 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:13:14,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 269 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:13:14,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2024-11-09 05:13:14,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 2248. [2024-11-09 05:13:14,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2248 states, 1653 states have (on average 1.2558983666061705) internal successors, (2076), 1671 states have internal predecessors, (2076), 360 states have call successors, (360), 234 states have call predecessors, (360), 233 states have return successors, (456), 344 states have call predecessors, (456), 359 states have call successors, (456) [2024-11-09 05:13:14,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 2892 transitions. [2024-11-09 05:13:14,560 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 2892 transitions. Word has length 108 [2024-11-09 05:13:14,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:13:14,560 INFO L471 AbstractCegarLoop]: Abstraction has 2248 states and 2892 transitions. [2024-11-09 05:13:14,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 05:13:14,561 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 2892 transitions. [2024-11-09 05:13:14,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 05:13:14,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:13:14,567 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-09 05:13:14,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 05:13:14,568 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:13:14,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:13:14,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1184666490, now seen corresponding path program 1 times [2024-11-09 05:13:14,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:13:14,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474039628] [2024-11-09 05:13:14,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:13:14,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:13:14,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:13:14,662 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-09 05:13:14,662 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:13:14,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474039628] [2024-11-09 05:13:14,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474039628] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:13:14,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138227166] [2024-11-09 05:13:14,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:13:14,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:13:14,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:13:14,669 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:13:14,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 05:13:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:13:14,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 05:13:14,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:13:14,860 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-09 05:13:14,860 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:13:14,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138227166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:13:14,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:13:14,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-09 05:13:14,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247889790] [2024-11-09 05:13:14,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:13:14,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:13:14,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:13:14,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:13:14,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:13:14,863 INFO L87 Difference]: Start difference. First operand 2248 states and 2892 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-09 05:13:15,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:13:15,368 INFO L93 Difference]: Finished difference Result 3773 states and 4995 transitions. [2024-11-09 05:13:15,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:13:15,369 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-09 05:13:15,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:13:15,388 INFO L225 Difference]: With dead ends: 3773 [2024-11-09 05:13:15,390 INFO L226 Difference]: Without dead ends: 2589 [2024-11-09 05:13:15,396 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-09 05:13:15,397 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 159 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:13:15,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 192 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:13:15,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2589 states. [2024-11-09 05:13:15,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2589 to 2533. [2024-11-09 05:13:15,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2533 states, 1900 states have (on average 1.2547368421052632) internal successors, (2384), 1915 states have internal predecessors, (2384), 366 states have call successors, (366), 264 states have call predecessors, (366), 265 states have return successors, (461), 355 states have call predecessors, (461), 365 states have call successors, (461) [2024-11-09 05:13:15,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2533 states to 2533 states and 3211 transitions. [2024-11-09 05:13:15,893 INFO L78 Accepts]: Start accepts. Automaton has 2533 states and 3211 transitions. Word has length 105 [2024-11-09 05:13:15,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:13:15,894 INFO L471 AbstractCegarLoop]: Abstraction has 2533 states and 3211 transitions. [2024-11-09 05:13:15,895 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-09 05:13:15,895 INFO L276 IsEmpty]: Start isEmpty. Operand 2533 states and 3211 transitions. [2024-11-09 05:13:15,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 05:13:15,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:13:15,903 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-09 05:13:15,925 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 05:13:16,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-09 05:13:16,104 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:13:16,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:13:16,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1519905829, now seen corresponding path program 1 times [2024-11-09 05:13:16,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:13:16,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487156069] [2024-11-09 05:13:16,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:13:16,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:13:16,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:13:16,199 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-09 05:13:16,199 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:13:16,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487156069] [2024-11-09 05:13:16,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487156069] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:13:16,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407134749] [2024-11-09 05:13:16,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:13:16,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:13:16,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:13:16,202 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:13:16,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 05:13:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:13:16,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 05:13:16,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:13:16,372 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-09 05:13:16,372 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:13:16,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407134749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:13:16,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:13:16,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-09 05:13:16,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771038552] [2024-11-09 05:13:16,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:13:16,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:13:16,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:13:16,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:13:16,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:13:16,375 INFO L87 Difference]: Start difference. First operand 2533 states and 3211 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-09 05:13:17,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:13:17,162 INFO L93 Difference]: Finished difference Result 4255 states and 5539 transitions. [2024-11-09 05:13:17,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:13:17,163 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-09 05:13:17,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:13:17,180 INFO L225 Difference]: With dead ends: 4255 [2024-11-09 05:13:17,181 INFO L226 Difference]: Without dead ends: 2975 [2024-11-09 05:13:17,185 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-09 05:13:17,186 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 53 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:13:17,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 376 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:13:17,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2024-11-09 05:13:17,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 2680. [2024-11-09 05:13:17,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2680 states, 2025 states have (on average 1.2632098765432098) internal successors, (2558), 2040 states have internal predecessors, (2558), 377 states have call successors, (377), 275 states have call predecessors, (377), 276 states have return successors, (472), 366 states have call predecessors, (472), 376 states have call successors, (472) [2024-11-09 05:13:17,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2680 states to 2680 states and 3407 transitions. [2024-11-09 05:13:17,698 INFO L78 Accepts]: Start accepts. Automaton has 2680 states and 3407 transitions. Word has length 105 [2024-11-09 05:13:17,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:13:17,698 INFO L471 AbstractCegarLoop]: Abstraction has 2680 states and 3407 transitions. [2024-11-09 05:13:17,699 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-09 05:13:17,699 INFO L276 IsEmpty]: Start isEmpty. Operand 2680 states and 3407 transitions. [2024-11-09 05:13:17,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 05:13:17,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:13:17,712 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-09 05:13:17,734 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 05:13:17,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:13:17,913 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:13:17,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:13:17,913 INFO L85 PathProgramCache]: Analyzing trace with hash 582380614, now seen corresponding path program 2 times [2024-11-09 05:13:17,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:13:17,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009582890] [2024-11-09 05:13:17,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:13:17,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:13:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:13:18,083 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-09 05:13:18,083 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:13:18,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009582890] [2024-11-09 05:13:18,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009582890] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:13:18,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893210726] [2024-11-09 05:13:18,084 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 05:13:18,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:13:18,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:13:18,086 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:13:18,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 05:13:18,193 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 05:13:18,193 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 05:13:18,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 05:13:18,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:13:18,224 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-09 05:13:18,225 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:13:18,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893210726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:13:18,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:13:18,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2024-11-09 05:13:18,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628061580] [2024-11-09 05:13:18,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:13:18,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:13:18,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:13:18,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:13:18,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:13:18,227 INFO L87 Difference]: Start difference. First operand 2680 states and 3407 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-09 05:13:18,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:13:18,665 INFO L93 Difference]: Finished difference Result 4305 states and 5535 transitions. [2024-11-09 05:13:18,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:13:18,666 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-09 05:13:18,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:13:18,681 INFO L225 Difference]: With dead ends: 4305 [2024-11-09 05:13:18,682 INFO L226 Difference]: Without dead ends: 2811 [2024-11-09 05:13:18,687 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-09 05:13:18,688 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 168 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:13:18,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 498 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:13:18,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2811 states. [2024-11-09 05:13:19,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2811 to 2765. [2024-11-09 05:13:19,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2765 states, 2085 states have (on average 1.260431654676259) internal successors, (2628), 2106 states have internal predecessors, (2628), 385 states have call successors, (385), 280 states have call predecessors, (385), 293 states have return successors, (498), 380 states have call predecessors, (498), 384 states have call successors, (498) [2024-11-09 05:13:19,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2765 states to 2765 states and 3511 transitions. [2024-11-09 05:13:19,161 INFO L78 Accepts]: Start accepts. Automaton has 2765 states and 3511 transitions. Word has length 105 [2024-11-09 05:13:19,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:13:19,162 INFO L471 AbstractCegarLoop]: Abstraction has 2765 states and 3511 transitions. [2024-11-09 05:13:19,162 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-09 05:13:19,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2765 states and 3511 transitions. [2024-11-09 05:13:19,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 05:13:19,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:13:19,170 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-09 05:13:19,193 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 05:13:19,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:13:19,371 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:13:19,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:13:19,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1311061561, now seen corresponding path program 2 times [2024-11-09 05:13:19,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:13:19,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072137682] [2024-11-09 05:13:19,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:13:19,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:13:19,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:13:19,535 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-09 05:13:19,536 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:13:19,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072137682] [2024-11-09 05:13:19,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072137682] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:13:19,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060527123] [2024-11-09 05:13:19,536 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 05:13:19,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:13:19,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:13:19,539 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:13:19,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 05:13:19,663 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 05:13:19,663 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 05:13:19,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 05:13:19,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:13:19,694 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-09 05:13:19,696 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:13:19,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060527123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:13:19,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:13:19,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-09 05:13:19,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363392336] [2024-11-09 05:13:19,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:13:19,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:13:19,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:13:19,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:13:19,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:13:19,698 INFO L87 Difference]: Start difference. First operand 2765 states and 3511 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-09 05:13:20,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:13:20,143 INFO L93 Difference]: Finished difference Result 4234 states and 5630 transitions. [2024-11-09 05:13:20,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:13:20,144 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-09 05:13:20,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:13:20,159 INFO L225 Difference]: With dead ends: 4234 [2024-11-09 05:13:20,159 INFO L226 Difference]: Without dead ends: 2775 [2024-11-09 05:13:20,165 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-09 05:13:20,165 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 85 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:13:20,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 372 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:13:20,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2775 states. [2024-11-09 05:13:20,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2775 to 2759. [2024-11-09 05:13:20,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2759 states, 2079 states have (on average 1.2342472342472341) internal successors, (2566), 2100 states have internal predecessors, (2566), 385 states have call successors, (385), 280 states have call predecessors, (385), 293 states have return successors, (498), 380 states have call predecessors, (498), 384 states have call successors, (498) [2024-11-09 05:13:20,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2759 states to 2759 states and 3449 transitions. [2024-11-09 05:13:20,716 INFO L78 Accepts]: Start accepts. Automaton has 2759 states and 3449 transitions. Word has length 105 [2024-11-09 05:13:20,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:13:20,716 INFO L471 AbstractCegarLoop]: Abstraction has 2759 states and 3449 transitions. [2024-11-09 05:13:20,717 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-09 05:13:20,717 INFO L276 IsEmpty]: Start isEmpty. Operand 2759 states and 3449 transitions. [2024-11-09 05:13:20,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 05:13:20,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:13:20,725 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-09 05:13:20,749 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 05:13:20,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:13:20,929 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:13:20,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:13:20,930 INFO L85 PathProgramCache]: Analyzing trace with hash 937530087, now seen corresponding path program 1 times [2024-11-09 05:13:20,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:13:20,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127399798] [2024-11-09 05:13:20,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:13:20,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:13:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:13:21,096 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-09 05:13:21,097 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:13:21,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127399798] [2024-11-09 05:13:21,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127399798] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:13:21,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012746297] [2024-11-09 05:13:21,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:13:21,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:13:21,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:13:21,100 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:13:21,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 05:13:21,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:13:21,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 05:13:21,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:13:21,260 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-09 05:13:21,261 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:13:21,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012746297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:13:21,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:13:21,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-09 05:13:21,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124335036] [2024-11-09 05:13:21,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:13:21,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:13:21,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:13:21,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:13:21,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:13:21,262 INFO L87 Difference]: Start difference. First operand 2759 states and 3449 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-09 05:13:21,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:13:21,756 INFO L93 Difference]: Finished difference Result 4721 states and 6124 transitions. [2024-11-09 05:13:21,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:13:21,756 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-09 05:13:21,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:13:21,774 INFO L225 Difference]: With dead ends: 4721 [2024-11-09 05:13:21,774 INFO L226 Difference]: Without dead ends: 3185 [2024-11-09 05:13:21,780 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-09 05:13:21,781 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 77 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:13:21,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 384 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:13:21,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3185 states. [2024-11-09 05:13:22,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3185 to 3123. [2024-11-09 05:13:22,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3123 states, 2369 states have (on average 1.225833685099198) internal successors, (2904), 2393 states have internal predecessors, (2904), 428 states have call successors, (428), 313 states have call predecessors, (428), 324 states have return successors, (576), 418 states have call predecessors, (576), 427 states have call successors, (576) [2024-11-09 05:13:22,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 3908 transitions. [2024-11-09 05:13:22,280 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 3908 transitions. Word has length 105 [2024-11-09 05:13:22,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:13:22,280 INFO L471 AbstractCegarLoop]: Abstraction has 3123 states and 3908 transitions. [2024-11-09 05:13:22,281 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-09 05:13:22,281 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 3908 transitions. [2024-11-09 05:13:22,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-09 05:13:22,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:13:22,289 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-09 05:13:22,313 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-09 05:13:22,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:13:22,490 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:13:22,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:13:22,491 INFO L85 PathProgramCache]: Analyzing trace with hash 2066806347, now seen corresponding path program 1 times [2024-11-09 05:13:22,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:13:22,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245371675] [2024-11-09 05:13:22,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:13:22,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:13:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:13:22,665 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-09 05:13:22,665 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:13:22,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245371675] [2024-11-09 05:13:22,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245371675] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:13:22,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366602052] [2024-11-09 05:13:22,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:13:22,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:13:22,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:13:22,668 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:13:22,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 05:13:22,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:13:22,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 05:13:22,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:13:22,851 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-09 05:13:22,851 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:13:22,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366602052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:13:22,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:13:22,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-09 05:13:22,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137009447] [2024-11-09 05:13:22,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:13:22,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:13:22,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:13:22,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:13:22,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:13:22,858 INFO L87 Difference]: Start difference. First operand 3123 states and 3908 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-09 05:13:23,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:13:23,354 INFO L93 Difference]: Finished difference Result 4182 states and 5297 transitions. [2024-11-09 05:13:23,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:13:23,355 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-09 05:13:23,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:13:23,364 INFO L225 Difference]: With dead ends: 4182 [2024-11-09 05:13:23,364 INFO L226 Difference]: Without dead ends: 3056 [2024-11-09 05:13:23,366 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-09 05:13:23,367 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 16 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:13:23,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 334 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:13:23,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3056 states. [2024-11-09 05:13:23,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3056 to 3056. [2024-11-09 05:13:23,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3056 states, 2314 states have (on average 1.2242869490060502) internal successors, (2833), 2335 states have internal predecessors, (2833), 428 states have call successors, (428), 313 states have call predecessors, (428), 312 states have return successors, (558), 409 states have call predecessors, (558), 427 states have call successors, (558) [2024-11-09 05:13:23,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3056 states to 3056 states and 3819 transitions. [2024-11-09 05:13:23,800 INFO L78 Accepts]: Start accepts. Automaton has 3056 states and 3819 transitions. Word has length 107 [2024-11-09 05:13:23,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:13:23,801 INFO L471 AbstractCegarLoop]: Abstraction has 3056 states and 3819 transitions. [2024-11-09 05:13:23,801 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-09 05:13:23,801 INFO L276 IsEmpty]: Start isEmpty. Operand 3056 states and 3819 transitions. [2024-11-09 05:13:23,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 05:13:23,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:13:23,808 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-09 05:13:23,832 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-09 05:13:24,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:13:24,009 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:13:24,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:13:24,009 INFO L85 PathProgramCache]: Analyzing trace with hash -983553375, now seen corresponding path program 1 times [2024-11-09 05:13:24,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:13:24,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098766973] [2024-11-09 05:13:24,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:13:24,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:13:24,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:13:24,159 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-09 05:13:24,159 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:13:24,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098766973] [2024-11-09 05:13:24,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098766973] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:13:24,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142734633] [2024-11-09 05:13:24,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:13:24,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:13:24,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:13:24,162 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:13:24,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 05:13:24,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:13:24,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 05:13:24,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:13:24,322 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-09 05:13:24,322 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:13:24,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142734633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:13:24,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:13:24,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-09 05:13:24,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524662944] [2024-11-09 05:13:24,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:13:24,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:13:24,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:13:24,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:13:24,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:13:24,326 INFO L87 Difference]: Start difference. First operand 3056 states and 3819 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-09 05:13:25,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:13:25,055 INFO L93 Difference]: Finished difference Result 6340 states and 8066 transitions. [2024-11-09 05:13:25,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:13:25,056 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-09 05:13:25,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:13:25,077 INFO L225 Difference]: With dead ends: 6340 [2024-11-09 05:13:25,077 INFO L226 Difference]: Without dead ends: 3968 [2024-11-09 05:13:25,085 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-09 05:13:25,086 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 41 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:13:25,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 335 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:13:25,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3968 states. [2024-11-09 05:13:25,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3968 to 3331. [2024-11-09 05:13:25,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3331 states, 2547 states have (on average 1.2300745975657636) internal successors, (3133), 2569 states have internal predecessors, (3133), 449 states have call successors, (449), 334 states have call predecessors, (449), 333 states have return successors, (579), 429 states have call predecessors, (579), 448 states have call successors, (579) [2024-11-09 05:13:25,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3331 states to 3331 states and 4161 transitions. [2024-11-09 05:13:25,541 INFO L78 Accepts]: Start accepts. Automaton has 3331 states and 4161 transitions. Word has length 108 [2024-11-09 05:13:25,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:13:25,542 INFO L471 AbstractCegarLoop]: Abstraction has 3331 states and 4161 transitions. [2024-11-09 05:13:25,542 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-09 05:13:25,542 INFO L276 IsEmpty]: Start isEmpty. Operand 3331 states and 4161 transitions. [2024-11-09 05:13:25,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 05:13:25,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:13:25,549 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-09 05:13:25,574 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-09 05:13:25,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-09 05:13:25,753 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:13:25,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:13:25,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1410275533, now seen corresponding path program 1 times [2024-11-09 05:13:25,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:13:25,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222851377] [2024-11-09 05:13:25,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:13:25,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:13:25,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:13:25,879 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-09 05:13:25,879 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:13:25,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222851377] [2024-11-09 05:13:25,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222851377] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:13:25,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639292231] [2024-11-09 05:13:25,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:13:25,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:13:25,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:13:25,882 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:13:25,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 05:13:26,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:13:26,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 05:13:26,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:13:26,066 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-09 05:13:26,066 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:13:26,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639292231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:13:26,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:13:26,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2024-11-09 05:13:26,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832472183] [2024-11-09 05:13:26,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:13:26,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:13:26,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:13:26,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:13:26,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:13:26,069 INFO L87 Difference]: Start difference. First operand 3331 states and 4161 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-09 05:13:26,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:13:26,683 INFO L93 Difference]: Finished difference Result 5554 states and 7154 transitions. [2024-11-09 05:13:26,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:13:26,684 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-09 05:13:26,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:13:26,699 INFO L225 Difference]: With dead ends: 5554 [2024-11-09 05:13:26,699 INFO L226 Difference]: Without dead ends: 3713 [2024-11-09 05:13:26,706 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-09 05:13:26,707 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 151 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:13:26,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 207 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:13:26,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3713 states. [2024-11-09 05:13:27,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3713 to 3669. [2024-11-09 05:13:27,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3669 states, 2853 states have (on average 1.2117069751139151) internal successors, (3457), 2875 states have internal predecessors, (3457), 451 states have call successors, (451), 364 states have call predecessors, (451), 363 states have return successors, (627), 431 states have call predecessors, (627), 450 states have call successors, (627) [2024-11-09 05:13:27,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3669 states to 3669 states and 4535 transitions. [2024-11-09 05:13:27,416 INFO L78 Accepts]: Start accepts. Automaton has 3669 states and 4535 transitions. Word has length 110 [2024-11-09 05:13:27,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:13:27,416 INFO L471 AbstractCegarLoop]: Abstraction has 3669 states and 4535 transitions. [2024-11-09 05:13:27,416 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-09 05:13:27,417 INFO L276 IsEmpty]: Start isEmpty. Operand 3669 states and 4535 transitions. [2024-11-09 05:13:27,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-09 05:13:27,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:13:27,424 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:13:27,449 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-09 05:13:27,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-09 05:13:27,625 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:13:27,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:13:27,626 INFO L85 PathProgramCache]: Analyzing trace with hash -648848093, now seen corresponding path program 1 times [2024-11-09 05:13:27,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:13:27,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963342260] [2024-11-09 05:13:27,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:13:27,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:13:27,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:13:27,791 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 25 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-09 05:13:27,792 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:13:27,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963342260] [2024-11-09 05:13:27,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963342260] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:13:27,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626347611] [2024-11-09 05:13:27,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:13:27,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:13:27,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:13:27,795 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:13:27,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 05:13:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:13:27,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 05:13:27,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:13:28,043 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 05:13:28,043 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:13:28,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626347611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:13:28,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:13:28,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2024-11-09 05:13:28,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624061009] [2024-11-09 05:13:28,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:13:28,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 05:13:28,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:13:28,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 05:13:28,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-09 05:13:28,046 INFO L87 Difference]: Start difference. First operand 3669 states and 4535 transitions. Second operand has 7 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-09 05:13:28,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:13:28,925 INFO L93 Difference]: Finished difference Result 4189 states and 5129 transitions. [2024-11-09 05:13:28,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:13:28,925 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 112 [2024-11-09 05:13:28,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:13:28,943 INFO L225 Difference]: With dead ends: 4189 [2024-11-09 05:13:28,943 INFO L226 Difference]: Without dead ends: 3640 [2024-11-09 05:13:28,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-09 05:13:28,947 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 47 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:13:28,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 745 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:13:28,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3640 states. [2024-11-09 05:13:29,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3640 to 3580. [2024-11-09 05:13:29,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3580 states, 2792 states have (on average 1.21310888252149) internal successors, (3387), 2814 states have internal predecessors, (3387), 436 states have call successors, (436), 351 states have call predecessors, (436), 350 states have return successors, (612), 416 states have call predecessors, (612), 435 states have call successors, (612) [2024-11-09 05:13:29,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3580 states to 3580 states and 4435 transitions. [2024-11-09 05:13:29,430 INFO L78 Accepts]: Start accepts. Automaton has 3580 states and 4435 transitions. Word has length 112 [2024-11-09 05:13:29,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:13:29,430 INFO L471 AbstractCegarLoop]: Abstraction has 3580 states and 4435 transitions. [2024-11-09 05:13:29,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-09 05:13:29,431 INFO L276 IsEmpty]: Start isEmpty. Operand 3580 states and 4435 transitions. [2024-11-09 05:13:29,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 05:13:29,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:13:29,438 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-09 05:13:29,463 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-09 05:13:29,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:13:29,642 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:13:29,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:13:29,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1211577947, now seen corresponding path program 1 times [2024-11-09 05:13:29,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:13:29,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369288414] [2024-11-09 05:13:29,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:13:29,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:13:29,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:13:29,786 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-09 05:13:29,786 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:13:29,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369288414] [2024-11-09 05:13:29,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369288414] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:13:29,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009319375] [2024-11-09 05:13:29,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:13:29,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:13:29,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:13:29,789 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:13:29,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-09 05:13:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:13:29,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 05:13:29,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:13:29,952 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-09 05:13:29,952 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:13:29,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009319375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:13:29,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:13:29,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-09 05:13:29,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489045505] [2024-11-09 05:13:29,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:13:29,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:13:29,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:13:29,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:13:29,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:13:29,955 INFO L87 Difference]: Start difference. First operand 3580 states and 4435 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-09 05:13:30,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:13:30,698 INFO L93 Difference]: Finished difference Result 5287 states and 6554 transitions. [2024-11-09 05:13:30,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:13:30,698 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-09 05:13:30,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:13:30,718 INFO L225 Difference]: With dead ends: 5287 [2024-11-09 05:13:30,718 INFO L226 Difference]: Without dead ends: 3978 [2024-11-09 05:13:30,723 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-09 05:13:30,724 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 43 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:13:30,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 374 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:13:30,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3978 states. [2024-11-09 05:13:31,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3978 to 3768. [2024-11-09 05:13:31,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3768 states, 2948 states have (on average 1.2167571234735415) internal successors, (3587), 2970 states have internal predecessors, (3587), 452 states have call successors, (452), 367 states have call predecessors, (452), 366 states have return successors, (628), 432 states have call predecessors, (628), 451 states have call successors, (628) [2024-11-09 05:13:31,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3768 states to 3768 states and 4667 transitions. [2024-11-09 05:13:31,467 INFO L78 Accepts]: Start accepts. Automaton has 3768 states and 4667 transitions. Word has length 106 [2024-11-09 05:13:31,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:13:31,467 INFO L471 AbstractCegarLoop]: Abstraction has 3768 states and 4667 transitions. [2024-11-09 05:13:31,468 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-09 05:13:31,468 INFO L276 IsEmpty]: Start isEmpty. Operand 3768 states and 4667 transitions. [2024-11-09 05:13:31,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-09 05:13:31,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:13:31,475 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:13:31,499 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-09 05:13:31,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-09 05:13:31,676 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:13:31,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:13:31,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1123067633, now seen corresponding path program 1 times [2024-11-09 05:13:31,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:13:31,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919250625] [2024-11-09 05:13:31,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:13:31,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:13:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:13:31,855 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-09 05:13:31,856 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:13:31,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919250625] [2024-11-09 05:13:31,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919250625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:13:31,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:13:31,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 05:13:31,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110351636] [2024-11-09 05:13:31,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:13:31,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:13:31,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:13:31,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:13:31,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:13:31,859 INFO L87 Difference]: Start difference. First operand 3768 states and 4667 transitions. Second operand has 6 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 05:13:32,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:13:32,767 INFO L93 Difference]: Finished difference Result 4517 states and 5512 transitions. [2024-11-09 05:13:32,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 05:13:32,768 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 113 [2024-11-09 05:13:32,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:13:32,784 INFO L225 Difference]: With dead ends: 4517 [2024-11-09 05:13:32,784 INFO L226 Difference]: Without dead ends: 4060 [2024-11-09 05:13:32,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:13:32,788 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 160 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:13:32,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 841 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:13:32,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4060 states. [2024-11-09 05:13:33,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4060 to 4026. [2024-11-09 05:13:33,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4026 states, 3110 states have (on average 1.2112540192926045) internal successors, (3767), 3138 states have internal predecessors, (3767), 500 states have call successors, (500), 409 states have call predecessors, (500), 414 states have return successors, (688), 480 states have call predecessors, (688), 499 states have call successors, (688) [2024-11-09 05:13:33,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4026 states to 4026 states and 4955 transitions. [2024-11-09 05:13:33,406 INFO L78 Accepts]: Start accepts. Automaton has 4026 states and 4955 transitions. Word has length 113 [2024-11-09 05:13:33,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:13:33,407 INFO L471 AbstractCegarLoop]: Abstraction has 4026 states and 4955 transitions. [2024-11-09 05:13:33,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 05:13:33,408 INFO L276 IsEmpty]: Start isEmpty. Operand 4026 states and 4955 transitions. [2024-11-09 05:13:33,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-09 05:13:33,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:13:33,415 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:13:33,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 05:13:33,415 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:13:33,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:13:33,416 INFO L85 PathProgramCache]: Analyzing trace with hash 242589322, now seen corresponding path program 1 times [2024-11-09 05:13:33,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:13:33,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777784562] [2024-11-09 05:13:33,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:13:33,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:13:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:13:33,653 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 05:13:33,653 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:13:33,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777784562] [2024-11-09 05:13:33,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777784562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:13:33,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:13:33,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 05:13:33,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128347310] [2024-11-09 05:13:33,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:13:33,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 05:13:33,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:13:33,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 05:13:33,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-09 05:13:33,656 INFO L87 Difference]: Start difference. First operand 4026 states and 4955 transitions. Second operand has 10 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 6 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2024-11-09 05:13:35,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:13:35,110 INFO L93 Difference]: Finished difference Result 4705 states and 5718 transitions. [2024-11-09 05:13:35,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 05:13:35,110 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 6 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 114 [2024-11-09 05:13:35,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:13:35,128 INFO L225 Difference]: With dead ends: 4705 [2024-11-09 05:13:35,128 INFO L226 Difference]: Without dead ends: 3990 [2024-11-09 05:13:35,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2024-11-09 05:13:35,132 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 456 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 05:13:35,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 620 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 05:13:35,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3990 states. [2024-11-09 05:13:35,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3990 to 3970. [2024-11-09 05:13:35,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3970 states, 3074 states have (on average 1.2111255692908263) internal successors, (3723), 3106 states have internal predecessors, (3723), 485 states have call successors, (485), 397 states have call predecessors, (485), 409 states have return successors, (679), 468 states have call predecessors, (679), 484 states have call successors, (679) [2024-11-09 05:13:35,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3970 states to 3970 states and 4887 transitions. [2024-11-09 05:13:35,782 INFO L78 Accepts]: Start accepts. Automaton has 3970 states and 4887 transitions. Word has length 114 [2024-11-09 05:13:35,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:13:35,783 INFO L471 AbstractCegarLoop]: Abstraction has 3970 states and 4887 transitions. [2024-11-09 05:13:35,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 6 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2024-11-09 05:13:35,783 INFO L276 IsEmpty]: Start isEmpty. Operand 3970 states and 4887 transitions. [2024-11-09 05:13:35,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-09 05:13:35,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:13:35,790 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:13:35,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 05:13:35,790 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:13:35,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:13:35,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1529409039, now seen corresponding path program 1 times [2024-11-09 05:13:35,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:13:35,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847706393] [2024-11-09 05:13:35,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:13:35,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:13:35,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:13:36,843 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 22 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 05:13:36,844 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:13:36,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847706393] [2024-11-09 05:13:36,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847706393] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:13:36,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396998080] [2024-11-09 05:13:36,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:13:36,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:13:36,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:13:36,847 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:13:36,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-09 05:13:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:13:37,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-09 05:13:37,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:13:38,117 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 31 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 05:13:38,117 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:13:39,976 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 05:13:39,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396998080] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:13:39,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1307560319] [2024-11-09 05:13:39,980 INFO L159 IcfgInterpreter]: Started Sifa with 68 locations of interest [2024-11-09 05:13:39,981 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:13:39,981 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:13:39,981 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:13:39,982 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:13:57,093 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events1 with input of size 160 for LOIs [2024-11-09 05:13:57,202 INFO L197 IcfgInterpreter]: Interpreting procedure error1 with input of size 13 for LOIs [2024-11-09 05:13:57,204 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread1 with input of size 7 for LOIs [2024-11-09 05:13:57,208 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads1 with input of size 124 for LOIs [2024-11-09 05:13:57,742 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_write_p_triggered with input of size 125 for LOIs [2024-11-09 05:13:58,163 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_read_c_triggered with input of size 21 for LOIs [2024-11-09 05:13:58,193 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events1 with input of size 118 for LOIs [2024-11-09 05:13:58,262 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels1 with input of size 129 for LOIs [2024-11-09 05:13:58,349 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:14:10,102 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '218286#(and (= ~q_req_up~0 1) (= ~q_free~0 1) (not (= ~c_num_read~0 ~p_num_write~0)) (= ~c_last_read~0 ~p_last_write~0))' at error location [2024-11-09 05:14:10,102 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:14:10,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:14:10,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 16] total 47 [2024-11-09 05:14:10,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794273389] [2024-11-09 05:14:10,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:14:10,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-09 05:14:10,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:14:10,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-09 05:14:10,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=730, Invalid=8582, Unknown=0, NotChecked=0, Total=9312 [2024-11-09 05:14:10,108 INFO L87 Difference]: Start difference. First operand 3970 states and 4887 transitions. Second operand has 47 states, 33 states have (on average 5.9393939393939394) internal successors, (196), 37 states have internal predecessors, (196), 19 states have call successors, (44), 16 states have call predecessors, (44), 22 states have return successors, (46), 18 states have call predecessors, (46), 19 states have call successors, (46) [2024-11-09 05:14:26,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:14:26,022 INFO L93 Difference]: Finished difference Result 5770 states and 6980 transitions. [2024-11-09 05:14:26,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2024-11-09 05:14:26,022 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 33 states have (on average 5.9393939393939394) internal successors, (196), 37 states have internal predecessors, (196), 19 states have call successors, (44), 16 states have call predecessors, (44), 22 states have return successors, (46), 18 states have call predecessors, (46), 19 states have call successors, (46) Word has length 114 [2024-11-09 05:14:26,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:14:26,044 INFO L225 Difference]: With dead ends: 5770 [2024-11-09 05:14:26,044 INFO L226 Difference]: Without dead ends: 5026 [2024-11-09 05:14:26,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 298 SyntacticMatches, 6 SemanticMatches, 298 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 35998 ImplicationChecksByTransitivity, 23.6s TimeCoverageRelationStatistics Valid=8497, Invalid=81203, Unknown=0, NotChecked=0, Total=89700 [2024-11-09 05:14:26,068 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 3542 mSDsluCounter, 2181 mSDsCounter, 0 mSdLazyCounter, 4209 mSolverCounterSat, 1946 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3543 SdHoareTripleChecker+Valid, 2340 SdHoareTripleChecker+Invalid, 6155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1946 IncrementalHoareTripleChecker+Valid, 4209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-09 05:14:26,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3543 Valid, 2340 Invalid, 6155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1946 Valid, 4209 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-09 05:14:26,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5026 states. [2024-11-09 05:14:26,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5026 to 4123. [2024-11-09 05:14:27,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4123 states, 3179 states have (on average 1.2088707140610255) internal successors, (3843), 3212 states have internal predecessors, (3843), 505 states have call successors, (505), 416 states have call predecessors, (505), 437 states have return successors, (709), 495 states have call predecessors, (709), 504 states have call successors, (709) [2024-11-09 05:14:27,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4123 states to 4123 states and 5057 transitions. [2024-11-09 05:14:27,021 INFO L78 Accepts]: Start accepts. Automaton has 4123 states and 5057 transitions. Word has length 114 [2024-11-09 05:14:27,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:14:27,022 INFO L471 AbstractCegarLoop]: Abstraction has 4123 states and 5057 transitions. [2024-11-09 05:14:27,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 33 states have (on average 5.9393939393939394) internal successors, (196), 37 states have internal predecessors, (196), 19 states have call successors, (44), 16 states have call predecessors, (44), 22 states have return successors, (46), 18 states have call predecessors, (46), 19 states have call successors, (46) [2024-11-09 05:14:27,022 INFO L276 IsEmpty]: Start isEmpty. Operand 4123 states and 5057 transitions. [2024-11-09 05:14:27,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 05:14:27,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:14:27,030 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-09 05:14:27,056 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-09 05:14:27,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:14:27,231 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:14:27,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:14:27,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1514180282, now seen corresponding path program 1 times [2024-11-09 05:14:27,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:14:27,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222805872] [2024-11-09 05:14:27,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:14:27,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:14:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:14:27,404 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-09 05:14:27,404 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:14:27,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222805872] [2024-11-09 05:14:27,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222805872] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:14:27,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820940034] [2024-11-09 05:14:27,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:14:27,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:14:27,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:14:27,407 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:14:27,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-09 05:14:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:14:27,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 05:14:27,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:14:27,679 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-09 05:14:27,679 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:14:27,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820940034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:14:27,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:14:27,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-09 05:14:27,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154463837] [2024-11-09 05:14:27,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:14:27,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:14:27,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:14:27,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:14:27,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:14:27,684 INFO L87 Difference]: Start difference. First operand 4123 states and 5057 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-09 05:14:28,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:14:28,683 INFO L93 Difference]: Finished difference Result 7948 states and 9906 transitions. [2024-11-09 05:14:28,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:14:28,684 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-09 05:14:28,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:14:28,703 INFO L225 Difference]: With dead ends: 7948 [2024-11-09 05:14:28,703 INFO L226 Difference]: Without dead ends: 5122 [2024-11-09 05:14:28,712 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-09 05:14:28,713 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 198 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:14:28,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 323 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:14:28,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5122 states. [2024-11-09 05:14:29,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5122 to 4657. [2024-11-09 05:14:29,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4657 states, 3646 states have (on average 1.1996708721887) internal successors, (4374), 3687 states have internal predecessors, (4374), 528 states have call successors, (528), 455 states have call predecessors, (528), 481 states have return successors, (744), 515 states have call predecessors, (744), 527 states have call successors, (744) [2024-11-09 05:14:29,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4657 states to 4657 states and 5646 transitions. [2024-11-09 05:14:29,713 INFO L78 Accepts]: Start accepts. Automaton has 4657 states and 5646 transitions. Word has length 108 [2024-11-09 05:14:29,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:14:29,714 INFO L471 AbstractCegarLoop]: Abstraction has 4657 states and 5646 transitions. [2024-11-09 05:14:29,714 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-09 05:14:29,714 INFO L276 IsEmpty]: Start isEmpty. Operand 4657 states and 5646 transitions. [2024-11-09 05:14:29,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-09 05:14:29,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:14:29,721 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-09 05:14:29,746 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-09 05:14:29,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:14:29,926 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:14:29,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:14:29,926 INFO L85 PathProgramCache]: Analyzing trace with hash 170520247, now seen corresponding path program 1 times [2024-11-09 05:14:29,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:14:29,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426998535] [2024-11-09 05:14:29,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:14:29,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:14:29,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:14:30,393 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-09 05:14:30,394 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:14:30,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426998535] [2024-11-09 05:14:30,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426998535] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:14:30,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338853754] [2024-11-09 05:14:30,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:14:30,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:14:30,394 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:14:30,396 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:14:30,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-09 05:14:30,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:14:30,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 05:14:30,546 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:14:30,679 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-09 05:14:30,679 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:14:30,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338853754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:14:30,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:14:30,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 18 [2024-11-09 05:14:30,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063253706] [2024-11-09 05:14:30,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:14:30,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 05:14:30,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:14:30,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 05:14:30,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-09 05:14:30,684 INFO L87 Difference]: Start difference. First operand 4657 states and 5646 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-09 05:14:31,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:14:31,656 INFO L93 Difference]: Finished difference Result 7652 states and 9380 transitions. [2024-11-09 05:14:31,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:14:31,657 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-09 05:14:31,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:14:31,675 INFO L225 Difference]: With dead ends: 7652 [2024-11-09 05:14:31,675 INFO L226 Difference]: Without dead ends: 4374 [2024-11-09 05:14:31,685 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-09 05:14:31,686 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 69 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:14:31,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 825 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:14:31,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4374 states. [2024-11-09 05:14:32,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4374 to 4180. [2024-11-09 05:14:32,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4180 states, 3262 states have (on average 1.1922133660331085) internal successors, (3889), 3297 states have internal predecessors, (3889), 478 states have call successors, (478), 413 states have call predecessors, (478), 438 states have return successors, (663), 470 states have call predecessors, (663), 477 states have call successors, (663) [2024-11-09 05:14:32,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4180 states to 4180 states and 5030 transitions. [2024-11-09 05:14:32,734 INFO L78 Accepts]: Start accepts. Automaton has 4180 states and 5030 transitions. Word has length 112 [2024-11-09 05:14:32,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:14:32,734 INFO L471 AbstractCegarLoop]: Abstraction has 4180 states and 5030 transitions. [2024-11-09 05:14:32,735 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-09 05:14:32,735 INFO L276 IsEmpty]: Start isEmpty. Operand 4180 states and 5030 transitions. [2024-11-09 05:14:32,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 05:14:32,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:14:32,738 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:14:32,755 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-09 05:14:32,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:14:32,939 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:14:32,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:14:32,940 INFO L85 PathProgramCache]: Analyzing trace with hash -2146191278, now seen corresponding path program 1 times [2024-11-09 05:14:32,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:14:32,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935409735] [2024-11-09 05:14:32,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:14:32,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:14:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:14:33,273 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 23 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 05:14:33,273 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:14:33,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935409735] [2024-11-09 05:14:33,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935409735] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:14:33,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133780767] [2024-11-09 05:14:33,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:14:33,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:14:33,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:14:33,275 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:14:33,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-09 05:14:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:14:33,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 05:14:33,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:14:33,488 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 05:14:33,488 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:14:33,720 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-09 05:14:33,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133780767] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 05:14:33,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:14:33,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14, 8] total 20 [2024-11-09 05:14:33,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915743814] [2024-11-09 05:14:33,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:14:33,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 05:14:33,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:14:33,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 05:14:33,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2024-11-09 05:14:33,722 INFO L87 Difference]: Start difference. First operand 4180 states and 5030 transitions. Second operand has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 4 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-09 05:14:35,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:14:35,174 INFO L93 Difference]: Finished difference Result 5417 states and 6463 transitions. [2024-11-09 05:14:35,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 05:14:35,174 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 4 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 115 [2024-11-09 05:14:35,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:14:35,187 INFO L225 Difference]: With dead ends: 5417 [2024-11-09 05:14:35,187 INFO L226 Difference]: Without dead ends: 4586 [2024-11-09 05:14:35,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2024-11-09 05:14:35,196 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 239 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:14:35,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 553 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 05:14:35,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4586 states. [2024-11-09 05:14:35,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4586 to 4330. [2024-11-09 05:14:35,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4330 states, 3352 states have (on average 1.1903341288782816) internal successors, (3990), 3393 states have internal predecessors, (3990), 507 states have call successors, (507), 432 states have call predecessors, (507), 469 states have return successors, (722), 505 states have call predecessors, (722), 506 states have call successors, (722) [2024-11-09 05:14:35,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4330 states to 4330 states and 5219 transitions. [2024-11-09 05:14:36,003 INFO L78 Accepts]: Start accepts. Automaton has 4330 states and 5219 transitions. Word has length 115 [2024-11-09 05:14:36,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:14:36,004 INFO L471 AbstractCegarLoop]: Abstraction has 4330 states and 5219 transitions. [2024-11-09 05:14:36,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 4 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-09 05:14:36,004 INFO L276 IsEmpty]: Start isEmpty. Operand 4330 states and 5219 transitions. [2024-11-09 05:14:36,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 05:14:36,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:14:36,008 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-09 05:14:36,025 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-09 05:14:36,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-09 05:14:36,209 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:14:36,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:14:36,209 INFO L85 PathProgramCache]: Analyzing trace with hash 122532369, now seen corresponding path program 1 times [2024-11-09 05:14:36,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:14:36,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716708974] [2024-11-09 05:14:36,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:14:36,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:14:36,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:14:36,376 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-09 05:14:36,376 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:14:36,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716708974] [2024-11-09 05:14:36,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716708974] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:14:36,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340567323] [2024-11-09 05:14:36,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:14:36,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:14:36,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:14:36,380 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:14:36,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-09 05:14:36,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:14:36,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 05:14:36,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:14:36,577 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-09 05:14:36,577 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:14:36,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340567323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:14:36,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:14:36,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2024-11-09 05:14:36,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945495834] [2024-11-09 05:14:36,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:14:36,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:14:36,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:14:36,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:14:36,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:14:36,579 INFO L87 Difference]: Start difference. First operand 4330 states and 5219 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-09 05:14:37,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:14:37,826 INFO L93 Difference]: Finished difference Result 7976 states and 9792 transitions. [2024-11-09 05:14:37,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:14:37,827 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-09 05:14:37,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:14:37,842 INFO L225 Difference]: With dead ends: 7976 [2024-11-09 05:14:37,842 INFO L226 Difference]: Without dead ends: 5408 [2024-11-09 05:14:37,850 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-09 05:14:37,851 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 95 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:14:37,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 457 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 05:14:37,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5408 states. [2024-11-09 05:14:39,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5408 to 5179. [2024-11-09 05:14:39,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5179 states, 4018 states have (on average 1.1871577899452463) internal successors, (4770), 4067 states have internal predecessors, (4770), 606 states have call successors, (606), 513 states have call predecessors, (606), 553 states have return successors, (907), 599 states have call predecessors, (907), 605 states have call successors, (907) [2024-11-09 05:14:39,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5179 states to 5179 states and 6283 transitions. [2024-11-09 05:14:39,035 INFO L78 Accepts]: Start accepts. Automaton has 5179 states and 6283 transitions. Word has length 109 [2024-11-09 05:14:39,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:14:39,036 INFO L471 AbstractCegarLoop]: Abstraction has 5179 states and 6283 transitions. [2024-11-09 05:14:39,036 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-09 05:14:39,036 INFO L276 IsEmpty]: Start isEmpty. Operand 5179 states and 6283 transitions. [2024-11-09 05:14:39,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 05:14:39,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:14:39,039 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-09 05:14:39,055 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-09 05:14:39,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-11-09 05:14:39,240 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:14:39,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:14:39,240 INFO L85 PathProgramCache]: Analyzing trace with hash 126280712, now seen corresponding path program 1 times [2024-11-09 05:14:39,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:14:39,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749469638] [2024-11-09 05:14:39,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:14:39,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:14:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:14:39,399 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-09 05:14:39,399 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:14:39,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749469638] [2024-11-09 05:14:39,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749469638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:14:39,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:14:39,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:14:39,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410175657] [2024-11-09 05:14:39,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:14:39,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:14:39,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:14:39,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:14:39,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:14:39,402 INFO L87 Difference]: Start difference. First operand 5179 states and 6283 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-09 05:14:40,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:14:40,992 INFO L93 Difference]: Finished difference Result 11195 states and 13767 transitions. [2024-11-09 05:14:40,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:14:40,993 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-09 05:14:40,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:14:41,014 INFO L225 Difference]: With dead ends: 11195 [2024-11-09 05:14:41,015 INFO L226 Difference]: Without dead ends: 6336 [2024-11-09 05:14:41,024 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-09 05:14:41,024 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 91 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:14:41,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 532 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 05:14:41,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6336 states. [2024-11-09 05:14:42,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6336 to 6191. [2024-11-09 05:14:42,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6191 states, 4781 states have (on average 1.1767412675172557) internal successors, (5626), 4838 states have internal predecessors, (5626), 744 states have call successors, (744), 623 states have call predecessors, (744), 664 states have return successors, (1125), 730 states have call predecessors, (1125), 743 states have call successors, (1125) [2024-11-09 05:14:42,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6191 states to 6191 states and 7495 transitions. [2024-11-09 05:14:42,174 INFO L78 Accepts]: Start accepts. Automaton has 6191 states and 7495 transitions. Word has length 109 [2024-11-09 05:14:42,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:14:42,175 INFO L471 AbstractCegarLoop]: Abstraction has 6191 states and 7495 transitions. [2024-11-09 05:14:42,175 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-09 05:14:42,175 INFO L276 IsEmpty]: Start isEmpty. Operand 6191 states and 7495 transitions. [2024-11-09 05:14:42,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 05:14:42,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:14:42,179 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-09 05:14:42,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-09 05:14:42,180 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:14:42,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:14:42,180 INFO L85 PathProgramCache]: Analyzing trace with hash 274026475, now seen corresponding path program 1 times [2024-11-09 05:14:42,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:14:42,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748055807] [2024-11-09 05:14:42,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:14:42,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:14:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:14:42,630 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-09 05:14:42,631 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:14:42,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748055807] [2024-11-09 05:14:42,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748055807] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:14:42,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213479743] [2024-11-09 05:14:42,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:14:42,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:14:42,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:14:42,633 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:14:42,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-09 05:14:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:14:42,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 05:14:42,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:14:42,927 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-09 05:14:42,927 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:14:42,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213479743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:14:42,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:14:42,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 19 [2024-11-09 05:14:42,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867899362] [2024-11-09 05:14:42,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:14:42,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 05:14:42,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:14:42,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 05:14:42,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-11-09 05:14:42,929 INFO L87 Difference]: Start difference. First operand 6191 states and 7495 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-09 05:14:44,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:14:44,330 INFO L93 Difference]: Finished difference Result 9069 states and 10933 transitions. [2024-11-09 05:14:44,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 05:14:44,330 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-09 05:14:44,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:14:44,349 INFO L225 Difference]: With dead ends: 9069 [2024-11-09 05:14:44,349 INFO L226 Difference]: Without dead ends: 6320 [2024-11-09 05:14:44,356 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-09 05:14:44,357 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 65 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:14:44,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1180 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:14:44,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6320 states. [2024-11-09 05:14:45,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6320 to 6232. [2024-11-09 05:14:45,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6232 states, 4816 states have (on average 1.176702657807309) internal successors, (5667), 4873 states have internal predecessors, (5667), 747 states have call successors, (747), 626 states have call predecessors, (747), 667 states have return successors, (1128), 733 states have call predecessors, (1128), 746 states have call successors, (1128) [2024-11-09 05:14:45,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6232 states to 6232 states and 7542 transitions. [2024-11-09 05:14:45,473 INFO L78 Accepts]: Start accepts. Automaton has 6232 states and 7542 transitions. Word has length 115 [2024-11-09 05:14:45,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:14:45,474 INFO L471 AbstractCegarLoop]: Abstraction has 6232 states and 7542 transitions. [2024-11-09 05:14:45,474 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-09 05:14:45,474 INFO L276 IsEmpty]: Start isEmpty. Operand 6232 states and 7542 transitions. [2024-11-09 05:14:45,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 05:14:45,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:14:45,478 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-09 05:14:45,495 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-11-09 05:14:45,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-09 05:14:45,679 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:14:45,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:14:45,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1781274754, now seen corresponding path program 1 times [2024-11-09 05:14:45,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:14:45,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105795877] [2024-11-09 05:14:45,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:14:45,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:14:45,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:14:46,328 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-09 05:14:46,329 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:14:46,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105795877] [2024-11-09 05:14:46,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105795877] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:14:46,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073689182] [2024-11-09 05:14:46,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:14:46,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:14:46,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:14:46,330 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:14:46,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-09 05:14:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:14:46,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 05:14:46,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:14:46,833 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-09 05:14:46,833 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:14:46,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073689182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:14:46,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:14:46,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [18] total 25 [2024-11-09 05:14:46,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146926669] [2024-11-09 05:14:46,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:14:46,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 05:14:46,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:14:46,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 05:14:46,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2024-11-09 05:14:46,836 INFO L87 Difference]: Start difference. First operand 6232 states and 7542 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-09 05:14:48,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:14:48,529 INFO L93 Difference]: Finished difference Result 9295 states and 11189 transitions. [2024-11-09 05:14:48,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 05:14:48,530 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-09 05:14:48,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:14:48,545 INFO L225 Difference]: With dead ends: 9295 [2024-11-09 05:14:48,546 INFO L226 Difference]: Without dead ends: 4961 [2024-11-09 05:14:48,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=868, Unknown=0, NotChecked=0, Total=992 [2024-11-09 05:14:48,557 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 523 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:14:48,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 472 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 05:14:48,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4961 states. [2024-11-09 05:14:49,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4961 to 4056. [2024-11-09 05:14:49,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4056 states, 3074 states have (on average 1.1506180871828238) internal successors, (3537), 3107 states have internal predecessors, (3537), 516 states have call successors, (516), 425 states have call predecessors, (516), 464 states have return successors, (651), 524 states have call predecessors, (651), 515 states have call successors, (651) [2024-11-09 05:14:49,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4056 states to 4056 states and 4704 transitions. [2024-11-09 05:14:49,452 INFO L78 Accepts]: Start accepts. Automaton has 4056 states and 4704 transitions. Word has length 117 [2024-11-09 05:14:49,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:14:49,452 INFO L471 AbstractCegarLoop]: Abstraction has 4056 states and 4704 transitions. [2024-11-09 05:14:49,452 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-09 05:14:49,452 INFO L276 IsEmpty]: Start isEmpty. Operand 4056 states and 4704 transitions. [2024-11-09 05:14:49,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 05:14:49,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:14:49,455 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-09 05:14:49,471 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-11-09 05:14:49,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-09 05:14:49,655 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:14:49,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:14:49,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1423867258, now seen corresponding path program 1 times [2024-11-09 05:14:49,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:14:49,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683913600] [2024-11-09 05:14:49,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:14:49,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:14:49,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:14:50,283 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-09 05:14:50,283 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:14:50,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683913600] [2024-11-09 05:14:50,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683913600] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:14:50,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677301376] [2024-11-09 05:14:50,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:14:50,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:14:50,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:14:50,285 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:14:50,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-09 05:14:50,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:14:50,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 05:14:50,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:14:50,700 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-09 05:14:50,700 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:14:50,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677301376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:14:50,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:14:50,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [18] total 22 [2024-11-09 05:14:50,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889885468] [2024-11-09 05:14:50,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:14:50,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 05:14:50,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:14:50,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 05:14:50,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2024-11-09 05:14:50,702 INFO L87 Difference]: Start difference. First operand 4056 states and 4704 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-09 05:14:52,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:14:52,397 INFO L93 Difference]: Finished difference Result 7400 states and 8592 transitions. [2024-11-09 05:14:52,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 05:14:52,398 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-09 05:14:52,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:14:52,418 INFO L225 Difference]: With dead ends: 7400 [2024-11-09 05:14:52,418 INFO L226 Difference]: Without dead ends: 4887 [2024-11-09 05:14:52,424 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-09 05:14:52,425 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 628 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:14:52,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 361 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 05:14:52,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4887 states. [2024-11-09 05:14:53,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4887 to 4248. [2024-11-09 05:14:53,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4248 states, 3220 states have (on average 1.1468944099378882) internal successors, (3693), 3253 states have internal predecessors, (3693), 540 states have call successors, (540), 445 states have call predecessors, (540), 486 states have return successors, (655), 550 states have call predecessors, (655), 539 states have call successors, (655) [2024-11-09 05:14:53,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4248 states to 4248 states and 4888 transitions. [2024-11-09 05:14:53,283 INFO L78 Accepts]: Start accepts. Automaton has 4248 states and 4888 transitions. Word has length 118 [2024-11-09 05:14:53,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:14:53,284 INFO L471 AbstractCegarLoop]: Abstraction has 4248 states and 4888 transitions. [2024-11-09 05:14:53,284 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-09 05:14:53,284 INFO L276 IsEmpty]: Start isEmpty. Operand 4248 states and 4888 transitions. [2024-11-09 05:14:53,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 05:14:53,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:14:53,286 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:14:53,301 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-11-09 05:14:53,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-09 05:14:53,487 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:14:53,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:14:53,487 INFO L85 PathProgramCache]: Analyzing trace with hash 983948871, now seen corresponding path program 1 times [2024-11-09 05:14:53,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:14:53,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502170439] [2024-11-09 05:14:53,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:14:53,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:14:53,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:14:54,253 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 36 proven. 20 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-09 05:14:54,254 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:14:54,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502170439] [2024-11-09 05:14:54,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502170439] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:14:54,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441322239] [2024-11-09 05:14:54,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:14:54,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:14:54,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:14:54,255 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:14:54,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-09 05:14:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:14:54,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-09 05:14:54,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:14:55,380 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 60 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 05:14:55,381 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:14:57,152 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 13 proven. 44 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 05:14:57,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441322239] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:14:57,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1450370008] [2024-11-09 05:14:57,155 INFO L159 IcfgInterpreter]: Started Sifa with 69 locations of interest [2024-11-09 05:14:57,155 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:14:57,155 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:14:57,156 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:14:57,156 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:15:04,812 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events1 with input of size 161 for LOIs [2024-11-09 05:15:04,911 INFO L197 IcfgInterpreter]: Interpreting procedure error1 with input of size 77 for LOIs [2024-11-09 05:15:04,940 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread1 with input of size 7 for LOIs [2024-11-09 05:15:04,944 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads1 with input of size 125 for LOIs [2024-11-09 05:15:05,367 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_write_p_triggered with input of size 126 for LOIs [2024-11-09 05:15:05,819 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_read_c_triggered with input of size 27 for LOIs [2024-11-09 05:15:05,858 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events1 with input of size 119 for LOIs [2024-11-09 05:15:05,930 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels1 with input of size 130 for LOIs [2024-11-09 05:15:06,016 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:15:21,010 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '379744#(and (= ~q_req_up~0 1) (exists ((v_~q_req_up~0_103 Int) (v_~q_free~0_100 Int)) (and (or (and (= v_~q_free~0_100 0) (= ~p_dw_pc~0 1) (= 2 ~p_dw_st~0)) (and (<= 0 ~p_dw_pc~0) (<= v_~q_free~0_100 1) (= ~p_dw_st~0 0))) (or (exists ((v_~p_dw_st~0_136 Int) (v_~p_dw_pc~0_47 Int)) (and (or (and (<= ~q_buf_0~0 2147483647) (= v_~p_dw_st~0_136 1) (<= 0 (+ ~q_buf_0~0 2147483648)) (= v_~q_req_up~0_103 1)) (and (= v_~p_dw_st~0_136 1) (= v_~p_dw_pc~0_47 0))) (or (and (exists ((|v_ULTIMATE.start_eval1_~tmp~2#1_69| Int)) (and (not (= |v_ULTIMATE.start_eval1_~tmp~2#1_69| 0)) (<= |v_ULTIMATE.start_eval1_~tmp~2#1_69| 2147483647) (<= 0 (+ |v_ULTIMATE.start_eval1_~tmp~2#1_69| 2147483648)))) (= v_~p_dw_pc~0_47 0)) (and (= v_~p_dw_pc~0_47 1) (exists ((|v_ULTIMATE.start_eval1_~tmp~2#1_69| Int)) (and (not (= |v_ULTIMATE.start_eval1_~tmp~2#1_69| 0)) (<= |v_ULTIMATE.start_eval1_~tmp~2#1_69| 2147483647) (<= 0 (+ |v_ULTIMATE.start_eval1_~tmp~2#1_69| 2147483648)))))))) (= ~p_dw_st~0 0)))) (= ~q_free~0 1) (= ~c_dr_pc~0 1) (not (= ~c_num_read~0 ~p_num_write~0)) (= ~c_last_read~0 ~q_buf_0~0) (= ~c_last_read~0 ~p_last_write~0) (exists ((|v_ULTIMATE.start_eval1_~tmp___0~2#1_44| Int)) (and (<= |v_ULTIMATE.start_eval1_~tmp___0~2#1_44| 2147483647) (<= 0 (+ |v_ULTIMATE.start_eval1_~tmp___0~2#1_44| 2147483648)) (not (= |v_ULTIMATE.start_eval1_~tmp___0~2#1_44| 0)))) (= ~c_dr_st~0 1))' at error location [2024-11-09 05:15:21,010 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:15:21,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:15:21,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 18] total 50 [2024-11-09 05:15:21,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476971650] [2024-11-09 05:15:21,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:15:21,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-09 05:15:21,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:15:21,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-09 05:15:21,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=901, Invalid=9605, Unknown=0, NotChecked=0, Total=10506 [2024-11-09 05:15:21,016 INFO L87 Difference]: Start difference. First operand 4248 states and 4888 transitions. Second operand has 50 states, 37 states have (on average 5.837837837837838) internal successors, (216), 40 states have internal predecessors, (216), 24 states have call successors, (49), 18 states have call predecessors, (49), 23 states have return successors, (51), 23 states have call predecessors, (51), 24 states have call successors, (51) [2024-11-09 05:15:32,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:15:32,853 INFO L93 Difference]: Finished difference Result 6872 states and 7971 transitions. [2024-11-09 05:15:32,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2024-11-09 05:15:32,854 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 37 states have (on average 5.837837837837838) internal successors, (216), 40 states have internal predecessors, (216), 24 states have call successors, (49), 18 states have call predecessors, (49), 23 states have return successors, (51), 23 states have call predecessors, (51), 24 states have call successors, (51) Word has length 124 [2024-11-09 05:15:32,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:15:32,878 INFO L225 Difference]: With dead ends: 6872 [2024-11-09 05:15:32,879 INFO L226 Difference]: Without dead ends: 5891 [2024-11-09 05:15:32,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 334 SyntacticMatches, 2 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 17504 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=4777, Invalid=40379, Unknown=0, NotChecked=0, Total=45156 [2024-11-09 05:15:32,888 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 4034 mSDsluCounter, 2530 mSDsCounter, 0 mSdLazyCounter, 4523 mSolverCounterSat, 2520 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4035 SdHoareTripleChecker+Valid, 2679 SdHoareTripleChecker+Invalid, 7043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2520 IncrementalHoareTripleChecker+Valid, 4523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:15:32,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4035 Valid, 2679 Invalid, 7043 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2520 Valid, 4523 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-09 05:15:32,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5891 states. [2024-11-09 05:15:34,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5891 to 4671. [2024-11-09 05:15:34,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4671 states, 3533 states have (on average 1.14973110670818) internal successors, (4062), 3556 states have internal predecessors, (4062), 603 states have call successors, (603), 494 states have call predecessors, (603), 533 states have return successors, (710), 621 states have call predecessors, (710), 602 states have call successors, (710) [2024-11-09 05:15:34,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4671 states to 4671 states and 5375 transitions. [2024-11-09 05:15:34,232 INFO L78 Accepts]: Start accepts. Automaton has 4671 states and 5375 transitions. Word has length 124 [2024-11-09 05:15:34,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:15:34,232 INFO L471 AbstractCegarLoop]: Abstraction has 4671 states and 5375 transitions. [2024-11-09 05:15:34,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 37 states have (on average 5.837837837837838) internal successors, (216), 40 states have internal predecessors, (216), 24 states have call successors, (49), 18 states have call predecessors, (49), 23 states have return successors, (51), 23 states have call predecessors, (51), 24 states have call successors, (51) [2024-11-09 05:15:34,233 INFO L276 IsEmpty]: Start isEmpty. Operand 4671 states and 5375 transitions. [2024-11-09 05:15:34,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 05:15:34,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:15:34,235 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:15:34,252 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-11-09 05:15:34,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:15:34,436 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:15:34,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:15:34,436 INFO L85 PathProgramCache]: Analyzing trace with hash -301797508, now seen corresponding path program 1 times [2024-11-09 05:15:34,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:15:34,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346771997] [2024-11-09 05:15:34,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:15:34,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:15:34,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:15:34,647 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 38 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-09 05:15:34,647 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:15:34,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346771997] [2024-11-09 05:15:34,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346771997] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:15:34,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618073476] [2024-11-09 05:15:34,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:15:34,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:15:34,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:15:34,651 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:15:34,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-09 05:15:34,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:15:34,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 05:15:34,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:15:34,932 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 50 proven. 17 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 05:15:34,933 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:15:35,163 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-09 05:15:35,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618073476] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 05:15:35,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:15:35,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 10] total 17 [2024-11-09 05:15:35,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918252877] [2024-11-09 05:15:35,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:15:35,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 05:15:35,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:15:35,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 05:15:35,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2024-11-09 05:15:35,165 INFO L87 Difference]: Start difference. First operand 4671 states and 5375 transitions. Second operand has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 4 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-09 05:15:36,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:15:36,818 INFO L93 Difference]: Finished difference Result 5417 states and 6220 transitions. [2024-11-09 05:15:36,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 05:15:36,819 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), 4 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 125 [2024-11-09 05:15:36,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:15:36,834 INFO L225 Difference]: With dead ends: 5417 [2024-11-09 05:15:36,834 INFO L226 Difference]: Without dead ends: 4013 [2024-11-09 05:15:36,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2024-11-09 05:15:36,838 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 372 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:15:36,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 370 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 05:15:36,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4013 states. [2024-11-09 05:15:37,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4013 to 3690. [2024-11-09 05:15:37,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3690 states, 2840 states have (on average 1.143661971830986) internal successors, (3248), 2861 states have internal predecessors, (3248), 456 states have call successors, (456), 375 states have call predecessors, (456), 392 states have return successors, (530), 454 states have call predecessors, (530), 455 states have call successors, (530) [2024-11-09 05:15:37,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3690 states to 3690 states and 4234 transitions. [2024-11-09 05:15:37,824 INFO L78 Accepts]: Start accepts. Automaton has 3690 states and 4234 transitions. Word has length 125 [2024-11-09 05:15:37,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:15:37,825 INFO L471 AbstractCegarLoop]: Abstraction has 3690 states and 4234 transitions. [2024-11-09 05:15:37,825 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), 4 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-09 05:15:37,825 INFO L276 IsEmpty]: Start isEmpty. Operand 3690 states and 4234 transitions. [2024-11-09 05:15:37,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-09 05:15:37,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:15:37,827 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-09 05:15:37,844 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2024-11-09 05:15:38,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:15:38,028 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:15:38,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:15:38,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1301475353, now seen corresponding path program 1 times [2024-11-09 05:15:38,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:15:38,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755429758] [2024-11-09 05:15:38,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:15:38,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:15:38,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:15:38,211 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-09 05:15:38,212 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:15:38,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755429758] [2024-11-09 05:15:38,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755429758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:15:38,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:15:38,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:15:38,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343506612] [2024-11-09 05:15:38,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:15:38,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:15:38,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:15:38,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:15:38,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:15:38,214 INFO L87 Difference]: Start difference. First operand 3690 states and 4234 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-09 05:15:40,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:15:40,946 INFO L93 Difference]: Finished difference Result 10136 states and 11687 transitions. [2024-11-09 05:15:40,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:15:40,947 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-09 05:15:40,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:15:40,968 INFO L225 Difference]: With dead ends: 10136 [2024-11-09 05:15:40,969 INFO L226 Difference]: Without dead ends: 8257 [2024-11-09 05:15:40,973 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-09 05:15:40,974 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 324 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:15:40,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 713 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 05:15:40,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8257 states. [2024-11-09 05:15:42,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8257 to 6137. [2024-11-09 05:15:42,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6137 states, 4740 states have (on average 1.1540084388185654) internal successors, (5470), 4764 states have internal predecessors, (5470), 758 states have call successors, (758), 615 states have call predecessors, (758), 637 states have return successors, (864), 758 states have call predecessors, (864), 757 states have call successors, (864) [2024-11-09 05:15:42,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6137 states to 6137 states and 7092 transitions. [2024-11-09 05:15:42,739 INFO L78 Accepts]: Start accepts. Automaton has 6137 states and 7092 transitions. Word has length 133 [2024-11-09 05:15:42,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:15:42,739 INFO L471 AbstractCegarLoop]: Abstraction has 6137 states and 7092 transitions. [2024-11-09 05:15:42,739 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-09 05:15:42,740 INFO L276 IsEmpty]: Start isEmpty. Operand 6137 states and 7092 transitions. [2024-11-09 05:15:42,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-09 05:15:42,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:15:42,746 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-09 05:15:42,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-09 05:15:42,747 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:15:42,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:15:42,747 INFO L85 PathProgramCache]: Analyzing trace with hash 87183639, now seen corresponding path program 1 times [2024-11-09 05:15:42,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:15:42,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633822736] [2024-11-09 05:15:42,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:15:42,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:15:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:15:42,902 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-09 05:15:42,902 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:15:42,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633822736] [2024-11-09 05:15:42,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633822736] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:15:42,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156179386] [2024-11-09 05:15:42,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:15:42,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:15:42,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:15:42,905 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:15:42,910 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-09 05:15:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:15:43,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 05:15:43,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:15:43,132 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-09 05:15:43,132 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:15:43,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156179386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:15:43,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:15:43,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2024-11-09 05:15:43,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775619393] [2024-11-09 05:15:43,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:15:43,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:15:43,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:15:43,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:15:43,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:15:43,134 INFO L87 Difference]: Start difference. First operand 6137 states and 7092 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-09 05:15:44,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:15:44,611 INFO L93 Difference]: Finished difference Result 9102 states and 10534 transitions. [2024-11-09 05:15:44,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:15:44,612 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-09 05:15:44,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:15:44,627 INFO L225 Difference]: With dead ends: 9102 [2024-11-09 05:15:44,628 INFO L226 Difference]: Without dead ends: 4910 [2024-11-09 05:15:44,633 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-09 05:15:44,634 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 169 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:15:44,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 521 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:15:44,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4910 states. [2024-11-09 05:15:45,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4910 to 4829. [2024-11-09 05:15:45,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4829 states, 3738 states have (on average 1.1452648475120386) internal successors, (4281), 3761 states have internal predecessors, (4281), 585 states have call successors, (585), 478 states have call predecessors, (585), 504 states have return successors, (667), 590 states have call predecessors, (667), 584 states have call successors, (667) [2024-11-09 05:15:45,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4829 states to 4829 states and 5533 transitions. [2024-11-09 05:15:45,872 INFO L78 Accepts]: Start accepts. Automaton has 4829 states and 5533 transitions. Word has length 165 [2024-11-09 05:15:45,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:15:45,873 INFO L471 AbstractCegarLoop]: Abstraction has 4829 states and 5533 transitions. [2024-11-09 05:15:45,873 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-09 05:15:45,873 INFO L276 IsEmpty]: Start isEmpty. Operand 4829 states and 5533 transitions. [2024-11-09 05:15:45,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-09 05:15:45,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:15:45,878 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-09 05:15:45,895 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-11-09 05:15:46,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2024-11-09 05:15:46,079 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:15:46,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:15:46,079 INFO L85 PathProgramCache]: Analyzing trace with hash -510857587, now seen corresponding path program 2 times [2024-11-09 05:15:46,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:15:46,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475704882] [2024-11-09 05:15:46,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:15:46,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:15:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:15:46,187 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-09 05:15:46,188 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:15:46,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475704882] [2024-11-09 05:15:46,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475704882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:15:46,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:15:46,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:15:46,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518484003] [2024-11-09 05:15:46,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:15:46,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:15:46,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:15:46,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:15:46,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:15:46,191 INFO L87 Difference]: Start difference. First operand 4829 states and 5533 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-09 05:15:47,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:15:47,626 INFO L93 Difference]: Finished difference Result 7686 states and 8850 transitions. [2024-11-09 05:15:47,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:15:47,627 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-09 05:15:47,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:15:47,644 INFO L225 Difference]: With dead ends: 7686 [2024-11-09 05:15:47,644 INFO L226 Difference]: Without dead ends: 4855 [2024-11-09 05:15:47,650 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-09 05:15:47,650 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 195 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:15:47,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 339 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:15:47,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4855 states. [2024-11-09 05:15:48,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4855 to 4593. [2024-11-09 05:15:48,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4593 states, 3554 states have (on average 1.1443444006752954) internal successors, (4067), 3570 states have internal predecessors, (4067), 567 states have call successors, (567), 460 states have call predecessors, (567), 470 states have return successors, (627), 563 states have call predecessors, (627), 566 states have call successors, (627) [2024-11-09 05:15:48,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4593 states to 4593 states and 5261 transitions. [2024-11-09 05:15:48,908 INFO L78 Accepts]: Start accepts. Automaton has 4593 states and 5261 transitions. Word has length 166 [2024-11-09 05:15:48,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:15:48,909 INFO L471 AbstractCegarLoop]: Abstraction has 4593 states and 5261 transitions. [2024-11-09 05:15:48,909 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-09 05:15:48,909 INFO L276 IsEmpty]: Start isEmpty. Operand 4593 states and 5261 transitions. [2024-11-09 05:15:48,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-09 05:15:48,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:15:48,913 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-09 05:15:48,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-09 05:15:48,913 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:15:48,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:15:48,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1718174835, now seen corresponding path program 1 times [2024-11-09 05:15:48,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:15:48,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625633655] [2024-11-09 05:15:48,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:15:48,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:15:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:15:49,071 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-09 05:15:49,072 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:15:49,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625633655] [2024-11-09 05:15:49,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625633655] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:15:49,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455134544] [2024-11-09 05:15:49,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:15:49,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:15:49,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:15:49,075 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:15:49,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-11-09 05:15:49,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:15:49,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 05:15:49,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:15:49,305 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-09 05:15:49,305 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:15:49,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455134544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:15:49,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:15:49,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-09 05:15:49,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932977229] [2024-11-09 05:15:49,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:15:49,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:15:49,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:15:49,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:15:49,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:15:49,308 INFO L87 Difference]: Start difference. First operand 4593 states and 5261 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-09 05:15:50,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:15:50,917 INFO L93 Difference]: Finished difference Result 9802 states and 11167 transitions. [2024-11-09 05:15:50,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:15:50,918 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-09 05:15:50,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:15:50,936 INFO L225 Difference]: With dead ends: 9802 [2024-11-09 05:15:50,937 INFO L226 Difference]: Without dead ends: 5764 [2024-11-09 05:15:50,942 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-09 05:15:50,943 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 150 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:15:50,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 536 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:15:50,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5764 states. [2024-11-09 05:15:52,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5764 to 5762. [2024-11-09 05:15:52,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5762 states, 4423 states have (on average 1.1137237169342076) internal successors, (4926), 4439 states have internal predecessors, (4926), 737 states have call successors, (737), 590 states have call predecessors, (737), 600 states have return successors, (797), 733 states have call predecessors, (797), 736 states have call successors, (797) [2024-11-09 05:15:52,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5762 states to 5762 states and 6460 transitions. [2024-11-09 05:15:52,476 INFO L78 Accepts]: Start accepts. Automaton has 5762 states and 6460 transitions. Word has length 167 [2024-11-09 05:15:52,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:15:52,477 INFO L471 AbstractCegarLoop]: Abstraction has 5762 states and 6460 transitions. [2024-11-09 05:15:52,477 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-09 05:15:52,477 INFO L276 IsEmpty]: Start isEmpty. Operand 5762 states and 6460 transitions. [2024-11-09 05:15:52,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-09 05:15:52,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:15:52,483 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-09 05:15:52,500 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2024-11-09 05:15:52,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2024-11-09 05:15:52,683 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:15:52,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:15:52,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1657263967, now seen corresponding path program 1 times [2024-11-09 05:15:52,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:15:52,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710892735] [2024-11-09 05:15:52,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:15:52,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:15:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:15:52,855 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-09 05:15:52,855 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:15:52,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710892735] [2024-11-09 05:15:52,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710892735] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:15:52,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080173851] [2024-11-09 05:15:52,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:15:52,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:15:52,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:15:52,858 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:15:52,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-11-09 05:15:53,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:15:53,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 05:15:53,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:15:53,124 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-09 05:15:53,125 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:15:53,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080173851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:15:53,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:15:53,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2024-11-09 05:15:53,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146685844] [2024-11-09 05:15:53,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:15:53,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:15:53,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:15:53,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:15:53,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:15:53,128 INFO L87 Difference]: Start difference. First operand 5762 states and 6460 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-09 05:15:54,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:15:54,081 INFO L93 Difference]: Finished difference Result 6252 states and 7005 transitions. [2024-11-09 05:15:54,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:15:54,082 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-09 05:15:54,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:15:54,094 INFO L225 Difference]: With dead ends: 6252 [2024-11-09 05:15:54,094 INFO L226 Difference]: Without dead ends: 498 [2024-11-09 05:15:54,100 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-09 05:15:54,101 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 87 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:15:54,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 422 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 05:15:54,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2024-11-09 05:15:54,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2024-11-09 05:15:54,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 346 states have (on average 1.0953757225433527) internal successors, (379), 352 states have internal predecessors, (379), 76 states have call successors, (76), 66 states have call predecessors, (76), 75 states have return successors, (92), 79 states have call predecessors, (92), 75 states have call successors, (92) [2024-11-09 05:15:54,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 547 transitions. [2024-11-09 05:15:54,331 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 547 transitions. Word has length 169 [2024-11-09 05:15:54,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:15:54,332 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 547 transitions. [2024-11-09 05:15:54,332 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-09 05:15:54,332 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 547 transitions. [2024-11-09 05:15:54,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-09 05:15:54,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:15:54,333 INFO L215 NwaCegarLoop]: trace histogram [10, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 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-09 05:15:54,349 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2024-11-09 05:15:54,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2024-11-09 05:15:54,534 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:15:54,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:15:54,534 INFO L85 PathProgramCache]: Analyzing trace with hash -627608506, now seen corresponding path program 1 times [2024-11-09 05:15:54,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:15:54,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257562905] [2024-11-09 05:15:54,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:15:54,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:15:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:15:55,221 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 115 proven. 55 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-09 05:15:55,222 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:15:55,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257562905] [2024-11-09 05:15:55,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257562905] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:15:55,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842075929] [2024-11-09 05:15:55,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:15:55,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:15:55,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:15:55,224 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:15:55,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-11-09 05:15:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:15:55,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-09 05:15:55,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:15:56,967 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 158 proven. 191 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 05:15:56,967 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:15:58,979 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 122 proven. 26 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2024-11-09 05:15:58,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842075929] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:15:58,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [626038240] [2024-11-09 05:15:58,982 INFO L159 IcfgInterpreter]: Started Sifa with 68 locations of interest [2024-11-09 05:15:58,982 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:15:58,983 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:15:58,983 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:15:58,983 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:16:21,190 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events1 with input of size 152 for LOIs [2024-11-09 05:16:21,296 INFO L197 IcfgInterpreter]: Interpreting procedure error1 with input of size 17 for LOIs [2024-11-09 05:16:21,298 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread1 with input of size 7 for LOIs [2024-11-09 05:16:21,301 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads1 with input of size 125 for LOIs [2024-11-09 05:16:21,772 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_write_p_triggered with input of size 126 for LOIs [2024-11-09 05:16:22,149 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_read_c_triggered with input of size 21 for LOIs [2024-11-09 05:16:22,181 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events1 with input of size 119 for LOIs [2024-11-09 05:16:22,266 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels1 with input of size 130 for LOIs [2024-11-09 05:16:22,421 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:16:34,601 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '501924#(and (= ~q_req_up~0 1) (= ~q_free~0 1) (= ~c_dr_pc~0 1) (not (= ~c_num_read~0 ~p_num_write~0)) (= ~c_last_read~0 ~p_last_write~0) (= ~c_dr_st~0 1))' at error location [2024-11-09 05:16:34,601 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:16:34,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:16:34,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 16] total 48 [2024-11-09 05:16:34,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232711578] [2024-11-09 05:16:34,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:16:34,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-09 05:16:34,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:16:34,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-09 05:16:34,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=635, Invalid=8295, Unknown=0, NotChecked=0, Total=8930 [2024-11-09 05:16:34,605 INFO L87 Difference]: Start difference. First operand 498 states and 547 transitions. Second operand has 48 states, 36 states have (on average 7.916666666666667) internal successors, (285), 38 states have internal predecessors, (285), 22 states have call successors, (75), 17 states have call predecessors, (75), 23 states have return successors, (78), 25 states have call predecessors, (78), 22 states have call successors, (78) [2024-11-09 05:16:43,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:16:43,032 INFO L93 Difference]: Finished difference Result 937 states and 1032 transitions. [2024-11-09 05:16:43,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2024-11-09 05:16:43,033 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 36 states have (on average 7.916666666666667) internal successors, (285), 38 states have internal predecessors, (285), 22 states have call successors, (75), 17 states have call predecessors, (75), 23 states have return successors, (78), 25 states have call predecessors, (78), 22 states have call successors, (78) Word has length 220 [2024-11-09 05:16:43,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:16:43,042 INFO L225 Difference]: With dead ends: 937 [2024-11-09 05:16:43,042 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 05:16:43,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 803 GetRequests, 587 SyntacticMatches, 13 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 15142 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=3601, Invalid=38219, Unknown=0, NotChecked=0, Total=41820 [2024-11-09 05:16:43,048 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 1321 mSDsluCounter, 1411 mSDsCounter, 0 mSdLazyCounter, 3349 mSolverCounterSat, 812 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1321 SdHoareTripleChecker+Valid, 1496 SdHoareTripleChecker+Invalid, 4161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 812 IncrementalHoareTripleChecker+Valid, 3349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:16:43,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1321 Valid, 1496 Invalid, 4161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [812 Valid, 3349 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-09 05:16:43,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 05:16:43,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 05:16:43,050 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-09 05:16:43,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 05:16:43,061 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 220 [2024-11-09 05:16:43,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:16:43,061 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 05:16:43,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 36 states have (on average 7.916666666666667) internal successors, (285), 38 states have internal predecessors, (285), 22 states have call successors, (75), 17 states have call predecessors, (75), 23 states have return successors, (78), 25 states have call predecessors, (78), 22 states have call successors, (78) [2024-11-09 05:16:43,062 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 05:16:43,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 05:16:43,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-09 05:16:43,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-09 05:16:43,087 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2024-11-09 05:16:43,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2024-11-09 05:16:43,269 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:16:43,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 05:16:49,657 WARN L286 SmtUtils]: Spent 5.01s on a formula simplification. DAG size of input: 134 DAG size of output: 107 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-09 05:16:58,393 WARN L286 SmtUtils]: Spent 5.98s on a formula simplification. DAG size of input: 454 DAG size of output: 384 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-09 05:17:22,830 WARN L286 SmtUtils]: Spent 6.19s on a formula simplification. DAG size of input: 454 DAG size of output: 384 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-09 05:18:11,116 WARN L286 SmtUtils]: Spent 5.91s on a formula simplification. DAG size of input: 141 DAG size of output: 104 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-09 05:18:17,766 WARN L286 SmtUtils]: Spent 6.28s on a formula simplification. DAG size of input: 141 DAG size of output: 104 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-09 05:18:41,830 WARN L286 SmtUtils]: Spent 23.05s on a formula simplification. DAG size of input: 206 DAG size of output: 252 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-09 05:19:14,532 WARN L286 SmtUtils]: Spent 5.76s on a formula simplification. DAG size of input: 134 DAG size of output: 107 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-09 05:19:24,191 WARN L286 SmtUtils]: Spent 6.00s on a formula simplification. DAG size of input: 384 DAG size of output: 183 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-09 05:19:54,081 WARN L286 SmtUtils]: Spent 6.07s on a formula simplification. DAG size of input: 264 DAG size of output: 215 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-09 05:20:26,950 WARN L286 SmtUtils]: Spent 5.94s on a formula simplification. DAG size of input: 134 DAG size of output: 107 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-09 05:20:41,214 WARN L286 SmtUtils]: Spent 6.46s on a formula simplification. DAG size of input: 264 DAG size of output: 215 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-09 05:20:51,401 WARN L286 SmtUtils]: Spent 6.33s on a formula simplification. DAG size of input: 414 DAG size of output: 104 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-09 05:20:57,121 WARN L286 SmtUtils]: Spent 5.35s on a formula simplification. DAG size of input: 566 DAG size of output: 83 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-09 05:21:22,634 WARN L286 SmtUtils]: Spent 22.72s on a formula simplification. DAG size of input: 929 DAG size of output: 160 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-09 05:21:49,271 WARN L286 SmtUtils]: Spent 11.56s on a formula simplification. DAG size of input: 529 DAG size of output: 125 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-09 05:22:01,163 WARN L286 SmtUtils]: Spent 10.06s on a formula simplification. DAG size of input: 864 DAG size of output: 147 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-09 05:22:11,694 WARN L286 SmtUtils]: Spent 9.91s on a formula simplification. DAG size of input: 776 DAG size of output: 85 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-09 05:22:23,975 WARN L286 SmtUtils]: Spent 6.48s on a formula simplification. DAG size of input: 380 DAG size of output: 109 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-09 05:22:35,426 WARN L286 SmtUtils]: Spent 7.22s on a formula simplification. DAG size of input: 551 DAG size of output: 110 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-09 05:22:57,805 WARN L286 SmtUtils]: Spent 17.12s on a formula simplification. DAG size of input: 947 DAG size of output: 120 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-09 05:23:21,421 WARN L286 SmtUtils]: Spent 10.19s on a formula simplification. DAG size of input: 778 DAG size of output: 103 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-09 05:23:29,740 WARN L286 SmtUtils]: Spent 8.29s on a formula simplification. DAG size of input: 582 DAG size of output: 114 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-09 05:23:40,437 WARN L286 SmtUtils]: Spent 8.47s on a formula simplification. DAG size of input: 860 DAG size of output: 142 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-09 05:24:10,022 WARN L286 SmtUtils]: Spent 6.23s on a formula simplification. DAG size of input: 496 DAG size of output: 116 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-09 05:24:25,067 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 05:24:25,142 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:25,143 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:25,143 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 05:24:25,144 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:25,144 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:25,145 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:25,145 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:25,146 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:25,146 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:25,146 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:25,146 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:25,147 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:25,147 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:25,147 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:25,148 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:25,148 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 05:24:25,148 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 05:24:25,148 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 05:24:25,149 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 05:24:25,149 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 05:24:25,149 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 05:24:25,158 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:25,158 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:25,159 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 05:24:25,159 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:25,159 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:25,160 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:25,160 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:25,161 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:25,161 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:25,161 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:25,162 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:25,162 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:25,162 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:25,162 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:25,163 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:25,163 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 05:24:25,163 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 05:24:25,163 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 05:24:25,164 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 05:24:25,164 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 05:24:25,164 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 05:24:25,166 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 05:24:25,218 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:25,219 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:25,219 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 05:24:25,219 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:25,220 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:25,220 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:25,220 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:25,220 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:25,221 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:25,221 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:25,221 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:25,221 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:25,222 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:25,222 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:25,222 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:25,223 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 05:24:25,223 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 05:24:25,223 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 05:24:25,223 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 05:24:25,223 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 05:24:25,224 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 05:24:25,224 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 05:24:25,242 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:25,242 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:25,243 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 05:24:25,243 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:25,244 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:25,244 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:25,244 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:25,244 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:25,245 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:25,245 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:25,245 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:25,246 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:25,246 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:25,246 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:25,246 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:25,246 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 05:24:25,247 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 05:24:25,247 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 05:24:25,247 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 05:24:25,247 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 05:24:25,247 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 05:24:25,252 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 05:24:25,254 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:25,254 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:25,254 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 05:24:25,255 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:25,255 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:25,255 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:25,256 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:25,256 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:25,256 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:25,257 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:25,257 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:25,257 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:25,257 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:25,258 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:25,258 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:25,258 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 05:24:25,258 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 05:24:25,259 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 05:24:25,259 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 05:24:25,259 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 05:24:25,259 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 05:24:25,608 WARN L162 FloydHoareUtils]: Requires clause for immediate_notify contained old-variable. Original clause: (let ((.cse35 (= 2 |old(~t2_st~0)|)) (.cse10 (= ~E_1~0 1)) (.cse9 (= ~m_pc~0 ~t1_pc~0))) (let ((.cse3 (= |old(~t2_st~0)| 0)) (.cse4 (= |old(~t1_st~0)| 2)) (.cse38 (= ~m_pc~0 1)) (.cse41 (not .cse9)) (.cse40 (= ~t1_st~0 0)) (.cse2 (= 0 ~t2_st~0)) (.cse22 (= 0 ~t2_pc~0)) (.cse39 (= 2 ~t2_st~0)) (.cse0 (= ~m_st~0 |old(~m_st~0)|)) (.cse1 (= 2 ~t1_st~0)) (.cse28 (= ~t1_pc~0 1)) (.cse43 (not .cse10)) (.cse42 (not .cse35))) (and (or (and .cse0 .cse1 .cse2) (not .cse3) (not .cse4)) (let ((.cse32 (= ~E_2~0 1)) (.cse34 (= ~c_dr_st~0 0)) (.cse18 (= ~p_dw_st~0 0))) (let ((.cse31 (= (+ ~local~0 1) ~token~0)) (.cse12 (or .cse34 (not .cse18))) (.cse16 (= |old(~t1_st~0)| 0)) (.cse37 (not .cse32)) (.cse33 (= ~t2_pc~0 1)) (.cse29 (<= 2 ~E_1~0)) (.cse30 (= 2 |old(~m_st~0)|)) (.cse11 (not .cse38)) (.cse36 (not (= ~E_M~0 1))) (.cse5 (= ~p_num_write~0 0)) (.cse6 (= ~c_num_read~0 0)) (.cse7 (= ~t1_i~0 1)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse13 (= ~q_free~0 0)) (.cse14 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse15 (= ~q_req_up~0 0)) (.cse17 (= ~E_2~0 2)) (.cse19 (not (= |old(~m_st~0)| 0))) (.cse20 (= ~t2_i~0 1)) (.cse21 (= ~c_dr_pc~0 0)) (.cse23 (= ~q_read_ev~0 0)) (.cse24 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (not (= ~q_write_ev~0 1))) (.cse26 (= ~E_M~0 2)) (.cse27 (= ~token~0 ~local~0))) (or (and .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (and .cse28 .cse3 .cse29 .cse5 .cse30 .cse6 .cse7 .cse31 .cse8 .cse32 .cse12 .cse13 .cse14 .cse15 .cse33 .cse18 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26) (and .cse28 .cse34 .cse29 .cse5 .cse30 .cse6 .cse7 .cse8 .cse13 .cse14 .cse15 .cse33 .cse17 .cse4 (= ~token~0 (+ 2 ~local~0)) .cse18 .cse20 .cse21 .cse23 .cse24 .cse25) (and .cse28 .cse34 .cse29 .cse5 .cse30 .cse6 .cse7 .cse31 .cse8 .cse32 .cse13 .cse14 .cse15 .cse33 .cse18 .cse35 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26) (and .cse28 .cse34 .cse29 .cse5 .cse30 .cse6 .cse7 .cse8 .cse11 .cse13 .cse14 .cse15 .cse33 .cse18 .cse20 .cse21 .cse23 .cse24 .cse25 .cse36) (and .cse34 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse33 .cse17 .cse18 .cse35 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27) (and .cse28 .cse3 .cse5 .cse30 .cse6 .cse7 .cse8 .cse32 .cse12 .cse13 .cse14 .cse15 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 (= ~E_1~0 2)) (and .cse34 .cse29 .cse5 .cse30 .cse6 .cse7 .cse8 .cse11 .cse13 .cse14 .cse37 .cse15 .cse16 .cse33 .cse18 .cse20 .cse21 .cse23 .cse24 .cse25) (and .cse28 .cse34 .cse5 .cse6 .cse7 .cse8 .cse10 .cse13 .cse14 .cse15 .cse33 .cse17 .cse4 .cse18 .cse35 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27) (and .cse28 .cse34 .cse29 .cse5 .cse30 .cse6 .cse7 .cse8 .cse11 .cse13 .cse14 .cse37 .cse15 .cse33 .cse18 .cse20 .cse21 .cse23 .cse24 .cse25) (and .cse28 .cse3 .cse34 .cse29 .cse5 .cse30 .cse6 .cse7 .cse8 .cse11 .cse13 .cse14 .cse15 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse36) (and .cse28 .cse3 .cse34 .cse5 .cse6 .cse7 .cse8 .cse10 .cse13 .cse14 .cse15 .cse17 .cse4 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27)))) (or (and .cse39 .cse0 .cse40) .cse41 .cse38 .cse42) (or .cse41 (and .cse0 .cse40 .cse2) .cse43 (not .cse22)) (or (and .cse39 .cse0 .cse1) (not .cse28) .cse43 .cse42) (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: (exists ((|old(~t2_st~0)| Int) (|old(~t1_st~0)| Int) (|old(~m_st~0)| Int)) (let ((.cse29 (= 2 |old(~t2_st~0)|)) (.cse26 (= ~E_1~0 1)) (.cse25 (= ~m_pc~0 ~t1_pc~0))) (let ((.cse3 (= |old(~t2_st~0)| 0)) (.cse4 (= |old(~t1_st~0)| 2)) (.cse37 (= ~m_pc~0 1)) (.cse40 (not .cse25)) (.cse39 (= ~t1_st~0 0)) (.cse2 (= 0 ~t2_st~0)) (.cse33 (= 0 ~t2_pc~0)) (.cse38 (= 2 ~t2_st~0)) (.cse0 (= ~m_st~0 |old(~m_st~0)|)) (.cse1 (= 2 ~t1_st~0)) (.cse5 (= ~t1_pc~0 1)) (.cse42 (not .cse26)) (.cse41 (not .cse29))) (and (or (and .cse0 .cse1 .cse2) (not .cse3) (not .cse4)) (let ((.cse34 (= ~E_2~0 1))) (let ((.cse16 (not .cse34)) (.cse27 (= |old(~t1_st~0)| 0)) (.cse14 (not .cse37)) (.cse35 (not (= ~E_M~0 1))) (.cse8 (<= 2 ~E_1~0)) (.cse10 (= 2 |old(~m_st~0)|)) (.cse36 (= (+ ~local~0 1) ~token~0)) (.cse6 (= ~p_dw_pc~0 0)) (.cse7 (= ~c_dr_st~0 0)) (.cse9 (= ~p_num_write~0 0)) (.cse11 (= ~c_num_read~0 0)) (.cse12 (= ~t1_i~0 1)) (.cse13 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (= ~q_free~0 0)) (.cse17 (= ~q_req_up~0 0)) (.cse18 (= ~t2_pc~0 1)) (.cse28 (= ~E_2~0 2)) (.cse19 (= ~p_dw_st~0 0)) (.cse30 (not (= |old(~m_st~0)| 0))) (.cse20 (= ~t2_i~0 1)) (.cse21 (= ~c_dr_pc~0 0)) (.cse22 (= ~q_read_ev~0 0)) (.cse23 (= ~c_last_read~0 ~p_last_write~0)) (.cse24 (not (= ~q_write_ev~0 1))) (.cse31 (= ~E_M~0 2)) (.cse32 (= ~token~0 ~local~0))) (or (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse25 .cse26 .cse14 .cse15 .cse17 .cse27 .cse18 .cse28 .cse19 .cse29 .cse30 .cse20 .cse21 .cse22 .cse23 .cse24 .cse31 .cse32) (and .cse5 .cse3 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse26 .cse15 .cse17 .cse28 .cse4 .cse19 .cse30 .cse20 .cse21 .cse33 .cse22 .cse23 .cse24 .cse31 .cse32) (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse27 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse3 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse25 .cse26 .cse14 .cse15 .cse17 .cse27 .cse28 .cse19 .cse30 .cse20 .cse21 .cse33 .cse22 .cse23 .cse24 .cse31 .cse32) (and .cse5 .cse3 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse34 .cse15 .cse17 .cse19 .cse20 .cse21 .cse33 .cse22 .cse23 .cse24 .cse31 (= ~E_1~0 2)) (and .cse5 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse19 .cse20 .cse21 .cse33 .cse22 .cse23 .cse24 .cse35) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse36 .cse13 .cse34 .cse15 .cse17 .cse18 .cse19 .cse29 .cse20 .cse21 .cse22 .cse23 .cse24 .cse31) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse35) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse17 .cse18 .cse28 .cse4 (= ~token~0 (+ 2 ~local~0)) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse5 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse36 .cse13 .cse34 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse31) (and .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse26 .cse15 .cse17 .cse18 .cse28 .cse4 .cse19 .cse29 .cse30 .cse20 .cse21 .cse22 .cse23 .cse24 .cse31 .cse32)))) (or (and .cse38 .cse0 .cse39) .cse40 .cse37 .cse41) (or .cse40 (and .cse0 .cse39 .cse2) .cse42 (not .cse33)) (or (and .cse38 .cse0 .cse1) (not .cse5) .cse42 .cse41) (or (and (= ~m_st~0 2) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~t2_st~0)| ~t2_st~0)) (< ~E_1~0 2)))))) [2024-11-09 05:24:25,788 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-09 05:24:25,915 WARN L162 FloydHoareUtils]: Requires clause for update_channels1 contained old-variable. Original clause: (let ((.cse2 (= |old(~q_req_up~0)| 0)) (.cse0 (= ~c_dr_st~0 ~p_dw_st~0)) (.cse1 (= ~q_free~0 1))) (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|) (or (= ~q_ev~0 0) (not .cse0) (not .cse1) (not .cse2)) (let ((.cse17 (<= 2 ~E_1~0)) (.cse18 (= ~c_num_read~0 ~p_num_write~0)) (.cse22 (not (= ~E_2~0 1))) (.cse20 (= |old(~q_req_up~0)| 1)) (.cse9 (= ~p_dw_st~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse19 (not (= |old(~q_read_ev~0)| 0))) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~m_st~0 0)) (.cse21 (not (= ~m_pc~0 1))) (.cse28 (not (= ~c_dr_st~0 0))) (.cse6 (= 1 ~c_dr_i~0)) (.cse29 (= ~q_free~0 0)) (.cse23 (= ~c_dr_pc~0 1)) (.cse7 (= ~t1_st~0 0)) (.cse24 (not (= |old(~q_write_ev~0)| 0))) (.cse25 (not (= |old(~q_write_ev~0)| 1))) (.cse26 (= ~p_dw_pc~0 1)) (.cse8 (= ~E_2~0 2)) (.cse27 (not (= |old(~q_read_ev~0)| 1))) (.cse10 (= ~p_dw_i~0 1)) (.cse11 (= 0 ~t2_pc~0)) (.cse12 (= ~E_M~0 2)) (.cse14 (= 0 ~t2_st~0)) (.cse15 (= ~token~0 ~local~0)) (.cse16 (= ~E_1~0 2))) (or (let ((.cse13 (select |#memory_int| 1))) (and (= ~p_num_write~0 0) .cse2 (= (select |#length| 3) 12) (<= 1 |#StackHeapBarrier|) (= ~c_num_read~0 0) .cse3 .cse4 (= ~T1_E~0 2) .cse5 .cse1 (= ~c_last_read~0 0) (= ~T2_E~0 2) .cse6 (= 2 (select |#length| 1)) (= |old(~q_ev~0)| 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (= (select |#valid| 3) 1) (= ~t2_i~0 0) (= 2 |old(~q_write_ev~0)|) .cse7 (= ~m_i~0 0) .cse8 .cse9 (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= ~token~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= |old(~q_read_ev~0)| 2) .cse10 (= (select |#valid| 0) 0) .cse11 (= (select |#valid| 2) 1) (= ~c_last_read~0 ~p_last_write~0) .cse12 (= ~a_t~0 0) (= (select .cse13 0) 48) .cse14 .cse0 .cse15 (= (select .cse13 1) 0) .cse16 (= ~M_E~0 2) (= ~t1_i~0 0))) (and .cse17 .cse18 (= ~c_dr_st~0 2) .cse3 .cse19 .cse4 .cse20 .cse5 .cse1 .cse21 .cse6 .cse22 .cse23 .cse7 .cse24 .cse25 .cse26 .cse8 .cse27 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16) (and .cse17 .cse18 .cse3 .cse19 .cse4 .cse5 .cse21 .cse28 .cse6 .cse22 .cse23 (or (not .cse20) (not .cse29)) .cse7 .cse24 .cse25 .cse26 .cse8 .cse9 .cse27 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16) (and (not .cse9) .cse3 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse19 .cse4 .cse5 .cse21 .cse28 .cse6 .cse29 .cse23 .cse7 .cse24 .cse25 .cse26 .cse8 .cse27 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16))))) Eliminated clause: (let ((.cse4 (= ~q_req_up~0 0)) (.cse2 (= ~q_free~0 1))) (and (let ((.cse0 (= ~c_dr_st~0 0))) (let ((.cse24 (= ~q_req_up~0 1)) (.cse15 (= ~c_num_read~0 ~p_num_write~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse14 (not (= ~q_read_ev~0 1))) (.cse16 (= ~p_last_write~0 ~q_buf_0~0)) (.cse17 (= ~m_pc~0 ~t1_pc~0)) (.cse18 (not (= ~q_write_ev~0 0))) (.cse1 (= ~m_st~0 0)) (.cse19 (not (= ~m_pc~0 1))) (.cse20 (not .cse0)) (.cse3 (= 1 ~c_dr_i~0)) (.cse25 (= ~q_free~0 0)) (.cse21 (not (= ~q_read_ev~0 0))) (.cse22 (= ~c_dr_pc~0 1)) (.cse5 (= ~t1_st~0 0)) (.cse23 (= ~p_dw_pc~0 1)) (.cse6 (= ~E_2~0 2)) (.cse8 (= ~p_dw_i~0 1)) (.cse9 (= 0 ~t2_pc~0)) (.cse26 (not (= ~q_write_ev~0 1))) (.cse10 (= ~E_M~0 2)) (.cse12 (= 0 ~t2_st~0)) (.cse27 (= ~token~0 ~local~0)) (.cse13 (= ~E_1~0 2))) (or (let ((.cse11 (select |#memory_int| 1))) (and (= ~p_dw_pc~0 0) .cse0 (= ~p_num_write~0 0) (= (select |#length| 3) 12) (<= 1 |#StackHeapBarrier|) (= ~c_num_read~0 0) (= ~q_buf_0~0 0) (= ~t1_pc~0 0) (= ~p_last_write~0 0) (= ~T1_E~0 2) .cse1 .cse2 (= ~c_last_read~0 0) (= ~T2_E~0 2) .cse3 (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) .cse4 (= ~t2_i~0 0) .cse5 (= ~m_i~0 0) (= ~q_write_ev~0 2) .cse6 .cse7 (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= ~local~0 0) (= ~token~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) .cse8 (= (select |#valid| 0) 0) .cse9 (= (select |#valid| 2) 1) .cse10 (= ~a_t~0 0) (= (select .cse11 0) 48) .cse12 (= (select .cse11 1) 0) .cse13 (= ~M_E~0 2) (= ~t1_i~0 0))) (and .cse14 .cse15 .cse16 .cse17 .cse18 .cse1 .cse19 .cse20 .cse3 .cse21 .cse22 .cse5 .cse23 .cse6 .cse7 (or (not .cse24) (not .cse25)) .cse8 .cse9 .cse26 .cse10 .cse12 .cse27 .cse13) (and .cse24 .cse14 .cse15 (= ~c_dr_st~0 2) .cse16 .cse17 .cse18 .cse1 .cse2 .cse19 .cse3 .cse21 .cse22 .cse5 .cse23 .cse6 .cse8 .cse9 .cse26 .cse10 .cse12 .cse27 .cse13) (and (not .cse7) .cse14 .cse16 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse17 .cse18 .cse1 .cse19 .cse20 .cse3 .cse25 .cse21 .cse22 .cse5 .cse23 .cse6 .cse8 .cse9 .cse26 .cse10 .cse12 .cse27 .cse13)))) (or (not .cse4) (= ~q_ev~0 0) (not (= ~c_dr_st~0 ~p_dw_st~0)) (not .cse2)))) [2024-11-09 05:24:26,003 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:26,003 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:26,004 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 05:24:26,004 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:26,004 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:26,004 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:26,005 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:26,005 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:26,005 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:26,006 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:26,006 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:26,006 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:26,007 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:26,007 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:26,007 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:26,007 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 05:24:26,008 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 05:24:26,008 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 05:24:26,008 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 05:24:26,008 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 05:24:26,008 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 05:24:26,010 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:26,010 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:26,010 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 05:24:26,011 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:26,011 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:26,011 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:26,012 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:26,012 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:26,012 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:26,013 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:26,013 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:26,013 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:26,013 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:26,014 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:26,014 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:26,014 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 05:24:26,014 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 05:24:26,014 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 05:24:26,015 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 05:24:26,015 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 05:24:26,015 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 05:24:26,512 WARN L162 FloydHoareUtils]: Requires clause for activate_threads2 contained old-variable. Original clause: (let ((.cse39 (= 0 ~t2_pc~0)) (.cse36 (= ~E_1~0 1)) (.cse0 (= ~m_st~0 |old(~m_st~0)|)) (.cse2 (= 0 ~t2_st~0)) (.cse40 (= ~m_pc~0 ~t1_pc~0))) (let ((.cse4 (= |old(~t1_st~0)| 2)) (.cse3 (= |old(~t2_st~0)| 0)) (.cse11 (= 2 |old(~m_st~0)|)) (.cse7 (= ~m_pc~0 1)) (.cse9 (= ~m_st~0 2)) (.cse32 (= (+ ~local~0 1) ~token~0)) (.cse12 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t1_st~0)) (.cse5 (not .cse40)) (.cse6 (and .cse0 (= ~t1_st~0 0) .cse2)) (.cse42 (not .cse36)) (.cse8 (not .cse39)) (.cse10 (= |old(~t1_st~0)| ~t1_st~0)) (.cse26 (= 2 |old(~t2_st~0)|))) (and (or (and .cse0 .cse1 .cse2) (not .cse3) (not .cse4)) (or .cse5 .cse6 .cse7 .cse8) (or (and .cse9 .cse10 (= |old(~t2_st~0)| ~t2_st~0)) (not .cse11)) (let ((.cse19 (= |old(~m_st~0)| 0))) (let ((.cse24 (= ~token~0 (+ 2 ~local~0))) (.cse37 (not .cse19)) (.cse33 (not .cse7)) (.cse41 (= |old(~t1_st~0)| 0)) (.cse23 (= ~E_2~0 2)) (.cse34 (= ~token~0 ~local~0)) (.cse35 (= ~E_1~0 2)) (.cse13 (= ~c_dr_st~0 0)) (.cse14 (<= 2 ~E_1~0)) (.cse15 (= ~p_num_write~0 0)) (.cse16 (= ~c_num_read~0 0)) (.cse17 (= ~t1_i~0 1)) (.cse18 (= ~p_last_write~0 ~q_buf_0~0)) (.cse38 (= ~E_2~0 1)) (.cse20 (= ~q_free~0 0)) (.cse21 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse22 (= ~t2_pc~0 1)) (.cse25 (= ~p_dw_st~0 0)) (.cse27 (= ~t2_i~0 1)) (.cse28 (= ~c_dr_pc~0 0)) (.cse29 (= ~c_last_read~0 ~p_last_write~0)) (.cse30 (not (= ~q_write_ev~0 1))) (.cse31 (= ~E_M~0 2))) (or (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse4 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31) (and .cse12 .cse3 .cse13 .cse14 .cse15 .cse16 .cse17 .cse32 .cse18 .cse20 .cse21 .cse22 .cse23 .cse4 .cse25 .cse27 .cse28 .cse29 .cse30 .cse31) (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse33 .cse20 .cse21 .cse22 .cse23 .cse4 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse34 .cse35) (and .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse36 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse37 .cse27 .cse28 .cse29 .cse30 .cse31 .cse34) (and .cse12 .cse13 .cse14 .cse15 .cse11 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse4 .cse24 .cse25 .cse27 .cse28 .cse29 .cse30) (and .cse12 .cse3 .cse13 .cse15 .cse11 .cse16 .cse17 .cse18 .cse38 .cse20 .cse21 .cse25 .cse27 .cse28 .cse39 .cse29 .cse30 .cse31 .cse35) (and .cse12 .cse3 .cse13 .cse15 .cse11 .cse16 .cse17 .cse18 .cse20 .cse21 .cse23 .cse4 .cse25 .cse27 .cse28 .cse39 .cse29 .cse30 .cse31 .cse35) (and .cse12 .cse3 .cse13 .cse15 .cse16 .cse17 .cse18 .cse36 .cse20 .cse21 .cse23 .cse4 .cse25 .cse37 .cse27 .cse28 .cse39 .cse29 .cse30 .cse31 .cse34) (and .cse13 .cse15 .cse16 .cse17 .cse18 .cse40 .cse36 .cse20 .cse21 .cse41 .cse22 .cse23 .cse25 .cse26 .cse37 .cse27 .cse28 .cse29 .cse30 .cse31 .cse34) (and .cse12 .cse3 .cse13 .cse14 .cse15 .cse11 .cse16 .cse17 .cse32 .cse18 .cse38 .cse20 .cse21 .cse22 .cse25 .cse27 .cse28 .cse29 .cse30 .cse31) (and .cse13 .cse14 .cse15 .cse11 .cse16 .cse17 .cse18 .cse33 .cse20 .cse21 .cse41 .cse22 .cse25 .cse27 .cse28 .cse29 .cse30) (and .cse12 .cse3 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse33 .cse20 .cse21 .cse23 .cse4 .cse25 .cse27 .cse28 .cse39 .cse29 .cse30 .cse31 .cse34 .cse35) (and .cse12 .cse13 .cse14 .cse15 .cse11 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse4 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31) (and .cse3 .cse13 .cse15 .cse16 .cse17 .cse18 .cse40 .cse33 .cse20 .cse21 .cse41 .cse23 .cse25 .cse27 .cse28 .cse39 .cse29 .cse30 .cse31 .cse34 .cse35) (and .cse12 .cse3 .cse13 .cse14 .cse15 .cse11 .cse16 .cse17 .cse18 .cse33 .cse20 .cse21 .cse25 .cse27 .cse28 .cse39 .cse29 .cse30) (and .cse3 .cse13 .cse15 .cse16 .cse17 .cse18 .cse40 .cse36 .cse20 .cse21 .cse41 .cse23 .cse25 .cse37 .cse27 .cse28 .cse39 .cse29 .cse30 .cse31 .cse34) (and .cse12 .cse13 .cse14 .cse15 .cse11 .cse16 .cse17 .cse18 .cse33 .cse20 .cse21 .cse22 .cse25 .cse27 .cse28 .cse29 .cse30) (and .cse13 .cse15 .cse16 .cse17 .cse18 .cse40 .cse33 .cse20 .cse21 .cse41 .cse22 .cse23 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse34 .cse35) (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse32 .cse18 .cse38 .cse20 .cse21 .cse22 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31)))) (or .cse9 (not .cse32)) (or (not .cse12) .cse1 .cse42) (or .cse5 .cse6 .cse42 .cse8) (= ~q_req_up~0 0) (or (and .cse10 (= 2 ~t2_st~0) .cse0) (not .cse26)) (= ~q_read_ev~0 0)))) Eliminated clause: (let ((.cse38 (= ~E_1~0 1))) (let ((.cse3 (= 2 ~t1_st~0)) (.cse0 (= ~m_st~0 2)) (.cse4 (not .cse38)) (.cse1 (= (+ ~local~0 1) ~token~0)) (.cse2 (= ~t1_pc~0 1))) (and (or .cse0 (not .cse1)) (or (not .cse2) .cse3 .cse4) (= ~q_req_up~0 0) (exists ((|old(~t2_st~0)| Int) (|old(~t1_st~0)| Int) (|old(~m_st~0)| Int)) (let ((.cse40 (= 0 ~t2_pc~0)) (.cse5 (= ~m_st~0 |old(~m_st~0)|)) (.cse6 (= 0 ~t2_st~0)) (.cse22 (= ~m_pc~0 ~t1_pc~0))) (let ((.cse9 (not .cse22)) (.cse10 (and .cse5 (= ~t1_st~0 0) .cse6)) (.cse12 (not .cse40)) (.cse13 (= |old(~t1_st~0)| ~t1_st~0)) (.cse14 (= 2 |old(~m_st~0)|)) (.cse15 (= 2 |old(~t2_st~0)|)) (.cse7 (= |old(~t2_st~0)| 0)) (.cse8 (= |old(~t1_st~0)| 2)) (.cse11 (= ~m_pc~0 1))) (and (or (and .cse5 .cse3 .cse6) (not .cse7) (not .cse8)) (or .cse9 .cse10 .cse11 .cse12) (or (and .cse0 .cse13 (= |old(~t2_st~0)| ~t2_st~0)) (not .cse14)) (or .cse9 .cse10 .cse4 .cse12) (or (and .cse13 (= 2 ~t2_st~0) .cse5) (not .cse15)) (let ((.cse41 (= |old(~m_st~0)| 0))) (let ((.cse37 (= ~token~0 (+ 2 ~local~0))) (.cse25 (= |old(~t1_st~0)| 0)) (.cse36 (<= 2 ~E_1~0)) (.cse42 (= ~E_2~0 1)) (.cse23 (not .cse11)) (.cse26 (= ~t2_pc~0 1)) (.cse35 (= ~E_1~0 2)) (.cse16 (= ~p_dw_pc~0 0)) (.cse17 (= ~c_dr_st~0 0)) (.cse18 (= ~p_num_write~0 0)) (.cse19 (= ~c_num_read~0 0)) (.cse20 (= ~t1_i~0 1)) (.cse21 (= ~p_last_write~0 ~q_buf_0~0)) (.cse24 (= ~q_free~0 0)) (.cse27 (= ~E_2~0 2)) (.cse28 (= ~p_dw_st~0 0)) (.cse39 (not .cse41)) (.cse29 (= ~t2_i~0 1)) (.cse30 (= ~c_dr_pc~0 0)) (.cse31 (= ~c_last_read~0 ~p_last_write~0)) (.cse32 (not (= ~q_write_ev~0 1))) (.cse33 (= ~E_M~0 2)) (.cse34 (= ~token~0 ~local~0))) (or (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse15 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35) (and .cse2 .cse16 .cse17 .cse36 .cse18 .cse14 .cse19 .cse20 .cse21 .cse24 .cse26 .cse27 .cse8 .cse28 .cse15 .cse29 .cse30 .cse31 .cse32 .cse33) (and .cse2 .cse16 .cse17 .cse36 .cse18 .cse14 .cse19 .cse20 .cse21 .cse24 .cse26 .cse27 .cse8 .cse37 .cse28 .cse29 .cse30 .cse31 .cse32) (and .cse7 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse38 .cse24 .cse25 .cse27 .cse28 .cse39 .cse29 .cse30 .cse40 .cse31 .cse32 .cse33 .cse34) (and .cse7 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27 .cse28 .cse29 .cse30 .cse40 .cse31 .cse32 .cse33 .cse34 .cse35) (and .cse2 .cse7 .cse16 .cse17 .cse36 .cse18 .cse19 .cse20 .cse1 .cse21 .cse24 .cse26 .cse27 .cse8 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33) (and .cse2 .cse7 .cse16 .cse17 .cse18 .cse14 .cse19 .cse20 .cse21 .cse24 .cse27 .cse8 .cse28 .cse29 .cse30 .cse40 .cse31 .cse32 .cse33 .cse35) (and .cse2 .cse16 .cse17 .cse36 .cse18 .cse19 .cse20 .cse21 .cse41 .cse24 .cse26 .cse27 .cse8 .cse37 .cse28 .cse15 .cse29 .cse30 .cse31 .cse32 .cse33) (and .cse2 .cse7 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse27 .cse8 .cse28 .cse29 .cse30 .cse40 .cse31 .cse32 .cse33 .cse34 .cse35) (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse38 .cse24 .cse25 .cse26 .cse27 .cse28 .cse15 .cse39 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34) (and .cse2 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse38 .cse24 .cse26 .cse27 .cse28 .cse15 .cse39 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34) (and .cse2 .cse7 .cse16 .cse17 .cse18 .cse14 .cse19 .cse20 .cse21 .cse42 .cse24 .cse28 .cse29 .cse30 .cse40 .cse31 .cse32 .cse33 .cse35) (and .cse2 .cse16 .cse17 .cse36 .cse18 .cse14 .cse19 .cse20 .cse21 .cse23 .cse24 .cse26 .cse28 .cse29 .cse30 .cse31 .cse32) (and .cse2 .cse7 .cse16 .cse17 .cse36 .cse18 .cse14 .cse19 .cse20 .cse1 .cse21 .cse42 .cse24 .cse26 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33) (and .cse16 .cse17 .cse36 .cse18 .cse14 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse28 .cse29 .cse30 .cse31 .cse32) (and .cse2 .cse7 .cse16 .cse17 .cse36 .cse18 .cse14 .cse19 .cse20 .cse21 .cse23 .cse24 .cse28 .cse29 .cse30 .cse40 .cse31 .cse32) (and .cse2 .cse16 .cse17 .cse36 .cse18 .cse19 .cse20 .cse1 .cse21 .cse42 .cse24 .cse26 .cse28 .cse15 .cse29 .cse30 .cse31 .cse32 .cse33) (and .cse2 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse26 .cse27 .cse8 .cse28 .cse15 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35) (and .cse2 .cse7 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse38 .cse24 .cse27 .cse8 .cse28 .cse39 .cse29 .cse30 .cse40 .cse31 .cse32 .cse33 .cse34)))))))) (= ~q_read_ev~0 0)))) [2024-11-09 05:24:26,892 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-09 05:24:27,075 WARN L162 FloydHoareUtils]: Requires clause for activate_threads1 contained old-variable. Original clause: (let ((.cse1 (= ~c_num_read~0 ~p_num_write~0)) (.cse2 (= ~p_dw_pc~0 1)) (.cse0 (= |old(~p_dw_st~0)| 0))) (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (or (= ~c_dr_st~0 2) .cse0 (not .cse1)) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (or (= ~c_dr_st~0 0) .cse2) (let ((.cse23 (= ~q_free~0 0))) (let ((.cse13 (or (not (= ~q_req_up~0 1)) (not .cse23))) (.cse16 (not (= ~q_write_ev~0 1))) (.cse7 (= ~q_read_ev~0 1)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (not (= ~q_write_ev~0 0))) (.cse6 (= ~m_st~0 0)) (.cse8 (not (= ~m_pc~0 1))) (.cse9 (= 1 ~c_dr_i~0)) (.cse22 (not (= ~q_read_ev~0 0))) (.cse10 (= ~c_dr_pc~0 1)) (.cse11 (= ~t1_st~0 0)) (.cse12 (= ~E_2~0 2)) (.cse14 (= ~p_dw_i~0 1)) (.cse15 (= 0 ~t2_pc~0)) (.cse17 (= ~E_M~0 2)) (.cse18 (= 0 ~t2_st~0)) (.cse19 (= ~token~0 ~local~0)) (.cse20 (= ~E_1~0 2))) (or (and .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse2 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (= 2 |old(~c_dr_st~0)|) .cse20) (let ((.cse21 (select |#memory_int| 1))) (and (= ~p_num_write~0 0) (= (select |#length| 3) 12) (<= 1 |#StackHeapBarrier|) (= ~c_num_read~0 0) .cse3 .cse4 (= ~T1_E~0 2) .cse6 (= ~q_free~0 1) (= ~c_last_read~0 0) (= ~T2_E~0 2) .cse9 (= 2 (select |#length| 1)) (= ~c_dr_pc~0 ~p_dw_pc~0) (= (select |#valid| 3) 1) (= ~q_req_up~0 0) (= ~t2_i~0 0) .cse11 (= ~q_ev~0 0) (= ~m_i~0 0) (= ~q_write_ev~0 2) .cse12 (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= ~token~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) .cse14 (= (select |#valid| 0) 0) .cse15 (= (select |#valid| 2) 1) (= ~c_last_read~0 ~p_last_write~0) .cse17 (= ~a_t~0 0) (= (select .cse21 0) 48) .cse18 .cse19 (= (select .cse21 1) 0) .cse20 (= ~M_E~0 2) (= ~t1_i~0 0))) (and (not (= |old(~c_dr_st~0)| 0)) .cse1 .cse3 .cse4 .cse5 .cse0 .cse6 .cse8 .cse9 .cse22 .cse10 .cse11 .cse2 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and (not .cse7) .cse3 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse4 .cse5 .cse6 .cse8 .cse9 .cse23 .cse22 .cse10 .cse11 .cse2 .cse12 .cse14 .cse15 .cse17 .cse18 .cse19 (not .cse0) .cse20)))))) Eliminated clause: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse4 (= ~p_dw_st~0 0)) (.cse3 (= ~c_num_read~0 ~p_num_write~0)) (.cse2 (= ~c_dr_st~0 2)) (.cse1 (= ~p_dw_pc~0 1))) (and (or .cse0 .cse1) (or .cse2 (not .cse3) .cse4) (let ((.cse12 (= ~q_free~0 0))) (let ((.cse13 (not (= ~q_read_ev~0 0))) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~m_pc~0 ~t1_pc~0)) (.cse8 (not (= ~q_write_ev~0 0))) (.cse9 (= ~m_st~0 0)) (.cse5 (= ~q_read_ev~0 1)) (.cse10 (not (= ~m_pc~0 1))) (.cse11 (= 1 ~c_dr_i~0)) (.cse14 (= ~c_dr_pc~0 1)) (.cse15 (= ~t1_st~0 0)) (.cse16 (= ~E_2~0 2)) (.cse24 (or (not (= ~q_req_up~0 1)) (not .cse12))) (.cse17 (= ~p_dw_i~0 1)) (.cse18 (= 0 ~t2_pc~0)) (.cse25 (not (= ~q_write_ev~0 1))) (.cse19 (= ~E_M~0 2)) (.cse20 (= 0 ~t2_st~0)) (.cse21 (= ~token~0 ~local~0)) (.cse22 (= ~E_1~0 2))) (or (and (not .cse4) (not .cse5) .cse6 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse1 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (let ((.cse23 (select |#memory_int| 1))) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= (select |#length| 3) 12) (<= 1 |#StackHeapBarrier|) (= ~c_num_read~0 0) (= ~q_buf_0~0 0) (= ~t1_pc~0 0) (= ~p_last_write~0 0) (= ~T1_E~0 2) .cse9 (= ~q_free~0 1) (= ~c_last_read~0 0) (= ~T2_E~0 2) .cse11 (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= ~q_req_up~0 0) (= ~t2_i~0 0) .cse15 (= ~q_ev~0 0) (= ~m_i~0 0) (= ~q_write_ev~0 2) .cse16 (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= ~local~0 0) (= ~token~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) .cse17 (= (select |#valid| 0) 0) .cse18 (= (select |#valid| 2) 1) .cse19 (= ~a_t~0 0) (= (select .cse23 0) 48) .cse20 (= (select .cse23 1) 0) .cse22 (= ~M_E~0 2) (= ~t1_i~0 0))) (and .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 (not .cse0) .cse11 .cse13 .cse14 .cse15 .cse1 .cse16 .cse4 .cse24 .cse17 .cse18 .cse25 .cse19 .cse20 .cse21 .cse22) (and .cse3 .cse2 .cse6 .cse7 .cse8 .cse9 .cse5 .cse10 .cse11 .cse14 .cse15 .cse1 .cse16 .cse24 .cse17 .cse18 .cse25 .cse19 .cse20 .cse21 .cse22)))))) [2024-11-09 05:24:27,190 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:27,191 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:27,191 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 05:24:27,192 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:27,192 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:27,192 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:27,193 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:27,193 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:27,193 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:27,194 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:27,194 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:27,194 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:27,194 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:27,195 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:27,195 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:27,195 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 05:24:27,195 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 05:24:27,196 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 05:24:27,196 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 05:24:27,196 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 05:24:27,196 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 05:24:27,197 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:27,198 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:27,198 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 05:24:27,198 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:27,199 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:27,199 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:27,199 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:27,200 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:27,200 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:27,200 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:27,201 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:27,201 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:27,201 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:27,201 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:27,202 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:27,202 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 05:24:27,202 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 05:24:27,202 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 05:24:27,203 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 05:24:27,203 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 05:24:27,203 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 05:24:27,764 WARN L162 FloydHoareUtils]: Requires clause for fire_delta_events2 contained old-variable. Original clause: (let ((.cse26 (= 2 |old(~E_M~0)|)) (.cse25 (= 2 ~t2_st~0)) (.cse29 (= 2 |old(~E_1~0)|)) (.cse27 (= 2 |old(~E_2~0)|)) (.cse34 (= ~m_pc~0 ~t1_pc~0)) (.cse31 (= 0 ~t2_pc~0)) (.cse28 (= 2 ~t1_st~0)) (.cse42 (= ~E_2~0 2)) (.cse43 (= ~E_M~0 2))) (let ((.cse32 (= 0 ~t2_st~0)) (.cse15 (= ~t2_pc~0 1)) (.cse35 (= (+ ~local~0 1) ~token~0)) (.cse39 (and .cse42 (= ~E_1~0 |old(~E_1~0)|) .cse43)) (.cse38 (not .cse28)) (.cse1 (not .cse31)) (.cse0 (not .cse34)) (.cse36 (not .cse27)) (.cse41 (not .cse29)) (.cse40 (not .cse25)) (.cse37 (not .cse26)) (.cse2 (and .cse42 .cse43 (= ~E_1~0 2))) (.cse33 (= ~token~0 ~local~0))) (and (<= 2 ~E_1~0) (or .cse0 .cse1 .cse2) (let ((.cse3 (= ~c_dr_st~0 0)) (.cse18 (= ~p_dw_st~0 0))) (let ((.cse14 (= ~t1_st~0 0)) (.cse6 (not (= |old(~E_M~0)| 1))) (.cse10 (not (= ~m_pc~0 1))) (.cse16 (<= 2 |old(~E_1~0)|)) (.cse17 (not (= |old(~E_2~0)| 1))) (.cse24 (= ~t1_pc~0 1)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse7 (= ~m_st~0 2)) (.cse8 (= ~t1_i~0 1)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0)) (.cse30 (or .cse3 (not .cse18))) (.cse11 (= ~q_free~0 0)) (.cse12 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse13 (= ~q_req_up~0 0)) (.cse19 (= ~t2_i~0 1)) (.cse20 (= ~c_dr_pc~0 0)) (.cse21 (= ~q_read_ev~0 0)) (.cse22 (= ~c_last_read~0 ~p_last_write~0)) (.cse23 (not (= ~q_write_ev~0 1)))) (or (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse24 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse25 .cse26 .cse27 .cse11 .cse28 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse24 .cse4 .cse29 .cse5 .cse7 .cse8 .cse9 .cse26 .cse30 .cse27 .cse11 .cse28 .cse12 .cse13 .cse18 .cse19 .cse20 .cse31 .cse21 .cse22 .cse23 .cse32) (and .cse24 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse16 .cse17 .cse18 .cse19 .cse20 .cse31 .cse21 .cse22 .cse23 .cse32) (and .cse24 .cse3 .cse4 .cse29 .cse5 .cse6 .cse8 .cse9 .cse26 .cse10 .cse27 .cse11 .cse28 .cse12 .cse13 .cse16 .cse17 .cse18 .cse19 .cse20 .cse31 .cse21 .cse22 .cse23 .cse32 .cse33) (and .cse3 .cse4 .cse29 .cse5 .cse8 .cse9 .cse34 .cse25 .cse26 .cse10 .cse27 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse33) (and .cse24 .cse3 .cse4 .cse29 .cse5 .cse6 .cse8 .cse9 .cse25 .cse26 .cse10 .cse27 .cse11 .cse28 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse33) (and .cse24 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse25 .cse26 (= ~m_st~0 0) .cse27 .cse11 .cse28 .cse12 .cse13 .cse15 .cse16 .cse17 (= ~token~0 (+ 2 ~local~0)) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse3 .cse4 .cse29 .cse5 .cse8 .cse9 .cse34 .cse26 .cse10 .cse27 .cse11 .cse12 .cse13 .cse14 .cse18 .cse19 .cse20 .cse31 .cse21 .cse22 .cse23 .cse32 .cse33) (and .cse24 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse24 .cse4 .cse5 .cse7 .cse8 .cse35 .cse9 .cse26 .cse30 .cse27 .cse11 .cse28 .cse12 .cse13 .cse15 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse32)))) (not (= ~E_2~0 1)) (or .cse36 .cse37 .cse38 .cse39 (not .cse32) (not .cse15) (not .cse35)) (or .cse36 .cse40 .cse37 .cse38 .cse39) (or .cse36 .cse41 .cse37 .cse38 .cse1 .cse2) (or .cse0 .cse36 .cse41 .cse40 .cse37 .cse2 (not .cse33)) (not (= ~E_M~0 1))))) Eliminated clause: (let ((.cse41 (= ~E_2~0 2)) (.cse42 (= ~E_M~0 2)) (.cse26 (= ~m_pc~0 ~t1_pc~0)) (.cse20 (= 0 ~t2_pc~0))) (let ((.cse1 (not .cse20)) (.cse0 (not .cse26)) (.cse2 (and .cse41 .cse42 (= ~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 ((.cse11 (= 2 |old(~E_M~0)|)) (.cse27 (= 2 ~t2_st~0)) (.cse7 (= 2 |old(~E_1~0)|)) (.cse13 (= 2 |old(~E_2~0)|)) (.cse15 (= 2 ~t1_st~0))) (let ((.cse24 (= 0 ~t2_st~0)) (.cse29 (= ~t2_pc~0 1)) (.cse34 (= (+ ~local~0 1) ~token~0)) (.cse38 (and .cse41 (= ~E_1~0 |old(~E_1~0)|) .cse42)) (.cse37 (not .cse15)) (.cse35 (not .cse13)) (.cse40 (not .cse7)) (.cse39 (not .cse27)) (.cse36 (not .cse11)) (.cse25 (= ~token~0 ~local~0))) (and (let ((.cse3 (= ~t1_pc~0 1)) (.cse4 (= ~p_dw_pc~0 0)) (.cse5 (= ~c_dr_st~0 0)) (.cse6 (= ~p_num_write~0 0)) (.cse8 (= ~c_num_read~0 0)) (.cse31 (not (= |old(~E_M~0)| 1))) (.cse30 (= ~m_st~0 2)) (.cse9 (= ~t1_i~0 1)) (.cse10 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (not (= ~m_pc~0 1))) (.cse14 (= ~q_free~0 0)) (.cse16 (= ~q_req_up~0 0)) (.cse28 (= ~t1_st~0 0)) (.cse32 (<= 2 |old(~E_1~0)|)) (.cse33 (not (= |old(~E_2~0)| 1))) (.cse17 (= ~p_dw_st~0 0)) (.cse18 (= ~t2_i~0 1)) (.cse19 (= ~c_dr_pc~0 0)) (.cse21 (= ~q_read_ev~0 0)) (.cse22 (= ~c_last_read~0 ~p_last_write~0)) (.cse23 (not (= ~q_write_ev~0 1)))) (or (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse26 .cse27 .cse11 .cse12 .cse13 .cse14 .cse16 .cse28 .cse29 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse25) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse30 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse3 .cse4 .cse5 .cse6 .cse8 .cse31 .cse30 .cse9 .cse10 .cse12 .cse14 .cse16 .cse29 .cse32 .cse33 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse26 .cse11 .cse12 .cse13 .cse14 .cse16 .cse28 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse3 .cse4 .cse5 .cse6 .cse8 .cse31 .cse30 .cse9 .cse10 .cse12 .cse14 .cse16 .cse32 .cse33 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse3 .cse4 .cse5 .cse6 .cse8 .cse30 .cse9 .cse10 .cse27 .cse11 .cse13 .cse14 .cse15 .cse16 .cse29 .cse32 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23) (and .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse27 .cse11 (= ~m_st~0 0) .cse13 .cse14 .cse15 .cse16 .cse29 .cse32 (= ~token~0 (+ 2 ~local~0)) .cse17 .cse18 .cse19 .cse21 .cse22 .cse23) (and .cse3 .cse4 .cse5 .cse6 .cse8 .cse30 .cse9 .cse34 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse27 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse25) (and .cse4 .cse5 .cse6 .cse8 .cse31 .cse30 .cse9 .cse10 .cse12 .cse14 .cse16 .cse28 .cse29 .cse32 .cse33 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23))) (or .cse35 .cse36 .cse37 .cse38 (not .cse24) (not .cse29) (not .cse34)) (or .cse35 .cse39 .cse36 .cse37 .cse38) (or .cse35 .cse40 .cse36 .cse37 .cse1 .cse2) (or .cse0 .cse35 .cse40 .cse39 .cse36 .cse2 (not .cse25)))))) (not (= ~E_M~0 1))))) [2024-11-09 05:24:27,931 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-09 05:24:28,071 WARN L162 FloydHoareUtils]: Requires clause for fire_delta_events1 contained old-variable. Original clause: (let ((.cse20 (= ~c_num_read~0 ~p_num_write~0)) (.cse0 (= ~p_dw_st~0 0)) (.cse11 (= ~p_dw_pc~0 1))) (and (let ((.cse8 (= ~q_free~0 0)) (.cse24 (= ~c_dr_st~0 0))) (let ((.cse2 (= |old(~q_read_ev~0)| 0)) (.cse5 (not (= ~m_pc~0 1))) (.cse6 (not .cse24)) (.cse9 (= ~c_dr_pc~0 1)) (.cse21 (not (= |old(~q_write_ev~0)| 0))) (.cse22 (not (= |old(~q_write_ev~0)| 1))) (.cse23 (or (not (= ~q_req_up~0 1)) (not .cse8))) (.cse13 (not (= |old(~q_read_ev~0)| 1))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~m_st~0 0)) (.cse7 (= 1 ~c_dr_i~0)) (.cse10 (= ~t1_st~0 0)) (.cse12 (= ~E_2~0 2)) (.cse14 (= ~p_dw_i~0 1)) (.cse15 (= 0 ~t2_pc~0)) (.cse16 (= ~E_M~0 2)) (.cse17 (= 0 ~t2_st~0)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~E_1~0 2))) (or (and (not .cse0) .cse1 (= (+ ~c_num_read~0 1) ~p_num_write~0) (not .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse20 (= ~c_dr_st~0 2) .cse1 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse21 .cse22 .cse11 .cse12 .cse23 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse2) (and .cse20 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse21 .cse22 .cse11 .cse12 .cse0 .cse23 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (let ((.cse25 (select |#memory_int| 1))) (and .cse24 (= ~p_num_write~0 0) (= (select |#length| 3) 12) (<= 1 |#StackHeapBarrier|) (= ~c_num_read~0 0) .cse1 .cse3 (= ~T1_E~0 2) .cse4 (= ~q_free~0 1) (= ~c_last_read~0 0) (= ~T2_E~0 2) .cse7 (= 2 (select |#length| 1)) (= ~c_dr_pc~0 ~p_dw_pc~0) (= (select |#valid| 3) 1) (= ~q_req_up~0 0) (= ~t2_i~0 0) .cse10 (= ~q_ev~0 0) (= ~m_i~0 0) .cse12 (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= ~token~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) .cse14 (= (select |#valid| 0) 0) .cse15 (= (select |#valid| 2) 1) (= ~c_last_read~0 ~p_last_write~0) .cse16 (= ~a_t~0 0) (= (select .cse25 0) 48) .cse17 .cse18 (= (select .cse25 1) 0) .cse19 (= ~M_E~0 2) (= ~t1_i~0 0)))))) (or (not .cse20) .cse0 (= ~q_read_ev~0 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (or (and (= ~q_write_ev~0 2) (= ~q_read_ev~0 2)) .cse11))) Eliminated clause: (let ((.cse0 (= ~c_num_read~0 ~p_num_write~0)) (.cse22 (= ~p_dw_st~0 0)) (.cse14 (= ~q_read_ev~0 0)) (.cse9 (= ~p_dw_pc~0 1))) (and (let ((.cse23 (= ~c_dr_st~0 0)) (.cse25 (= ~q_free~0 0))) (let ((.cse3 (not (= ~q_write_ev~0 0))) (.cse11 (or (not (= ~q_req_up~0 1)) (not .cse25))) (.cse15 (not (= ~q_write_ev~0 1))) (.cse20 (not (= ~q_read_ev~0 1))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~m_st~0 0)) (.cse5 (not (= ~m_pc~0 1))) (.cse21 (not .cse23)) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (= ~c_dr_pc~0 1)) (.cse8 (= ~t1_st~0 0)) (.cse10 (= ~E_2~0 2)) (.cse12 (= ~p_dw_i~0 1)) (.cse13 (= 0 ~t2_pc~0)) (.cse16 (= ~E_M~0 2)) (.cse17 (= 0 ~t2_st~0)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~E_1~0 2))) (or (and .cse0 (= ~c_dr_st~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse20 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse21 .cse6 .cse7 .cse8 .cse9 .cse10 .cse22 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19) (let ((.cse24 (select |#memory_int| 1))) (and (= ~p_dw_pc~0 0) .cse23 (= ~p_num_write~0 0) (= (select |#length| 3) 12) (<= 1 |#StackHeapBarrier|) (= ~c_num_read~0 0) (= ~q_buf_0~0 0) (= ~t1_pc~0 0) (= ~p_last_write~0 0) (= ~T1_E~0 2) .cse4 (= ~q_free~0 1) (= ~c_last_read~0 0) (= ~T2_E~0 2) .cse6 (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= ~q_req_up~0 0) (= ~t2_i~0 0) .cse8 (= ~q_ev~0 0) (= ~m_i~0 0) .cse10 (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= ~local~0 0) (= ~token~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) .cse12 (= (select |#valid| 0) 0) .cse13 (= (select |#valid| 2) 1) .cse16 (= ~a_t~0 0) (= (select .cse24 0) 48) .cse17 (= (select .cse24 1) 0) .cse19 (= ~M_E~0 2) (= ~t1_i~0 0))) (and (not .cse22) .cse20 .cse1 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse2 .cse4 .cse5 .cse21 .cse6 .cse25 (not .cse14) .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse16 .cse17 .cse18 .cse19)))) (or (not .cse0) .cse22 .cse14) (or (and (= ~q_write_ev~0 2) (= ~q_read_ev~0 2)) .cse9))) [2024-11-09 05:24:28,145 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:28,145 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:28,145 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 05:24:28,146 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:28,146 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:28,146 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:28,147 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:28,147 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:28,147 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:28,148 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:28,148 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:28,148 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:28,148 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:28,149 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:28,149 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:28,149 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 05:24:28,149 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 05:24:28,150 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 05:24:28,150 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 05:24:28,150 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 05:24:28,150 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 05:24:28,151 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:28,152 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:28,152 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 05:24:28,152 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:28,153 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:28,153 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:28,153 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:28,154 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:28,154 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:28,154 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:28,155 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:28,155 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:28,155 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:28,155 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:28,155 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:28,156 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 05:24:28,156 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 05:24:28,156 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 05:24:28,156 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 05:24:28,156 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 05:24:28,157 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 05:24:28,343 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:28,344 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:28,344 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 05:24:28,345 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:28,345 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:28,345 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:28,346 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:28,346 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:28,346 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:28,346 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:28,347 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:28,347 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:28,347 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:28,347 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:28,348 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:28,348 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 05:24:28,348 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 05:24:28,348 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 05:24:28,349 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 05:24:28,349 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 05:24:28,349 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 05:24:28,350 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:28,350 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:28,350 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 05:24:28,351 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:28,351 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:28,351 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:28,352 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:28,352 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:28,352 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:28,352 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:28,353 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:28,353 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:28,353 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:28,353 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:28,354 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:28,354 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 05:24:28,354 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 05:24:28,354 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 05:24:28,354 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 05:24:28,355 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 05:24:28,355 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 05:24:28,554 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:28,554 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:28,554 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 05:24:28,555 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:28,555 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:28,555 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:28,555 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:28,556 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:28,556 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:28,556 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:28,556 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:28,557 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:28,557 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:28,557 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:28,557 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:28,557 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 05:24:28,557 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 05:24:28,558 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 05:24:28,558 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 05:24:28,558 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 05:24:28,558 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 05:24:28,559 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:28,559 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:28,559 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 05:24:28,560 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:28,560 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:28,560 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:28,560 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:28,561 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:28,561 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:28,561 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:28,561 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:28,562 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:28,562 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:28,562 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:28,563 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:28,563 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 05:24:28,563 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 05:24:28,563 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 05:24:28,564 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 05:24:28,564 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 05:24:28,564 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 05:24:29,045 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 05:24:29,046 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:29,047 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:29,047 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 05:24:29,047 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:29,048 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:29,048 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:29,048 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:29,049 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:29,049 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:29,049 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:29,049 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:29,050 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:29,050 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:29,050 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:29,050 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:29,050 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 05:24:29,051 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 05:24:29,051 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 05:24:29,051 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 05:24:29,051 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 05:24:29,051 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 05:24:29,052 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 05:24:29,053 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:29,053 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:29,054 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 05:24:29,054 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:29,054 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:29,055 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:29,055 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:29,055 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:29,056 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:29,056 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:29,056 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:29,056 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:29,057 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:29,057 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:29,057 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:29,057 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 05:24:29,058 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 05:24:29,058 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 05:24:29,058 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 05:24:29,058 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 05:24:29,058 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 05:24:29,558 WARN L162 FloydHoareUtils]: Requires clause for reset_delta_events1 contained old-variable. Original clause: (and (let ((.cse10 (= |old(~q_write_ev~0)| 1)) (.cse0 (= ~c_dr_st~0 0)) (.cse25 (= ~p_dw_st~0 0))) (let ((.cse1 (not .cse25)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse4 (not (= |old(~q_read_ev~0)| 0))) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (= ~m_st~0 0)) (.cse7 (not (= ~m_pc~0 1))) (.cse22 (not .cse0)) (.cse8 (= 1 ~c_dr_i~0)) (.cse9 (= ~q_free~0 0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse12 (= ~t1_st~0 0)) (.cse23 (not (= |old(~q_write_ev~0)| 0))) (.cse24 (not .cse10)) (.cse13 (= ~p_dw_pc~0 1)) (.cse14 (= ~E_2~0 2)) (.cse15 (not (= |old(~q_read_ev~0)| 1))) (.cse16 (= ~p_dw_i~0 1)) (.cse17 (= 0 ~t2_pc~0)) (.cse18 (= ~E_M~0 2)) (.cse19 (= 0 ~t2_st~0)) (.cse20 (= ~token~0 ~local~0)) (.cse21 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and (= ~c_num_read~0 ~p_num_write~0) .cse2 .cse4 .cse5 .cse6 .cse7 .cse22 .cse8 .cse11 .cse12 .cse23 .cse24 .cse13 .cse14 .cse25 (or (not (= ~q_req_up~0 1)) (not .cse9)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (let ((.cse26 (select |#memory_int| 1))) (and .cse0 (= ~p_num_write~0 0) (= (select |#length| 3) 12) (<= 1 |#StackHeapBarrier|) (= ~c_num_read~0 0) .cse2 .cse5 (= ~T1_E~0 2) .cse6 (= ~q_free~0 1) (= ~c_last_read~0 0) (= ~T2_E~0 2) .cse8 (= 2 (select |#length| 1)) (= ~c_dr_pc~0 ~p_dw_pc~0) (= (select |#valid| 3) 1) (= ~q_req_up~0 0) (= ~t2_i~0 0) (= 2 |old(~q_write_ev~0)|) .cse12 (= ~q_ev~0 0) (= ~m_i~0 0) .cse14 .cse25 (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= ~token~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= |old(~q_read_ev~0)| 2) .cse16 (= (select |#valid| 0) 0) .cse17 (= (select |#valid| 2) 1) (= ~c_last_read~0 ~p_last_write~0) .cse18 (= ~a_t~0 0) (= (select .cse26 0) 48) .cse19 .cse20 (= (select .cse26 1) 0) .cse21 (= ~M_E~0 2) (= ~t1_i~0 0))) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse22 .cse8 .cse9 .cse11 .cse12 .cse23 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21)))) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0)) Eliminated clause: (let ((.cse21 (= ~q_write_ev~0 1)) (.cse0 (= ~c_dr_st~0 0)) (.cse22 (= ~p_dw_st~0 0))) (let ((.cse1 (not .cse22)) (.cse2 (not (= ~q_read_ev~0 1))) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse24 (not (= ~q_write_ev~0 0))) (.cse6 (= ~m_st~0 0)) (.cse7 (not (= ~m_pc~0 1))) (.cse25 (not .cse0)) (.cse8 (= 1 ~c_dr_i~0)) (.cse9 (= ~q_free~0 0)) (.cse10 (not (= ~q_read_ev~0 0))) (.cse11 (= ~c_dr_pc~0 1)) (.cse12 (= ~t1_st~0 0)) (.cse13 (= ~p_dw_pc~0 1)) (.cse14 (= ~E_2~0 2)) (.cse15 (= ~p_dw_i~0 1)) (.cse16 (= 0 ~t2_pc~0)) (.cse26 (not .cse21)) (.cse17 (= ~E_M~0 2)) (.cse18 (= 0 ~t2_st~0)) (.cse19 (= ~token~0 ~local~0)) (.cse20 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (let ((.cse23 (select |#memory_int| 1))) (and (= ~p_dw_pc~0 0) .cse0 (= ~p_num_write~0 0) (= (select |#length| 3) 12) (<= 1 |#StackHeapBarrier|) (= ~c_num_read~0 0) (= ~q_buf_0~0 0) (= ~t1_pc~0 0) (= ~p_last_write~0 0) (= ~T1_E~0 2) .cse6 (= ~q_free~0 1) (= ~c_last_read~0 0) (= ~T2_E~0 2) .cse8 (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= ~q_req_up~0 0) (= ~t2_i~0 0) .cse12 (= ~q_ev~0 0) (= ~m_i~0 0) (= ~q_write_ev~0 2) .cse14 .cse22 (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= ~local~0 0) (= ~token~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) .cse15 (= (select |#valid| 0) 0) .cse16 (= (select |#valid| 2) 1) .cse17 (= ~a_t~0 0) (= (select .cse23 0) 48) .cse18 (= (select .cse23 1) 0) .cse20 (= ~M_E~0 2) (= ~t1_i~0 0))) (and (= ~c_num_read~0 ~p_num_write~0) .cse3 .cse5 .cse24 .cse6 .cse7 .cse25 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22 (or (not (= ~q_req_up~0 1)) (not .cse9)) .cse15 .cse16 .cse26 .cse17 .cse18 .cse19 .cse20) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse24 .cse6 .cse7 .cse25 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse26 .cse17 .cse18 .cse19 .cse20)))) [2024-11-09 05:24:29,692 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:29,692 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:29,693 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 05:24:29,693 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:29,693 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:29,694 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:29,694 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:29,694 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:29,695 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:29,695 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:29,695 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:29,695 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:29,696 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:29,696 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:29,696 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:29,696 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 05:24:29,696 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 05:24:29,697 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 05:24:29,697 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 05:24:29,697 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 05:24:29,697 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 05:24:29,700 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:29,700 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:29,701 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 05:24:29,701 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:29,701 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:29,702 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:29,702 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:29,702 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:29,703 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:29,703 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 05:24:29,703 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 05:24:29,703 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:29,704 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:29,704 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 05:24:29,704 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 05:24:29,704 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 05:24:29,704 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 05:24:29,705 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 05:24:29,705 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 05:24:29,705 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 05:24:29,705 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 05:24:29,957 WARN L162 FloydHoareUtils]: Requires clause for reset_delta_events2 contained old-variable. Original clause: (let ((.cse18 (= 2 |old(~E_M~0)|)) (.cse37 (= 2 ~t2_st~0)) (.cse14 (= 2 |old(~E_1~0)|)) (.cse20 (= 2 |old(~E_2~0)|)) (.cse36 (= ~m_pc~0 ~t1_pc~0)) (.cse28 (= 0 ~t2_pc~0)) (.cse22 (= 2 ~t1_st~0)) (.cse39 (= ~E_2~0 2)) (.cse40 (= ~E_M~0 2))) (let ((.cse6 (and .cse39 (= ~E_1~0 |old(~E_1~0)|) .cse40)) (.cse9 (= (+ ~local~0 1) ~token~0)) (.cse7 (= 0 ~t2_st~0)) (.cse8 (= ~t2_pc~0 1)) (.cse5 (not .cse22)) (.cse1 (not .cse28)) (.cse0 (not .cse36)) (.cse3 (not .cse20)) (.cse38 (not .cse14)) (.cse10 (not .cse37)) (.cse4 (not .cse18)) (.cse2 (and .cse39 .cse40 (= ~E_1~0 2))) (.cse32 (= ~token~0 ~local~0))) (and (<= 2 ~E_1~0) (or .cse0 .cse1 .cse2) (or .cse3 .cse4 .cse5 .cse6 (not .cse7) (not .cse8) (not .cse9)) (or .cse3 .cse10 .cse4 .cse5 .cse6) (let ((.cse34 (= ~t1_st~0 0)) (.cse33 (= ~m_st~0 2)) (.cse11 (= ~t1_pc~0 1)) (.cse12 (= ~c_dr_st~0 0)) (.cse13 (= ~p_num_write~0 0)) (.cse15 (= ~c_num_read~0 0)) (.cse16 (= ~t1_i~0 1)) (.cse17 (= ~p_last_write~0 ~q_buf_0~0)) (.cse19 (not (= ~m_pc~0 1))) (.cse21 (= ~q_free~0 0)) (.cse23 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse24 (= ~q_req_up~0 0)) (.cse35 (<= 2 |old(~E_1~0)|)) (.cse25 (= ~p_dw_st~0 0)) (.cse26 (= ~t2_i~0 1)) (.cse27 (= ~c_dr_pc~0 0)) (.cse29 (= ~q_read_ev~0 0)) (.cse30 (= ~c_last_read~0 ~p_last_write~0)) (.cse31 (not (= ~q_write_ev~0 1)))) (or (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse7 .cse32) (and .cse12 .cse13 .cse15 .cse33 .cse16 .cse17 .cse19 .cse21 .cse23 .cse24 .cse34 .cse8 .cse35 .cse25 .cse26 .cse27 .cse29 .cse30 .cse31) (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse33 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse7) (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse36 .cse37 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse34 .cse8 .cse25 .cse26 .cse27 .cse29 .cse30 .cse31 .cse32) (and .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse37 .cse18 (= ~m_st~0 0) .cse20 .cse21 .cse22 .cse23 .cse24 .cse8 .cse35 (= ~token~0 (+ 2 ~local~0)) .cse25 .cse26 .cse27 .cse29 .cse30 .cse31) (and .cse11 .cse12 .cse13 .cse15 .cse33 .cse16 .cse17 .cse19 .cse21 .cse23 .cse24 .cse8 .cse35 .cse25 .cse26 .cse27 .cse29 .cse30 .cse31) (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse36 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse34 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse7 .cse32) (and .cse11 .cse12 .cse13 .cse15 .cse33 .cse16 .cse17 .cse19 .cse21 .cse23 .cse24 .cse35 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse7) (and .cse11 .cse12 .cse13 .cse15 .cse33 .cse16 .cse17 .cse37 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 .cse8 .cse35 .cse25 .cse26 .cse27 .cse29 .cse30 .cse31) (and .cse11 .cse12 .cse13 .cse15 .cse33 .cse16 .cse9 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 .cse8 .cse25 .cse26 .cse27 .cse29 .cse30 .cse31 .cse7) (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse37 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse8 .cse35 .cse25 .cse26 .cse27 .cse29 .cse30 .cse31 .cse32))) (or .cse3 .cse38 .cse4 .cse5 .cse1 .cse2) (or .cse0 .cse3 .cse38 .cse10 .cse4 .cse2 (not .cse32))))) Eliminated clause: (let ((.cse39 (= ~E_2~0 2)) (.cse40 (= ~E_M~0 2)) (.cse35 (= ~m_pc~0 ~t1_pc~0)) (.cse26 (= 0 ~t2_pc~0))) (let ((.cse1 (not .cse26)) (.cse0 (not .cse35)) (.cse2 (and .cse39 .cse40 (= ~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 ((.cse31 (= 2 |old(~E_M~0)|)) (.cse36 (= 2 ~t2_st~0)) (.cse30 (= 2 |old(~E_1~0)|)) (.cse32 (= 2 |old(~E_2~0)|)) (.cse33 (= 2 ~t1_st~0))) (let ((.cse6 (and .cse39 (= ~E_1~0 |old(~E_1~0)|) .cse40)) (.cse9 (= (+ ~local~0 1) ~token~0)) (.cse7 (= 0 ~t2_st~0)) (.cse8 (= ~t2_pc~0 1)) (.cse5 (not .cse33)) (.cse3 (not .cse32)) (.cse38 (not .cse30)) (.cse10 (not .cse36)) (.cse4 (not .cse31)) (.cse34 (= ~token~0 ~local~0))) (and (or .cse3 .cse4 .cse5 .cse6 (not .cse7) (not .cse8) (not .cse9)) (or .cse3 .cse10 .cse4 .cse5 .cse6) (let ((.cse37 (= ~t1_st~0 0)) (.cse22 (<= 2 |old(~E_1~0)|)) (.cse16 (= ~m_st~0 2)) (.cse11 (= ~t1_pc~0 1)) (.cse12 (= ~p_dw_pc~0 0)) (.cse13 (= ~c_dr_st~0 0)) (.cse14 (= ~p_num_write~0 0)) (.cse15 (= ~c_num_read~0 0)) (.cse17 (= ~t1_i~0 1)) (.cse18 (= ~p_last_write~0 ~q_buf_0~0)) (.cse19 (not (= ~m_pc~0 1))) (.cse20 (= ~q_free~0 0)) (.cse21 (= ~q_req_up~0 0)) (.cse23 (= ~p_dw_st~0 0)) (.cse24 (= ~t2_i~0 1)) (.cse25 (= ~c_dr_pc~0 0)) (.cse27 (= ~q_read_ev~0 0)) (.cse28 (= ~c_last_read~0 ~p_last_write~0)) (.cse29 (not (= ~q_write_ev~0 1)))) (or (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse7) (and .cse11 .cse12 .cse13 .cse14 .cse30 .cse15 .cse17 .cse18 .cse31 .cse19 .cse32 .cse20 .cse33 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse7 .cse34) (and .cse12 .cse13 .cse14 .cse30 .cse15 .cse17 .cse18 .cse35 .cse36 .cse31 .cse19 .cse32 .cse20 .cse21 .cse37 .cse8 .cse23 .cse24 .cse25 .cse27 .cse28 .cse29 .cse34) (and .cse11 .cse12 .cse13 .cse14 .cse30 .cse15 .cse16 .cse17 .cse18 .cse31 .cse32 .cse20 .cse33 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse7) (and .cse12 .cse13 .cse14 .cse30 .cse15 .cse17 .cse18 .cse35 .cse31 .cse19 .cse32 .cse20 .cse21 .cse37 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse7 .cse34) (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse36 .cse31 .cse32 .cse20 .cse33 .cse21 .cse8 .cse22 .cse23 .cse24 .cse25 .cse27 .cse28 .cse29) (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse37 .cse8 .cse22 .cse23 .cse24 .cse25 .cse27 .cse28 .cse29) (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse36 .cse31 (= ~m_st~0 0) .cse32 .cse20 .cse33 .cse21 .cse8 .cse22 (= ~token~0 (+ 2 ~local~0)) .cse23 .cse24 .cse25 .cse27 .cse28 .cse29) (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse8 .cse22 .cse23 .cse24 .cse25 .cse27 .cse28 .cse29) (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse9 .cse18 .cse31 .cse32 .cse20 .cse33 .cse21 .cse8 .cse23 .cse24 .cse25 .cse27 .cse28 .cse29 .cse7) (and .cse11 .cse12 .cse13 .cse14 .cse30 .cse15 .cse17 .cse18 .cse36 .cse31 .cse19 .cse32 .cse20 .cse33 .cse21 .cse8 .cse23 .cse24 .cse25 .cse27 .cse28 .cse29 .cse34))) (or .cse3 .cse38 .cse4 .cse5 .cse1 .cse2) (or .cse0 .cse3 .cse38 .cse10 .cse4 .cse2 (not .cse34))))))))) [2024-11-09 05:24:30,129 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-09 05:24:30,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 05:24:30 BoogieIcfgContainer [2024-11-09 05:24:30,133 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 05:24:30,133 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 05:24:30,133 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 05:24:30,134 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 05:24:30,134 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:11:55" (3/4) ... [2024-11-09 05:24:30,138 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 05:24:30,143 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2024-11-09 05:24:30,144 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels1 [2024-11-09 05:24:30,144 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2024-11-09 05:24:30,144 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads1 [2024-11-09 05:24:30,145 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2024-11-09 05:24:30,145 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2024-11-09 05:24:30,145 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events1 [2024-11-09 05:24:30,145 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2024-11-09 05:24:30,146 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2024-11-09 05:24:30,147 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2024-11-09 05:24:30,147 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2024-11-09 05:24:30,149 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2024-11-09 05:24:30,149 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events1 [2024-11-09 05:24:30,149 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2024-11-09 05:24:30,171 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 76 nodes and edges [2024-11-09 05:24:30,172 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2024-11-09 05:24:30,173 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 05:24:30,174 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 05:24:30,211 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((q_write_ev == \old(q_write_ev)) && (\old(q_read_ev) == q_read_ev)) && (q_req_up == \old(q_req_up))) && ((((q_ev == 0) || (c_dr_st != p_dw_st)) || (q_free != 1)) || (\old(q_req_up) != 0))) && (((((((((((((((((((((((((((((((((((((p_num_write == 0) && (\old(q_req_up) == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (c_last_read == 0)) && (T2_E == 2)) && (1 == c_dr_i)) && (\old(q_ev) == 0)) && (c_dr_pc == p_dw_pc)) && (t2_i == 0)) && (2 == \old(q_write_ev))) && (t1_st == 0)) && (m_i == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (token == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (\old(q_read_ev) == 2)) && (p_dw_i == 1)) && (0 == t2_pc)) && (c_last_read == p_last_write)) && (E_M == 2)) && (a_t == 0)) && (0 == t2_st)) && (c_dr_st == p_dw_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 0)) || (((((((((((((((((((((((((2 <= E_1) && (c_num_read == p_num_write)) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (\old(q_read_ev) != 0)) && (m_pc == t1_pc)) && (\old(q_req_up) == 1)) && (m_st == 0)) && (q_free == 1)) && (m_pc != 1)) && (1 == c_dr_i)) && (E_2 != 1)) && (c_dr_pc == 1)) && (t1_st == 0)) && (\old(q_write_ev) != 0)) && (\old(q_write_ev) != 1)) && (p_dw_pc == 1)) && (E_2 == 2)) && (\old(q_read_ev) != 1)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((((((2 <= E_1) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (\old(q_read_ev) != 0)) && (m_pc == t1_pc)) && (m_st == 0)) && (m_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (E_2 != 1)) && (c_dr_pc == 1)) && ((\old(q_req_up) != 1) || (q_free != 0))) && (t1_st == 0)) && (\old(q_write_ev) != 0)) && (\old(q_write_ev) != 1)) && (p_dw_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (\old(q_read_ev) != 1)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (\old(q_read_ev) != 0)) && (m_pc == t1_pc)) && (m_st == 0)) && (m_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (\old(q_write_ev) != 0)) && (\old(q_write_ev) != 1)) && (p_dw_pc == 1)) && (E_2 == 2)) && (\old(q_read_ev) != 1)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)))) [2024-11-09 05:24:30,292 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((q_write_ev == \old(q_write_ev)) && (\old(q_read_ev) == q_read_ev)) && (q_req_up == \old(q_req_up))) && ((((q_ev == 0) || (c_dr_st != p_dw_st)) || (q_free != 1)) || (\old(q_req_up) != 0))) && (((((((((((((((((((((((((((((((((((((p_num_write == 0) && (\old(q_req_up) == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (c_last_read == 0)) && (T2_E == 2)) && (1 == c_dr_i)) && (\old(q_ev) == 0)) && (c_dr_pc == p_dw_pc)) && (t2_i == 0)) && (2 == \old(q_write_ev))) && (t1_st == 0)) && (m_i == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (token == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (\old(q_read_ev) == 2)) && (p_dw_i == 1)) && (0 == t2_pc)) && (c_last_read == p_last_write)) && (E_M == 2)) && (a_t == 0)) && (0 == t2_st)) && (c_dr_st == p_dw_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 0)) || (((((((((((((((((((((((((2 <= E_1) && (c_num_read == p_num_write)) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (\old(q_read_ev) != 0)) && (m_pc == t1_pc)) && (\old(q_req_up) == 1)) && (m_st == 0)) && (q_free == 1)) && (m_pc != 1)) && (1 == c_dr_i)) && (E_2 != 1)) && (c_dr_pc == 1)) && (t1_st == 0)) && (\old(q_write_ev) != 0)) && (\old(q_write_ev) != 1)) && (p_dw_pc == 1)) && (E_2 == 2)) && (\old(q_read_ev) != 1)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((((((2 <= E_1) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (\old(q_read_ev) != 0)) && (m_pc == t1_pc)) && (m_st == 0)) && (m_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (E_2 != 1)) && (c_dr_pc == 1)) && ((\old(q_req_up) != 1) || (q_free != 0))) && (t1_st == 0)) && (\old(q_write_ev) != 0)) && (\old(q_write_ev) != 1)) && (p_dw_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (\old(q_read_ev) != 1)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (\old(q_read_ev) != 0)) && (m_pc == t1_pc)) && (m_st == 0)) && (m_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (\old(q_write_ev) != 0)) && (\old(q_write_ev) != 1)) && (p_dw_pc == 1)) && (E_2 == 2)) && (\old(q_read_ev) != 1)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)))) [2024-11-09 05:24:30,444 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/witness.graphml [2024-11-09 05:24:30,445 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/witness.yml [2024-11-09 05:24:30,445 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 05:24:30,445 INFO L158 Benchmark]: Toolchain (without parser) took 757136.47ms. Allocated memory was 163.6MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 121.4MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 324.4MB. Max. memory is 16.1GB. [2024-11-09 05:24:30,446 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 125.8MB. Free memory is still 72.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 05:24:30,446 INFO L158 Benchmark]: CACSL2BoogieTranslator took 644.95ms. Allocated memory is still 163.6MB. Free memory was 121.4MB in the beginning and 101.2MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-09 05:24:30,446 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.11ms. Allocated memory is still 163.6MB. Free memory was 101.2MB in the beginning and 98.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 05:24:30,447 INFO L158 Benchmark]: Boogie Preprocessor took 72.37ms. Allocated memory is still 163.6MB. Free memory was 98.3MB in the beginning and 95.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 05:24:30,447 INFO L158 Benchmark]: RCFGBuilder took 1375.63ms. Allocated memory is still 163.6MB. Free memory was 95.5MB in the beginning and 69.8MB in the end (delta: 25.7MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. [2024-11-09 05:24:30,447 INFO L158 Benchmark]: TraceAbstraction took 754632.86ms. Allocated memory was 163.6MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 69.8MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2024-11-09 05:24:30,448 INFO L158 Benchmark]: Witness Printer took 311.54ms. Allocated memory is still 2.6GB. Free memory was 2.3GB in the beginning and 2.2GB in the end (delta: 43.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-11-09 05:24:30,449 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.45ms. Allocated memory is still 125.8MB. Free memory is still 72.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 644.95ms. Allocated memory is still 163.6MB. Free memory was 121.4MB in the beginning and 101.2MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.11ms. Allocated memory is still 163.6MB. Free memory was 101.2MB in the beginning and 98.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.37ms. Allocated memory is still 163.6MB. Free memory was 98.3MB in the beginning and 95.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1375.63ms. Allocated memory is still 163.6MB. Free memory was 95.5MB in the beginning and 69.8MB in the end (delta: 25.7MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. * TraceAbstraction took 754632.86ms. Allocated memory was 163.6MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 69.8MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 311.54ms. Allocated memory is still 2.6GB. Free memory was 2.3GB in the beginning and 2.2GB in the end (delta: 43.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] - 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: 496]: 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: 28]: 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, 153 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 287.7s, OverallIterations: 45, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 88.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18113 SdHoareTripleChecker+Valid, 26.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17939 mSDsluCounter, 27973 SdHoareTripleChecker+Invalid, 22.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19579 mSDsCounter, 7617 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24804 IncrementalHoareTripleChecker+Invalid, 32421 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7617 mSolverCounterUnsat, 8394 mSDtfsCounter, 24804 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5898 GetRequests, 4650 SyntacticMatches, 32 SemanticMatches, 1216 ConstructedPredicates, 0 IntricatePredicates, 8 DeprecatedPredicates, 75189 ImplicationChecksByTransitivity, 102.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6232occurred in iteration=35, InterpolantAutomatonStates: 768, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 28.4s AutomataMinimizationTime, 45 MinimizatonAttempts, 10703 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 24.1s InterpolantComputationTime, 8005 NumberOfCodeBlocks, 7917 NumberOfCodeBlocksAsserted, 75 NumberOfCheckSat, 8782 ConstructedInterpolants, 0 QuantifiedInterpolants, 23604 SizeOfPredicates, 41 NumberOfNonLiveVariables, 12633 ConjunctsInSsa, 339 ConjunctsInUnsatCore, 80 InterpolantComputations, 40 PerfectInterpolantSequences, 5425/6322 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: OVERALL_TIME: 5.3s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 8, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 54, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 59, TOOLS_POST_TIME: 1.9s, TOOLS_POST_CALL_APPLICATIONS: 25, TOOLS_POST_CALL_TIME: 1.2s, TOOLS_POST_RETURN_APPLICATIONS: 18, TOOLS_POST_RETURN_TIME: 1.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 102, TOOLS_QUANTIFIERELIM_TIME: 4.0s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 162, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 21, DOMAIN_JOIN_TIME: 0.9s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 1, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 2, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 54, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME: 0.2s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.2s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 2, CALL_SUMMARIZER_APPLICATIONS: 18, CALL_SUMMARIZER_CACHE_MISSES: 7, CALL_SUMMARIZER_OVERALL_TIME: 0.1s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.1s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 888, DAG_COMPRESSION_RETAINED_NODES: 150, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 581]: Location Invariant Derived location invariant: (((((((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (m_pc != 1)) && (q_free == 0)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) || (((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (q_free == 0)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local))) || (((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (E_2 != 1)) && (q_req_up == 0)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (0 == t2_st)) && (E_M != 1))) || (((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st))) || (((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (q_req_up == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (E_2 != 1)) && (q_req_up == 0)) && (t2_pc == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M != 1))) || ((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (q_req_up == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (E_1 == 2))) - InvariantResult [Line: 226]: Location Invariant Derived location invariant: (((((q_write_ev == \old(q_write_ev)) && (\old(q_read_ev) == q_read_ev)) && (q_req_up == \old(q_req_up))) && ((((q_ev == 0) || (c_dr_st != p_dw_st)) || (q_free != 1)) || (\old(q_req_up) != 0))) && (((((((((((((((((((((((((((((((((((((p_num_write == 0) && (\old(q_req_up) == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (c_last_read == 0)) && (T2_E == 2)) && (1 == c_dr_i)) && (\old(q_ev) == 0)) && (c_dr_pc == p_dw_pc)) && (t2_i == 0)) && (2 == \old(q_write_ev))) && (t1_st == 0)) && (m_i == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (token == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (\old(q_read_ev) == 2)) && (p_dw_i == 1)) && (0 == t2_pc)) && (c_last_read == p_last_write)) && (E_M == 2)) && (a_t == 0)) && (0 == t2_st)) && (c_dr_st == p_dw_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 0)) || (((((((((((((((((((((((((2 <= E_1) && (c_num_read == p_num_write)) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (\old(q_read_ev) != 0)) && (m_pc == t1_pc)) && (\old(q_req_up) == 1)) && (m_st == 0)) && (q_free == 1)) && (m_pc != 1)) && (1 == c_dr_i)) && (E_2 != 1)) && (c_dr_pc == 1)) && (t1_st == 0)) && (\old(q_write_ev) != 0)) && (\old(q_write_ev) != 1)) && (p_dw_pc == 1)) && (E_2 == 2)) && (\old(q_read_ev) != 1)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((((((2 <= E_1) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (\old(q_read_ev) != 0)) && (m_pc == t1_pc)) && (m_st == 0)) && (m_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (E_2 != 1)) && (c_dr_pc == 1)) && ((\old(q_req_up) != 1) || (q_free != 0))) && (t1_st == 0)) && (\old(q_write_ev) != 0)) && (\old(q_write_ev) != 1)) && (p_dw_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (\old(q_read_ev) != 1)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (\old(q_read_ev) != 0)) && (m_pc == t1_pc)) && (m_st == 0)) && (m_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (\old(q_write_ev) != 0)) && (\old(q_write_ev) != 1)) && (p_dw_pc == 1)) && (E_2 == 2)) && (\old(q_read_ev) != 1)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)))) - InvariantResult [Line: 259]: Location Invariant Derived location invariant: ((((((((((m_st == 0) && (0 == t2_st)) && (token == local)) && ((((((((((((((((((((q_req_up == 1) && (q_read_ev != 1)) && (c_num_read == p_num_write)) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (q_free == 1)) && (m_pc != 1)) && (1 == c_dr_i)) && (q_read_ev != 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (q_write_ev == 2)) && (E_2 == 2)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (E_1 == 2)) || (((((((((((((((((((((q_req_up == 1) && (q_read_ev != 1)) && (c_num_read == p_num_write)) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (q_write_ev != 0)) && (q_free == 1)) && (m_pc != 1)) && (1 == c_dr_i)) && (q_read_ev != 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && (p_dw_i == 1)) && (0 == t2_pc)) && (q_write_ev != 1)) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)))) || ((((((((((((((((((((((((((((((((((c_dr_st == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (c_last_read == 0)) && (T2_E == 2)) && (1 == c_dr_i)) && (c_dr_pc == p_dw_pc)) && (q_req_up == 0)) && (t2_i == 0)) && (t1_st == 0)) && (q_ev == 0)) && (m_i == 0)) && (q_write_ev == 2)) && (E_2 == 2)) && (p_dw_st == 0)) && (token == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (m_pc == 0)) && (p_dw_i == 1)) && (0 == t2_pc)) && (c_last_read == p_last_write)) && (E_M == 2)) && (a_t == 0)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 0))) || (((((((((((((((((((((p_dw_st != 0) && (q_read_ev != 1)) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (m_st == 0)) && (m_pc != 1)) && (1 == c_dr_i)) && (q_free == 0)) && (q_read_ev != 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (q_write_ev == 2)) && (E_2 == 2)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((((q_read_ev != 1) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (q_write_ev != 0)) && (m_st == 0)) && (m_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_read_ev != 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && ((q_req_up != 1) || (q_free != 0))) && (p_dw_i == 1)) && (0 == t2_pc)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((((((((((((((((((((((((c_dr_st == 0) && (q_req_up == 1)) && (c_num_read == 0)) && (q_buf_0 <= 2147483647)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (m_st == 0)) && (c_last_read == 0)) && (T2_E == 2)) && (1 == c_dr_i)) && (q_free == 0)) && (t2_i == 0)) && (t1_st == 0)) && (m_i == 0)) && (0 <= (q_buf_0 + 2147483648))) && (p_dw_pc == 1)) && (q_write_ev == 2)) && (E_2 == 2)) && (token == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (2 == p_dw_st)) && (m_pc == 0)) && (p_dw_i == 1)) && (p_num_write == 1)) && (0 == t2_pc)) && (E_M == 2)) && (a_t == 0)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 0))) || (((((((((((((((((((((((p_dw_st != 0) && (q_read_ev != 1)) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (q_write_ev != 0)) && (m_st == 0)) && (m_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (q_read_ev != 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && (p_dw_i == 1)) && (0 == t2_pc)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (m_st == 0)) && (q_free == 1)) && (m_pc != 1)) && (1 == c_dr_i)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (q_write_ev == 2)) && (E_2 == 2)) && (p_dw_st == 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) - InvariantResult [Line: 757]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (E_2 != 1)) && (q_req_up == 0)) && (t2_pc == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M != 1)) || ((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (E_1 == 2))) || (((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 == t2_st)) && (m_pc != 1)) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || ((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st))) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (m_st == 0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (token == ((long long) 2 + local))) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2))) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (m_pc != 1)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2))) || (((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (E_2 != 1)) && (q_req_up == 0)) && (t1_st == 0)) && (t2_pc == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M != 1))) || (((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (m_pc != 1)) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (E_2 != 1)) && (q_req_up == 0)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (0 == t2_st)) && (E_M != 1))) - InvariantResult [Line: 537]: Location Invariant Derived location invariant: ((((((((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (m_pc != 1)) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (E_1 == 2))) || ((((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 == t2_st)) && (m_pc != 1)) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (token == ((long long) 2 + local))) && (p_dw_st == 0)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2))) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (m_pc != 1)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (m_st != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2))) - InvariantResult [Line: 188]: Location Invariant Derived location invariant: (((((((((((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (m_st == 0)) && (q_free == 1)) && (m_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_req_up == 0)) && (t1_st == 0)) && (q_write_ev == 2)) && (E_2 == 2)) && (p_dw_st == 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (0 == t2_pc)) && (c_last_read == p_last_write)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) || (((((((((((((((((((((((q_req_up == 1) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (m_st == 0)) && (m_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (t1_st == 0)) && (p_dw_pc == 1)) && (q_write_ev == 2)) && (E_2 == 2)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (2 == p_dw_st)) && (p_dw_i == 1)) && (p_num_write == 1)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((p_dw_st != 0) && (c_num_read == p_num_write)) && (((((((((((((((((((q_req_up == 1) && (q_read_ev != 1)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (q_free == 1)) && (m_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_read_ev != 0)) && (t1_st == 0)) && (p_dw_pc == 1)) && (q_write_ev == 2)) && (E_2 == 2)) && (p_dw_i == 1)) && (0 == t2_pc)) && (c_last_read == p_last_write)) && (E_M == 2)) && (E_1 == 2)) || ((((((((((((((((((q_req_up == 1) && (q_read_ev != 1)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (q_free == 1)) && (m_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_read_ev != 0)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && (p_dw_i == 1)) && (0 == t2_pc)) && (c_last_read == p_last_write)) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)))) && (q_write_ev != 0)) && (m_st == 0)) && (q_write_ev != 1)) && (0 == t2_st)) && (token == local))) - InvariantResult [Line: 1029]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (E_2 != 1)) && (q_req_up == 0)) && (t2_pc == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M != 1)) || ((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (E_1 == 2))) || (((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 == t2_st)) && (m_pc != 1)) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st))) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (m_st == 0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (token == ((long long) 2 + local))) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2))) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (m_pc != 1)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2))) || (((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (E_2 != 1)) && (q_req_up == 0)) && (t1_st == 0)) && (t2_pc == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M != 1))) || (((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (m_pc != 1)) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (E_2 != 1)) && (q_req_up == 0)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (0 == t2_st)) && (E_M != 1))) - InvariantResult [Line: 617]: Location Invariant Derived location invariant: ((((((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (E_2 != 1)) && (q_req_up == 0)) && (t1_st == 0)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M != 1)) || ((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_st == 0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (E_2 == 2)) && (token == ((long long) 2 + local))) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2))) || (((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || ((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2))) || ((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (E_2 != 1)) && (q_req_up == 0)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M != 1))) || (((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (m_pc != 1)) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) - InvariantResult [Line: 147]: Location Invariant Derived location invariant: ((((((((((((((((p_dw_st != 0) && (q_read_ev != 1)) && (((long long) c_num_read + 1) == p_num_write)) && (q_write_ev != 0)) && (m_st == 0)) && (q_read_ev != 0)) && ((((((((((((p_last_write == q_buf_0) && (m_pc == t1_pc)) && (m_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (0 == t2_pc)) || ((((((((((((p_dw_pc == 0) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (m_pc != 1)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (q_write_ev == 2)) && (p_dw_i == 1)) && (0 == t2_pc)))) && (E_2 == 2)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) || (((((((((((((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_buf_0 == 0)) && (t1_pc == 0)) && (p_last_write == 0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (c_last_read == 0)) && (T2_E == 2)) && (1 == c_dr_i)) && (q_req_up == 0)) && (t2_i == 0)) && (t1_st == 0)) && (m_i == 0)) && (q_write_ev == 2)) && (p_dw_st == 1)) && (E_2 == 2)) && (local == 0)) && (token == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (m_pc == 0)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (a_t == 0)) && (0 == t2_st)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 0))) || (((((((((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (p_dw_st != 0)) && (c_num_read == 0)) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (m_st == 0)) && (q_free == 1)) && (m_pc != 1)) && (1 == c_dr_i)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (q_write_ev == 2)) && (E_2 == 2)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (q_req_up == 1)) && (c_num_read == 0)) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (c_last_read == 0)) && (T2_E == 2)) && (1 == c_dr_i)) && (q_free == 0)) && (t2_i == 0)) && (t1_st == 0)) && (m_i == 0)) && (0 <= (q_buf_0 + 2147483648))) && (q_write_ev == 2)) && (p_dw_st == 1)) && (E_2 == 2)) && (local == 0)) && (token == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (m_pc == 0)) && (p_dw_i == 1)) && (p_num_write == 1)) && (0 == t2_pc)) && (p_last_write <= 2147483647)) && (E_M == 2)) && (a_t == 0)) && (0 == t2_st)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 0))) - InvariantResult [Line: 726]: Location Invariant Derived location invariant: (((((((((((((((((((((((((((((((((((t1_pc == 1) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (m_pc != 1)) && (q_free == 0)) && (2 == t1_st)) && (c_dr_pc == p_dw_pc)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) || (((((((((((((((((((((((c_dr_st == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 == t2_st)) && (m_pc != 1)) && (q_free == 0)) && (c_dr_pc == p_dw_pc)) && (q_req_up == 0)) && (t1_st == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((((t1_pc == 1) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (m_st == 0)) && (q_free == 0)) && (2 == t1_st)) && (c_dr_pc == p_dw_pc)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (token == ((long long) 2 + local))) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2))) || (((((((((((((((((((((c_dr_st == 0) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (c_dr_pc == p_dw_pc)) && (E_2 != 1)) && (q_req_up == 0)) && (t1_st == 0)) && (t2_pc == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M != 1))) || (((((((((((((((((((((((t1_pc == 1) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && ((c_dr_st == 0) || (p_dw_st != 0))) && (q_free == 0)) && (2 == t1_st)) && (c_dr_pc == p_dw_pc)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st))) || ((((((((((((((((((((((t1_pc == 1) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && ((c_dr_st == 0) || (p_dw_st != 0))) && (q_free == 0)) && (2 == t1_st)) && (c_dr_pc == p_dw_pc)) && (q_req_up == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (E_1 == 2))) || (((((((((((((((((((((t1_pc == 1) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (c_dr_pc == p_dw_pc)) && (E_2 != 1)) && (q_req_up == 0)) && (t2_pc == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M != 1))) || ((((((((((((((((((((((c_dr_st == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (q_free == 0)) && (c_dr_pc == p_dw_pc)) && (q_req_up == 0)) && (t1_st == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || ((((((((((((((((((((((t1_pc == 1) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (c_dr_pc == p_dw_pc)) && (E_2 != 1)) && (q_req_up == 0)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (0 == t2_st)) && (E_M != 1))) || ((((((((((((((((((((((c_dr_st == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (c_dr_pc == p_dw_pc)) && (q_req_up == 0)) && (t1_st == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((((p_num_write == 0) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (m_pc != 1)) && ((c_dr_st == 0) || (p_dw_st != 0))) && (q_free == 0)) && (c_dr_pc == p_dw_pc)) && (q_req_up == 0)) && (t1_st == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((((((((((((t1_pc == 1) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (q_free == 0)) && (2 == t1_st)) && (c_dr_pc == p_dw_pc)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2))) || (((((((((((((((((((((((t1_pc == 1) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && ((c_dr_st == 0) || (p_dw_st != 0))) && (q_free == 0)) && (2 == t1_st)) && (c_dr_pc == p_dw_pc)) && (q_req_up == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) - InvariantResult [Line: 427]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((p_dw_st != 0) && (q_read_ev != 1)) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (m_st == 0)) && (m_pc != 1)) && (1 == c_dr_i)) && (q_free == 0)) && (q_read_ev != 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (q_write_ev == 2)) && (E_2 == 2)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) || (((((((((((((((((((((((q_read_ev != 1) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (q_write_ev != 0)) && (m_st == 0)) && (m_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_read_ev != 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && ((q_req_up != 1) || (q_free != 0))) && (p_dw_i == 1)) && (0 == t2_pc)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_buf_0 == 0)) && (t1_pc == 0)) && (p_last_write == 0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (c_last_read == 0)) && (T2_E == 2)) && (1 == c_dr_i)) && (q_req_up == 0)) && (t2_i == 0)) && (t1_st == 0)) && (q_ev == 0)) && (m_i == 0)) && (q_write_ev == 2)) && (E_2 == 2)) && (p_dw_st == 0)) && (local == 0)) && (token == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (m_pc == 0)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (a_t == 0)) && (0 == t2_st)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 0))) || (((((((((((((((((((((((p_dw_st != 0) && (q_read_ev != 1)) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (q_write_ev != 0)) && (m_st == 0)) && (m_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (q_read_ev != 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && (p_dw_i == 1)) && (0 == t2_pc)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((c_dr_st == 0) && (q_req_up == 1)) && (c_num_read == 0)) && (t1_pc == 0)) && (q_buf_0 <= 2147483647)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (c_last_read == 0)) && (T2_E == 2)) && (1 == c_dr_i)) && (q_free == 0)) && (t2_i == 0)) && (t1_st == 0)) && (m_i == 0)) && (0 <= (q_buf_0 + 2147483648))) && (p_dw_pc == 1)) && (q_write_ev == 2)) && (E_2 == 2)) && (local == 0)) && (token == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (2 == p_dw_st)) && (m_pc == 0)) && (p_dw_i == 1)) && (p_num_write == 1)) && (0 == t2_pc)) && (E_M == 2)) && (a_t == 0)) && (0 == t2_st)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 0)) || ((((((((c_num_read == p_num_write) && (c_dr_st == 2)) && (q_write_ev != 0)) && (m_st == 0)) && ((((((((((((((((((q_req_up == 1) && (q_read_ev != 1)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (q_free == 1)) && (m_pc != 1)) && (1 == c_dr_i)) && (q_read_ev != 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) || (((((((((((((((((q_req_up == 1) && (q_read_ev != 1)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (q_free == 1)) && (m_pc != 1)) && (1 == c_dr_i)) && (q_read_ev != 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (q_write_ev == 2)) && (E_2 == 2)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (E_1 == 2)))) && (q_write_ev != 1)) && (0 == t2_st)) && (token == local))) || (((((((((((((((((((((p_dw_st != 0) && (q_read_ev != 1)) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (m_st == 0)) && (m_pc != 1)) && (1 == c_dr_i)) && (q_free == 0)) && (q_read_ev != 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (q_write_ev == 2)) && (E_2 == 2)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((((q_read_ev != 1) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (q_write_ev != 0)) && (m_st == 0)) && (m_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_read_ev != 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && ((q_req_up != 1) || (q_free != 0))) && (p_dw_i == 1)) && (0 == t2_pc)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_buf_0 == 0)) && (t1_pc == 0)) && (p_last_write == 0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (c_last_read == 0)) && (T2_E == 2)) && (1 == c_dr_i)) && (q_req_up == 0)) && (t2_i == 0)) && (t1_st == 0)) && (q_ev == 0)) && (m_i == 0)) && (q_write_ev == 2)) && (E_2 == 2)) && (p_dw_st == 0)) && (local == 0)) && (token == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (m_pc == 0)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (a_t == 0)) && (0 == t2_st)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 0))) || (((((((((((((((((((((((p_dw_st != 0) && (q_read_ev != 1)) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (q_write_ev != 0)) && (m_st == 0)) && (m_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (q_read_ev != 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && (p_dw_i == 1)) && (0 == t2_pc)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (m_st == 0)) && (q_free == 1)) && (m_pc != 1)) && (1 == c_dr_i)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (q_write_ev == 2)) && (E_2 == 2)) && (p_dw_st == 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) - ProcedureContractResult [Line: 926]: Procedure Contract for immediate_notify Derived contract for procedure immediate_notify. Ensures: ((((((((((((((\old(t1_st) != 0) || (((m_st == 2) && (\old(t2_st) == t2_st)) && (t1_st == 0))) || (E_2 == 1)) || (E_1 < 2)) || (t2_pc != 1)) && ((((((((((((c_dr_st == 0) && (p_num_write == 0)) && (2 == \old(m_st))) && (c_num_read == 0)) && (m_st == 2)) && (q_free == 0)) && (q_req_up == 0)) && (q_read_ev == 0)) && (q_write_ev != 1)) && (E_M != 1)) || (E_1 < 2)) || (0 != t2_pc))) && (((m_st == \old(m_st)) && (t1_st == 0)) || (E_1 != 1))) && ((\old(t2_st) != 0) || (0 == t2_st))) && ((((m_st == 2) && (m_pc != 1)) || (((m_st == 2) && (\old(t1_st) == t1_st)) && (0 == t2_st))) || (E_2 != 1))) && ((((((E_2 == 1) || (t1_pc != 1)) || (m_pc == 1)) || ((m_st == 2) && (\old(t2_st) == t2_st))) || (E_1 < 2)) || (t2_pc != 1))) && (((2 == t2_st) || (E_1 != 1)) || (2 != \old(t2_st)))) && ((((((((((m_st == 0) && (2 == t1_st)) && (\old(t2_st) == t2_st)) && (E_M != 0)) || (E_2 == 1)) || (t1_pc != 1)) || ((((m_st == 2) && (2 == t1_st)) && (\old(t2_st) == t2_st)) && (E_M != 1))) || (((m_st == 2) && (m_pc != 1)) && (\old(t2_st) == t2_st))) || (E_1 < 2)) || (t2_pc != 1))) && (((((((((((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (2 == \old(m_st))) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (E_2 != 1)) && (q_req_up == 0)) && (t2_pc == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) || ((((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (E_1 == 1)) && (m_pc != 1)) && (q_free == 0)) && (q_req_up == 0)) && (\old(t1_st) == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (2 == \old(t2_st))) && (\old(m_st) != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local))) || ((((((((((((((((((((((((t1_pc == 1) && (\old(t2_st) == 0)) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (E_1 == 1)) && (m_pc != 1)) && (q_free == 0)) && (q_req_up == 0)) && (E_2 == 2)) && (\old(t1_st) == 2)) && (p_dw_st == 0)) && (\old(m_st) != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local))) || ((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (2 == \old(m_st))) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (E_2 != 1)) && (q_req_up == 0)) && (\old(t1_st) == 0)) && (t2_pc == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1))) || (((((((((((((t1_pc == 1) && (\old(t2_st) == 0)) && (p_dw_pc == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (E_2 == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (c_last_read == p_last_write)) && (E_M == 2)) && (E_1 == 2))) || ((((((((((((((((((((((((\old(t2_st) == 0) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (E_1 == 1)) && (m_pc != 1)) && (q_free == 0)) && (q_req_up == 0)) && (\old(t1_st) == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (\old(m_st) != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local))) || ((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (2 == \old(m_st))) && (c_num_read == 0)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (E_2 == 1)) && (q_free == 0)) && (q_req_up == 0)) && (t2_pc == 1)) && (p_dw_st == 0)) && (2 == \old(t2_st))) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2))) || ((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (2 == \old(m_st))) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (q_req_up == 0)) && (t2_pc == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M != 1))) || (((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (2 == \old(m_st))) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (\old(t1_st) == 2)) && (token == ((long long) 2 + local))) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1))) || ((((((((((((((((((((((t1_pc == 1) && (\old(t2_st) == 0)) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (2 == \old(m_st))) && (c_num_read == 0)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (E_2 == 1)) && (q_free == 0)) && (q_req_up == 0)) && (t2_pc == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2))) || ((((((((((((t1_pc == 1) && (\old(t2_st) == 0)) && (p_dw_pc == 0)) && (2 <= E_1)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (c_last_read == p_last_write))) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (E_1 == 1)) && (q_free == 0)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (\old(t1_st) == 2)) && (p_dw_st == 0)) && (2 == \old(t2_st))) && (\old(m_st) != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local)))) && (((((((((((((((((((((((((((((((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))) && (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: 226]: Procedure Contract for update_channels1 Derived contract for procedure update_channels1. Requires: (((((((((((((((((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_buf_0 == 0)) && (t1_pc == 0)) && (p_last_write == 0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (c_last_read == 0)) && (T2_E == 2)) && (1 == c_dr_i)) && (q_req_up == 0)) && (t2_i == 0)) && (t1_st == 0)) && (m_i == 0)) && (q_write_ev == 2)) && (E_2 == 2)) && (p_dw_st == 0)) && (local == 0)) && (token == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (m_pc == 0)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (a_t == 0)) && (0 == t2_st)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 0)) || (((((((((((((((((((((((q_read_ev != 1) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (q_write_ev != 0)) && (m_st == 0)) && (m_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_read_ev != 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && ((q_req_up != 1) || (q_free != 0))) && (p_dw_i == 1)) && (0 == t2_pc)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((((q_req_up == 1) && (q_read_ev != 1)) && (c_num_read == p_num_write)) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (q_write_ev != 0)) && (m_st == 0)) && (q_free == 1)) && (m_pc != 1)) && (1 == c_dr_i)) && (q_read_ev != 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && (p_dw_i == 1)) && (0 == t2_pc)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((((p_dw_st != 0) && (q_read_ev != 1)) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (q_write_ev != 0)) && (m_st == 0)) && (m_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (q_read_ev != 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && (p_dw_i == 1)) && (0 == t2_pc)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) && ((((q_req_up != 0) || (q_ev == 0)) || (c_dr_st != p_dw_st)) || (q_free != 1))) Ensures: (((((((((\old(q_read_ev) == q_read_ev) && ((\old(q_req_up) == 1) || (q_write_ev == \old(q_write_ev)))) || (((long long) c_num_read + 1) != p_num_write)) && (((c_num_read != p_num_write) || (p_dw_st == 0)) || (q_read_ev == 0))) && ((((((((((((((((((((((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (\old(q_req_up) == 0)) && (c_num_read == 0)) && (q_buf_0 == 0)) && (t1_pc == 0)) && (p_last_write == 0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (c_last_read == 0)) && (T2_E == 2)) && (1 == c_dr_i)) && (\old(q_ev) == 0)) && (t2_i == 0)) && (2 == \old(q_write_ev))) && (t1_st == 0)) && (m_i == 0)) && (E_2 == 2)) && (local == 0)) && (token == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (\old(q_read_ev) == 2)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (a_t == 0)) && (0 == t2_st)) && (c_dr_st == p_dw_st)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 0)) || (((((((((((((((((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (\old(q_read_ev) != 0)) && (m_pc == t1_pc)) && (m_st == 0)) && (m_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && ((\old(q_req_up) != 1) || (q_free != 0))) && (t1_st == 0)) && (\old(q_write_ev) != 0)) && (\old(q_write_ev) != 1)) && (p_dw_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (\old(q_read_ev) != 1)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (\old(q_read_ev) != 0)) && (m_pc == t1_pc)) && (m_st == 0)) && (m_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (\old(q_write_ev) != 0)) && (\old(q_write_ev) != 1)) && (p_dw_pc == 1)) && (E_2 == 2)) && (\old(q_read_ev) != 1)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((((((((((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (\old(q_read_ev) != 0)) && (m_pc == t1_pc)) && (m_st == 0)) && (q_free == 1)) && (m_pc != 1)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (t1_st == 0)) && (\old(q_write_ev) != 0)) && (\old(q_write_ev) != 1)) && (p_dw_pc == 1)) && (E_2 == 2)) && (\old(q_read_ev) != 1)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)))) && ((((q_req_up == 0) || (q_free < 1)) || (c_num_read != 1)) || (p_dw_st == 0))) && ((c_num_read != p_num_write) || (((((((\old(q_req_up) != 1) || (q_read_ev == 0)) || (q_free != 1)) && ((\old(q_req_up) == 1) || (\old(q_read_ev) == q_read_ev))) && ((q_free == 1) || (\old(q_read_ev) == q_read_ev))) && (q_write_ev == \old(q_write_ev))) && ((q_req_up != 1) || (q_free != 0))))) && (((((q_req_up == 0) && (q_ev == 0)) || (c_dr_st != p_dw_st)) || (q_free != 1)) || (\old(q_req_up) != 0))) && ((((((((((((((((((((((((((((((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))) && (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: 892]: Procedure Contract for activate_threads2 Derived contract for procedure activate_threads2. Requires: (((((m_st == 2) || (((long long) local + 1) != token)) && (((t1_pc != 1) || (2 == t1_st)) || (E_1 != 1))) && (q_req_up == 0)) && (q_read_ev == 0)) Ensures: (((((((((((((((((((token != ((long long) 2 + local)) || (2 == t2_st)) || (\old(m_st) != 0)) && (((\old(t1_st) == t1_st) || (((((((p_dw_pc == 0) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (0 != t2_pc))) && ((m_st == 2) || (((long long) local + 1) != token))) && ((\old(t2_st) != 0) || (0 == t2_st))) && (((((((((((((((((p_dw_st != 0) || (t2_i != 1)) || (c_dr_pc != 0)) || (E_2 == 1)) || (m_pc != 1)) || (t1_pc != 1)) || (c_dr_st != 0)) || (p_num_write != 0)) || (t1_i != 1)) || (p_dw_pc != 0)) || (p_last_write != q_buf_0)) || (c_num_read != 0)) || (q_free != 0)) || (E_1 < 2)) || (t2_pc != 1)) || (c_last_read != p_last_write)) || ((2 == t1_st) && (\old(t1_st) == 2)))) && (((m_st == 2) || (m_pc == 1)) || (2 != \old(m_st)))) && (((((((((((((((((((((p_dw_st != 0) || (t2_i != 1)) || (E_M != 2)) || (c_dr_pc != 0)) || (t1_pc != 1)) || (c_dr_st != 0)) || (p_num_write != 0)) || (t1_i != 1)) || (E_2 != 1)) || (p_dw_pc != 0)) || (p_last_write != q_buf_0)) || (c_num_read != 0)) || (q_free != 0)) || (E_1 < 2)) || (t2_pc != 1)) || (((long long) local + 1) != token)) || (2 != \old(t2_st))) || (c_last_read != p_last_write)) && (((((E_M != 2) || (\old(t2_st) != 0)) || (E_2 != 1)) || (t2_pc != 1)) || (((long long) local + 1) != token))) || ((\old(t1_st) == t1_st) && (0 == t2_st))) || (((((((((\old(t2_st) == 0) && (p_dw_pc == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (E_1 == 2)))) && ((t1_st == 0) || (E_1 != 1))) && (((((((E_2 != 2) || (E_M != 2)) || (2 == t1_st)) || (E_1 != 2)) || (\old(t1_st) != 2)) || (2 != \old(t2_st))) || (token != local))) && (((((((E_2 != 2) || (E_M != 2)) || (2 == t1_st)) || (E_1 != 2)) || (\old(t1_st) != 2)) || (0 != t2_pc)) || (token != local))) && ((\old(t1_st) != 0) || (t1_st == 0))) && (((E_M != 2) || ((((((((c_dr_st == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == \old(m_st))) && (q_req_up == 0)) && (p_dw_st == 0)) && (q_read_ev == 0)) && (q_write_ev != 1))) || (2 != \old(t2_st)))) && ((m_st == \old(m_st)) || (0 != t2_pc))) && (((((m_st == 2) && (E_M != 1)) || (token != ((long long) 2 + local))) || ((((((((p_dw_pc == 0) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((m_st == 0) && (2 == t1_st)) && (E_M != 0)))) && ((((((((((((((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (E_1 == 1)) && (q_free == 0)) && (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)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) || ((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (\old(t1_st) == 2)) && (p_dw_st == 0)) && (2 == \old(t2_st))) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((p_dw_pc == 0) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (E_1 == 1)) && (m_pc != 1)) && (q_free == 0)) && (\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)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local))) || (((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (2 == \old(m_st))) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (2 == \old(t2_st))) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2))) || ((((((((((((((((((((((t1_pc == 1) && (\old(t2_st) == 0)) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (2 == \old(m_st))) && (c_num_read == 0)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2))) || (((((((((((((((((((((((\old(t2_st) == 0) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (m_pc != 1)) && (q_free == 0)) && (q_req_up == 0)) && (\old(t1_st) == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((((((p_dw_pc == 0) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (q_free == 0)) && (\old(t1_st) == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (2 == \old(t2_st))) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || ((((((((((((((((((((((((\old(t2_st) == 0) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (E_1 == 1)) && (m_pc != 1)) && (q_free == 0)) && (q_req_up == 0)) && (\old(t1_st) == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (\old(m_st) != 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local))) || ((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (E_2 == 1)) && (q_free == 0)) && (t2_pc == 1)) && (p_dw_st == 0)) && (2 == \old(t2_st))) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2))) || ((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (2 == \old(m_st))) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (token == ((long long) 2 + local))) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1))) || (((((((((((((((((((((t1_pc == 1) && (\old(t2_st) == 0)) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (2 == \old(m_st))) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (E_2 == 1)) && (q_free == 0)) && (q_req_up == 0)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (E_1 == 2))) || ((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (\old(m_st) == 0)) && (q_free == 0)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (\old(t1_st) == 2)) && (token == ((long long) 2 + local))) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2))) || (((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (2 == \old(m_st))) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (q_req_up == 0)) && (\old(t1_st) == 0)) && (t2_pc == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1))) || (((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (2 == \old(m_st))) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (q_req_up == 0)) && (t2_pc == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1))) || ((((((((((((((((((((((t1_pc == 1) && (\old(t2_st) == 0)) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (2 == \old(m_st))) && (c_num_read == 0)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (E_2 == 1)) && (q_free == 0)) && (q_req_up == 0)) && (t2_pc == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2))) || (((((((((((((((((t1_pc == 1) && (\old(t2_st) == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (E_1 == 1)) && (q_free == 0)) && (q_req_up == 0)) && (E_2 == 2)) && (\old(t1_st) == 2)) && (\old(m_st) != 0)) && (t2_i == 1)) && (0 == t2_pc)) && (q_read_ev == 0)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local))) || ((((((((((((((((((((((t1_pc == 1) && (\old(t2_st) == 0)) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (2 == \old(m_st))) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (q_req_up == 0)) && (E_2 == 2)) && (\old(t1_st) == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (E_1 == 2))) || ((((((((((((((((((((t1_pc == 1) && (\old(t2_st) == 0)) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (2 == \old(m_st))) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (q_req_up == 0)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1))) || (((((((((((((((((((((((t1_pc == 1) && (\old(t2_st) == 0)) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (q_req_up == 0)) && (E_2 == 2)) && (\old(t1_st) == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2)))) && ((E_2 == 1) || (\old(t2_st) == t2_st))) && (((((((((((((((((((((((((((((((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))) && (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: 315]: Procedure Contract for activate_threads1 Derived contract for procedure activate_threads1. Requires: ((((c_dr_st == 0) || (p_dw_pc == 1)) && (((c_dr_st == 2) || (c_num_read != p_num_write)) || (p_dw_st == 0))) && ((((((((((((((((((((((((p_dw_st != 0) && (q_read_ev != 1)) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (q_write_ev != 0)) && (m_st == 0)) && (m_pc != 1)) && (1 == c_dr_i)) && (q_free == 0)) && (q_read_ev != 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) || ((((((((((((((((((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (q_buf_0 == 0)) && (t1_pc == 0)) && (p_last_write == 0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (c_last_read == 0)) && (T2_E == 2)) && (1 == c_dr_i)) && (q_req_up == 0)) && (t2_i == 0)) && (t1_st == 0)) && (q_ev == 0)) && (m_i == 0)) && (q_write_ev == 2)) && (E_2 == 2)) && (local == 0)) && (token == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (m_pc == 0)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (a_t == 0)) && (0 == t2_st)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 0))) || ((((((((((((((((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (q_write_ev != 0)) && (m_st == 0)) && (m_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_read_ev != 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && ((q_req_up != 1) || (q_free != 0))) && (p_dw_i == 1)) && (0 == t2_pc)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (q_write_ev != 0)) && (m_st == 0)) && (q_read_ev == 1)) && (m_pc != 1)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && ((q_req_up != 1) || (q_free != 0))) && (p_dw_i == 1)) && (0 == t2_pc)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)))) Ensures: ((((((((((\old(p_dw_st) == p_dw_st) && (c_dr_st == 0)) && (q_write_ev == 1)) || (((\old(p_dw_st) == p_dw_st) && ((c_dr_st != 0) || (\old(c_dr_st) == 0))) && (q_write_ev != 1))) || (((long long) c_num_read + 1) != p_num_write)) && ((((((((((((((((((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (q_write_ev != 0)) && (m_st == 0)) && (q_read_ev == 1)) && (m_pc != 1)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && ((q_req_up != 1) || (q_free != 0))) && (p_dw_i == 1)) && (0 == t2_pc)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (2 == \old(c_dr_st))) && (E_1 == 2)) || (((((((((((((((((((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (q_buf_0 == 0)) && (t1_pc == 0)) && (p_last_write == 0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (c_last_read == 0)) && (T2_E == 2)) && (1 == c_dr_i)) && (q_req_up == 0)) && (t2_i == 0)) && (t1_st == 0)) && (q_ev == 0)) && (m_i == 0)) && (q_write_ev == 2)) && (E_2 == 2)) && (local == 0)) && (token == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (m_pc == 0)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (a_t == 0)) && (0 == t2_st)) && (\old(c_dr_st) == 0)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 0))) || ((((((((((((((((((((((\old(c_dr_st) != 0) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (q_write_ev != 0)) && (\old(p_dw_st) == 0)) && (m_st == 0)) && (m_pc != 1)) && (1 == c_dr_i)) && (q_read_ev != 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && ((q_req_up != 1) || (q_free != 0))) && (p_dw_i == 1)) && (0 == t2_pc)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((q_read_ev != 1) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (q_write_ev != 0)) && (m_st == 0)) && (m_pc != 1)) && (1 == c_dr_i)) && (q_free == 0)) && (q_read_ev != 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (\old(p_dw_st) != 0)) && (E_1 == 2)))) && (((\old(p_dw_st) == 0) || (c_num_read != p_num_write)) || (((((((((((p_last_write == q_buf_0) && (m_pc == t1_pc)) && (m_pc != 1)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (t1_st == 0)) && ((c_dr_st != 0) || (\old(c_dr_st) == 0))) && (p_dw_pc == 1)) && (p_dw_st == 0)) && (p_dw_i == 1)) && (0 == t2_pc)))) && ((p_dw_pc == 1) || ((c_dr_st == 0) && (p_dw_st == 0)))) && (((p_dw_pc != 1) || ((((((((((p_last_write == q_buf_0) && (m_pc == t1_pc)) && (m_pc != 1)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (t1_st == 0)) && ((c_dr_st != 0) || (\old(c_dr_st) == 0))) && (p_dw_st == 0)) && (p_dw_i == 1)) && (0 == t2_pc))) || (\old(p_dw_st) != 0))) && ((((((((((((((((((((((((((((((((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))) && (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: 695]: Procedure Contract for update_channels2 Derived contract for procedure update_channels2. Requires: (((((((((((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (E_2 != 1)) && (q_req_up == 0)) && (t2_pc == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M != 1)) || ((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (E_1 == 2))) || (((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 == t2_st)) && (m_pc != 1)) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st))) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (m_st == 0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (token == ((long long) 2 + local))) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2))) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (m_pc != 1)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2))) || (((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (E_2 != 1)) && (q_req_up == 0)) && (t1_st == 0)) && (t2_pc == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M != 1))) || (((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (m_pc != 1)) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (E_2 != 1)) && (q_req_up == 0)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (0 == t2_st)) && (E_M != 1))) Ensures: ((((((((((((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (E_2 != 1)) && (q_req_up == 0)) && (t2_pc == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M != 1)) || ((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (E_1 == 2))) || (((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 == t2_st)) && (m_pc != 1)) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st))) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (m_st == 0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (token == ((long long) 2 + local))) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2))) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (m_pc != 1)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2))) || (((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (E_2 != 1)) && (q_req_up == 0)) && (t1_st == 0)) && (t2_pc == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M != 1))) || (((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (m_pc != 1)) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (E_2 != 1)) && (q_req_up == 0)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (0 == t2_st)) && (E_M != 1))) && ((((((((((((((((((((((((((((((((((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))) && (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: 816]: 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)))) && (((((((((((((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (2 == \old(E_1))) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == \old(E_M))) && (m_pc != 1)) && (2 == \old(E_2))) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (0 == t2_st)) && (token == local)) || (((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (2 == \old(E_1))) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 == t2_st)) && (2 == \old(E_M))) && (m_pc != 1)) && (2 == \old(E_2))) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (t2_pc == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (token == local))) || ((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (2 == \old(E_1))) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == \old(E_M))) && (2 == \old(E_2))) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (0 == t2_st))) || (((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (\old(E_M) != 1)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (q_req_up == 0)) && (t2_pc == 1)) && (2 <= \old(E_1))) && (\old(E_2) != 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1))) || (((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (2 == \old(E_1))) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 == \old(E_M))) && (m_pc != 1)) && (2 == \old(E_2))) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (0 == t2_st)) && (token == local))) || ((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (\old(E_M) != 1)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (q_req_up == 0)) && (2 <= \old(E_1))) && (\old(E_2) != 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (0 == t2_st))) || ((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (2 == \old(E_M))) && (2 == \old(E_2))) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (t2_pc == 1)) && (2 <= \old(E_1))) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1))) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (2 == \old(E_M))) && (m_st == 0)) && (2 == \old(E_2))) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (t2_pc == 1)) && (2 <= \old(E_1))) && (token == ((long long) 2 + local))) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1))) || ((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (2 == \old(E_M))) && (2 == \old(E_2))) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (t2_pc == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (0 == t2_st))) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (2 == \old(E_1))) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (2 == \old(E_M))) && (m_pc != 1)) && (2 == \old(E_2))) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (t2_pc == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (token == local))) || (((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (\old(E_M) != 1)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (t2_pc == 1)) && (2 <= \old(E_1))) && (\old(E_2) != 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)))) && (((((((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))) && ((((((((((((((((((((((((((((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))) && (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: 279]: Procedure Contract for fire_delta_events1 Derived contract for procedure fire_delta_events1. Requires: ((((((((((((((((((((((((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (q_write_ev != 0)) && (m_st == 0)) && (m_pc != 1)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && ((q_req_up != 1) || (q_free != 0))) && (p_dw_i == 1)) && (0 == t2_pc)) && (q_read_ev == 0)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) || ((((((((((((((((((((((q_read_ev != 1) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (q_write_ev != 0)) && (m_st == 0)) && (m_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && ((q_req_up != 1) || (q_free != 0))) && (p_dw_i == 1)) && (0 == t2_pc)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_buf_0 == 0)) && (t1_pc == 0)) && (p_last_write == 0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (c_last_read == 0)) && (T2_E == 2)) && (1 == c_dr_i)) && (q_req_up == 0)) && (t2_i == 0)) && (t1_st == 0)) && (q_ev == 0)) && (m_i == 0)) && (E_2 == 2)) && (local == 0)) && (token == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (a_t == 0)) && (0 == t2_st)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 0))) || (((((((((((((((((((((p_dw_st != 0) && (q_read_ev != 1)) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (m_st == 0)) && (m_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (q_read_ev != 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) && (((c_num_read != p_num_write) || (p_dw_st == 0)) || (q_read_ev == 0))) && (((q_write_ev == 2) && (q_read_ev == 2)) || (p_dw_pc == 1))) Ensures: (((((((((((((((((((((((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (\old(q_read_ev) != 0)) && (m_pc == t1_pc)) && (m_st == 0)) && (m_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && (\old(q_read_ev) != 1)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) || (((((((((((((((((((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (m_st == 0)) && (m_pc != 1)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (t1_st == 0)) && (\old(q_write_ev) != 0)) && (\old(q_write_ev) != 1)) && (p_dw_pc == 1)) && (E_2 == 2)) && ((q_req_up != 1) || (q_free != 0))) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (\old(q_read_ev) == 0))) || ((((((((((((((((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (m_st == 0)) && (m_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (t1_st == 0)) && (\old(q_write_ev) != 0)) && (\old(q_write_ev) != 1)) && (p_dw_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && ((q_req_up != 1) || (q_free != 0))) && (\old(q_read_ev) != 1)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_buf_0 == 0)) && (t1_pc == 0)) && (p_last_write == 0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (c_last_read == 0)) && (T2_E == 2)) && (1 == c_dr_i)) && (q_req_up == 0)) && (t2_i == 0)) && (t1_st == 0)) && (q_ev == 0)) && (m_i == 0)) && (E_2 == 2)) && (local == 0)) && (token == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (a_t == 0)) && (0 == t2_st)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 0))) && ((((q_write_ev != 0) && (\old(q_read_ev) == q_read_ev)) && ((q_write_ev == \old(q_write_ev)) || (\old(q_write_ev) == 0))) || (((long long) c_num_read + 1) != p_num_write))) && ((p_dw_st != 0) || (((q_write_ev == \old(q_write_ev)) && ((\old(q_read_ev) != 0) || (q_read_ev == 1))) && ((\old(q_read_ev) == q_read_ev) || (\old(q_read_ev) == 0))))) && (((q_write_ev == 2) && (q_read_ev == 2)) || (p_dw_pc == 1))) && ((((q_read_ev == 1) && (q_write_ev == \old(q_write_ev))) || (c_num_read != p_num_write)) || (p_dw_st == 0))) && ((((((((((((((((((((((((((((((((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))) && (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: 88]: Procedure Contract for is_do_read_c_triggered Derived contract for procedure is_do_read_c_triggered. Requires: (((((((((((((((((((((((p_dw_st != 0) && (q_read_ev != 1)) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (q_write_ev != 0)) && (m_st == 0)) && (m_pc != 1)) && (1 == c_dr_i)) && (q_free == 0)) && (q_read_ev != 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) || ((((((((((((((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_buf_0 == 0)) && (t1_pc == 0)) && (p_last_write == 0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (c_last_read == 0)) && (T2_E == 2)) && (1 == c_dr_i)) && (q_req_up == 0)) && (t2_i == 0)) && (t1_st == 0)) && (q_ev == 0)) && (m_i == 0)) && (q_write_ev == 2)) && (E_2 == 2)) && (p_dw_st == 0)) && (local == 0)) && (token == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (m_pc == 0)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (a_t == 0)) && (0 == t2_st)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 0))) || ((((((((((((((((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (q_write_ev != 0)) && (m_st == 0)) && (m_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_read_ev != 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && ((q_req_up != 1) || (q_free != 0))) && (p_dw_i == 1)) && (0 == t2_pc)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) Ensures: ((((((\result == 1) && (q_write_ev == 1)) || ((q_write_ev != 1) && ((c_dr_st == 0) || (\result == 0)))) && (((((((((((((((((((((((p_dw_st != 0) && (q_read_ev != 1)) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (q_write_ev != 0)) && (m_st == 0)) && (m_pc != 1)) && (1 == c_dr_i)) && (q_free == 0)) && (q_read_ev != 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) || ((((((((((((((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_buf_0 == 0)) && (t1_pc == 0)) && (p_last_write == 0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (c_last_read == 0)) && (T2_E == 2)) && (1 == c_dr_i)) && (q_req_up == 0)) && (t2_i == 0)) && (t1_st == 0)) && (q_ev == 0)) && (m_i == 0)) && (q_write_ev == 2)) && (E_2 == 2)) && (p_dw_st == 0)) && (local == 0)) && (token == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (m_pc == 0)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (a_t == 0)) && (0 == t2_st)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 0))) || ((((((((((((((((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (q_write_ev != 0)) && (m_st == 0)) && (m_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_read_ev != 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && ((q_req_up != 1) || (q_free != 0))) && (p_dw_i == 1)) && (0 == t2_pc)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)))) && ((\result == 0) || (p_dw_pc == 1))) && ((((((((((((((((((((((((((((((((((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))) && (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: 69]: Procedure Contract for is_do_write_p_triggered Derived contract for procedure is_do_write_p_triggered. Requires: ((((((((((((((((((((((((p_dw_st != 0) && (q_read_ev != 1)) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (q_write_ev != 0)) && (m_st == 0)) && (m_pc != 1)) && (1 == c_dr_i)) && (q_free == 0)) && (q_read_ev != 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) || ((((((((((((((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_buf_0 == 0)) && (t1_pc == 0)) && (p_last_write == 0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (c_last_read == 0)) && (T2_E == 2)) && (1 == c_dr_i)) && (q_req_up == 0)) && (t2_i == 0)) && (t1_st == 0)) && (q_ev == 0)) && (m_i == 0)) && (q_write_ev == 2)) && (E_2 == 2)) && (p_dw_st == 0)) && (local == 0)) && (token == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (m_pc == 0)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (a_t == 0)) && (0 == t2_st)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 0))) || ((((((((((((((((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (q_write_ev != 0)) && (m_st == 0)) && (m_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_read_ev != 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && ((q_req_up != 1) || (q_free != 0))) && (p_dw_i == 1)) && (0 == t2_pc)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (q_write_ev != 0)) && (m_st == 0)) && (q_read_ev == 1)) && (m_pc != 1)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && ((q_req_up != 1) || (q_free != 0))) && (p_dw_i == 1)) && (0 == t2_pc)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) Ensures: ((((((\result == 1) || (c_num_read != p_num_write)) || (p_dw_st == 0)) && ((((((((((((((((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_buf_0 == 0)) && (t1_pc == 0)) && (p_last_write == 0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (c_last_read == 0)) && (T2_E == 2)) && (1 == c_dr_i)) && (q_req_up == 0)) && (t2_i == 0)) && (t1_st == 0)) && (q_ev == 0)) && (m_i == 0)) && (q_write_ev == 2)) && (E_2 == 2)) && (local == 0)) && (token == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (m_pc == 0)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (a_t == 0)) && (0 == t2_st)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 0)) || (((((((((((((((((((((p_dw_st != 0) && (q_read_ev != 1)) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (q_write_ev != 0)) && (m_st == 0)) && (m_pc != 1)) && (1 == c_dr_i)) && (q_free == 0)) && (q_read_ev != 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((((((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (q_write_ev != 0)) && (m_st == 0)) && (m_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_read_ev != 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && ((q_req_up != 1) || (q_free != 0))) && (p_dw_i == 1)) && (0 == t2_pc)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (q_write_ev != 0)) && (m_st == 0)) && (q_read_ev == 1)) && (m_pc != 1)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && ((q_req_up != 1) || (q_free != 0))) && (p_dw_i == 1)) && (0 == t2_pc)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)))) && ((q_read_ev == 1) || (\result == 0))) && ((((((((((((((((((((((((((((((((((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))) && (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: 259]: Procedure Contract for exists_runnable_thread1 Derived contract for procedure exists_runnable_thread1. Requires: ((((((((((((((((((((((((((((((((((((((((c_dr_st == 0) && (q_req_up == 1)) && (c_num_read == 0)) && (t1_pc == 0)) && (q_buf_0 <= 2147483647)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (c_last_read == 0)) && (T2_E == 2)) && (1 == c_dr_i)) && (q_free == 0)) && (t2_i == 0)) && (t1_st == 0)) && (m_i == 0)) && (0 <= (q_buf_0 + 2147483648))) && (p_dw_pc == 1)) && (q_write_ev == 2)) && (E_2 == 2)) && (local == 0)) && (token == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (2 == p_dw_st)) && (m_pc == 0)) && (p_dw_i == 1)) && (p_num_write == 1)) && (0 == t2_pc)) && (E_M == 2)) && (a_t == 0)) && (0 == t2_st)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 0)) || ((((m_st == 0) && (0 == t2_st)) && (token == local)) && ((((((((((((((((((((q_req_up == 1) && (q_read_ev != 1)) && (c_num_read == p_num_write)) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (q_free == 1)) && (m_pc != 1)) && (1 == c_dr_i)) && (q_read_ev != 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (q_write_ev == 2)) && (E_2 == 2)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (E_1 == 2)) || (((((((((((((((((((((q_req_up == 1) && (q_read_ev != 1)) && (c_num_read == p_num_write)) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (q_write_ev != 0)) && (q_free == 1)) && (m_pc != 1)) && (1 == c_dr_i)) && (q_read_ev != 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && (p_dw_i == 1)) && (0 == t2_pc)) && (q_write_ev != 1)) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st))))) || (((((((((((((((((((((p_dw_st != 0) && (q_read_ev != 1)) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (m_st == 0)) && (m_pc != 1)) && (1 == c_dr_i)) && (q_free == 0)) && (q_read_ev != 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (q_write_ev == 2)) && (E_2 == 2)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((((q_read_ev != 1) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (q_write_ev != 0)) && (m_st == 0)) && (m_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_read_ev != 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && ((q_req_up != 1) || (q_free != 0))) && (p_dw_i == 1)) && (0 == t2_pc)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_buf_0 == 0)) && (t1_pc == 0)) && (p_last_write == 0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (c_last_read == 0)) && (T2_E == 2)) && (1 == c_dr_i)) && (q_req_up == 0)) && (t2_i == 0)) && (t1_st == 0)) && (q_ev == 0)) && (m_i == 0)) && (q_write_ev == 2)) && (E_2 == 2)) && (p_dw_st == 0)) && (local == 0)) && (token == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (m_pc == 0)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (a_t == 0)) && (0 == t2_st)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 0))) || (((((((((((((((((((((((p_dw_st != 0) && (q_read_ev != 1)) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (q_write_ev != 0)) && (m_st == 0)) && (m_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (q_read_ev != 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && (p_dw_i == 1)) && (0 == t2_pc)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (m_st == 0)) && (q_free == 1)) && (m_pc != 1)) && (1 == c_dr_i)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (q_write_ev == 2)) && (E_2 == 2)) && (p_dw_st == 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) Ensures: (((((p_dw_st != 0) || (\result == 1)) && ((((((((((((((((((((((((((((((((((((((((c_dr_st == 0) && (q_req_up == 1)) && (c_num_read == 0)) && (t1_pc == 0)) && (q_buf_0 <= 2147483647)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (c_last_read == 0)) && (T2_E == 2)) && (1 == c_dr_i)) && (q_free == 0)) && (t2_i == 0)) && (t1_st == 0)) && (m_i == 0)) && (0 <= (q_buf_0 + 2147483648))) && (p_dw_pc == 1)) && (q_write_ev == 2)) && (E_2 == 2)) && (local == 0)) && (token == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (2 == p_dw_st)) && (m_pc == 0)) && (p_dw_i == 1)) && (p_num_write == 1)) && (0 == t2_pc)) && (E_M == 2)) && (a_t == 0)) && (0 == t2_st)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 0)) || ((((m_st == 0) && (0 == t2_st)) && (token == local)) && ((((((((((((((((((((q_req_up == 1) && (q_read_ev != 1)) && (c_num_read == p_num_write)) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (q_free == 1)) && (m_pc != 1)) && (1 == c_dr_i)) && (q_read_ev != 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (q_write_ev == 2)) && (E_2 == 2)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (E_1 == 2)) || (((((((((((((((((((((q_req_up == 1) && (q_read_ev != 1)) && (c_num_read == p_num_write)) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (q_write_ev != 0)) && (q_free == 1)) && (m_pc != 1)) && (1 == c_dr_i)) && (q_read_ev != 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && (p_dw_i == 1)) && (0 == t2_pc)) && (q_write_ev != 1)) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st))))) || (((((((((((((((((((((p_dw_st != 0) && (q_read_ev != 1)) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (m_st == 0)) && (m_pc != 1)) && (1 == c_dr_i)) && (q_free == 0)) && (q_read_ev != 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (q_write_ev == 2)) && (E_2 == 2)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((((q_read_ev != 1) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (q_write_ev != 0)) && (m_st == 0)) && (m_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_read_ev != 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && ((q_req_up != 1) || (q_free != 0))) && (p_dw_i == 1)) && (0 == t2_pc)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_buf_0 == 0)) && (t1_pc == 0)) && (p_last_write == 0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (c_last_read == 0)) && (T2_E == 2)) && (1 == c_dr_i)) && (q_req_up == 0)) && (t2_i == 0)) && (t1_st == 0)) && (q_ev == 0)) && (m_i == 0)) && (q_write_ev == 2)) && (E_2 == 2)) && (p_dw_st == 0)) && (local == 0)) && (token == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (m_pc == 0)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (a_t == 0)) && (0 == t2_st)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 0))) || (((((((((((((((((((((((p_dw_st != 0) && (q_read_ev != 1)) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (q_write_ev != 0)) && (m_st == 0)) && (m_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (q_read_ev != 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && (p_dw_i == 1)) && (0 == t2_pc)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (m_st == 0)) && (q_free == 1)) && (m_pc != 1)) && (1 == c_dr_i)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (q_write_ev == 2)) && (E_2 == 2)) && (p_dw_st == 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)))) && ((c_dr_st != 0) || (\result == 1))) && ((((((((((((((((((((((((((((((((((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))) && (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: 24]: Procedure Contract for error1 Derived contract for procedure error1. Requires: 0 Ensures: (0 && ((((((((((((((((((((((((((((((((((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))) && (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: 726]: Procedure Contract for exists_runnable_thread2 Derived contract for procedure exists_runnable_thread2. Requires: (((((((((((((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (E_2 != 1)) && (q_req_up == 0)) && (t2_pc == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M != 1)) || ((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (E_1 == 2))) || (((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 == t2_st)) && (m_pc != 1)) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || ((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st))) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (m_st == 0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (token == ((long long) 2 + local))) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2))) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (m_pc != 1)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2))) || (((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (E_2 != 1)) && (q_req_up == 0)) && (t1_st == 0)) && (t2_pc == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M != 1))) || (((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (m_pc != 1)) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (E_2 != 1)) && (q_req_up == 0)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (0 == t2_st)) && (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))) && (((((((((((((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (E_2 != 1)) && (q_req_up == 0)) && (t2_pc == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M != 1)) || ((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (E_1 == 2))) || (((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 == t2_st)) && (m_pc != 1)) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || ((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st))) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (m_st == 0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (token == ((long long) 2 + local))) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2))) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (m_pc != 1)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2))) || (((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (E_2 != 1)) && (q_req_up == 0)) && (t1_st == 0)) && (t2_pc == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M != 1))) || (((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (m_pc != 1)) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (E_2 != 1)) && (q_req_up == 0)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (0 == t2_st)) && (E_M != 1)))) && ((((((((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))) && ((((((((E_2 != 2) || (E_M != 2)) || (t1_pc != 1)) || (\result == 1)) || (E_1 != 2)) || (0 != t2_pc)) || (t1_st != 0)) || (token != local))) && ((((((((((((((((((((((((((((((((((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))) && (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: 297]: Procedure Contract for reset_delta_events1 Derived contract for procedure reset_delta_events1. Requires: (((((((((((((((((((((((((c_dr_st == 0) && (p_dw_st != 0)) && (q_read_ev != 1)) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (m_st == 0)) && (m_pc != 1)) && (1 == c_dr_i)) && (q_free == 0)) && (q_read_ev != 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (q_write_ev == 1)) || ((((((((((((((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_buf_0 == 0)) && (t1_pc == 0)) && (p_last_write == 0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (c_last_read == 0)) && (T2_E == 2)) && (1 == c_dr_i)) && (q_req_up == 0)) && (t2_i == 0)) && (t1_st == 0)) && (q_ev == 0)) && (m_i == 0)) && (q_write_ev == 2)) && (E_2 == 2)) && (p_dw_st == 0)) && (local == 0)) && (token == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (m_pc == 0)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (a_t == 0)) && (0 == t2_st)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 0))) || ((((((((((((((((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (q_write_ev != 0)) && (m_st == 0)) && (m_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_read_ev != 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && ((q_req_up != 1) || (q_free != 0))) && (p_dw_i == 1)) && (0 == t2_pc)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((((p_dw_st != 0) && (q_read_ev != 1)) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (q_write_ev != 0)) && (m_st == 0)) && (m_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (q_read_ev != 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && (p_dw_i == 1)) && (0 == t2_pc)) && (q_write_ev != 1)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) Ensures: ((((((((\old(q_write_ev) == 1) || ((q_write_ev == \old(q_write_ev)) && (\old(q_read_ev) == q_read_ev))) || (((long long) c_num_read + 1) != p_num_write)) && (((c_dr_st != 0) || (((((((((((((((((q_read_ev != 1) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (m_pc != 1)) && (1 == c_dr_i)) && (q_free == 0)) && (q_read_ev != 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (q_write_ev == 2)) && (E_2 == 2)) && (\old(q_read_ev) == q_read_ev)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (E_1 == 2))) || (((long long) c_num_read + 1) != p_num_write))) && ((p_dw_pc == 1) || (q_write_ev == 2))) && (((((((((((((((((((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (\old(q_read_ev) != 0)) && (m_pc == t1_pc)) && (m_st == 0)) && (m_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (t1_st == 0)) && (\old(q_write_ev) != 0)) && (\old(q_write_ev) != 1)) && (p_dw_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && ((q_req_up != 1) || (q_free != 0))) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) || (((((((((((((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_buf_0 == 0)) && (t1_pc == 0)) && (p_last_write == 0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (c_last_read == 0)) && (T2_E == 2)) && (1 == c_dr_i)) && (q_req_up == 0)) && (t2_i == 0)) && (t1_st == 0)) && (q_ev == 0)) && (m_i == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (local == 0)) && (token == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (\old(q_read_ev) == 2)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (a_t == 0)) && (0 == t2_st)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 0))) || (((((((c_dr_st == 0) && (p_dw_st != 0)) && (((long long) c_num_read + 1) == p_num_write)) && (m_st == 0)) && (\old(q_write_ev) == 1)) && (0 == t2_st)) && (token == local))) || (((((((((((((((((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (\old(q_read_ev) != 0)) && (m_pc == t1_pc)) && (m_st == 0)) && (m_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (\old(q_write_ev) != 0)) && (\old(q_write_ev) != 1)) && (p_dw_pc == 1)) && (E_2 == 2)) && (\old(q_read_ev) != 1)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)))) && (((((\old(q_read_ev) == 1) && (q_write_ev == \old(q_write_ev))) && (q_read_ev == 2)) || (c_num_read != p_num_write)) || (((q_read_ev != 1) && (q_write_ev == \old(q_write_ev))) && (\old(q_read_ev) == q_read_ev)))) && ((((((((((((((((((((((((((((((((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))) && (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: 854]: 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)) && ((((((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))) && (((((((((((((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (2 == \old(E_M))) && (2 == \old(E_2))) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (t2_pc == 1)) && (2 <= \old(E_1))) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (0 == t2_st)) || ((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (q_req_up == 0)) && (2 <= \old(E_1))) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (0 == t2_st))) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (2 == \old(E_1))) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == \old(E_M))) && (m_pc != 1)) && (2 == \old(E_2))) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (0 == t2_st)) && (token == local))) || (((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (2 == \old(E_1))) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 == t2_st)) && (2 == \old(E_M))) && (m_pc != 1)) && (2 == \old(E_2))) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (t2_pc == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (token == local))) || ((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (2 == \old(E_1))) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == \old(E_M))) && (2 == \old(E_2))) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (0 == t2_st))) || (((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (2 == \old(E_1))) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 == \old(E_M))) && (m_pc != 1)) && (2 == \old(E_2))) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (0 == t2_st)) && (token == local))) || ((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (2 == \old(E_M))) && (2 == \old(E_2))) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (t2_pc == 1)) && (2 <= \old(E_1))) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1))) || (((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (t2_pc == 1)) && (2 <= \old(E_1))) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1))) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (2 == \old(E_M))) && (m_st == 0)) && (2 == \old(E_2))) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (t2_pc == 1)) && (2 <= \old(E_1))) && (token == ((long long) 2 + local))) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1))) || (((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (q_req_up == 0)) && (t2_pc == 1)) && (2 <= \old(E_1))) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1))) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (2 == \old(E_1))) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (2 == \old(E_M))) && (m_pc != 1)) && (2 == \old(E_2))) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (t2_pc == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (q_read_ev == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (token == local)))) && (E_M != 1)) && ((((((((((((((((((((((((((((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))) && (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-09 05:24:30,643 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0ef9df-21d2-40ea-b419-1bc03aff9472/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE