./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.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_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/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_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/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_084dca34-e464-40bc-989b-0bcf22132b88/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 f24e14c02d3357f8669328b41c4b37af446f7269afa24af78cb772dc24fa0c01 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 07:26:35,140 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:26:35,237 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 07:26:35,244 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:26:35,248 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:26:35,290 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:26:35,290 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:26:35,291 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:26:35,292 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:26:35,293 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:26:35,294 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 07:26:35,294 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 07:26:35,295 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 07:26:35,295 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 07:26:35,295 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 07:26:35,296 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 07:26:35,296 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 07:26:35,296 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 07:26:35,297 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 07:26:35,297 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 07:26:35,298 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 07:26:35,302 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 07:26:35,303 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:26:35,303 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:26:35,303 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:26:35,304 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:26:35,304 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:26:35,304 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:26:35,305 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:26:35,305 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:26:35,305 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:26:35,305 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:26:35,306 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:26:35,308 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:26:35,308 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:26:35,309 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:26:35,309 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:26:35,310 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:26:35,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 07:26:35,311 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:26:35,311 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:26:35,312 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 07:26:35,312 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 07:26:35,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:26:35,312 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:26:35,313 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 07:26:35,313 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:26:35,313 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_084dca34-e464-40bc-989b-0bcf22132b88/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_084dca34-e464-40bc-989b-0bcf22132b88/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 -> f24e14c02d3357f8669328b41c4b37af446f7269afa24af78cb772dc24fa0c01 [2024-11-09 07:26:35,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:26:35,589 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:26:35,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:26:35,593 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:26:35,593 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:26:35,595 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c Unable to find full path for "g++" [2024-11-09 07:26:37,527 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:26:37,753 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:26:37,753 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2024-11-09 07:26:37,766 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/data/2e432e632/fc0c542647e845a59a1b89c4d3e82175/FLAGe52e6f21a [2024-11-09 07:26:37,785 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/data/2e432e632/fc0c542647e845a59a1b89c4d3e82175 [2024-11-09 07:26:37,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:26:37,790 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:26:37,793 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:26:37,794 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:26:37,800 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:26:37,801 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:26:37" (1/1) ... [2024-11-09 07:26:37,802 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e418b32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:37, skipping insertion in model container [2024-11-09 07:26:37,803 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:26:37" (1/1) ... [2024-11-09 07:26:37,864 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:26:38,077 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_084dca34-e464-40bc-989b-0bcf22132b88/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[914,927] [2024-11-09 07:26:38,158 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_084dca34-e464-40bc-989b-0bcf22132b88/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[7115,7128] [2024-11-09 07:26:38,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:26:38,227 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:26:38,243 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_084dca34-e464-40bc-989b-0bcf22132b88/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[914,927] [2024-11-09 07:26:38,282 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_084dca34-e464-40bc-989b-0bcf22132b88/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[7115,7128] [2024-11-09 07:26:38,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:26:38,348 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:26:38,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:38 WrapperNode [2024-11-09 07:26:38,348 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:26:38,350 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:26:38,350 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:26:38,350 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:26:38,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:38" (1/1) ... [2024-11-09 07:26:38,374 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:38" (1/1) ... [2024-11-09 07:26:38,442 INFO L138 Inliner]: procedures = 55, calls = 60, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 400 [2024-11-09 07:26:38,443 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:26:38,444 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:26:38,444 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:26:38,444 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:26:38,468 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:38" (1/1) ... [2024-11-09 07:26:38,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:38" (1/1) ... [2024-11-09 07:26:38,471 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:38" (1/1) ... [2024-11-09 07:26:38,475 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:38" (1/1) ... [2024-11-09 07:26:38,486 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:38" (1/1) ... [2024-11-09 07:26:38,503 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:38" (1/1) ... [2024-11-09 07:26:38,505 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:38" (1/1) ... [2024-11-09 07:26:38,507 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:38" (1/1) ... [2024-11-09 07:26:38,513 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:26:38,518 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:26:38,518 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:26:38,518 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:26:38,519 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:38" (1/1) ... [2024-11-09 07:26:38,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 07:26:38,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:26:38,573 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 07:26:38,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 07:26:38,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:26:38,611 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-09 07:26:38,612 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-09 07:26:38,612 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-09 07:26:38,613 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-09 07:26:38,613 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-09 07:26:38,613 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-09 07:26:38,613 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-09 07:26:38,613 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-09 07:26:38,614 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-11-09 07:26:38,614 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-11-09 07:26:38,614 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-09 07:26:38,614 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-09 07:26:38,615 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-09 07:26:38,615 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-09 07:26:38,616 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-11-09 07:26:38,616 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-11-09 07:26:38,616 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-09 07:26:38,616 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-09 07:26:38,617 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-11-09 07:26:38,617 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-11-09 07:26:38,617 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-09 07:26:38,618 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-09 07:26:38,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 07:26:38,619 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-09 07:26:38,619 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-09 07:26:38,619 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-11-09 07:26:38,620 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-11-09 07:26:38,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:26:38,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:26:38,621 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-09 07:26:38,621 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-09 07:26:38,753 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:26:38,757 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:26:39,366 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2024-11-09 07:26:39,366 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:26:39,630 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:26:39,632 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-09 07:26:39,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:26:39 BoogieIcfgContainer [2024-11-09 07:26:39,632 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:26:39,634 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:26:39,636 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:26:39,639 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:26:39,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:26:37" (1/3) ... [2024-11-09 07:26:39,640 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e1219d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:26:39, skipping insertion in model container [2024-11-09 07:26:39,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:38" (2/3) ... [2024-11-09 07:26:39,641 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e1219d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:26:39, skipping insertion in model container [2024-11-09 07:26:39,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:26:39" (3/3) ... [2024-11-09 07:26:39,643 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2024-11-09 07:26:39,661 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:26:39,661 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 07:26:39,732 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:26:39,738 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;@733d9caa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:26:39,739 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 07:26:39,743 INFO L276 IsEmpty]: Start isEmpty. Operand has 141 states, 95 states have (on average 1.4631578947368422) internal successors, (139), 101 states have internal predecessors, (139), 29 states have call successors, (29), 14 states have call predecessors, (29), 14 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-09 07:26:39,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 07:26:39,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:26:39,756 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] [2024-11-09 07:26:39,756 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:26:39,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:26:39,763 INFO L85 PathProgramCache]: Analyzing trace with hash -2011418988, now seen corresponding path program 1 times [2024-11-09 07:26:39,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:26:39,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302885509] [2024-11-09 07:26:39,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:26:39,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:26:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:26:40,286 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 07:26:40,287 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:26:40,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302885509] [2024-11-09 07:26:40,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302885509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:26:40,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:26:40,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:26:40,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144302383] [2024-11-09 07:26:40,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:26:40,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:26:40,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:26:40,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:26:40,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:26:40,321 INFO L87 Difference]: Start difference. First operand has 141 states, 95 states have (on average 1.4631578947368422) internal successors, (139), 101 states have internal predecessors, (139), 29 states have call successors, (29), 14 states have call predecessors, (29), 14 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 07:26:41,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:26:41,067 INFO L93 Difference]: Finished difference Result 503 states and 720 transitions. [2024-11-09 07:26:41,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:26:41,070 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 34 [2024-11-09 07:26:41,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:26:41,089 INFO L225 Difference]: With dead ends: 503 [2024-11-09 07:26:41,089 INFO L226 Difference]: Without dead ends: 357 [2024-11-09 07:26:41,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:26:41,101 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 442 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:26:41,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 448 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 07:26:41,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-09 07:26:41,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 346. [2024-11-09 07:26:41,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 237 states have (on average 1.3122362869198312) internal successors, (311), 244 states have internal predecessors, (311), 70 states have call successors, (70), 38 states have call predecessors, (70), 37 states have return successors, (86), 65 states have call predecessors, (86), 68 states have call successors, (86) [2024-11-09 07:26:41,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 467 transitions. [2024-11-09 07:26:41,232 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 467 transitions. Word has length 34 [2024-11-09 07:26:41,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:26:41,232 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 467 transitions. [2024-11-09 07:26:41,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 07:26:41,233 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 467 transitions. [2024-11-09 07:26:41,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 07:26:41,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:26:41,237 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 07:26:41,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:26:41,237 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:26:41,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:26:41,238 INFO L85 PathProgramCache]: Analyzing trace with hash -377871881, now seen corresponding path program 1 times [2024-11-09 07:26:41,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:26:41,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112593226] [2024-11-09 07:26:41,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:26:41,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:26:41,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:26:41,504 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 07:26:41,505 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:26:41,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112593226] [2024-11-09 07:26:41,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112593226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:26:41,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:26:41,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:26:41,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001866199] [2024-11-09 07:26:41,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:26:41,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:26:41,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:26:41,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:26:41,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:26:41,512 INFO L87 Difference]: Start difference. First operand 346 states and 467 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 07:26:42,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:26:42,390 INFO L93 Difference]: Finished difference Result 821 states and 1097 transitions. [2024-11-09 07:26:42,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:26:42,391 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 07:26:42,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:26:42,397 INFO L225 Difference]: With dead ends: 821 [2024-11-09 07:26:42,398 INFO L226 Difference]: Without dead ends: 757 [2024-11-09 07:26:42,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:26:42,400 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 690 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:26:42,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 682 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 07:26:42,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2024-11-09 07:26:42,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 686. [2024-11-09 07:26:42,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 474 states have (on average 1.2869198312236287) internal successors, (610), 481 states have internal predecessors, (610), 125 states have call successors, (125), 86 states have call predecessors, (125), 85 states have return successors, (156), 120 states have call predecessors, (156), 123 states have call successors, (156) [2024-11-09 07:26:42,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 891 transitions. [2024-11-09 07:26:42,569 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 891 transitions. Word has length 45 [2024-11-09 07:26:42,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:26:42,569 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 891 transitions. [2024-11-09 07:26:42,569 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 07:26:42,570 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 891 transitions. [2024-11-09 07:26:42,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 07:26:42,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:26:42,574 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 07:26:42,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:26:42,575 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:26:42,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:26:42,579 INFO L85 PathProgramCache]: Analyzing trace with hash 320168885, now seen corresponding path program 1 times [2024-11-09 07:26:42,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:26:42,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202016121] [2024-11-09 07:26:42,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:26:42,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:26:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:26:42,902 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 07:26:42,903 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:26:42,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202016121] [2024-11-09 07:26:42,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202016121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:26:42,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:26:42,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:26:42,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892691073] [2024-11-09 07:26:42,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:26:42,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:26:42,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:26:42,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:26:42,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:26:42,909 INFO L87 Difference]: Start difference. First operand 686 states and 891 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 07:26:43,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:26:43,665 INFO L93 Difference]: Finished difference Result 1447 states and 1838 transitions. [2024-11-09 07:26:43,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 07:26:43,666 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 07:26:43,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:26:43,678 INFO L225 Difference]: With dead ends: 1447 [2024-11-09 07:26:43,678 INFO L226 Difference]: Without dead ends: 1044 [2024-11-09 07:26:43,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2024-11-09 07:26:43,685 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 287 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:26:43,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 485 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:26:43,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2024-11-09 07:26:43,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 1015. [2024-11-09 07:26:43,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 697 states have (on average 1.2639885222381635) internal successors, (881), 705 states have internal predecessors, (881), 181 states have call successors, (181), 134 states have call predecessors, (181), 135 states have return successors, (230), 177 states have call predecessors, (230), 179 states have call successors, (230) [2024-11-09 07:26:43,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1292 transitions. [2024-11-09 07:26:43,871 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1292 transitions. Word has length 46 [2024-11-09 07:26:43,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:26:43,872 INFO L471 AbstractCegarLoop]: Abstraction has 1015 states and 1292 transitions. [2024-11-09 07:26:43,872 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 07:26:43,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1292 transitions. [2024-11-09 07:26:43,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 07:26:43,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:26:43,875 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 07:26:43,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:26:43,876 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:26:43,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:26:43,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1109194298, now seen corresponding path program 1 times [2024-11-09 07:26:43,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:26:43,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699413555] [2024-11-09 07:26:43,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:26:43,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:26:43,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:26:43,928 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 07:26:43,928 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:26:43,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699413555] [2024-11-09 07:26:43,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699413555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:26:43,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:26:43,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:26:43,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501018438] [2024-11-09 07:26:43,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:26:43,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:26:43,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:26:43,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:26:43,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:26:43,931 INFO L87 Difference]: Start difference. First operand 1015 states and 1292 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 07:26:44,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:26:44,161 INFO L93 Difference]: Finished difference Result 1956 states and 2451 transitions. [2024-11-09 07:26:44,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:26:44,161 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 07:26:44,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:26:44,169 INFO L225 Difference]: With dead ends: 1956 [2024-11-09 07:26:44,169 INFO L226 Difference]: Without dead ends: 1274 [2024-11-09 07:26:44,171 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 07:26:44,172 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 68 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:26:44,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 290 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:26:44,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2024-11-09 07:26:44,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1252. [2024-11-09 07:26:44,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1252 states, 858 states have (on average 1.2529137529137528) internal successors, (1075), 866 states have internal predecessors, (1075), 223 states have call successors, (223), 172 states have call predecessors, (223), 169 states have return successors, (276), 215 states have call predecessors, (276), 221 states have call successors, (276) [2024-11-09 07:26:44,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1574 transitions. [2024-11-09 07:26:44,350 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1574 transitions. Word has length 47 [2024-11-09 07:26:44,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:26:44,351 INFO L471 AbstractCegarLoop]: Abstraction has 1252 states and 1574 transitions. [2024-11-09 07:26:44,351 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 07:26:44,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1574 transitions. [2024-11-09 07:26:44,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 07:26:44,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:26:44,353 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 07:26:44,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:26:44,353 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:26:44,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:26:44,354 INFO L85 PathProgramCache]: Analyzing trace with hash 914040955, now seen corresponding path program 1 times [2024-11-09 07:26:44,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:26:44,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394350243] [2024-11-09 07:26:44,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:26:44,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:26:44,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:26:44,404 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 07:26:44,404 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:26:44,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394350243] [2024-11-09 07:26:44,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394350243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:26:44,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:26:44,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:26:44,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392274193] [2024-11-09 07:26:44,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:26:44,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:26:44,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:26:44,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:26:44,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:26:44,407 INFO L87 Difference]: Start difference. First operand 1252 states and 1574 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 07:26:44,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:26:44,651 INFO L93 Difference]: Finished difference Result 1658 states and 2064 transitions. [2024-11-09 07:26:44,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:26:44,651 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 07:26:44,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:26:44,660 INFO L225 Difference]: With dead ends: 1658 [2024-11-09 07:26:44,660 INFO L226 Difference]: Without dead ends: 1103 [2024-11-09 07:26:44,662 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 07:26:44,665 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 151 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:26:44,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 222 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:26:44,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2024-11-09 07:26:44,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 897. [2024-11-09 07:26:44,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 897 states, 622 states have (on average 1.2411575562700965) internal successors, (772), 629 states have internal predecessors, (772), 160 states have call successors, (160), 118 states have call predecessors, (160), 113 states have return successors, (184), 151 states have call predecessors, (184), 158 states have call successors, (184) [2024-11-09 07:26:44,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1116 transitions. [2024-11-09 07:26:44,814 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1116 transitions. Word has length 53 [2024-11-09 07:26:44,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:26:44,817 INFO L471 AbstractCegarLoop]: Abstraction has 897 states and 1116 transitions. [2024-11-09 07:26:44,818 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 07:26:44,818 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1116 transitions. [2024-11-09 07:26:44,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 07:26:44,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:26:44,819 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 07:26:44,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:26:44,820 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:26:44,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:26:44,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1075976658, now seen corresponding path program 1 times [2024-11-09 07:26:44,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:26:44,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394305716] [2024-11-09 07:26:44,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:26:44,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:26:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:26:44,922 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 07:26:44,922 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:26:44,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394305716] [2024-11-09 07:26:44,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394305716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:26:44,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:26:44,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:26:44,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781159570] [2024-11-09 07:26:44,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:26:44,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:26:44,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:26:44,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:26:44,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:26:44,924 INFO L87 Difference]: Start difference. First operand 897 states and 1116 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 07:26:45,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:26:45,347 INFO L93 Difference]: Finished difference Result 1152 states and 1417 transitions. [2024-11-09 07:26:45,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:26:45,348 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 07:26:45,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:26:45,354 INFO L225 Difference]: With dead ends: 1152 [2024-11-09 07:26:45,355 INFO L226 Difference]: Without dead ends: 1149 [2024-11-09 07:26:45,355 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 07:26:45,356 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 285 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:26:45,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 198 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:26:45,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2024-11-09 07:26:45,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 896. [2024-11-09 07:26:45,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 622 states have (on average 1.2315112540192925) internal successors, (766), 628 states have internal predecessors, (766), 159 states have call successors, (159), 118 states have call predecessors, (159), 113 states have return successors, (184), 151 states have call predecessors, (184), 158 states have call successors, (184) [2024-11-09 07:26:45,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1109 transitions. [2024-11-09 07:26:45,518 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1109 transitions. Word has length 54 [2024-11-09 07:26:45,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:26:45,518 INFO L471 AbstractCegarLoop]: Abstraction has 896 states and 1109 transitions. [2024-11-09 07:26:45,519 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 07:26:45,519 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1109 transitions. [2024-11-09 07:26:45,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 07:26:45,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:26:45,521 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 07:26:45,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:26:45,521 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:26:45,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:26:45,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1005086718, now seen corresponding path program 1 times [2024-11-09 07:26:45,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:26:45,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147086611] [2024-11-09 07:26:45,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:26:45,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:26:45,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:26:45,669 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 07:26:45,669 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:26:45,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147086611] [2024-11-09 07:26:45,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147086611] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:26:45,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038359364] [2024-11-09 07:26:45,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:26:45,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:26:45,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:26:45,672 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:26:45,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 07:26:45,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:26:45,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 07:26:45,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:26:46,124 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 07:26:46,125 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:26:46,246 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 07:26:46,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038359364] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:26:46,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2099684058] [2024-11-09 07:26:46,266 INFO L159 IcfgInterpreter]: Started Sifa with 54 locations of interest [2024-11-09 07:26:46,267 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:26:46,270 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:26:46,276 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:26:46,276 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:26:48,781 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events1 with input of size 101 for LOIs [2024-11-09 07:26:48,828 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread1 with input of size 97 for LOIs [2024-11-09 07:26:48,871 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads1 with input of size 105 for LOIs [2024-11-09 07:26:49,474 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_write_p_triggered with input of size 101 for LOIs [2024-11-09 07:26:49,571 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_read_c_triggered with input of size 101 for LOIs [2024-11-09 07:26:49,683 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events1 with input of size 101 for LOIs [2024-11-09 07:26:49,729 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels1 with input of size 108 for LOIs [2024-11-09 07:26:49,773 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:26:56,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [2099684058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:26:56,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:26:56,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [5, 5, 4] total 36 [2024-11-09 07:26:56,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546646035] [2024-11-09 07:26:56,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:26:56,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-09 07:26:56,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:26:56,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-09 07:26:56,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1061, Unknown=0, NotChecked=0, Total=1260 [2024-11-09 07:26:56,768 INFO L87 Difference]: Start difference. First operand 896 states and 1109 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 07:27:04,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:27:04,375 INFO L93 Difference]: Finished difference Result 1535 states and 1865 transitions. [2024-11-09 07:27:04,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 07:27:04,376 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 07:27:04,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:27:04,382 INFO L225 Difference]: With dead ends: 1535 [2024-11-09 07:27:04,382 INFO L226 Difference]: Without dead ends: 922 [2024-11-09 07:27:04,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 131 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=405, Invalid=1947, Unknown=0, NotChecked=0, Total=2352 [2024-11-09 07:27:04,385 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 121 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 2284 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1389 SdHoareTripleChecker+Invalid, 2372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 2284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:27:04,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1389 Invalid, 2372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 2284 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-09 07:27:04,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-11-09 07:27:04,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 914. [2024-11-09 07:27:04,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 638 states have (on average 1.2288401253918495) internal successors, (784), 644 states have internal predecessors, (784), 160 states have call successors, (160), 119 states have call predecessors, (160), 114 states have return successors, (185), 152 states have call predecessors, (185), 159 states have call successors, (185) [2024-11-09 07:27:04,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1129 transitions. [2024-11-09 07:27:04,511 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1129 transitions. Word has length 55 [2024-11-09 07:27:04,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:27:04,512 INFO L471 AbstractCegarLoop]: Abstraction has 914 states and 1129 transitions. [2024-11-09 07:27:04,512 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 07:27:04,513 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1129 transitions. [2024-11-09 07:27:04,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 07:27:04,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:27:04,515 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 07:27:04,538 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 07:27:04,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-09 07:27:04,717 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:27:04,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:27:04,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1975577499, now seen corresponding path program 1 times [2024-11-09 07:27:04,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:27:04,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245712124] [2024-11-09 07:27:04,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:27:04,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:27:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:27:04,925 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 07:27:04,926 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:27:04,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245712124] [2024-11-09 07:27:04,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245712124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:27:04,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:27:04,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:27:04,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058368017] [2024-11-09 07:27:04,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:27:04,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:27:04,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:27:04,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:27:04,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:27:04,928 INFO L87 Difference]: Start difference. First operand 914 states and 1129 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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 07:27:05,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:27:05,470 INFO L93 Difference]: Finished difference Result 1346 states and 1721 transitions. [2024-11-09 07:27:05,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:27:05,471 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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 60 [2024-11-09 07:27:05,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:27:05,478 INFO L225 Difference]: With dead ends: 1346 [2024-11-09 07:27:05,478 INFO L226 Difference]: Without dead ends: 1075 [2024-11-09 07:27:05,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:27:05,481 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 251 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:27:05,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 415 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:27:05,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2024-11-09 07:27:05,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 1063. [2024-11-09 07:27:05,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 739 states have (on average 1.2273342354533152) internal successors, (907), 747 states have internal predecessors, (907), 190 states have call successors, (190), 137 states have call predecessors, (190), 132 states have return successors, (227), 180 states have call predecessors, (227), 189 states have call successors, (227) [2024-11-09 07:27:05,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1324 transitions. [2024-11-09 07:27:05,667 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1324 transitions. Word has length 60 [2024-11-09 07:27:05,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:27:05,668 INFO L471 AbstractCegarLoop]: Abstraction has 1063 states and 1324 transitions. [2024-11-09 07:27:05,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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 07:27:05,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1324 transitions. [2024-11-09 07:27:05,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 07:27:05,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:27:05,670 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 07:27:05,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:27:05,670 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:27:05,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:27:05,671 INFO L85 PathProgramCache]: Analyzing trace with hash 701894621, now seen corresponding path program 1 times [2024-11-09 07:27:05,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:27:05,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846389157] [2024-11-09 07:27:05,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:27:05,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:27:05,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:27:05,729 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 07:27:05,729 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:27:05,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846389157] [2024-11-09 07:27:05,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846389157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:27:05,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:27:05,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:27:05,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685791396] [2024-11-09 07:27:05,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:27:05,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:27:05,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:27:05,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:27:05,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:27:05,732 INFO L87 Difference]: Start difference. First operand 1063 states and 1324 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 07:27:05,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:27:05,963 INFO L93 Difference]: Finished difference Result 1645 states and 2007 transitions. [2024-11-09 07:27:05,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:27:05,964 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 07:27:05,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:27:05,971 INFO L225 Difference]: With dead ends: 1645 [2024-11-09 07:27:05,971 INFO L226 Difference]: Without dead ends: 1272 [2024-11-09 07:27:05,973 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 07:27:05,974 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 43 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:27:05,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 326 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:27:05,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1272 states. [2024-11-09 07:27:06,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 1184. [2024-11-09 07:27:06,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 820 states have (on average 1.2195121951219512) internal successors, (1000), 832 states have internal predecessors, (1000), 212 states have call successors, (212), 159 states have call predecessors, (212), 150 states have return successors, (249), 194 states have call predecessors, (249), 211 states have call successors, (249) [2024-11-09 07:27:06,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1461 transitions. [2024-11-09 07:27:06,173 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1461 transitions. Word has length 61 [2024-11-09 07:27:06,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:27:06,174 INFO L471 AbstractCegarLoop]: Abstraction has 1184 states and 1461 transitions. [2024-11-09 07:27:06,174 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 07:27:06,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1461 transitions. [2024-11-09 07:27:06,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 07:27:06,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:27:06,175 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 07:27:06,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:27:06,176 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:27:06,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:27:06,176 INFO L85 PathProgramCache]: Analyzing trace with hash -770694313, now seen corresponding path program 1 times [2024-11-09 07:27:06,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:27:06,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851167163] [2024-11-09 07:27:06,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:27:06,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:27:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:27:06,248 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 07:27:06,249 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:27:06,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851167163] [2024-11-09 07:27:06,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851167163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:27:06,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:27:06,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:27:06,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365827123] [2024-11-09 07:27:06,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:27:06,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:27:06,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:27:06,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:27:06,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:27:06,252 INFO L87 Difference]: Start difference. First operand 1184 states and 1461 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 07:27:06,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:27:06,492 INFO L93 Difference]: Finished difference Result 1644 states and 2086 transitions. [2024-11-09 07:27:06,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:27:06,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 62 [2024-11-09 07:27:06,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:27:06,501 INFO L225 Difference]: With dead ends: 1644 [2024-11-09 07:27:06,501 INFO L226 Difference]: Without dead ends: 1277 [2024-11-09 07:27:06,503 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 07:27:06,503 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 28 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:27:06,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 327 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:27:06,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2024-11-09 07:27:06,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 1221. [2024-11-09 07:27:06,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1221 states, 851 states have (on average 1.2232667450058754) internal successors, (1041), 863 states have internal predecessors, (1041), 215 states have call successors, (215), 162 states have call predecessors, (215), 153 states have return successors, (252), 197 states have call predecessors, (252), 214 states have call successors, (252) [2024-11-09 07:27:06,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1508 transitions. [2024-11-09 07:27:06,683 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1508 transitions. Word has length 62 [2024-11-09 07:27:06,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:27:06,683 INFO L471 AbstractCegarLoop]: Abstraction has 1221 states and 1508 transitions. [2024-11-09 07:27:06,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 07:27:06,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1508 transitions. [2024-11-09 07:27:06,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-09 07:27:06,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:27:06,687 INFO L215 NwaCegarLoop]: trace histogram [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 07:27:06,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:27:06,687 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:27:06,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:27:06,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1869106373, now seen corresponding path program 1 times [2024-11-09 07:27:06,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:27:06,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876046252] [2024-11-09 07:27:06,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:27:06,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:27:06,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:27:06,789 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-09 07:27:06,790 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:27:06,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876046252] [2024-11-09 07:27:06,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876046252] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:27:06,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159408342] [2024-11-09 07:27:06,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:27:06,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:27:06,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:27:06,793 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:27:06,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 07:27:06,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:27:06,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 07:27:06,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:27:06,949 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 07:27:06,949 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:27:06,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159408342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:27:06,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:27:06,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-09 07:27:06,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512347137] [2024-11-09 07:27:06,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:27:06,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:27:06,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:27:06,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:27:06,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:27:06,952 INFO L87 Difference]: Start difference. First operand 1221 states and 1508 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 07:27:07,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:27:07,180 INFO L93 Difference]: Finished difference Result 1638 states and 2074 transitions. [2024-11-09 07:27:07,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:27:07,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 90 [2024-11-09 07:27:07,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:27:07,187 INFO L225 Difference]: With dead ends: 1638 [2024-11-09 07:27:07,188 INFO L226 Difference]: Without dead ends: 1300 [2024-11-09 07:27:07,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 90 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 07:27:07,190 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 146 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:27:07,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 168 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:27:07,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2024-11-09 07:27:07,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1285. [2024-11-09 07:27:07,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1285 states, 906 states have (on average 1.2218543046357615) internal successors, (1107), 917 states have internal predecessors, (1107), 215 states have call successors, (215), 170 states have call predecessors, (215), 162 states have return successors, (250), 199 states have call predecessors, (250), 214 states have call successors, (250) [2024-11-09 07:27:07,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1572 transitions. [2024-11-09 07:27:07,387 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 1572 transitions. Word has length 90 [2024-11-09 07:27:07,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:27:07,388 INFO L471 AbstractCegarLoop]: Abstraction has 1285 states and 1572 transitions. [2024-11-09 07:27:07,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 07:27:07,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1572 transitions. [2024-11-09 07:27:07,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-09 07:27:07,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:27:07,391 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:27:07,412 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 07:27:07,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 07:27:07,596 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:27:07,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:27:07,596 INFO L85 PathProgramCache]: Analyzing trace with hash 895617414, now seen corresponding path program 1 times [2024-11-09 07:27:07,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:27:07,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096881636] [2024-11-09 07:27:07,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:27:07,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:27:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:27:07,711 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-09 07:27:07,711 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:27:07,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096881636] [2024-11-09 07:27:07,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096881636] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:27:07,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445769641] [2024-11-09 07:27:07,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:27:07,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:27:07,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:27:07,714 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:27:07,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 07:27:07,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:27:07,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 07:27:07,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:27:07,843 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 07:27:07,844 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:27:07,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445769641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:27:07,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:27:07,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-09 07:27:07,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371217761] [2024-11-09 07:27:07,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:27:07,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:27:07,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:27:07,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:27:07,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:27:07,846 INFO L87 Difference]: Start difference. First operand 1285 states and 1572 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 07:27:08,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:27:08,093 INFO L93 Difference]: Finished difference Result 1768 states and 2203 transitions. [2024-11-09 07:27:08,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:27:08,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 90 [2024-11-09 07:27:08,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:27:08,101 INFO L225 Difference]: With dead ends: 1768 [2024-11-09 07:27:08,101 INFO L226 Difference]: Without dead ends: 1383 [2024-11-09 07:27:08,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 90 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 07:27:08,103 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 37 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:27:08,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 328 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:27:08,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2024-11-09 07:27:08,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1313. [2024-11-09 07:27:08,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1313 states, 928 states have (on average 1.2241379310344827) internal successors, (1136), 939 states have internal predecessors, (1136), 218 states have call successors, (218), 173 states have call predecessors, (218), 165 states have return successors, (253), 202 states have call predecessors, (253), 217 states have call successors, (253) [2024-11-09 07:27:08,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 1607 transitions. [2024-11-09 07:27:08,297 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 1607 transitions. Word has length 90 [2024-11-09 07:27:08,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:27:08,297 INFO L471 AbstractCegarLoop]: Abstraction has 1313 states and 1607 transitions. [2024-11-09 07:27:08,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 07:27:08,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1607 transitions. [2024-11-09 07:27:08,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-09 07:27:08,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:27:08,300 INFO L215 NwaCegarLoop]: trace histogram [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 07:27:08,320 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 07:27:08,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-09 07:27:08,501 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:27:08,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:27:08,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1238578919, now seen corresponding path program 2 times [2024-11-09 07:27:08,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:27:08,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622991909] [2024-11-09 07:27:08,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:27:08,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:27:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:27:08,680 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-09 07:27:08,680 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:27:08,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622991909] [2024-11-09 07:27:08,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622991909] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:27:08,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938592395] [2024-11-09 07:27:08,681 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 07:27:08,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:27:08,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:27:08,683 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:27:08,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 07:27:08,778 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 07:27:08,778 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:27:08,779 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 07:27:08,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:27:08,817 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 07:27:08,817 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:27:08,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938592395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:27:08,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:27:08,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-09 07:27:08,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690441960] [2024-11-09 07:27:08,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:27:08,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:27:08,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:27:08,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:27:08,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:27:08,819 INFO L87 Difference]: Start difference. First operand 1313 states and 1607 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 07:27:09,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:27:09,077 INFO L93 Difference]: Finished difference Result 1838 states and 2327 transitions. [2024-11-09 07:27:09,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:27:09,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 90 [2024-11-09 07:27:09,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:27:09,085 INFO L225 Difference]: With dead ends: 1838 [2024-11-09 07:27:09,085 INFO L226 Difference]: Without dead ends: 1425 [2024-11-09 07:27:09,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 92 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 07:27:09,088 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 59 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:27:09,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 323 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:27:09,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2024-11-09 07:27:09,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 1405. [2024-11-09 07:27:09,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1405 states, 998 states have (on average 1.218436873747495) internal successors, (1216), 1010 states have internal predecessors, (1216), 231 states have call successors, (231), 183 states have call predecessors, (231), 174 states have return successors, (276), 213 states have call predecessors, (276), 230 states have call successors, (276) [2024-11-09 07:27:09,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 1723 transitions. [2024-11-09 07:27:09,328 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 1723 transitions. Word has length 90 [2024-11-09 07:27:09,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:27:09,328 INFO L471 AbstractCegarLoop]: Abstraction has 1405 states and 1723 transitions. [2024-11-09 07:27:09,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 07:27:09,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 1723 transitions. [2024-11-09 07:27:09,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-09 07:27:09,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:27:09,332 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 07:27:09,351 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 07:27:09,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:27:09,533 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:27:09,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:27:09,534 INFO L85 PathProgramCache]: Analyzing trace with hash -853026837, now seen corresponding path program 1 times [2024-11-09 07:27:09,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:27:09,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695398347] [2024-11-09 07:27:09,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:27:09,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:27:09,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:27:09,740 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 07:27:09,741 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:27:09,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695398347] [2024-11-09 07:27:09,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695398347] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:27:09,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635924562] [2024-11-09 07:27:09,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:27:09,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:27:09,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:27:09,744 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:27:09,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 07:27:09,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:27:09,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 07:27:09,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:27:09,895 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 07:27:09,896 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:27:09,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635924562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:27:09,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:27:09,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-09 07:27:09,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060791504] [2024-11-09 07:27:09,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:27:09,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:27:09,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:27:09,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:27:09,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:27:09,899 INFO L87 Difference]: Start difference. First operand 1405 states and 1723 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 07:27:10,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:27:10,223 INFO L93 Difference]: Finished difference Result 2289 states and 2859 transitions. [2024-11-09 07:27:10,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:27:10,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 91 [2024-11-09 07:27:10,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:27:10,233 INFO L225 Difference]: With dead ends: 2289 [2024-11-09 07:27:10,233 INFO L226 Difference]: Without dead ends: 1648 [2024-11-09 07:27:10,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 93 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 07:27:10,236 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 34 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:27:10,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 300 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:27:10,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2024-11-09 07:27:10,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1475. [2024-11-09 07:27:10,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1475 states, 1052 states have (on average 1.220532319391635) internal successors, (1284), 1065 states have internal predecessors, (1284), 239 states have call successors, (239), 191 states have call predecessors, (239), 182 states have return successors, (284), 220 states have call predecessors, (284), 238 states have call successors, (284) [2024-11-09 07:27:10,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 1807 transitions. [2024-11-09 07:27:10,487 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 1807 transitions. Word has length 91 [2024-11-09 07:27:10,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:27:10,487 INFO L471 AbstractCegarLoop]: Abstraction has 1475 states and 1807 transitions. [2024-11-09 07:27:10,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 07:27:10,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 1807 transitions. [2024-11-09 07:27:10,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 07:27:10,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:27:10,494 INFO L215 NwaCegarLoop]: trace histogram [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 07:27:10,515 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 07:27:10,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:27:10,696 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:27:10,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:27:10,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1714848797, now seen corresponding path program 1 times [2024-11-09 07:27:10,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:27:10,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003267324] [2024-11-09 07:27:10,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:27:10,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:27:10,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:27:10,817 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-09 07:27:10,818 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:27:10,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003267324] [2024-11-09 07:27:10,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003267324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:27:10,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:27:10,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:27:10,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911734286] [2024-11-09 07:27:10,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:27:10,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:27:10,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:27:10,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:27:10,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:27:10,820 INFO L87 Difference]: Start difference. First operand 1475 states and 1807 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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 07:27:11,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:27:11,259 INFO L93 Difference]: Finished difference Result 2493 states and 3081 transitions. [2024-11-09 07:27:11,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:27:11,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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 93 [2024-11-09 07:27:11,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:27:11,273 INFO L225 Difference]: With dead ends: 2493 [2024-11-09 07:27:11,274 INFO L226 Difference]: Without dead ends: 1983 [2024-11-09 07:27:11,278 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 07:27:11,278 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 220 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:27:11,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 335 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:27:11,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1983 states. [2024-11-09 07:27:11,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1983 to 1945. [2024-11-09 07:27:11,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1945 states, 1392 states have (on average 1.221264367816092) internal successors, (1700), 1402 states have internal predecessors, (1700), 317 states have call successors, (317), 243 states have call predecessors, (317), 234 states have return successors, (360), 301 states have call predecessors, (360), 316 states have call successors, (360) [2024-11-09 07:27:11,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1945 states and 2377 transitions. [2024-11-09 07:27:11,579 INFO L78 Accepts]: Start accepts. Automaton has 1945 states and 2377 transitions. Word has length 93 [2024-11-09 07:27:11,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:27:11,580 INFO L471 AbstractCegarLoop]: Abstraction has 1945 states and 2377 transitions. [2024-11-09 07:27:11,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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 07:27:11,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 2377 transitions. [2024-11-09 07:27:11,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 07:27:11,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:27:11,584 INFO L215 NwaCegarLoop]: trace histogram [5, 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] [2024-11-09 07:27:11,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 07:27:11,584 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:27:11,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:27:11,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1601165599, now seen corresponding path program 1 times [2024-11-09 07:27:11,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:27:11,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023884859] [2024-11-09 07:27:11,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:27:11,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:27:11,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:27:11,761 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 17 proven. 14 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-09 07:27:11,762 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:27:11,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023884859] [2024-11-09 07:27:11,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023884859] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:27:11,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88080878] [2024-11-09 07:27:11,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:27:11,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:27:11,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:27:11,764 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:27:11,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 07:27:11,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:27:11,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 07:27:11,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:27:11,982 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 07:27:11,982 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:27:11,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88080878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:27:11,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:27:11,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2024-11-09 07:27:11,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226125135] [2024-11-09 07:27:11,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:27:11,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:27:11,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:27:11,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:27:11,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:27:11,985 INFO L87 Difference]: Start difference. First operand 1945 states and 2377 transitions. Second operand has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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 07:27:12,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:27:12,398 INFO L93 Difference]: Finished difference Result 2853 states and 3505 transitions. [2024-11-09 07:27:12,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:27:12,399 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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 100 [2024-11-09 07:27:12,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:27:12,409 INFO L225 Difference]: With dead ends: 2853 [2024-11-09 07:27:12,409 INFO L226 Difference]: Without dead ends: 1754 [2024-11-09 07:27:12,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 97 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 07:27:12,413 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 39 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:27:12,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 691 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:27:12,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2024-11-09 07:27:12,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1721. [2024-11-09 07:27:12,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1721 states, 1228 states have (on average 1.2109120521172638) internal successors, (1487), 1238 states have internal predecessors, (1487), 281 states have call successors, (281), 219 states have call predecessors, (281), 210 states have return successors, (308), 265 states have call predecessors, (308), 280 states have call successors, (308) [2024-11-09 07:27:12,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 1721 states and 2076 transitions. [2024-11-09 07:27:12,705 INFO L78 Accepts]: Start accepts. Automaton has 1721 states and 2076 transitions. Word has length 100 [2024-11-09 07:27:12,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:27:12,705 INFO L471 AbstractCegarLoop]: Abstraction has 1721 states and 2076 transitions. [2024-11-09 07:27:12,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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 07:27:12,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 2076 transitions. [2024-11-09 07:27:12,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 07:27:12,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:27:12,708 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 07:27:12,729 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 07:27:12,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 07:27:12,912 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:27:12,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:27:12,913 INFO L85 PathProgramCache]: Analyzing trace with hash -554480374, now seen corresponding path program 1 times [2024-11-09 07:27:12,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:27:12,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087332262] [2024-11-09 07:27:12,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:27:12,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:27:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:27:13,251 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 07:27:13,251 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:27:13,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087332262] [2024-11-09 07:27:13,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087332262] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:27:13,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171542521] [2024-11-09 07:27:13,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:27:13,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:27:13,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:27:13,254 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:27:13,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 07:27:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:27:13,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 07:27:13,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:27:13,424 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 07:27:13,424 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:27:13,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171542521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:27:13,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:27:13,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 17 [2024-11-09 07:27:13,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004378834] [2024-11-09 07:27:13,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:27:13,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:27:13,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:27:13,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:27:13,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-11-09 07:27:13,427 INFO L87 Difference]: Start difference. First operand 1721 states and 2076 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 07:27:13,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:27:13,896 INFO L93 Difference]: Finished difference Result 2268 states and 2727 transitions. [2024-11-09 07:27:13,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:27:13,897 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 07:27:13,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:27:13,908 INFO L225 Difference]: With dead ends: 2268 [2024-11-09 07:27:13,908 INFO L226 Difference]: Without dead ends: 1516 [2024-11-09 07:27:13,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2024-11-09 07:27:13,912 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 107 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:27:13,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 609 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:27:13,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2024-11-09 07:27:14,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1493. [2024-11-09 07:27:14,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1493 states, 1086 states have (on average 1.218232044198895) internal successors, (1323), 1094 states have internal predecessors, (1323), 233 states have call successors, (233), 177 states have call predecessors, (233), 172 states have return successors, (256), 223 states have call predecessors, (256), 232 states have call successors, (256) [2024-11-09 07:27:14,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 1812 transitions. [2024-11-09 07:27:14,189 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 1812 transitions. Word has length 102 [2024-11-09 07:27:14,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:27:14,190 INFO L471 AbstractCegarLoop]: Abstraction has 1493 states and 1812 transitions. [2024-11-09 07:27:14,190 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 07:27:14,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 1812 transitions. [2024-11-09 07:27:14,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 07:27:14,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:27:14,193 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 07:27:14,214 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 07:27:14,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-09 07:27:14,395 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:27:14,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:27:14,395 INFO L85 PathProgramCache]: Analyzing trace with hash -449667631, now seen corresponding path program 1 times [2024-11-09 07:27:14,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:27:14,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247799258] [2024-11-09 07:27:14,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:27:14,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:27:14,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:27:14,612 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 07:27:14,612 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:27:14,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247799258] [2024-11-09 07:27:14,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247799258] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:27:14,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398460878] [2024-11-09 07:27:14,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:27:14,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:27:14,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:27:14,615 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:27:14,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 07:27:14,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:27:14,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 07:27:14,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:27:14,761 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 07:27:14,762 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:27:14,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398460878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:27:14,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:27:14,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-11-09 07:27:14,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070851801] [2024-11-09 07:27:14,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:27:14,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:27:14,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:27:14,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:27:14,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:27:14,764 INFO L87 Difference]: Start difference. First operand 1493 states and 1812 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 07:27:15,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:27:15,050 INFO L93 Difference]: Finished difference Result 1792 states and 2170 transitions. [2024-11-09 07:27:15,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:27:15,050 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 07:27:15,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:27:15,057 INFO L225 Difference]: With dead ends: 1792 [2024-11-09 07:27:15,057 INFO L226 Difference]: Without dead ends: 1342 [2024-11-09 07:27:15,058 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 07:27:15,059 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 53 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:27:15,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 311 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:27:15,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2024-11-09 07:27:15,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1226. [2024-11-09 07:27:15,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 896 states have (on average 1.2165178571428572) internal successors, (1090), 902 states have internal predecessors, (1090), 191 states have call successors, (191), 138 states have call predecessors, (191), 137 states have return successors, (210), 187 states have call predecessors, (210), 190 states have call successors, (210) [2024-11-09 07:27:15,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1491 transitions. [2024-11-09 07:27:15,256 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1491 transitions. Word has length 104 [2024-11-09 07:27:15,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:27:15,257 INFO L471 AbstractCegarLoop]: Abstraction has 1226 states and 1491 transitions. [2024-11-09 07:27:15,257 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 07:27:15,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1491 transitions. [2024-11-09 07:27:15,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 07:27:15,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:27:15,259 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 07:27:15,279 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 07:27:15,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 07:27:15,460 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:27:15,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:27:15,460 INFO L85 PathProgramCache]: Analyzing trace with hash -849658830, now seen corresponding path program 1 times [2024-11-09 07:27:15,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:27:15,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727784739] [2024-11-09 07:27:15,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:27:15,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:27:15,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:27:15,644 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 07:27:15,644 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:27:15,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727784739] [2024-11-09 07:27:15,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727784739] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:27:15,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520875260] [2024-11-09 07:27:15,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:27:15,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:27:15,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:27:15,647 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:27:15,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 07:27:15,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:27:15,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 07:27:15,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:27:16,117 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 07:27:16,118 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:27:16,278 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 07:27:16,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520875260] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:27:16,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [682481392] [2024-11-09 07:27:16,281 INFO L159 IcfgInterpreter]: Started Sifa with 65 locations of interest [2024-11-09 07:27:16,282 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:27:16,282 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:27:16,282 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:27:16,282 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:27:22,647 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events1 with input of size 139 for LOIs [2024-11-09 07:27:22,828 INFO L197 IcfgInterpreter]: Interpreting procedure error1 with input of size 103 for LOIs [2024-11-09 07:27:22,902 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread1 with input of size 60 for LOIs [2024-11-09 07:27:22,915 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads1 with input of size 124 for LOIs [2024-11-09 07:27:23,700 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_write_p_triggered with input of size 125 for LOIs [2024-11-09 07:27:24,473 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_read_c_triggered with input of size 74 for LOIs [2024-11-09 07:27:24,520 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events1 with input of size 118 for LOIs [2024-11-09 07:27:24,597 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels1 with input of size 129 for LOIs [2024-11-09 07:27:24,688 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:27:39,932 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '80063#(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)))) (exists ((v_~c_last_read~0_10 Int) (v_~q_free~0_44 Int)) (and (<= v_~q_free~0_44 1) (not (= ~p_dw_st~0 0)) (<= 1 |#StackHeapBarrier|) (= v_~c_last_read~0_10 0) (= ~t1_pc~0 0) (<= ~q_buf_0~0 2147483647) (<= ~p_dw_pc~0 1) (= ~T1_E~0 2) (<= 0 ~p_dw_pc~0) (= ~m_st~0 0) (<= 0 ~p_num_write~0) (= 1 ~c_dr_i~0) (= ~t1_st~0 0) (= ~c_num_read~0 1) (= ~m_i~0 0) (<= 0 (+ ~q_buf_0~0 2147483648)) (= ~local~0 0) (= ~token~0 0) (= ~m_pc~0 0) (= ~p_dw_i~0 1) (= ~E_M~0 2) (= ~a_t~0 0) (= ~E_1~0 2) (= ~M_E~0 2) (<= 0 v_~q_free~0_44) (not (= v_~q_free~0_44 1)) (= ~t1_i~0 0))) (not (= ~c_num_read~0 ~p_num_write~0)) (= ~c_last_read~0 ~q_buf_0~0) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~c_dr_st~0 1))' at error location [2024-11-09 07:27:39,933 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 07:27:39,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:27:39,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 13 [2024-11-09 07:27:39,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247521761] [2024-11-09 07:27:39,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:27:39,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 07:27:39,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:27:39,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 07:27:39,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=2973, Unknown=0, NotChecked=0, Total=3306 [2024-11-09 07:27:39,937 INFO L87 Difference]: Start difference. First operand 1226 states and 1491 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 07:27:43,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:27:43,094 INFO L93 Difference]: Finished difference Result 2166 states and 2578 transitions. [2024-11-09 07:27:43,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-11-09 07:27:43,095 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 07:27:43,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:27:43,108 INFO L225 Difference]: With dead ends: 2166 [2024-11-09 07:27:43,109 INFO L226 Difference]: Without dead ends: 1984 [2024-11-09 07:27:43,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 274 SyntacticMatches, 6 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 4738 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=1088, Invalid=12252, Unknown=0, NotChecked=0, Total=13340 [2024-11-09 07:27:43,116 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 909 mSDsluCounter, 1132 mSDsCounter, 0 mSdLazyCounter, 1749 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 2150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 1749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:27:43,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [914 Valid, 1321 Invalid, 2150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 1749 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 07:27:43,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1984 states. [2024-11-09 07:27:43,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1984 to 1621. [2024-11-09 07:27:43,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1621 states, 1181 states have (on average 1.2066045723962744) internal successors, (1425), 1187 states have internal predecessors, (1425), 249 states have call successors, (249), 190 states have call predecessors, (249), 189 states have return successors, (268), 245 states have call predecessors, (268), 248 states have call successors, (268) [2024-11-09 07:27:43,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1621 states to 1621 states and 1942 transitions. [2024-11-09 07:27:43,427 INFO L78 Accepts]: Start accepts. Automaton has 1621 states and 1942 transitions. Word has length 104 [2024-11-09 07:27:43,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:27:43,428 INFO L471 AbstractCegarLoop]: Abstraction has 1621 states and 1942 transitions. [2024-11-09 07:27:43,429 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 07:27:43,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1621 states and 1942 transitions. [2024-11-09 07:27:43,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 07:27:43,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:27:43,432 INFO L215 NwaCegarLoop]: trace histogram [5, 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] [2024-11-09 07:27:43,451 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-09 07:27:43,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:27:43,632 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:27:43,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:27:43,633 INFO L85 PathProgramCache]: Analyzing trace with hash -5973149, now seen corresponding path program 1 times [2024-11-09 07:27:43,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:27:43,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244341121] [2024-11-09 07:27:43,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:27:43,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:27:43,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:27:44,272 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 19 proven. 21 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 07:27:44,272 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:27:44,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244341121] [2024-11-09 07:27:44,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244341121] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:27:44,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053036876] [2024-11-09 07:27:44,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:27:44,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:27:44,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:27:44,275 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:27:44,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 07:27:44,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:27:44,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 07:27:44,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:27:44,607 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 07:27:44,607 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:27:44,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053036876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:27:44,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:27:44,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [18] total 22 [2024-11-09 07:27:44,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528679763] [2024-11-09 07:27:44,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:27:44,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:27:44,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:27:44,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:27:44,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2024-11-09 07:27:44,609 INFO L87 Difference]: Start difference. First operand 1621 states and 1942 transitions. Second operand has 9 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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 07:27:45,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:27:45,405 INFO L93 Difference]: Finished difference Result 2530 states and 3070 transitions. [2024-11-09 07:27:45,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:27:45,406 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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 103 [2024-11-09 07:27:45,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:27:45,416 INFO L225 Difference]: With dead ends: 2530 [2024-11-09 07:27:45,416 INFO L226 Difference]: Without dead ends: 1699 [2024-11-09 07:27:45,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2024-11-09 07:27:45,420 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 435 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:27:45,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 397 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:27:45,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2024-11-09 07:27:45,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1659. [2024-11-09 07:27:45,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1659 states, 1215 states have (on average 1.1975308641975309) internal successors, (1455), 1221 states have internal predecessors, (1455), 249 states have call successors, (249), 194 states have call predecessors, (249), 193 states have return successors, (268), 245 states have call predecessors, (268), 248 states have call successors, (268) [2024-11-09 07:27:45,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 1972 transitions. [2024-11-09 07:27:45,763 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 1972 transitions. Word has length 103 [2024-11-09 07:27:45,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:27:45,764 INFO L471 AbstractCegarLoop]: Abstraction has 1659 states and 1972 transitions. [2024-11-09 07:27:45,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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 07:27:45,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 1972 transitions. [2024-11-09 07:27:45,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 07:27:45,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:27:45,768 INFO L215 NwaCegarLoop]: trace histogram [5, 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, 1] [2024-11-09 07:27:45,785 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-09 07:27:45,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:27:45,968 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:27:45,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:27:45,969 INFO L85 PathProgramCache]: Analyzing trace with hash 295992831, now seen corresponding path program 1 times [2024-11-09 07:27:45,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:27:45,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046426115] [2024-11-09 07:27:45,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:27:45,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:27:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:27:46,444 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 28 proven. 17 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 07:27:46,445 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:27:46,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046426115] [2024-11-09 07:27:46,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046426115] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:27:46,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492337808] [2024-11-09 07:27:46,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:27:46,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:27:46,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:27:46,447 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:27:46,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 07:27:46,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:27:46,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 07:27:46,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:27:46,667 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 07:27:46,668 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:27:46,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492337808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:27:46,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:27:46,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [16] total 18 [2024-11-09 07:27:46,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115426789] [2024-11-09 07:27:46,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:27:46,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:27:46,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:27:46,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:27:46,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2024-11-09 07:27:46,669 INFO L87 Difference]: Start difference. First operand 1659 states and 1972 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 07:27:47,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:27:47,461 INFO L93 Difference]: Finished difference Result 3124 states and 3729 transitions. [2024-11-09 07:27:47,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:27:47,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 104 [2024-11-09 07:27:47,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:27:47,477 INFO L225 Difference]: With dead ends: 3124 [2024-11-09 07:27:47,479 INFO L226 Difference]: Without dead ends: 1907 [2024-11-09 07:27:47,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2024-11-09 07:27:47,483 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 57 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:27:47,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 366 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:27:47,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1907 states. [2024-11-09 07:27:47,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1907 to 1773. [2024-11-09 07:27:47,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1773 states, 1289 states have (on average 1.1799844840961986) internal successors, (1521), 1301 states have internal predecessors, (1521), 270 states have call successors, (270), 209 states have call predecessors, (270), 212 states have return successors, (289), 264 states have call predecessors, (289), 269 states have call successors, (289) [2024-11-09 07:27:47,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2080 transitions. [2024-11-09 07:27:47,869 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2080 transitions. Word has length 104 [2024-11-09 07:27:47,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:27:47,869 INFO L471 AbstractCegarLoop]: Abstraction has 1773 states and 2080 transitions. [2024-11-09 07:27:47,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 07:27:47,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2080 transitions. [2024-11-09 07:27:47,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 07:27:47,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:27:47,873 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 07:27:47,895 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-09 07:27:48,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:27:48,074 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:27:48,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:27:48,075 INFO L85 PathProgramCache]: Analyzing trace with hash -677431702, now seen corresponding path program 1 times [2024-11-09 07:27:48,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:27:48,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38904644] [2024-11-09 07:27:48,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:27:48,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:27:48,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:27:48,121 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 07:27:48,121 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:27:48,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38904644] [2024-11-09 07:27:48,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38904644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:27:48,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:27:48,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:27:48,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126854117] [2024-11-09 07:27:48,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:27:48,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:27:48,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:27:48,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:27:48,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:27:48,124 INFO L87 Difference]: Start difference. First operand 1773 states and 2080 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 07:27:48,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:27:48,559 INFO L93 Difference]: Finished difference Result 2272 states and 2652 transitions. [2024-11-09 07:27:48,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:27:48,560 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 07:27:48,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:27:48,578 INFO L225 Difference]: With dead ends: 2272 [2024-11-09 07:27:48,578 INFO L226 Difference]: Without dead ends: 1763 [2024-11-09 07:27:48,580 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 07:27:48,583 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 153 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:27:48,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 253 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:27:48,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2024-11-09 07:27:48,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1754. [2024-11-09 07:27:48,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1754 states, 1272 states have (on average 1.1705974842767295) internal successors, (1489), 1284 states have internal predecessors, (1489), 269 states have call successors, (269), 208 states have call predecessors, (269), 211 states have return successors, (288), 263 states have call predecessors, (288), 268 states have call successors, (288) [2024-11-09 07:27:48,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 2046 transitions. [2024-11-09 07:27:48,935 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 2046 transitions. Word has length 108 [2024-11-09 07:27:48,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:27:48,936 INFO L471 AbstractCegarLoop]: Abstraction has 1754 states and 2046 transitions. [2024-11-09 07:27:48,936 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 07:27:48,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 2046 transitions. [2024-11-09 07:27:48,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-09 07:27:48,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:27:48,939 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 07:27:48,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 07:27:48,940 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:27:48,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:27:48,940 INFO L85 PathProgramCache]: Analyzing trace with hash 980638016, now seen corresponding path program 1 times [2024-11-09 07:27:48,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:27:48,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394863855] [2024-11-09 07:27:48,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:27:48,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:27:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:27:49,091 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 07:27:49,092 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:27:49,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394863855] [2024-11-09 07:27:49,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394863855] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:27:49,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469083491] [2024-11-09 07:27:49,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:27:49,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:27:49,092 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:27:49,094 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:27:49,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 07:27:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:27:49,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 07:27:49,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:27:49,287 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 07:27:49,288 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:27:49,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469083491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:27:49,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:27:49,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2024-11-09 07:27:49,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681615423] [2024-11-09 07:27:49,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:27:49,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:27:49,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:27:49,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:27:49,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:27:49,290 INFO L87 Difference]: Start difference. First operand 1754 states and 2046 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 07:27:49,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:27:49,839 INFO L93 Difference]: Finished difference Result 2274 states and 2640 transitions. [2024-11-09 07:27:49,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:27:49,839 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 07:27:49,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:27:49,850 INFO L225 Difference]: With dead ends: 2274 [2024-11-09 07:27:49,850 INFO L226 Difference]: Without dead ends: 1725 [2024-11-09 07:27:49,852 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 07:27:49,853 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 47 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:27:49,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 705 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:27:49,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1725 states. [2024-11-09 07:27:50,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1725 to 1665. [2024-11-09 07:27:50,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1665 states, 1211 states have (on average 1.171758876961189) internal successors, (1419), 1223 states have internal predecessors, (1419), 254 states have call successors, (254), 195 states have call predecessors, (254), 198 states have return successors, (273), 248 states have call predecessors, (273), 253 states have call successors, (273) [2024-11-09 07:27:50,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 1946 transitions. [2024-11-09 07:27:50,175 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 1946 transitions. Word has length 112 [2024-11-09 07:27:50,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:27:50,176 INFO L471 AbstractCegarLoop]: Abstraction has 1665 states and 1946 transitions. [2024-11-09 07:27:50,176 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 07:27:50,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 1946 transitions. [2024-11-09 07:27:50,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-09 07:27:50,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:27:50,179 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 07:27:50,201 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-09 07:27:50,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-09 07:27:50,380 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:27:50,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:27:50,380 INFO L85 PathProgramCache]: Analyzing trace with hash 2095804458, now seen corresponding path program 1 times [2024-11-09 07:27:50,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:27:50,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242925989] [2024-11-09 07:27:50,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:27:50,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:27:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:27:50,506 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 07:27:50,506 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:27:50,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242925989] [2024-11-09 07:27:50,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242925989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:27:50,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:27:50,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:27:50,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406527563] [2024-11-09 07:27:50,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:27:50,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:27:50,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:27:50,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:27:50,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:27:50,509 INFO L87 Difference]: Start difference. First operand 1665 states and 1946 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 07:27:51,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:27:51,129 INFO L93 Difference]: Finished difference Result 2414 states and 2791 transitions. [2024-11-09 07:27:51,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:27:51,129 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 07:27:51,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:27:51,142 INFO L225 Difference]: With dead ends: 2414 [2024-11-09 07:27:51,146 INFO L226 Difference]: Without dead ends: 1957 [2024-11-09 07:27:51,148 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 07:27:51,150 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 142 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:27:51,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 781 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:27:51,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1957 states. [2024-11-09 07:27:51,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1957 to 1923. [2024-11-09 07:27:51,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1923 states, 1373 states have (on average 1.1646030589949017) internal successors, (1599), 1391 states have internal predecessors, (1599), 302 states have call successors, (302), 237 states have call predecessors, (302), 246 states have return successors, (333), 296 states have call predecessors, (333), 301 states have call successors, (333) [2024-11-09 07:27:51,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1923 states to 1923 states and 2234 transitions. [2024-11-09 07:27:51,455 INFO L78 Accepts]: Start accepts. Automaton has 1923 states and 2234 transitions. Word has length 113 [2024-11-09 07:27:51,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:27:51,456 INFO L471 AbstractCegarLoop]: Abstraction has 1923 states and 2234 transitions. [2024-11-09 07:27:51,456 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 07:27:51,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1923 states and 2234 transitions. [2024-11-09 07:27:51,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-09 07:27:51,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:27:51,459 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 07:27:51,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 07:27:51,460 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:27:51,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:27:51,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1396937517, now seen corresponding path program 1 times [2024-11-09 07:27:51,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:27:51,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232912485] [2024-11-09 07:27:51,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:27:51,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:27:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:27:52,272 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 07:27:52,272 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:27:52,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232912485] [2024-11-09 07:27:52,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232912485] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:27:52,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100512036] [2024-11-09 07:27:52,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:27:52,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:27:52,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:27:52,274 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:27:52,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 07:27:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:27:52,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-09 07:27:52,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:27:53,362 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 07:27:53,363 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:27:55,051 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 07:27:55,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100512036] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:27:55,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1821747201] [2024-11-09 07:27:55,058 INFO L159 IcfgInterpreter]: Started Sifa with 68 locations of interest [2024-11-09 07:27:55,058 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:27:55,058 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:27:55,059 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:27:55,059 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:28:06,381 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events1 with input of size 150 for LOIs [2024-11-09 07:28:06,466 INFO L197 IcfgInterpreter]: Interpreting procedure error1 with input of size 13 for LOIs [2024-11-09 07:28:06,468 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread1 with input of size 7 for LOIs [2024-11-09 07:28:06,471 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads1 with input of size 114 for LOIs [2024-11-09 07:28:06,870 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_write_p_triggered with input of size 115 for LOIs [2024-11-09 07:28:07,173 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_read_c_triggered with input of size 21 for LOIs [2024-11-09 07:28:07,201 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events1 with input of size 108 for LOIs [2024-11-09 07:28:07,251 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels1 with input of size 119 for LOIs [2024-11-09 07:28:07,314 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:28:16,933 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '118651#(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 07:28:16,933 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 07:28:16,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:28:16,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 16] total 47 [2024-11-09 07:28:16,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697190813] [2024-11-09 07:28:16,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:28:16,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-09 07:28:16,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:28:16,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-09 07:28:16,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=765, Invalid=8355, Unknown=0, NotChecked=0, Total=9120 [2024-11-09 07:28:16,938 INFO L87 Difference]: Start difference. First operand 1923 states and 2234 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 07:28:32,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:28:32,172 INFO L93 Difference]: Finished difference Result 4533 states and 5383 transitions. [2024-11-09 07:28:32,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 228 states. [2024-11-09 07:28:32,172 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 07:28:32,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:28:32,186 INFO L225 Difference]: With dead ends: 4533 [2024-11-09 07:28:32,186 INFO L226 Difference]: Without dead ends: 3733 [2024-11-09 07:28:32,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 299 SyntacticMatches, 6 SemanticMatches, 316 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 40941 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=9677, Invalid=91129, Unknown=0, NotChecked=0, Total=100806 [2024-11-09 07:28:32,205 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 3076 mSDsluCounter, 2848 mSDsCounter, 0 mSdLazyCounter, 5055 mSolverCounterSat, 1595 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3077 SdHoareTripleChecker+Valid, 3019 SdHoareTripleChecker+Invalid, 6650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1595 IncrementalHoareTripleChecker+Valid, 5055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:28:32,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3077 Valid, 3019 Invalid, 6650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1595 Valid, 5055 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-09 07:28:32,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3733 states. [2024-11-09 07:28:32,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3733 to 2180. [2024-11-09 07:28:32,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2180 states, 1546 states have (on average 1.1623544631306597) internal successors, (1797), 1565 states have internal predecessors, (1797), 341 states have call successors, (341), 272 states have call predecessors, (341), 291 states have return successors, (384), 343 states have call predecessors, (384), 340 states have call successors, (384) [2024-11-09 07:28:32,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 2522 transitions. [2024-11-09 07:28:32,840 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 2522 transitions. Word has length 114 [2024-11-09 07:28:32,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:28:32,840 INFO L471 AbstractCegarLoop]: Abstraction has 2180 states and 2522 transitions. [2024-11-09 07:28:32,841 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 07:28:32,841 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 2522 transitions. [2024-11-09 07:28:32,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 07:28:32,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:28:32,844 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 07:28:32,865 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-09 07:28:33,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-09 07:28:33,049 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:28:33,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:28:33,049 INFO L85 PathProgramCache]: Analyzing trace with hash -297133395, now seen corresponding path program 1 times [2024-11-09 07:28:33,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:28:33,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105206956] [2024-11-09 07:28:33,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:28:33,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:28:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:28:33,331 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 07:28:33,331 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:28:33,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105206956] [2024-11-09 07:28:33,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105206956] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:28:33,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040527953] [2024-11-09 07:28:33,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:28:33,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:28:33,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:28:33,334 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:28:33,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-09 07:28:33,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:28:33,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 07:28:33,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:28:33,543 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 07:28:33,544 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:28:33,759 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 07:28:33,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040527953] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 07:28:33,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:28:33,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14, 8] total 20 [2024-11-09 07:28:33,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415491906] [2024-11-09 07:28:33,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:28:33,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:28:33,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:28:33,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:28:33,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2024-11-09 07:28:33,761 INFO L87 Difference]: Start difference. First operand 2180 states and 2522 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 07:28:34,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:28:34,941 INFO L93 Difference]: Finished difference Result 3508 states and 4075 transitions. [2024-11-09 07:28:34,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:28:34,941 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 07:28:34,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:28:34,954 INFO L225 Difference]: With dead ends: 3508 [2024-11-09 07:28:34,954 INFO L226 Difference]: Without dead ends: 2517 [2024-11-09 07:28:34,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2024-11-09 07:28:34,957 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 241 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:28:34,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 447 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:28:34,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2517 states. [2024-11-09 07:28:35,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2517 to 2260. [2024-11-09 07:28:35,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2260 states, 1591 states have (on average 1.1615336266499057) internal successors, (1848), 1613 states have internal predecessors, (1848), 360 states have call successors, (360), 281 states have call predecessors, (360), 307 states have return successors, (424), 366 states have call predecessors, (424), 359 states have call successors, (424) [2024-11-09 07:28:35,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 2260 states and 2632 transitions. [2024-11-09 07:28:35,604 INFO L78 Accepts]: Start accepts. Automaton has 2260 states and 2632 transitions. Word has length 115 [2024-11-09 07:28:35,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:28:35,605 INFO L471 AbstractCegarLoop]: Abstraction has 2260 states and 2632 transitions. [2024-11-09 07:28:35,605 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 07:28:35,605 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 2632 transitions. [2024-11-09 07:28:35,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 07:28:35,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:28:35,609 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 07:28:35,630 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-09 07:28:35,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-09 07:28:35,810 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:28:35,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:28:35,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1087850859, now seen corresponding path program 1 times [2024-11-09 07:28:35,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:28:35,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389551272] [2024-11-09 07:28:35,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:28:35,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:28:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:28:36,470 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 30 proven. 24 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-09 07:28:36,470 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:28:36,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389551272] [2024-11-09 07:28:36,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389551272] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:28:36,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20024416] [2024-11-09 07:28:36,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:28:36,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:28:36,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:28:36,473 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:28:36,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-09 07:28:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:28:36,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-09 07:28:36,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:28:37,475 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 07:28:37,475 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:28:38,987 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 07:28:38,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20024416] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:28:38,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1851456650] [2024-11-09 07:28:38,991 INFO L159 IcfgInterpreter]: Started Sifa with 69 locations of interest [2024-11-09 07:28:38,991 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:28:38,992 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:28:38,992 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:28:38,992 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:28:44,278 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events1 with input of size 151 for LOIs [2024-11-09 07:28:44,361 INFO L197 IcfgInterpreter]: Interpreting procedure error1 with input of size 77 for LOIs [2024-11-09 07:28:44,388 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread1 with input of size 7 for LOIs [2024-11-09 07:28:44,392 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads1 with input of size 115 for LOIs [2024-11-09 07:28:44,710 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_write_p_triggered with input of size 116 for LOIs [2024-11-09 07:28:45,037 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_read_c_triggered with input of size 21 for LOIs [2024-11-09 07:28:45,062 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events1 with input of size 109 for LOIs [2024-11-09 07:28:45,113 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels1 with input of size 120 for LOIs [2024-11-09 07:28:45,176 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:28:55,922 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '139129#(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 ~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)))) (exists ((v_~q_req_up~0_102 Int) (v_~q_free~0_102 Int)) (and (or (and (= v_~q_free~0_102 0) (= ~p_dw_pc~0 1) (= 2 ~p_dw_st~0)) (and (<= v_~q_free~0_102 1) (<= 0 ~p_dw_pc~0) (= ~p_dw_st~0 0))) (or (exists ((v_~p_dw_st~0_138 Int) (v_~p_dw_pc~0_48 Int)) (and (or (and (<= ~q_buf_0~0 2147483647) (<= 0 (+ ~q_buf_0~0 2147483648)) (= v_~p_dw_st~0_138 1) (= v_~q_req_up~0_102 1)) (and (= v_~p_dw_st~0_138 1) (= v_~p_dw_pc~0_48 0))) (or (and (exists ((|v_ULTIMATE.start_eval1_~tmp~2#1_70| Int)) (and (not (= |v_ULTIMATE.start_eval1_~tmp~2#1_70| 0)) (<= |v_ULTIMATE.start_eval1_~tmp~2#1_70| 2147483647) (<= 0 (+ |v_ULTIMATE.start_eval1_~tmp~2#1_70| 2147483648)))) (= v_~p_dw_pc~0_48 1)) (and (exists ((|v_ULTIMATE.start_eval1_~tmp~2#1_70| Int)) (and (not (= |v_ULTIMATE.start_eval1_~tmp~2#1_70| 0)) (<= |v_ULTIMATE.start_eval1_~tmp~2#1_70| 2147483647) (<= 0 (+ |v_ULTIMATE.start_eval1_~tmp~2#1_70| 2147483648)))) (= v_~p_dw_pc~0_48 0))))) (= ~p_dw_st~0 0)))) (= ~c_dr_st~0 1))' at error location [2024-11-09 07:28:55,922 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 07:28:55,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:28:55,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 18] total 49 [2024-11-09 07:28:55,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617747364] [2024-11-09 07:28:55,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:28:55,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-09 07:28:55,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:28:55,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-09 07:28:55,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=926, Invalid=9376, Unknown=0, NotChecked=0, Total=10302 [2024-11-09 07:28:55,926 INFO L87 Difference]: Start difference. First operand 2260 states and 2632 transitions. Second operand has 49 states, 35 states have (on average 6.085714285714285) internal successors, (213), 39 states have internal predecessors, (213), 26 states have call successors, (49), 17 states have call predecessors, (49), 21 states have return successors, (51), 24 states have call predecessors, (51), 26 states have call successors, (51) [2024-11-09 07:29:04,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:29:04,380 INFO L93 Difference]: Finished difference Result 4478 states and 5225 transitions. [2024-11-09 07:29:04,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2024-11-09 07:29:04,381 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 35 states have (on average 6.085714285714285) internal successors, (213), 39 states have internal predecessors, (213), 26 states have call successors, (49), 17 states have call predecessors, (49), 21 states have return successors, (51), 24 states have call predecessors, (51), 26 states have call successors, (51) Word has length 124 [2024-11-09 07:29:04,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:29:04,392 INFO L225 Difference]: With dead ends: 4478 [2024-11-09 07:29:04,392 INFO L226 Difference]: Without dead ends: 3407 [2024-11-09 07:29:04,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 326 SyntacticMatches, 2 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 15936 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=4360, Invalid=36646, Unknown=0, NotChecked=0, Total=41006 [2024-11-09 07:29:04,402 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 4723 mSDsluCounter, 1779 mSDsCounter, 0 mSdLazyCounter, 3828 mSolverCounterSat, 2568 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4723 SdHoareTripleChecker+Valid, 1952 SdHoareTripleChecker+Invalid, 6396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2568 IncrementalHoareTripleChecker+Valid, 3828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:29:04,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4723 Valid, 1952 Invalid, 6396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2568 Valid, 3828 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-09 07:29:04,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3407 states. [2024-11-09 07:29:04,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3407 to 2076. [2024-11-09 07:29:04,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2076 states, 1479 states have (on average 1.162947937795808) internal successors, (1720), 1500 states have internal predecessors, (1720), 320 states have call successors, (320), 249 states have call predecessors, (320), 275 states have return successors, (374), 327 states have call predecessors, (374), 319 states have call successors, (374) [2024-11-09 07:29:04,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2076 states to 2076 states and 2414 transitions. [2024-11-09 07:29:04,966 INFO L78 Accepts]: Start accepts. Automaton has 2076 states and 2414 transitions. Word has length 124 [2024-11-09 07:29:04,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:29:04,967 INFO L471 AbstractCegarLoop]: Abstraction has 2076 states and 2414 transitions. [2024-11-09 07:29:04,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 35 states have (on average 6.085714285714285) internal successors, (213), 39 states have internal predecessors, (213), 26 states have call successors, (49), 17 states have call predecessors, (49), 21 states have return successors, (51), 24 states have call predecessors, (51), 26 states have call successors, (51) [2024-11-09 07:29:04,967 INFO L276 IsEmpty]: Start isEmpty. Operand 2076 states and 2414 transitions. [2024-11-09 07:29:04,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 07:29:04,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:29:04,971 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 07:29:04,994 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-09 07:29:05,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-09 07:29:05,175 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:29:05,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:29:05,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1673632349, now seen corresponding path program 1 times [2024-11-09 07:29:05,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:29:05,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269856995] [2024-11-09 07:29:05,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:29:05,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:29:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:29:05,365 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 07:29:05,366 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:29:05,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269856995] [2024-11-09 07:29:05,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269856995] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:29:05,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936656787] [2024-11-09 07:29:05,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:29:05,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:29:05,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:29:05,368 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:29:05,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-09 07:29:05,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:29:05,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 07:29:05,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:29:05,619 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 07:29:05,619 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:29:05,858 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 07:29:05,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936656787] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 07:29:05,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:29:05,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 10] total 17 [2024-11-09 07:29:05,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468582434] [2024-11-09 07:29:05,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:29:05,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:29:05,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:29:05,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:29:05,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2024-11-09 07:29:05,861 INFO L87 Difference]: Start difference. First operand 2076 states and 2414 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 07:29:07,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:29:07,225 INFO L93 Difference]: Finished difference Result 2737 states and 3161 transitions. [2024-11-09 07:29:07,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:29:07,225 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 07:29:07,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:29:07,233 INFO L225 Difference]: With dead ends: 2737 [2024-11-09 07:29:07,233 INFO L226 Difference]: Without dead ends: 1850 [2024-11-09 07:29:07,236 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 07:29:07,236 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 336 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:29:07,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 361 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 07:29:07,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2024-11-09 07:29:07,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1807. [2024-11-09 07:29:07,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1807 states, 1280 states have (on average 1.15234375) internal successors, (1475), 1301 states have internal predecessors, (1475), 284 states have call successors, (284), 219 states have call predecessors, (284), 241 states have return successors, (333), 287 states have call predecessors, (333), 283 states have call successors, (333) [2024-11-09 07:29:07,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1807 states and 2092 transitions. [2024-11-09 07:29:07,729 INFO L78 Accepts]: Start accepts. Automaton has 1807 states and 2092 transitions. Word has length 125 [2024-11-09 07:29:07,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:29:07,730 INFO L471 AbstractCegarLoop]: Abstraction has 1807 states and 2092 transitions. [2024-11-09 07:29:07,730 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 07:29:07,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1807 states and 2092 transitions. [2024-11-09 07:29:07,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-09 07:29:07,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:29:07,735 INFO L215 NwaCegarLoop]: trace histogram [7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1] [2024-11-09 07:29:07,760 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-09 07:29:07,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-09 07:29:07,936 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:29:07,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:29:07,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1224578478, now seen corresponding path program 1 times [2024-11-09 07:29:07,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:29:07,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068105454] [2024-11-09 07:29:07,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:29:07,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:29:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:29:08,176 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 64 proven. 39 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-11-09 07:29:08,177 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:29:08,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068105454] [2024-11-09 07:29:08,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068105454] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:29:08,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657581938] [2024-11-09 07:29:08,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:29:08,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:29:08,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:29:08,180 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:29:08,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-09 07:29:08,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:29:08,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 07:29:08,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:29:08,427 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-09 07:29:08,428 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:29:08,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657581938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:29:08,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:29:08,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-09 07:29:08,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610146993] [2024-11-09 07:29:08,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:29:08,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:29:08,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:29:08,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:29:08,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:29:08,430 INFO L87 Difference]: Start difference. First operand 1807 states and 2092 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-09 07:29:09,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:29:09,122 INFO L93 Difference]: Finished difference Result 2214 states and 2567 transitions. [2024-11-09 07:29:09,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:29:09,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 160 [2024-11-09 07:29:09,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:29:09,129 INFO L225 Difference]: With dead ends: 2214 [2024-11-09 07:29:09,130 INFO L226 Difference]: Without dead ends: 693 [2024-11-09 07:29:09,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:29:09,134 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 62 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:29:09,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 344 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:29:09,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2024-11-09 07:29:09,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 693. [2024-11-09 07:29:09,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 474 states have (on average 1.1033755274261603) internal successors, (523), 484 states have internal predecessors, (523), 108 states have call successors, (108), 92 states have call predecessors, (108), 110 states have return successors, (137), 116 states have call predecessors, (137), 107 states have call successors, (137) [2024-11-09 07:29:09,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 768 transitions. [2024-11-09 07:29:09,491 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 768 transitions. Word has length 160 [2024-11-09 07:29:09,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:29:09,491 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 768 transitions. [2024-11-09 07:29:09,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-09 07:29:09,492 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 768 transitions. [2024-11-09 07:29:09,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-09 07:29:09,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:29:09,495 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 07:29:09,518 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-09 07:29:09,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-09 07:29:09,696 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:29:09,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:29:09,696 INFO L85 PathProgramCache]: Analyzing trace with hash -243798581, now seen corresponding path program 1 times [2024-11-09 07:29:09,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:29:09,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654830785] [2024-11-09 07:29:09,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:29:09,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:29:09,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:29:10,338 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 07:29:10,338 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:29:10,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654830785] [2024-11-09 07:29:10,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654830785] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:29:10,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218327236] [2024-11-09 07:29:10,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:29:10,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:29:10,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:29:10,340 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:29:10,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-09 07:29:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:29:10,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-09 07:29:10,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:29:11,805 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 07:29:11,806 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:29:13,527 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 07:29:13,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218327236] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:29:13,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1860460427] [2024-11-09 07:29:13,530 INFO L159 IcfgInterpreter]: Started Sifa with 68 locations of interest [2024-11-09 07:29:13,530 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:29:13,531 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:29:13,531 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:29:13,531 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:29:28,259 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events1 with input of size 142 for LOIs [2024-11-09 07:29:28,337 INFO L197 IcfgInterpreter]: Interpreting procedure error1 with input of size 17 for LOIs [2024-11-09 07:29:28,339 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread1 with input of size 7 for LOIs [2024-11-09 07:29:28,341 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads1 with input of size 115 for LOIs [2024-11-09 07:29:28,666 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_write_p_triggered with input of size 116 for LOIs [2024-11-09 07:29:28,936 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_read_c_triggered with input of size 21 for LOIs [2024-11-09 07:29:28,965 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events1 with input of size 109 for LOIs [2024-11-09 07:29:29,019 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels1 with input of size 120 for LOIs [2024-11-09 07:29:29,086 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:29:39,446 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '162779#(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 07:29:39,446 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 07:29:39,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:29:39,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 16] total 48 [2024-11-09 07:29:39,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793768034] [2024-11-09 07:29:39,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:29:39,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-09 07:29:39,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:29:39,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-09 07:29:39,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=649, Invalid=8471, Unknown=0, NotChecked=0, Total=9120 [2024-11-09 07:29:39,449 INFO L87 Difference]: Start difference. First operand 693 states and 768 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 07:29:47,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:29:47,170 INFO L93 Difference]: Finished difference Result 1270 states and 1415 transitions. [2024-11-09 07:29:47,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2024-11-09 07:29:47,171 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 07:29:47,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:29:47,174 INFO L225 Difference]: With dead ends: 1270 [2024-11-09 07:29:47,174 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 07:29:47,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 821 GetRequests, 583 SyntacticMatches, 17 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 18508 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=4190, Invalid=45316, Unknown=0, NotChecked=0, Total=49506 [2024-11-09 07:29:47,183 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 1578 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 3226 mSolverCounterSat, 927 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1578 SdHoareTripleChecker+Valid, 1400 SdHoareTripleChecker+Invalid, 4153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 927 IncrementalHoareTripleChecker+Valid, 3226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:29:47,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1578 Valid, 1400 Invalid, 4153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [927 Valid, 3226 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 07:29:47,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 07:29:47,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 07:29:47,184 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 07:29:47,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 07:29:47,188 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 220 [2024-11-09 07:29:47,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:29:47,188 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 07:29:47,189 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 07:29:47,189 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 07:29:47,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 07:29:47,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-09 07:29:47,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-09 07:29:47,209 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-09 07:29:47,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:29:47,395 INFO L407 BasicCegarLoop]: Path program 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] [2024-11-09 07:29:47,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 07:29:53,173 WARN L286 SmtUtils]: Spent 5.23s on a formula simplification. DAG size of input: 396 DAG size of output: 395 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-09 07:30:06,042 WARN L286 SmtUtils]: Spent 7.40s on a formula simplification. DAG size of input: 156 DAG size of output: 205 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-09 07:31:09,918 WARN L286 SmtUtils]: Spent 21.15s on a formula simplification. DAG size of input: 179 DAG size of output: 282 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-09 07:31:15,727 WARN L286 SmtUtils]: Spent 5.50s on a formula simplification. DAG size of input: 396 DAG size of output: 395 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-09 07:32:07,695 WARN L286 SmtUtils]: Spent 7.48s on a formula simplification. DAG size of input: 805 DAG size of output: 136 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-09 07:33:21,693 WARN L286 SmtUtils]: Spent 6.18s on a formula simplification. DAG size of input: 801 DAG size of output: 131 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-09 07:33:24,568 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 07:33:24,613 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:24,614 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:24,617 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 07:33:24,617 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:24,617 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:24,618 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:24,618 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:24,618 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:24,618 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:24,619 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:24,619 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:24,623 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:24,623 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:24,624 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:24,624 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:24,624 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:33:24,624 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:33:24,624 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 07:33:24,624 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:33:24,624 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:33:24,625 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 07:33:24,637 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 07:33:24,638 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:24,639 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:24,639 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 07:33:24,639 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:24,639 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:24,640 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:24,644 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:24,644 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:24,645 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:24,645 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:24,645 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:24,645 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:24,645 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:24,645 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:24,646 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:24,646 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:33:24,646 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:33:24,646 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 07:33:24,646 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:33:24,646 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:33:24,647 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 07:33:24,668 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:24,669 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:24,669 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 07:33:24,669 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:24,670 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:24,670 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:24,670 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:24,670 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:24,671 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:24,671 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:24,671 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:24,671 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:24,671 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:24,671 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:24,672 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:24,672 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:33:24,676 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:33:24,676 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 07:33:24,676 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:33:24,676 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:33:24,677 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 07:33:24,677 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 07:33:24,698 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:24,698 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:24,699 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 07:33:24,699 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:24,699 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:24,700 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:24,700 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:24,700 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:24,701 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:24,701 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:24,701 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:24,701 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:24,702 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:24,702 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:24,702 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:24,702 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:33:24,703 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:33:24,703 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 07:33:24,703 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:33:24,703 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:33:24,703 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 07:33:24,707 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:24,707 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:24,708 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 07:33:24,708 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:24,708 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:24,709 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:24,709 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:24,709 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:24,710 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:24,710 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:24,710 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:24,711 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:24,711 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:24,711 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:24,711 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:24,712 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:33:24,712 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:33:24,712 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 07:33:24,712 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:33:24,712 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:33:24,713 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 07:33:24,714 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 07:33:24,778 WARN L162 FloydHoareUtils]: Requires clause for immediate_notify contained old-variable. Original clause: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (= 2 |old(~m_st~0)|)) (.cse2 (= ~m_pc~0 1)) (.cse1 (= ~m_st~0 |old(~m_st~0)|)) (.cse22 (= |old(~t1_st~0)| 2))) (and (or (not .cse0) (and .cse1 (= ~t1_st~0 0)) .cse2) (or (and (= ~m_st~0 2) (= |old(~t1_st~0)| ~t1_st~0)) (not .cse3)) (let ((.cse15 (not (= |old(~m_st~0)| 0))) (.cse19 (= ~E_M~0 2)) (.cse20 (= ~token~0 ~local~0)) (.cse6 (not (= ~q_read_ev~0 1))) (.cse11 (= ~q_free~0 0)) (.cse13 (= ~q_req_up~0 0)) (.cse18 (not (= ~q_write_ev~0 1))) (.cse21 (= ~t1_pc~0 1)) (.cse4 (= ~c_dr_st~0 0)) (.cse23 (<= 2 ~E_1~0)) (.cse5 (= ~p_num_write~0 0)) (.cse7 (= ~c_num_read~0 0)) (.cse8 (= ~t1_i~0 1)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (not .cse2)) (.cse12 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (= ~p_dw_st~0 0)) (.cse16 (= ~c_dr_pc~0 0)) (.cse17 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse0 .cse10 .cse11 .cse12 .cse13 (= |old(~t1_st~0)| 0) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse21 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse22 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse21 .cse4 .cse23 .cse5 .cse3 .cse6 .cse7 .cse8 (= (+ ~local~0 1) ~token~0) .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18) (and .cse21 .cse4 .cse23 .cse5 .cse3 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse16 .cse17))) (or (and .cse1 (= 2 ~t1_st~0)) (not .cse22)))) Eliminated clause: (exists ((|old(~t1_st~0)| Int) (|old(~m_st~0)| Int)) (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (= 2 |old(~m_st~0)|)) (.cse2 (= ~m_pc~0 1)) (.cse1 (= ~m_st~0 |old(~m_st~0)|)) (.cse23 (= |old(~t1_st~0)| 2))) (and (or (not .cse0) (and .cse1 (= ~t1_st~0 0)) .cse2) (or (and (= ~m_st~0 2) (= |old(~t1_st~0)| ~t1_st~0)) (not .cse3)) (let ((.cse9 (not (= ~q_read_ev~0 1))) (.cse13 (= ~q_free~0 0)) (.cse14 (= ~q_req_up~0 0)) (.cse20 (not (= |old(~m_st~0)| 0))) (.cse18 (not (= ~q_write_ev~0 1))) (.cse21 (= ~E_M~0 2)) (.cse22 (= ~token~0 ~local~0)) (.cse4 (= ~t1_pc~0 1)) (.cse5 (= ~p_dw_pc~0 0)) (.cse6 (= ~c_dr_st~0 0)) (.cse7 (<= 2 ~E_1~0)) (.cse8 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse11 (= ~t1_i~0 1)) (.cse12 (= ~p_last_write~0 ~q_buf_0~0)) (.cse19 (not .cse2)) (.cse15 (= ~p_dw_st~0 0)) (.cse16 (= ~c_dr_pc~0 0)) (.cse17 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse3 .cse9 .cse10 .cse11 (= (+ ~local~0 1) ~token~0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse0 .cse19 .cse13 .cse14 (= |old(~t1_st~0)| 0) .cse15 .cse20 .cse16 .cse17 .cse18 .cse21 .cse22) (and .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse23 .cse15 .cse20 .cse16 .cse17 .cse18 .cse21 .cse22) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse3 .cse10 .cse11 .cse12 .cse19 .cse15 .cse16 .cse17))) (or (and .cse1 (= 2 ~t1_st~0)) (not .cse23))))) [2024-11-09 07:33:24,824 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-09 07:33:24,932 WARN L162 FloydHoareUtils]: Requires clause for update_channels1 contained old-variable. Original clause: (let ((.cse17 (= ~p_dw_pc~0 1))) (and (let ((.cse5 (= ~p_dw_st~0 0)) (.cse0 (= |old(~q_req_up~0)| 0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (not (= |old(~q_read_ev~0)| 0))) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse13 (not (= ~m_pc~0 1))) (.cse14 (not (= ~c_dr_st~0 0))) (.cse3 (= 1 ~c_dr_i~0)) (.cse16 (= ~c_dr_pc~0 1)) (.cse19 (= |old(~q_req_up~0)| 1)) (.cse15 (= ~q_free~0 0)) (.cse4 (= ~t1_st~0 0)) (.cse20 (not (= |old(~q_write_ev~0)| 0))) (.cse21 (not (= |old(~q_write_ev~0)| 1))) (.cse18 (not (= |old(~q_read_ev~0)| 1))) (.cse6 (= ~p_dw_i~0 1)) (.cse7 (= ~E_M~0 2)) (.cse9 (= ~token~0 ~local~0)) (.cse10 (= ~E_1~0 2))) (or (let ((.cse8 (select |#memory_int| 1))) (and (= ~p_num_write~0 0) .cse0 (= (select |#length| 3) 12) (<= 1 |#StackHeapBarrier|) (= ~c_num_read~0 0) .cse1 .cse2 (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 1) (= ~c_last_read~0 0) .cse3 (= 2 (select |#length| 1)) (= |old(~q_ev~0)| 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (= (select |#valid| 3) 1) (= 2 |old(~q_write_ev~0)|) .cse4 (= ~m_i~0 0) .cse5 (= (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) .cse6 (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= ~c_last_read~0 ~p_last_write~0) .cse7 (= ~a_t~0 0) (= (select .cse8 0) 48) (= ~c_dr_st~0 ~p_dw_st~0) .cse9 (= (select .cse8 1) 0) .cse10 (= ~M_E~0 2) (= ~t1_i~0 0))) (and (not .cse5) (let ((.cse11 (= (+ ~c_num_read~0 1) ~p_num_write~0))) (or (and .cse0 .cse1 .cse11 .cse12 .cse2 .cse13 .cse14 .cse3 .cse15 .cse16 .cse4 .cse17 .cse18 .cse6 .cse7 .cse9 .cse10) (and .cse1 .cse11 .cse12 .cse2 .cse19 .cse13 .cse14 .cse3 .cse15 .cse16 .cse4 .cse17 .cse18 .cse6 .cse7 .cse9 .cse10))) .cse20 .cse21) (and (= ~c_num_read~0 ~p_num_write~0) .cse1 .cse12 .cse2 .cse13 .cse14 .cse3 .cse16 (or (not .cse19) (not .cse15)) .cse4 .cse20 .cse21 .cse17 .cse18 .cse6 .cse7 .cse9 .cse10))) (or (= ~q_ev~0 0) .cse17) (= ~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)|))) Eliminated clause: (let ((.cse0 (= ~p_dw_pc~0 1))) (and (or (= ~q_ev~0 0) .cse0) (let ((.cse21 (= ~c_dr_st~0 0))) (let ((.cse5 (not (= ~q_read_ev~0 1))) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (not (= ~q_write_ev~0 0))) (.cse9 (not (= ~m_pc~0 1))) (.cse10 (not .cse21)) (.cse13 (not (= ~q_read_ev~0 0))) (.cse14 (= ~c_dr_pc~0 1)) (.cse4 (= ~q_req_up~0 1)) (.cse12 (= ~q_free~0 0)) (.cse3 (not (= ~q_write_ev~0 1))) (.cse18 (= ~token~0 ~local~0)) (.cse11 (= 1 ~c_dr_i~0)) (.cse20 (= ~q_req_up~0 0)) (.cse15 (= ~t1_st~0 0)) (.cse1 (= ~p_dw_st~0 0)) (.cse16 (= ~p_dw_i~0 1)) (.cse17 (= ~E_M~0 2)) (.cse19 (= ~E_1~0 2))) (or (and (not .cse1) .cse2 .cse3 (let ((.cse7 (= (+ ~c_num_read~0 1) ~p_num_write~0))) (or (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse0 .cse16 .cse17 .cse18 .cse19) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse15 .cse0 .cse16 .cse17 .cse18 .cse19)))) (and .cse5 (= ~c_num_read~0 ~p_num_write~0) .cse6 .cse8 .cse2 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse0 (or (not .cse4) (not .cse12)) .cse16 .cse3 .cse17 .cse18 .cse19) (let ((.cse22 (select |#memory_int| 1))) (and (= ~p_dw_pc~0 0) .cse21 (= ~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) (= ~m_st~0 0) (= ~q_free~0 1) (= ~c_last_read~0 0) .cse11 (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) .cse20 .cse15 (= ~m_i~0 0) (= ~q_write_ev~0 2) .cse1 (= (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) .cse16 (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) .cse17 (= ~a_t~0 0) (= (select .cse22 0) 48) (= (select .cse22 1) 0) .cse19 (= ~M_E~0 2) (= ~t1_i~0 0)))))))) [2024-11-09 07:33:25,027 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:25,027 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:25,028 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 07:33:25,028 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:25,028 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:25,028 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:25,029 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:25,029 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:25,029 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:25,029 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:25,029 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:25,030 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:25,030 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:25,030 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:25,030 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:25,030 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:33:25,030 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:33:25,030 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 07:33:25,031 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:33:25,031 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:33:25,031 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 07:33:25,031 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:25,032 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:25,032 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 07:33:25,032 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:25,033 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:25,033 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:25,033 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:25,033 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:25,034 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:25,034 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:25,034 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:25,034 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:25,034 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:25,035 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:25,035 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:25,035 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:33:25,035 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:33:25,035 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 07:33:25,035 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:33:25,036 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:33:25,036 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 07:33:25,179 WARN L162 FloydHoareUtils]: Requires clause for activate_threads2 contained old-variable. Original clause: (let ((.cse6 (= ~m_pc~0 ~t1_pc~0)) (.cse25 (= ~m_pc~0 1)) (.cse21 (= 2 |old(~m_st~0)|)) (.cse26 (= ~m_st~0 |old(~m_st~0)|)) (.cse22 (= |old(~t1_st~0)| 2))) (and (let ((.cse13 (not (= |old(~m_st~0)| 0))) (.cse19 (= ~t1_pc~0 1)) (.cse20 (<= 2 ~E_1~0)) (.cse24 (= (+ ~local~0 1) ~token~0)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (not (= ~q_read_ev~0 1))) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (not .cse25)) (.cse8 (= ~q_free~0 0)) (.cse9 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse10 (= ~q_req_up~0 0)) (.cse11 (= |old(~t1_st~0)| 0)) (.cse12 (= ~p_dw_st~0 0)) (.cse14 (= ~c_dr_pc~0 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (not (= ~q_write_ev~0 1))) (.cse17 (= ~E_M~0 2)) (.cse18 (= ~token~0 ~local~0)) (.cse23 (= ~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) (and .cse19 .cse0 .cse20 .cse1 .cse21 .cse2 .cse3 .cse4 .cse5 .cse8 .cse9 .cse10 .cse22 .cse12 .cse14 .cse15 .cse16 .cse17) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse9 .cse10 .cse22 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse0 .cse20 .cse1 .cse21 .cse2 .cse3 .cse4 .cse5 .cse8 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse23) (and .cse19 .cse0 .cse20 .cse1 .cse21 .cse2 .cse3 .cse4 .cse24 .cse5 .cse8 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16) (and .cse19 .cse0 .cse20 .cse1 .cse21 .cse3 .cse4 .cse5 .cse7 .cse9 .cse12 .cse14 .cse15) (and .cse19 .cse0 .cse20 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse22 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse23) (and .cse19 .cse0 .cse20 .cse1 .cse2 .cse3 .cse4 .cse24 .cse5 .cse8 .cse9 .cse10 .cse22 .cse12 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse23))) (or (not .cse6) (and .cse26 (= ~t1_st~0 0)) .cse25) (or (and (= ~m_st~0 2) (= |old(~t1_st~0)| ~t1_st~0)) (not .cse21)) (or (and .cse26 (= 2 ~t1_st~0)) (not .cse22)))) Eliminated clause: (exists ((|old(~t1_st~0)| Int) (|old(~m_st~0)| Int)) (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~m_pc~0 1)) (.cse8 (= 2 |old(~m_st~0)|)) (.cse1 (= ~m_st~0 |old(~m_st~0)|)) (.cse21 (= |old(~t1_st~0)| 2))) (and (or (not .cse0) (and .cse1 (= ~t1_st~0 0)) .cse2) (let ((.cse26 (not (= |old(~m_st~0)| 0))) (.cse25 (= |old(~t1_st~0)| 0)) (.cse12 (= (+ ~local~0 1) ~token~0)) (.cse9 (not (= ~q_read_ev~0 1))) (.cse14 (= ~q_free~0 0)) (.cse15 (= ~q_req_up~0 0)) (.cse19 (not (= ~q_write_ev~0 1))) (.cse22 (= ~E_M~0 2)) (.cse23 (= ~token~0 ~local~0)) (.cse24 (= ~E_1~0 2)) (.cse3 (= ~t1_pc~0 1)) (.cse4 (= ~p_dw_pc~0 0)) (.cse5 (= ~c_dr_st~0 0)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse11 (= ~t1_i~0 1)) (.cse13 (= ~p_last_write~0 ~q_buf_0~0)) (.cse20 (not .cse2)) (.cse16 (= ~p_dw_st~0 0)) (.cse17 (= ~c_dr_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse13 .cse20 .cse14 .cse15 .cse21 .cse16 .cse17 .cse18 .cse19 .cse22 .cse23 .cse24) (and .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse13 .cse0 .cse20 .cse14 .cse15 .cse25 .cse16 .cse26 .cse17 .cse18 .cse19 .cse22 .cse23) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse21 .cse16 .cse17 .cse18 .cse19 .cse22) (and .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse21 .cse16 .cse26 .cse17 .cse18 .cse19 .cse22 .cse23) (and .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse13 .cse0 .cse20 .cse14 .cse15 .cse25 .cse16 .cse17 .cse18 .cse19 .cse22 .cse23 .cse24) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21 .cse16 .cse17 .cse18 .cse19 .cse22) (and .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse22 .cse23 .cse24) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse20 .cse16 .cse17 .cse18))) (or (and (= ~m_st~0 2) (= |old(~t1_st~0)| ~t1_st~0)) (not .cse8)) (or (and .cse1 (= 2 ~t1_st~0)) (not .cse21))))) [2024-11-09 07:33:25,340 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-09 07:33:25,434 WARN L162 FloydHoareUtils]: Requires clause for activate_threads1 contained old-variable. Original clause: (let ((.cse0 (= ~p_dw_pc~0 1))) (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (or .cse0 (and (= ~c_dr_st~0 0) (= ~p_dw_st~0 0))) (let ((.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (not (= ~q_write_ev~0 0))) (.cse4 (not (= ~m_pc~0 1))) (.cse5 (= 1 ~c_dr_i~0)) (.cse9 (= ~q_free~0 0)) (.cse6 (not (= ~q_read_ev~0 0))) (.cse14 (= ~q_req_up~0 0)) (.cse7 (= ~c_dr_pc~0 1)) (.cse8 (= ~t1_st~0 0)) (.cse10 (= ~p_dw_i~0 1)) (.cse11 (= ~E_M~0 2)) (.cse12 (= ~token~0 ~local~0)) (.cse13 (= ~E_1~0 2))) (or (and (not (= |old(~c_dr_st~0)| 0)) (= ~c_num_read~0 ~p_num_write~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse0 (or (not (= ~q_req_up~0 1)) (not .cse9)) .cse10 (not (= ~q_write_ev~0 1)) .cse11 .cse12 .cse13) (let ((.cse15 (select |#memory_int| 1))) (and (= ~p_num_write~0 0) (= (select |#length| 3) 12) (<= 1 |#StackHeapBarrier|) (= ~c_num_read~0 0) .cse1 .cse2 (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 1) (= ~c_last_read~0 0) .cse5 (= 2 (select |#length| 1)) (= ~c_dr_pc~0 ~p_dw_pc~0) (= (select |#valid| 3) 1) .cse14 .cse8 (= ~q_ev~0 0) (= ~m_i~0 0) (= ~q_write_ev~0 2) (= (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) .cse10 (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= ~c_last_read~0 ~p_last_write~0) .cse11 (= ~a_t~0 0) (= (select .cse15 0) 48) .cse12 (= (select .cse15 1) 0) .cse13 (= ~M_E~0 2) (= ~t1_i~0 0))) (and (not (= ~q_read_ev~0 1)) .cse1 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse2 .cse3 .cse4 .cse5 .cse9 .cse6 .cse14 .cse7 .cse8 .cse0 .cse10 .cse11 .cse12 (not (= |old(~p_dw_st~0)| 0)) .cse13))))) Eliminated clause: (let ((.cse9 (= ~p_dw_pc~0 1)) (.cse4 (= ~c_dr_st~0 0)) (.cse15 (= ~p_dw_st~0 0))) (and (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (not (= ~q_write_ev~0 0))) (.cse3 (not (= ~m_pc~0 1))) (.cse10 (= ~q_free~0 0)) (.cse6 (not (= ~q_read_ev~0 0))) (.cse7 (= ~c_dr_pc~0 1)) (.cse13 (= ~token~0 ~local~0)) (.cse5 (= 1 ~c_dr_i~0)) (.cse16 (= ~q_req_up~0 0)) (.cse8 (= ~t1_st~0 0)) (.cse11 (= ~p_dw_i~0 1)) (.cse12 (= ~E_M~0 2)) (.cse14 (= ~E_1~0 2))) (or (and (= ~c_num_read~0 ~p_num_write~0) .cse0 .cse1 .cse2 .cse3 (not .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 (or (not (= ~q_req_up~0 1)) (not .cse10)) .cse11 (not (= ~q_write_ev~0 1)) .cse12 .cse13 .cse14) (and (not .cse15) (not (= ~q_read_ev~0 1)) .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse1 .cse2 .cse3 .cse5 .cse10 .cse6 .cse16 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (let ((.cse17 (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) (= ~m_st~0 0) (= ~q_free~0 1) (= ~c_last_read~0 0) .cse5 (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) .cse16 .cse8 (= ~q_ev~0 0) (= ~m_i~0 0) (= ~q_write_ev~0 2) (= (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) .cse11 (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) .cse12 (= ~a_t~0 0) (= (select .cse17 0) 48) (= (select .cse17 1) 0) .cse14 (= ~M_E~0 2) (= ~t1_i~0 0))))) (or .cse9 (and .cse4 .cse15)))) [2024-11-09 07:33:25,485 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:25,486 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:25,486 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 07:33:25,486 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:25,486 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:25,486 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:25,487 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:25,487 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:25,487 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:25,487 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:25,488 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:25,492 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:25,492 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:25,492 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:25,492 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:25,493 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:33:25,493 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:33:25,493 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 07:33:25,493 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:33:25,493 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:33:25,493 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 07:33:25,493 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:25,494 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:25,494 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 07:33:25,494 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:25,494 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:25,494 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:25,495 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:25,495 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:25,495 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:25,495 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:25,495 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:25,495 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:25,495 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:25,495 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:25,495 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:25,496 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:33:25,496 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:33:25,500 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 07:33:25,500 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:33:25,500 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:33:25,500 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 07:33:25,686 WARN L162 FloydHoareUtils]: Requires clause for fire_delta_events2 contained old-variable. Original clause: (and (let ((.cse20 (= ~m_st~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse11 (= 2 ~t1_st~0)) (.cse14 (<= 2 |old(~E_1~0)|)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= 2 |old(~E_1~0)|)) (.cse4 (not (= ~q_read_ev~0 1))) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= 2 |old(~E_M~0)|)) (.cse9 (not (= ~m_pc~0 1))) (.cse10 (= ~q_free~0 0)) (.cse12 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse13 (= ~q_req_up~0 0)) (.cse15 (= ~p_dw_st~0 0)) (.cse16 (= ~c_dr_pc~0 0)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (not (= ~q_write_ev~0 1))) (.cse19 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse7 .cse8 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse12 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse20 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 (= (+ ~local~0 1) ~token~0) .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~m_pc~0 ~t1_pc~0) .cse8 .cse9 .cse10 .cse12 .cse13 (= ~t1_st~0 0) .cse15 .cse16 .cse17 .cse18 .cse19))) (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 2)) Eliminated clause: (and (let ((.cse6 (= ~m_st~0 2)) (.cse9 (not (= ~m_pc~0 1))) (.cse17 (= ~token~0 ~local~0)) (.cse18 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~c_dr_st~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~p_num_write~0 0)) (.cse13 (not (= ~q_read_ev~0 1))) (.cse5 (= ~c_num_read~0 0)) (.cse7 (= ~t1_i~0 1)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse14 (= ~q_free~0 0)) (.cse19 (= 2 ~t1_st~0)) (.cse15 (= ~q_req_up~0 0)) (.cse10 (= ~p_dw_st~0 0)) (.cse11 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (not (= ~q_write_ev~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse4 .cse13 .cse5 .cse6 .cse7 .cse8 .cse14 .cse15 .cse10 .cse11 .cse12 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse5 .cse6 .cse7 .cse8 .cse14 .cse19 .cse15 .cse10 .cse11 .cse12 .cse16) (and .cse0 .cse1 .cse2 .cse4 .cse13 .cse5 .cse7 .cse8 .cse9 .cse14 .cse19 .cse15 .cse10 .cse11 .cse12 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse4 .cse13 .cse5 .cse7 .cse8 (= ~m_pc~0 ~t1_pc~0) .cse9 .cse14 .cse15 (= ~t1_st~0 0) .cse10 .cse11 .cse12 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse5 .cse7 (= (+ ~local~0 1) ~token~0) .cse8 .cse14 .cse19 .cse15 .cse10 .cse11 .cse12 .cse16))) (= ~E_M~0 2)) [2024-11-09 07:33:25,803 WARN L162 FloydHoareUtils]: Requires clause for fire_delta_events1 contained old-variable. Original clause: (and (let ((.cse16 (= ~c_dr_st~0 0))) (let ((.cse3 (not (= ~m_pc~0 1))) (.cse4 (not .cse16)) (.cse8 (= ~c_dr_pc~0 1)) (.cse10 (= ~p_dw_pc~0 1)) (.cse6 (= ~q_free~0 0)) (.cse11 (not (= |old(~q_read_ev~0)| 1))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= 1 ~c_dr_i~0)) (.cse7 (= ~q_req_up~0 0)) (.cse9 (= ~t1_st~0 0)) (.cse0 (= ~p_dw_st~0 0)) (.cse12 (= ~p_dw_i~0 1)) (.cse13 (= ~E_M~0 2)) (.cse14 (= ~token~0 ~local~0)) (.cse15 (= ~E_1~0 2))) (or (and (not .cse0) .cse1 (= (+ ~c_num_read~0 1) ~p_num_write~0) (not (= |old(~q_read_ev~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and (= ~c_num_read~0 ~p_num_write~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse9 (not (= |old(~q_write_ev~0)| 0)) (not (= |old(~q_write_ev~0)| 1)) .cse10 (or (not (= ~q_req_up~0 1)) (not .cse6)) .cse11 .cse12 .cse13 .cse14 .cse15) (let ((.cse17 (select |#memory_int| 1))) (and .cse16 (= ~p_num_write~0 0) (= (select |#length| 3) 12) (<= 1 |#StackHeapBarrier|) (= ~c_num_read~0 0) .cse1 .cse2 (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 1) (= ~c_last_read~0 0) .cse5 (= 2 (select |#length| 1)) (= ~c_dr_pc~0 ~p_dw_pc~0) (= (select |#valid| 3) 1) .cse7 (= 2 |old(~q_write_ev~0)|) .cse9 (= ~q_ev~0 0) (= ~m_i~0 0) .cse0 (= (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) .cse12 (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= ~c_last_read~0 ~p_last_write~0) .cse13 (= ~a_t~0 0) (= (select .cse17 0) 48) .cse14 (= (select .cse17 1) 0) .cse15 (= ~M_E~0 2) (= ~t1_i~0 0)))))) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0)) Eliminated clause: (let ((.cse0 (= ~c_dr_st~0 0))) (let ((.cse4 (= ~p_dw_st~0 0)) (.cse9 (not (= ~q_read_ev~0 1))) (.cse10 (= ~p_last_write~0 ~q_buf_0~0)) (.cse11 (= ~m_pc~0 ~t1_pc~0)) (.cse12 (not (= ~m_pc~0 1))) (.cse13 (not .cse0)) (.cse1 (= 1 ~c_dr_i~0)) (.cse16 (= ~q_free~0 0)) (.cse2 (= ~q_req_up~0 0)) (.cse14 (= ~c_dr_pc~0 1)) (.cse3 (= ~t1_st~0 0)) (.cse15 (= ~p_dw_pc~0 1)) (.cse5 (= ~p_dw_i~0 1)) (.cse6 (= ~E_M~0 2)) (.cse17 (= ~token~0 ~local~0)) (.cse8 (= ~E_1~0 2))) (or (let ((.cse7 (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) (= ~m_st~0 0) (= ~q_free~0 1) (= ~c_last_read~0 0) .cse1 (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) .cse2 .cse3 (= ~q_ev~0 0) (= ~m_i~0 0) (= ~q_write_ev~0 2) .cse4 (= (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) .cse5 (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) .cse6 (= ~a_t~0 0) (= (select .cse7 0) 48) (= (select .cse7 1) 0) .cse8 (= ~M_E~0 2) (= ~t1_i~0 0))) (and .cse9 (= ~c_num_read~0 ~p_num_write~0) .cse10 .cse11 (not (= ~q_write_ev~0 0)) .cse12 .cse13 .cse1 .cse14 .cse3 .cse15 (or (not (= ~q_req_up~0 1)) (not .cse16)) .cse5 (not (= ~q_write_ev~0 1)) .cse6 .cse17 .cse8) (and (not .cse4) .cse9 .cse10 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse11 .cse12 .cse13 .cse1 .cse16 (not (= ~q_read_ev~0 0)) .cse2 .cse14 .cse3 .cse15 .cse5 .cse6 .cse17 .cse8)))) [2024-11-09 07:33:25,878 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:25,878 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:25,878 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 07:33:25,879 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:25,879 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:25,879 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:25,879 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:25,879 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:25,879 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:25,880 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:25,880 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:25,881 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:25,884 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:25,884 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:25,885 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:25,885 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:33:25,885 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:33:25,885 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 07:33:25,885 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:33:25,885 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:33:25,885 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 07:33:25,886 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:25,887 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:25,887 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 07:33:25,887 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:25,887 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:25,888 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:25,888 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:25,888 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:25,888 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:25,888 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:25,889 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:25,889 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:25,889 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:25,889 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:25,889 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:25,889 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:33:25,890 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:33:25,890 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 07:33:25,890 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:33:25,890 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:33:25,890 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 07:33:26,040 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:26,041 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:26,041 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 07:33:26,042 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:26,042 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:26,042 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:26,042 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:26,043 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:26,043 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:26,043 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:26,043 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:26,044 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:26,044 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:26,044 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:26,044 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:26,044 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:33:26,045 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:33:26,045 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 07:33:26,045 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:33:26,045 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:33:26,045 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 07:33:26,046 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:26,047 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:26,047 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 07:33:26,047 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:26,048 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:26,048 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:26,048 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:26,048 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:26,048 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:26,049 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:26,049 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:26,049 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:26,049 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:26,049 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:26,050 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:26,050 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:33:26,050 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:33:26,050 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 07:33:26,050 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:33:26,051 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:33:26,051 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 07:33:26,172 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:26,172 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:26,173 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 07:33:26,173 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:26,173 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:26,174 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:26,174 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:26,174 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:26,175 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:26,175 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:26,175 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:26,175 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:26,176 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:26,176 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:26,176 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:26,176 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:33:26,176 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:33:26,177 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 07:33:26,177 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:33:26,177 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:33:26,177 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 07:33:26,178 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:26,178 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:26,179 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 07:33:26,179 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:26,179 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:26,179 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:26,180 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:26,180 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:26,180 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:26,181 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:26,181 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:26,181 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:26,181 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:26,181 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:26,182 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:26,182 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:33:26,182 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:33:26,182 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 07:33:26,182 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:33:26,183 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:33:26,183 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 07:33:26,404 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:26,405 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:26,405 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 07:33:26,406 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:26,406 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:26,406 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:26,407 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:26,407 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:26,407 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:26,407 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:26,408 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:26,408 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:26,408 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:26,408 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:26,408 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:26,409 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:33:26,409 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:33:26,409 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 07:33:26,409 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:33:26,409 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:33:26,409 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 07:33:26,410 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 07:33:26,411 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:26,411 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:26,412 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 07:33:26,412 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:26,412 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:26,413 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:26,413 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:26,413 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:26,414 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:26,414 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:26,414 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:26,414 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:26,415 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:26,415 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:26,415 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:26,415 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:33:26,415 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:33:26,416 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 07:33:26,416 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:33:26,416 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:33:26,416 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 07:33:26,417 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 07:33:26,678 WARN L162 FloydHoareUtils]: Requires clause for reset_delta_events1 contained old-variable. Original clause: (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (let ((.cse21 (= ~q_free~0 0)) (.cse23 (= |old(~q_write_ev~0)| 1)) (.cse18 (= ~c_dr_st~0 0)) (.cse24 (= ~p_dw_st~0 0))) (let ((.cse19 (not .cse24)) (.cse20 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse13 (not (= |old(~q_read_ev~0)| 1))) (.cse22 (= ~q_req_up~0 0)) (.cse0 (= ~c_num_read~0 ~p_num_write~0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (not (= |old(~q_read_ev~0)| 0))) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (not (= ~m_pc~0 1))) (.cse5 (not .cse18)) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (= ~c_dr_pc~0 1)) (.cse8 (= ~t1_st~0 0)) (.cse9 (not (= |old(~q_write_ev~0)| 0))) (.cse10 (not .cse23)) (.cse11 (= ~p_dw_pc~0 1)) (.cse12 (or (not (= ~q_req_up~0 1)) (not .cse21))) (.cse14 (= ~p_dw_i~0 1)) (.cse15 (= ~E_M~0 2)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse19 .cse1 .cse20 .cse2 .cse3 .cse4 .cse6 .cse21 .cse22 .cse23 .cse7 .cse8 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse19 .cse1 .cse20 .cse2 .cse3 .cse4 .cse5 .cse6 .cse21 .cse22 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17) (let ((.cse25 (select |#memory_int| 1))) (and .cse18 (= ~p_num_write~0 0) (= (select |#length| 3) 12) (<= 1 |#StackHeapBarrier|) (= ~c_num_read~0 0) .cse1 .cse3 (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 1) (= ~c_last_read~0 0) .cse6 (= 2 (select |#length| 1)) (= ~c_dr_pc~0 ~p_dw_pc~0) (= (select |#valid| 3) 1) .cse22 (= 2 |old(~q_write_ev~0)|) .cse8 (= ~q_ev~0 0) (= ~m_i~0 0) .cse24 (= (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) .cse14 (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= ~c_last_read~0 ~p_last_write~0) .cse15 (= ~a_t~0 0) (= (select .cse25 0) 48) .cse16 (= (select .cse25 1) 0) .cse17 (= ~M_E~0 2) (= ~t1_i~0 0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse14 .cse15 .cse16 .cse17))))) Eliminated clause: (let ((.cse25 (= ~q_write_ev~0 1)) (.cse17 (= ~q_free~0 0)) (.cse0 (= ~c_dr_st~0 0)) (.cse4 (= ~p_dw_st~0 0))) (let ((.cse9 (not .cse4)) (.cse10 (not (= ~q_read_ev~0 1))) (.cse12 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse2 (= ~q_req_up~0 0)) (.cse23 (= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~p_last_write~0 ~q_buf_0~0)) (.cse13 (= ~m_pc~0 ~t1_pc~0)) (.cse14 (not (= ~q_write_ev~0 0))) (.cse15 (not (= ~m_pc~0 1))) (.cse16 (not .cse0)) (.cse1 (= 1 ~c_dr_i~0)) (.cse18 (not (= ~q_read_ev~0 0))) (.cse19 (= ~c_dr_pc~0 1)) (.cse3 (= ~t1_st~0 0)) (.cse20 (= ~p_dw_pc~0 1)) (.cse24 (or (not (= ~q_req_up~0 1)) (not .cse17))) (.cse5 (= ~p_dw_i~0 1)) (.cse21 (not .cse25)) (.cse6 (= ~E_M~0 2)) (.cse22 (= ~token~0 ~local~0)) (.cse8 (= ~E_1~0 2))) (or (let ((.cse7 (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) (= ~m_st~0 0) (= ~q_free~0 1) (= ~c_last_read~0 0) .cse1 (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) .cse2 .cse3 (= ~q_ev~0 0) (= ~m_i~0 0) (= ~q_write_ev~0 2) .cse4 (= (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) .cse5 (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) .cse6 (= ~a_t~0 0) (= (select .cse7 0) 48) (= (select .cse7 1) 0) .cse8 (= ~M_E~0 2) (= ~t1_i~0 0))) (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse1 .cse17 .cse18 .cse2 .cse19 .cse3 .cse20 .cse5 .cse21 .cse6 .cse22 .cse8) (and .cse10 .cse23 .cse11 .cse13 .cse14 .cse15 .cse16 .cse1 .cse18 .cse19 .cse3 .cse20 .cse24 .cse5 .cse21 .cse6 .cse22 .cse8) (and .cse0 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse1 .cse17 .cse18 .cse2 .cse19 .cse3 .cse20 .cse5 .cse6 .cse22 .cse8 .cse25) (and .cse23 .cse11 .cse13 .cse14 .cse15 .cse16 .cse1 .cse18 .cse19 .cse3 .cse20 .cse4 .cse24 .cse5 .cse21 .cse6 .cse22 .cse8)))) [2024-11-09 07:33:26,765 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:26,765 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:26,766 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 07:33:26,766 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:26,766 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:26,766 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:26,767 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:26,767 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:26,767 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:26,767 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:26,768 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:26,768 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:26,768 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:26,768 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:26,768 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:26,769 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:33:26,769 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:33:26,769 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 07:33:26,769 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:33:26,769 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:33:26,770 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 07:33:26,770 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:26,771 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:26,771 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-09 07:33:26,771 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:26,772 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:26,772 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:26,772 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:26,772 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:26,773 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:26,773 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 07:33:26,773 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 07:33:26,773 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:26,773 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:26,773 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-09 07:33:26,774 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-09 07:33:26,774 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:33:26,774 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:33:26,774 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 07:33:26,774 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:33:26,774 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:33:26,774 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-09 07:33:26,866 WARN L162 FloydHoareUtils]: Requires clause for reset_delta_events2 contained old-variable. Original clause: (and (let ((.cse6 (= ~m_st~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse19 (= 2 ~t1_st~0)) (.cse20 (<= 2 |old(~E_1~0)|)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= 2 |old(~E_1~0)|)) (.cse4 (not (= ~q_read_ev~0 1))) (.cse5 (= ~c_num_read~0 0)) (.cse7 (= ~t1_i~0 1)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (= 2 |old(~E_M~0)|)) (.cse18 (not (= ~m_pc~0 1))) (.cse10 (= ~q_free~0 0)) (.cse11 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse12 (= ~q_req_up~0 0)) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~c_dr_pc~0 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (not (= ~q_write_ev~0 1))) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse18 .cse10 .cse19 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse11 .cse20 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse19 .cse11 .cse12 .cse20 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 (= (+ ~local~0 1) ~token~0) .cse8 .cse9 .cse10 .cse19 .cse11 .cse12 .cse20 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 (= ~m_pc~0 ~t1_pc~0) .cse9 .cse18 .cse10 .cse11 .cse12 (= ~t1_st~0 0) .cse13 .cse14 .cse15 .cse16 .cse17))) (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 2)) Eliminated clause: (and (let ((.cse6 (= ~m_st~0 2)) (.cse9 (not (= ~m_pc~0 1))) (.cse17 (= ~token~0 ~local~0)) (.cse18 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~c_dr_st~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~p_num_write~0 0)) (.cse13 (not (= ~q_read_ev~0 1))) (.cse5 (= ~c_num_read~0 0)) (.cse7 (= ~t1_i~0 1)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse14 (= ~q_free~0 0)) (.cse19 (= 2 ~t1_st~0)) (.cse15 (= ~q_req_up~0 0)) (.cse10 (= ~p_dw_st~0 0)) (.cse11 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (not (= ~q_write_ev~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse4 .cse13 .cse5 .cse6 .cse7 .cse8 .cse14 .cse15 .cse10 .cse11 .cse12 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse5 .cse6 .cse7 .cse8 .cse14 .cse19 .cse15 .cse10 .cse11 .cse12 .cse16) (and .cse0 .cse1 .cse2 .cse4 .cse13 .cse5 .cse7 .cse8 .cse9 .cse14 .cse19 .cse15 .cse10 .cse11 .cse12 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse4 .cse13 .cse5 .cse7 .cse8 (= ~m_pc~0 ~t1_pc~0) .cse9 .cse14 .cse15 (= ~t1_st~0 0) .cse10 .cse11 .cse12 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse5 .cse7 (= (+ ~local~0 1) ~token~0) .cse8 .cse14 .cse19 .cse15 .cse10 .cse11 .cse12 .cse16))) (= ~E_M~0 2)) [2024-11-09 07:33:26,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:33:26 BoogieIcfgContainer [2024-11-09 07:33:26,919 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 07:33:26,919 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 07:33:26,919 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 07:33:26,920 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 07:33:26,920 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:26:39" (3/4) ... [2024-11-09 07:33:26,924 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 07:33:26,928 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2024-11-09 07:33:26,930 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels1 [2024-11-09 07:33:26,930 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2024-11-09 07:33:26,930 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads1 [2024-11-09 07:33:26,930 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2024-11-09 07:33:26,930 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2024-11-09 07:33:26,930 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events1 [2024-11-09 07:33:26,930 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2024-11-09 07:33:26,931 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2024-11-09 07:33:26,932 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2024-11-09 07:33:26,932 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2024-11-09 07:33:26,933 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2024-11-09 07:33:26,933 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events1 [2024-11-09 07:33:26,933 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2024-11-09 07:33:26,959 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 67 nodes and edges [2024-11-09 07:33:26,960 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-11-09 07:33:26,961 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 07:33:26,965 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 07:33:27,000 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((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)) && (1 == c_dr_i)) && (\old(q_ev) == 0)) && (c_dr_pc == p_dw_pc)) && (2 == \old(q_write_ev))) && (t1_st == 0)) && (m_i == 0)) && (p_dw_st == 0)) && (token == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (\old(q_read_ev) == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (E_M == 2)) && (a_t == 0)) && (c_dr_st == p_dw_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 0)) || ((((p_dw_st != 0) && ((((((((((((((((((\old(q_req_up) == 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_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (\old(q_read_ev) != 1)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) || (((((((((((((((((p_last_write == q_buf_0) && (((long long) c_num_read + 1) == p_num_write)) && (\old(q_read_ev) != 0)) && (m_pc == t1_pc)) && (\old(q_req_up) == 1)) && (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)) && (\old(q_read_ev) != 1)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2)))) && (\old(q_write_ev) != 0)) && (\old(q_write_ev) != 1))) || ((((((((((((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (\old(q_read_ev) != 0)) && (m_pc == t1_pc)) && (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)) && (\old(q_read_ev) != 1)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) && ((q_ev == 0) || (p_dw_pc == 1))) && (q_write_ev == \old(q_write_ev))) && (\old(q_read_ev) == q_read_ev)) && (q_req_up == \old(q_req_up))) [2024-11-09 07:33:27,068 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((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)) && (1 == c_dr_i)) && (\old(q_ev) == 0)) && (c_dr_pc == p_dw_pc)) && (2 == \old(q_write_ev))) && (t1_st == 0)) && (m_i == 0)) && (p_dw_st == 0)) && (token == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (\old(q_read_ev) == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (E_M == 2)) && (a_t == 0)) && (c_dr_st == p_dw_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 0)) || ((((p_dw_st != 0) && ((((((((((((((((((\old(q_req_up) == 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_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (\old(q_read_ev) != 1)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) || (((((((((((((((((p_last_write == q_buf_0) && (((long long) c_num_read + 1) == p_num_write)) && (\old(q_read_ev) != 0)) && (m_pc == t1_pc)) && (\old(q_req_up) == 1)) && (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)) && (\old(q_read_ev) != 1)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2)))) && (\old(q_write_ev) != 0)) && (\old(q_write_ev) != 1))) || ((((((((((((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (\old(q_read_ev) != 0)) && (m_pc == t1_pc)) && (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)) && (\old(q_read_ev) != 1)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) && ((q_ev == 0) || (p_dw_pc == 1))) && (q_write_ev == \old(q_write_ev))) && (\old(q_read_ev) == q_read_ev)) && (q_req_up == \old(q_req_up))) [2024-11-09 07:33:27,249 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/witness.graphml [2024-11-09 07:33:27,249 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/witness.yml [2024-11-09 07:33:27,249 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 07:33:27,250 INFO L158 Benchmark]: Toolchain (without parser) took 409460.39ms. Allocated memory was 123.7MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 80.6MB in the beginning and 837.1MB in the end (delta: -756.5MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-11-09 07:33:27,254 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 123.7MB. Free memory is still 65.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:33:27,254 INFO L158 Benchmark]: CACSL2BoogieTranslator took 555.75ms. Allocated memory is still 123.7MB. Free memory was 80.6MB in the beginning and 61.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 07:33:27,255 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.68ms. Allocated memory was 123.7MB in the beginning and 153.1MB in the end (delta: 29.4MB). Free memory was 61.4MB in the beginning and 121.8MB in the end (delta: -60.4MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2024-11-09 07:33:27,255 INFO L158 Benchmark]: Boogie Preprocessor took 73.06ms. Allocated memory is still 153.1MB. Free memory was 121.8MB in the beginning and 122.5MB in the end (delta: -774.8kB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 07:33:27,255 INFO L158 Benchmark]: RCFGBuilder took 1114.98ms. Allocated memory is still 153.1MB. Free memory was 122.5MB in the beginning and 67.0MB in the end (delta: 55.6MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2024-11-09 07:33:27,255 INFO L158 Benchmark]: TraceAbstraction took 407284.42ms. Allocated memory was 153.1MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 67.0MB in the beginning and 865.4MB in the end (delta: -798.5MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-11-09 07:33:27,256 INFO L158 Benchmark]: Witness Printer took 330.23ms. Allocated memory is still 2.3GB. Free memory was 865.4MB in the beginning and 837.1MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-09 07:33:27,257 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.29ms. Allocated memory is still 123.7MB. Free memory is still 65.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 555.75ms. Allocated memory is still 123.7MB. Free memory was 80.6MB in the beginning and 61.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.68ms. Allocated memory was 123.7MB in the beginning and 153.1MB in the end (delta: 29.4MB). Free memory was 61.4MB in the beginning and 121.8MB in the end (delta: -60.4MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.06ms. Allocated memory is still 153.1MB. Free memory was 121.8MB in the beginning and 122.5MB in the end (delta: -774.8kB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1114.98ms. Allocated memory is still 153.1MB. Free memory was 122.5MB in the beginning and 67.0MB in the end (delta: 55.6MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * TraceAbstraction took 407284.42ms. Allocated memory was 153.1MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 67.0MB in the beginning and 865.4MB in the end (delta: -798.5MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 330.23ms. Allocated memory is still 2.3GB. Free memory was 865.4MB in the beginning and 837.1MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. 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: #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: #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: #StackHeapBarrier - 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: #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]]] * 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, 141 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 187.7s, OverallIterations: 30, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 56.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14907 SdHoareTripleChecker+Valid, 19.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14820 mSDsluCounter, 19193 SdHoareTripleChecker+Invalid, 16.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14219 mSDsCounter, 6794 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21323 IncrementalHoareTripleChecker+Invalid, 28117 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6794 mSolverCounterUnsat, 4974 mSDtfsCounter, 21323 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4443 GetRequests, 3282 SyntacticMatches, 34 SemanticMatches, 1127 ConstructedPredicates, 0 IntricatePredicates, 8 DeprecatedPredicates, 81465 ImplicationChecksByTransitivity, 82.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2260occurred in iteration=26, InterpolantAutomatonStates: 700, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.2s AutomataMinimizationTime, 30 MinimizatonAttempts, 5068 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 17.5s InterpolantComputationTime, 4782 NumberOfCodeBlocks, 4746 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 5584 ConstructedInterpolants, 0 QuantifiedInterpolants, 17677 SizeOfPredicates, 39 NumberOfNonLiveVariables, 7249 ConjunctsInSsa, 269 ConjunctsInUnsatCore, 55 InterpolantComputations, 25 PerfectInterpolantSequences, 3206/3874 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: 3.5s, 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.2s, TOOLS_POST_CALL_APPLICATIONS: 25, TOOLS_POST_CALL_TIME: 0.8s, TOOLS_POST_RETURN_APPLICATIONS: 18, TOOLS_POST_RETURN_TIME: 0.7s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 102, TOOLS_QUANTIFIERELIM_TIME: 2.5s, 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.6s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 1, DOMAIN_WIDEN_TIME: 0.0s, 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.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, 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: 575]: Location Invariant Derived location invariant: (((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (q_read_ev != 1)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (q_req_up == 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) || (((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (q_read_ev != 1)) && (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)) && (c_dr_pc == 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)) && (m_pc != 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2))) || ((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (q_read_ev != 1)) && (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)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2))) - InvariantResult [Line: 226]: Location Invariant Derived location invariant: (((((((((((((((((((((((((((((((((((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)) && (1 == c_dr_i)) && (\old(q_ev) == 0)) && (c_dr_pc == p_dw_pc)) && (2 == \old(q_write_ev))) && (t1_st == 0)) && (m_i == 0)) && (p_dw_st == 0)) && (token == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (\old(q_read_ev) == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (E_M == 2)) && (a_t == 0)) && (c_dr_st == p_dw_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 0)) || ((((p_dw_st != 0) && ((((((((((((((((((\old(q_req_up) == 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_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (\old(q_read_ev) != 1)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) || (((((((((((((((((p_last_write == q_buf_0) && (((long long) c_num_read + 1) == p_num_write)) && (\old(q_read_ev) != 0)) && (m_pc == t1_pc)) && (\old(q_req_up) == 1)) && (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)) && (\old(q_read_ev) != 1)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2)))) && (\old(q_write_ev) != 0)) && (\old(q_write_ev) != 1))) || ((((((((((((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (\old(q_read_ev) != 0)) && (m_pc == t1_pc)) && (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)) && (\old(q_read_ev) != 1)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) && ((q_ev == 0) || (p_dw_pc == 1))) && (q_write_ev == \old(q_write_ev))) && (\old(q_read_ev) == q_read_ev)) && (q_req_up == \old(q_req_up))) - InvariantResult [Line: 259]: Location Invariant Derived location 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)) && (q_write_ev != 0)) && (m_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (q_read_ev != 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (q_write_ev != 1)) && (E_M == 2)) && (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)) && (1 == c_dr_i)) && (q_free == 0)) && (t1_st == 0)) && (m_i == 0)) && (0 <= (q_buf_0 + 2147483648))) && (p_dw_pc == 1)) && (q_write_ev == 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)) && (E_M == 2)) && (a_t == 0)) && (token == local)) && (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_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)) && ((q_req_up != 1) || (q_free != 0))) && (p_dw_i == 1)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((((((((((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)) && (1 == c_dr_i)) && (c_dr_pc == p_dw_pc)) && (q_req_up == 0)) && (t1_st == 0)) && (q_ev == 0)) && (m_i == 0)) && (q_write_ev == 2)) && (p_dw_st == 0)) && (token == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (m_pc == 0)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (E_M == 2)) && (a_t == 0)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 0))) || (((q_write_ev != 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_pc != 1)) && (1 == c_dr_i)) && (q_free == 0)) && (q_read_ev != 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (q_write_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) || ((((((((((((((((((q_req_up == 1) && (q_read_ev != 1)) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (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)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) && (2 <= p_dw_st)))) && (q_write_ev != 1))) || (((((((((((((((((((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)) && (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)) && (p_dw_st == 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) - InvariantResult [Line: 904]: 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)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) || (((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (q_read_ev != 1)) && (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)) && (p_dw_st == 0)) && (c_dr_pc == 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)) && (q_read_ev != 1)) && (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)) && (p_dw_st == 0)) && (c_dr_pc == 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)) && (q_read_ev != 1)) && (c_num_read == 0)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (p_dw_st == 0)) && (c_dr_pc == 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)) && (q_read_ev != 1)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (q_req_up == 0)) && (p_dw_st == 0)) && (c_dr_pc == 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)) && (q_read_ev != 1)) && (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)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) - InvariantResult [Line: 188]: Location Invariant Derived location invariant: (((((((((((((((((((((q_req_up == 1) && (c_num_read == 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)) && (t1_st == 0)) && (p_dw_pc == 1)) && (q_write_ev == 2)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (2 == p_dw_st)) && (p_dw_i == 1)) && (p_num_write == 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) || (((((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (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_req_up == 0)) && (t1_st == 0)) && (q_write_ev == 2)) && (p_dw_st == 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((p_dw_st != 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)) && (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)) && (p_dw_i == 1)) && (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_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)) && (1 == c_dr_i)) && (q_req_up == 0)) && (t1_st == 0)) && (m_i == 0)) && (q_write_ev == 2)) && (p_dw_st == 1)) && (local == 0)) && (token == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (m_pc == 0)) && (p_dw_i == 1)) && (E_M == 2)) && (a_t == 0)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 0)) || (((((((((((((((((((((((((((((p_dw_pc == 0) && (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)) && (1 == c_dr_i)) && (q_free == 0)) && (t1_st == 0)) && (m_i == 0)) && (0 <= (p_last_write + 2147483648))) && (q_write_ev == 2)) && (p_dw_st == 1)) && (local == 0)) && (token == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (m_pc == 0)) && (p_dw_i == 1)) && (p_num_write == 1)) && (E_M == 2)) && (a_t == 0)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 0))) || (((((((((q_req_up == 1) && (p_dw_st != 0)) && (q_read_ev != 1)) && (((long long) c_num_read + 1) == p_num_write)) && (q_write_ev != 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)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) || ((((((((((((((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)) && (E_M == 2)) && (token == local)) && (E_1 == 2)))) && ((p_dw_pc == 1) || (q_read_ev == 2))) && (q_write_ev != 1))) || (((((((((((((((((((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)) && (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)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) - InvariantResult [Line: 531]: Location Invariant Derived location invariant: (((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (q_read_ev != 1)) && (c_num_read == 0)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (p_dw_st == 0)) && (m_st != 0)) && (c_dr_pc == 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)) && (q_read_ev != 1)) && (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)) && (p_dw_st == 0)) && (m_st != 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2))) || ((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (q_read_ev != 1)) && (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)) && (p_dw_st == 0)) && (m_st != 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) - InvariantResult [Line: 660]: Location Invariant Derived location invariant: (((((((((((((((((((((((((c_dr_st == 0) && (p_num_write == 0)) && (q_read_ev != 1)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (m_pc != 1)) && (q_free == 0)) && (c_dr_pc == p_dw_pc)) && (q_req_up == 0)) && (t1_st == 0)) && (p_dw_st == 0)) && (c_dr_pc == 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)) && (q_read_ev != 1)) && (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)) && (p_dw_st == 0)) && (m_st != 0)) && (c_dr_pc == 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)) && (q_read_ev != 1)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 == t1_st)) && (c_dr_pc == p_dw_pc)) && (q_req_up == 0)) && (p_dw_st == 0)) && (m_st != 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2))) || ((((((((((((((((((t1_pc == 1) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (q_read_ev != 1)) && (c_num_read == 0)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 == t1_st)) && (c_dr_pc == p_dw_pc)) && (q_req_up == 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2))) || ((((((((((((((((((c_dr_st == 0) && (p_num_write == 0)) && (q_read_ev != 1)) && (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)) && (p_dw_st == 0)) && (c_dr_pc == 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)) && (c_dr_pc == p_dw_pc)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2))) || (((((((((((((((((((t1_pc == 1) && (c_dr_st == 0)) && (p_num_write == 0)) && (q_read_ev != 1)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_pc != 1)) && (q_free == 0)) && (2 == t1_st)) && (c_dr_pc == p_dw_pc)) && (q_req_up == 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) - InvariantResult [Line: 686]: 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)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) || (((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (q_read_ev != 1)) && (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)) && (p_dw_st == 0)) && (c_dr_pc == 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)) && (q_read_ev != 1)) && (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)) && (p_dw_st == 0)) && (c_dr_pc == 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)) && (q_read_ev != 1)) && (c_num_read == 0)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (p_dw_st == 0)) && (c_dr_pc == 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)) && (q_read_ev != 1)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (q_req_up == 0)) && (p_dw_st == 0)) && (c_dr_pc == 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)) && (q_read_ev != 1)) && (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)) && (p_dw_st == 0)) && (c_dr_pc == 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)) && (q_read_ev != 1)) && (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)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) - InvariantResult [Line: 427]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((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)) && (1 == c_dr_i)) && (q_req_up == 0)) && (t1_st == 0)) && (q_ev == 0)) && (m_i == 0)) && (q_write_ev == 2)) && (p_dw_st == 0)) && (local == 0)) && (token == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (m_pc == 0)) && (p_dw_i == 1)) && (E_M == 2)) && (a_t == 0)) && (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_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (q_read_ev != 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (q_write_ev != 1)) && (E_M == 2)) && (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_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)) && ((q_req_up != 1) || (q_free != 0))) && (p_dw_i == 1)) && (q_write_ev != 1)) && (E_M == 2)) && (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)) && (m_pc != 1)) && (1 == c_dr_i)) && (q_free == 0)) && (q_read_ev != 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (q_write_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((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)) && (1 == c_dr_i)) && (q_req_up == 0)) && (t1_st == 0)) && (q_ev == 0)) && (m_i == 0)) && (q_write_ev == 2)) && (p_dw_st == 0)) && (local == 0)) && (token == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (m_pc == 0)) && (p_dw_i == 1)) && (E_M == 2)) && (a_t == 0)) && (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_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (q_read_ev != 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (q_write_ev != 1)) && (E_M == 2)) && (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_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)) && ((q_req_up != 1) || (q_free != 0))) && (p_dw_i == 1)) && (q_write_ev != 1)) && (E_M == 2)) && (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)) && (m_pc != 1)) && (1 == c_dr_i)) && (q_free == 0)) && (q_read_ev != 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (q_write_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || ((((((((((((((((((((q_req_up == 1) && (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_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)) && (p_dw_i == 1)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) && (2 <= p_dw_st))) || (((((((((((((((((((((((((((((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)) && (1 == c_dr_i)) && (q_free == 0)) && (t1_st == 0)) && (m_i == 0)) && (0 <= (q_buf_0 + 2147483648))) && (p_dw_pc == 1)) && (q_write_ev == 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)) && (E_M == 2)) && (a_t == 0)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 0))) || (((((((((((((((((((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)) && (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)) && (p_dw_st == 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) - ProcedureContractResult [Line: 812]: Procedure Contract for immediate_notify Derived contract for procedure immediate_notify. Ensures: ((((((((m_st == 2) || (m_pc == 1)) || (2 != \old(m_st))) && (((m_pc != t1_pc) || (t1_st == 0)) || (m_pc == 1))) && ((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (2 == \old(m_st))) && (q_read_ev != 1)) && (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)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) || (((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (q_read_ev != 1)) && (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)) && (p_dw_st == 0)) && (\old(m_st) != 0)) && (c_dr_pc == 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)) && (p_num_write == 0)) && (q_read_ev != 1)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (q_req_up == 0)) && (\old(t1_st) == 2)) && (p_dw_st == 0)) && (\old(m_st) != 0)) && (c_dr_pc == 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)) && (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 == \old(m_st)) || (token != local))) && (((\old(t1_st) == t1_st) || (m_pc != 1)) || (((long long) local + 1) != token))) && (((((((((((((((((((((((((((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))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 226]: Procedure Contract for update_channels1 Derived contract for procedure update_channels1. Requires: (((q_ev == 0) || (p_dw_pc == 1)) && ((((((p_dw_st != 0) && (q_write_ev != 0)) && (q_write_ev != 1)) && ((((((((((((((((((q_req_up == 1) && (q_read_ev != 1)) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (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)) && (p_dw_i == 1)) && (E_M == 2)) && (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)) && (m_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (q_read_ev != 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (E_M == 2)) && (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_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)) && ((q_req_up != 1) || (q_free != 0))) && (p_dw_i == 1)) && (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)) && (q_buf_0 == 0)) && (t1_pc == 0)) && (p_last_write == 0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (c_last_read == 0)) && (1 == c_dr_i)) && (q_req_up == 0)) && (t1_st == 0)) && (m_i == 0)) && (q_write_ev == 2)) && (p_dw_st == 0)) && (local == 0)) && (token == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (m_pc == 0)) && (p_dw_i == 1)) && (E_M == 2)) && (a_t == 0)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 0)))) Ensures: (((((((p_dw_pc == 1) || ((q_req_up == 0) && (q_ev == 0))) && (((q_req_up == 0) && (\old(q_read_ev) == q_read_ev)) || (((long long) c_num_read + 1) != p_num_write))) && (((((((((((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 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)) && (1 == c_dr_i)) && (\old(q_ev) == 0)) && (2 == \old(q_write_ev))) && (t1_st == 0)) && (m_i == 0)) && (p_dw_st == 0)) && (local == 0)) && (token == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (\old(q_read_ev) == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (a_t == 0)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 0)) || ((((p_dw_st != 0) && (\old(q_write_ev) != 0)) && (\old(q_write_ev) != 1)) && ((((((((((((((((((p_last_write == q_buf_0) && (((long long) c_num_read + 1) == p_num_write)) && (\old(q_read_ev) != 0)) && (m_pc == t1_pc)) && (\old(q_req_up) == 1)) && (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)) && (\old(q_read_ev) != 1)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) || ((((((((((((((((\old(q_req_up) == 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_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)) && (E_M == 2)) && (token == local)) && (E_1 == 2))))) || ((((((((((((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (\old(q_read_ev) != 0)) && (m_pc == t1_pc)) && (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)) && (\old(q_read_ev) != 1)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2)))) && ((((((q_read_ev != 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))) || ((\old(q_req_up) == 1) && (q_free == 0)))) && ((((((\old(q_req_up) != 1) || (q_req_up == 0)) || (q_free < 1)) || (c_num_read != 1)) || (p_dw_st == 0)) || (c_dr_st != 2))) && (((((((((((((((((((((((((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))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 787]: Procedure Contract for activate_threads2 Derived contract for procedure activate_threads2. Ensures: ((((((((((((\old(t1_st) != 0) || (E_M != 2)) || (t1_st == 0)) && ((((((((((((p_dw_st != 0) || ((m_st == 2) && (\old(t1_st) == t1_st))) || (c_dr_pc != 0)) || (m_pc != 1)) || (t1_pc != 1)) || (t1_i != 1)) || (p_dw_pc != 0)) || (p_last_write != q_buf_0)) || (E_1 < 2)) || (2 != \old(m_st))) || (c_last_read != p_last_write)) || (token != local))) && (((((((((q_req_up != 0) || (E_M != 2)) || (q_read_ev == 1)) || (2 == t1_st)) || (E_1 != 2)) || (m_pc == 1)) || (q_free != 0)) || (\old(t1_st) != 2)) || (q_write_ev == 1))) && ((m_st == \old(m_st)) || (m_pc == 1))) && ((((((((q_req_up != 0) || (E_M != 2)) || (q_read_ev == 1)) || (2 == t1_st)) || (q_free != 0)) || (\old(t1_st) != 2)) || (((long long) local + 1) != token)) || (q_write_ev == 1))) && (((\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))) || (((long long) local + 1) != token))) && (((E_M != 2) || (m_st == \old(m_st))) || (\old(t1_st) != 2))) && ((((((((((((((((((p_num_write == 0) && (c_num_read == 0)) && (2 == t1_st)) || (q_req_up != 0)) || (p_dw_st != 0)) || (E_M != 2)) || (c_dr_pc != 0)) || (q_read_ev == 1)) || (t1_pc != 1)) || (t1_i != 1)) || (p_dw_pc != 0)) || (p_last_write != q_buf_0)) || (q_free != 0)) || (\old(t1_st) != 2)) || (E_1 < 2)) || (2 != \old(m_st))) || (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))) && (q_read_ev != 1)) && (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)) && (p_dw_st == 0)) && (c_dr_pc == 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)) && (q_read_ev != 1)) && (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) == 2)) && (p_dw_st == 0)) && (c_dr_pc == 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)) && (q_read_ev != 1)) && (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)) && (p_dw_st == 0)) && (\old(m_st) != 0)) && (c_dr_pc == 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)) && (2 == \old(m_st))) && (q_read_ev != 1)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (q_req_up == 0)) && (\old(t1_st) == 2)) && (p_dw_st == 0)) && (c_dr_pc == 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)) && (q_read_ev != 1)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (q_req_up == 0)) && (\old(t1_st) == 2)) && (p_dw_st == 0)) && (\old(m_st) != 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local))) || (((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (q_read_ev != 1)) && (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)) && (p_dw_st == 0)) && (c_dr_pc == 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)) && (q_read_ev != 1)) && (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)) && (\old(t1_st) == 2)) && (p_dw_st == 0)) && (c_dr_pc == 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)) && (2 == \old(m_st))) && (q_read_ev != 1)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (q_req_up == 0)) && (p_dw_st == 0)) && (c_dr_pc == 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)) && (2 == \old(m_st))) && (c_num_read == 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)))) && (((((((((((((((((((((((((((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))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 315]: Procedure Contract for activate_threads1 Derived contract for procedure activate_threads1. Requires: ((((((((((((((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (q_write_ev != 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)) && ((q_req_up != 1) || (q_free != 0))) && (p_dw_i == 1)) && (q_write_ev != 1)) && (E_M == 2)) && (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_pc != 1)) && (1 == c_dr_i)) && (q_free == 0)) && (q_read_ev != 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (E_M == 2)) && (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)) && (1 == c_dr_i)) && (q_req_up == 0)) && (t1_st == 0)) && (q_ev == 0)) && (m_i == 0)) && (q_write_ev == 2)) && (local == 0)) && (token == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (m_pc == 0)) && (p_dw_i == 1)) && (E_M == 2)) && (a_t == 0)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 0))) && ((p_dw_pc == 1) || ((c_dr_st == 0) && (p_dw_st == 0)))) Ensures: (((((((\old(p_dw_st) == p_dw_st) && (c_dr_st == 0)) || (q_write_ev != 1)) && (((((((((((((((((((\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)) && (m_pc != 1)) && (1 == c_dr_i)) && (q_read_ev != 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && ((q_req_up != 1) || (q_free != 0))) && (p_dw_i == 1)) && (q_write_ev != 1)) && (E_M == 2)) && (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)) && (1 == c_dr_i)) && (q_req_up == 0)) && (t1_st == 0)) && (q_ev == 0)) && (m_i == 0)) && (q_write_ev == 2)) && (local == 0)) && (token == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (m_pc == 0)) && (p_dw_i == 1)) && (E_M == 2)) && (a_t == 0)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 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_pc != 1)) && (1 == c_dr_i)) && (q_free == 0)) && (q_read_ev != 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (\old(p_dw_st) != 0)) && (E_1 == 2)))) && ((p_dw_pc == 1) || ((c_dr_st == 0) && (p_dw_st == 0)))) && (((((q_read_ev == 1) && ((c_dr_st != 0) || (\old(c_dr_st) == 0))) && (p_dw_st == 0)) || (((\old(p_dw_st) == p_dw_st) && (q_read_ev != 1)) && ((c_dr_st != 0) || (\old(c_dr_st) == 0)))) || (q_write_ev == 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_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))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 634]: 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)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) || (((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (q_read_ev != 1)) && (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)) && (p_dw_st == 0)) && (c_dr_pc == 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)) && (q_read_ev != 1)) && (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)) && (p_dw_st == 0)) && (c_dr_pc == 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)) && (q_read_ev != 1)) && (c_num_read == 0)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (p_dw_st == 0)) && (c_dr_pc == 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)) && (q_read_ev != 1)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (q_req_up == 0)) && (p_dw_st == 0)) && (c_dr_pc == 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)) && (q_read_ev != 1)) && (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)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) 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)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) || (((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (q_read_ev != 1)) && (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)) && (p_dw_st == 0)) && (c_dr_pc == 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)) && (q_read_ev != 1)) && (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)) && (p_dw_st == 0)) && (c_dr_pc == 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)) && (q_read_ev != 1)) && (c_num_read == 0)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (p_dw_st == 0)) && (c_dr_pc == 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)) && (q_read_ev != 1)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (q_req_up == 0)) && (p_dw_st == 0)) && (c_dr_pc == 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)) && (q_read_ev != 1)) && (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)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) && (((((((((((((((((((((((((((((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))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 731]: Procedure Contract for fire_delta_events2 Derived contract for procedure fire_delta_events2. 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)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) || (((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (q_read_ev != 1)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (q_req_up == 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (q_read_ev != 1)) && (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)) && (p_dw_st == 0)) && (c_dr_pc == 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)) && (q_read_ev != 1)) && (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)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (token == local)) && (E_1 == 2))) || ((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (q_read_ev != 1)) && (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)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (q_read_ev != 1)) && (c_num_read == 0)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1))) && (E_M == 2)) Ensures: ((((E_1 == \old(E_1)) && (E_M == 2)) && (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (2 == \old(E_1))) && (q_read_ev != 1)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == \old(E_M))) && (q_free == 0)) && (q_req_up == 0)) && (p_dw_st == 0)) && (c_dr_pc == 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)) && (q_read_ev != 1)) && (c_num_read == 0)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (2 == \old(E_M))) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (2 <= \old(E_1))) && (p_dw_st == 0)) && (c_dr_pc == 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)) && (2 == \old(E_M))) && (m_pc != 1)) && (2 <= \old(E_1))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (2 == \old(E_1))) && (q_read_ev != 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)) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (p_dw_st == 0)) && (c_dr_pc == 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))) && (q_read_ev != 1)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == \old(E_M))) && (m_pc != 1)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (p_dw_st == 0)) && (c_dr_pc == 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)) && (q_read_ev != 1)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == \old(E_M))) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (2 <= \old(E_1))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 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))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 279]: Procedure Contract for fire_delta_events1 Derived contract for procedure fire_delta_events1. 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)) && (1 == c_dr_i)) && (q_req_up == 0)) && (t1_st == 0)) && (q_ev == 0)) && (m_i == 0)) && (q_write_ev == 2)) && (p_dw_st == 0)) && (local == 0)) && (token == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (m_pc == 0)) && (p_dw_i == 1)) && (E_M == 2)) && (a_t == 0)) && (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_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && ((q_req_up != 1) || (q_free != 0))) && (p_dw_i == 1)) && (q_write_ev != 1)) && (E_M == 2)) && (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)) && (m_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (q_read_ev != 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) Ensures: (((((((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) && (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_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (\old(q_read_ev) != 1)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) || (((((((((((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (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)) && ((q_req_up != 1) || (q_free != 0))) && (\old(q_read_ev) != 1)) && (p_dw_i == 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)) && (q_buf_0 == 0)) && (t1_pc == 0)) && (p_last_write == 0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (c_last_read == 0)) && (1 == c_dr_i)) && (q_req_up == 0)) && (2 == \old(q_write_ev))) && (t1_st == 0)) && (q_ev == 0)) && (m_i == 0)) && (p_dw_st == 0)) && (local == 0)) && (token == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (\old(q_read_ev) == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (a_t == 0)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 0)))) && ((c_num_read != p_num_write) || (((q_read_ev != 0) && (q_write_ev == \old(q_write_ev))) && ((\old(q_read_ev) == q_read_ev) || (\old(q_read_ev) == 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))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (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_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)) && (1 == c_dr_i)) && (q_req_up == 0)) && (t1_st == 0)) && (q_ev == 0)) && (m_i == 0)) && (q_write_ev == 2)) && (p_dw_st == 0)) && (local == 0)) && (token == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (m_pc == 0)) && (p_dw_i == 1)) && (E_M == 2)) && (a_t == 0)) && (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_pc != 1)) && (1 == c_dr_i)) && (q_free == 0)) && (q_read_ev != 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (E_M == 2)) && (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_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)) && ((q_req_up != 1) || (q_free != 0))) && (p_dw_i == 1)) && (q_write_ev != 1)) && (E_M == 2)) && (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_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)) && (p_dw_st == 0)) && ((q_req_up != 1) || (q_free != 0))) && (p_dw_i == 1)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) Ensures: ((((((\result == 0) || (c_num_read != p_num_write)) && (((((((((((((((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)) && (p_dw_i == 1)) && (\result == 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) && (q_write_ev == 1)) || ((((((((((((((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)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (q_write_ev != 1)) && ((c_dr_st == 0) || (\result == 0))) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((long long) c_num_read + 1) != p_num_write))) && ((((((((((((((((((((((((((((((((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)) && (1 == c_dr_i)) && (q_req_up == 0)) && (t1_st == 0)) && (q_ev == 0)) && (m_i == 0)) && (q_write_ev == 2)) && (p_dw_st == 0)) && (local == 0)) && (token == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (m_pc == 0)) && (p_dw_i == 1)) && (E_M == 2)) && (a_t == 0)) && (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_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)) && ((q_req_up != 1) || (q_free != 0))) && (p_dw_i == 1)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || ((((((p_dw_st != 0) && (q_read_ev != 1)) && (((long long) c_num_read + 1) == p_num_write)) && (q_write_ev != 0)) && (q_read_ev != 0)) && (q_req_up == 0))) || ((((((((((((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (q_write_ev != 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)) && (p_dw_st == 0)) && ((q_req_up != 1) || (q_free != 0))) && (p_dw_i == 1)) && (q_write_ev != 1)) && (E_M == 2)) && (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))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (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_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)) && (1 == c_dr_i)) && (q_req_up == 0)) && (t1_st == 0)) && (q_ev == 0)) && (m_i == 0)) && (q_write_ev == 2)) && (p_dw_st == 0)) && (local == 0)) && (token == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (m_pc == 0)) && (p_dw_i == 1)) && (E_M == 2)) && (a_t == 0)) && (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_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)) && ((q_req_up != 1) || (q_free != 0))) && (p_dw_i == 1)) && (q_write_ev != 1)) && (E_M == 2)) && (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_pc != 1)) && (1 == c_dr_i)) && (q_free == 0)) && (q_read_ev != 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) Ensures: ((((((((((((((((((((((((((((((((((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)) && (1 == c_dr_i)) && (q_req_up == 0)) && (t1_st == 0)) && (q_ev == 0)) && (m_i == 0)) && (q_write_ev == 2)) && (p_dw_st == 0)) && (local == 0)) && (token == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (m_pc == 0)) && (p_dw_i == 1)) && (E_M == 2)) && (a_t == 0)) && (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_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)) && ((q_req_up != 1) || (q_free != 0))) && (p_dw_i == 1)) && (q_write_ev != 1)) && (E_M == 2)) && (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_pc != 1)) && (1 == c_dr_i)) && (q_free == 0)) && (q_read_ev != 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) && (((q_read_ev != 1) || (\result == 1)) || (p_dw_st == 0))) && ((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))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 259]: Procedure Contract for exists_runnable_thread1 Derived contract for procedure exists_runnable_thread1. 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)) && (1 == c_dr_i)) && (q_req_up == 0)) && (t1_st == 0)) && (q_ev == 0)) && (m_i == 0)) && (q_write_ev == 2)) && (p_dw_st == 0)) && (local == 0)) && (token == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (m_pc == 0)) && (p_dw_i == 1)) && (E_M == 2)) && (a_t == 0)) && (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_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (q_read_ev != 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (q_write_ev != 1)) && (E_M == 2)) && (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_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)) && ((q_req_up != 1) || (q_free != 0))) && (p_dw_i == 1)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((q_write_ev != 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_pc != 1)) && (1 == c_dr_i)) && (q_free == 0)) && (q_read_ev != 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (q_write_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) || ((((((((((((((((((q_req_up == 1) && (q_read_ev != 1)) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (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)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) && (2 <= p_dw_st)))) && (q_write_ev != 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)) && (1 == c_dr_i)) && (q_free == 0)) && (t1_st == 0)) && (m_i == 0)) && (0 <= (q_buf_0 + 2147483648))) && (p_dw_pc == 1)) && (q_write_ev == 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)) && (E_M == 2)) && (a_t == 0)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 0))) || (((((((((((((((((((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)) && (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)) && (p_dw_st == 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) Ensures: (((((p_dw_st != 0) || (\result == 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)) && (1 == c_dr_i)) && (q_req_up == 0)) && (t1_st == 0)) && (q_ev == 0)) && (m_i == 0)) && (q_write_ev == 2)) && (p_dw_st == 0)) && (local == 0)) && (token == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (m_pc == 0)) && (p_dw_i == 1)) && (E_M == 2)) && (a_t == 0)) && (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_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (q_read_ev != 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (q_write_ev != 1)) && (E_M == 2)) && (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_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)) && ((q_req_up != 1) || (q_free != 0))) && (p_dw_i == 1)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((q_write_ev != 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_pc != 1)) && (1 == c_dr_i)) && (q_free == 0)) && (q_read_ev != 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (q_write_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) || ((((((((((((((((((q_req_up == 1) && (q_read_ev != 1)) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (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)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) && (2 <= p_dw_st)))) && (q_write_ev != 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)) && (1 == c_dr_i)) && (q_free == 0)) && (t1_st == 0)) && (m_i == 0)) && (0 <= (q_buf_0 + 2147483648))) && (p_dw_pc == 1)) && (q_write_ev == 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)) && (E_M == 2)) && (a_t == 0)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 0))) || (((((((((((((((((((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)) && (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)) && (p_dw_st == 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (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))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (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))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 660]: 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)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) || (((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (q_read_ev != 1)) && (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)) && (p_dw_st == 0)) && (c_dr_pc == 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)) && (q_read_ev != 1)) && (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)) && (p_dw_st == 0)) && (c_dr_pc == 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)) && (q_read_ev != 1)) && (c_num_read == 0)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (p_dw_st == 0)) && (c_dr_pc == 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)) && (q_read_ev != 1)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (q_req_up == 0)) && (p_dw_st == 0)) && (c_dr_pc == 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)) && (q_read_ev != 1)) && (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)) && (p_dw_st == 0)) && (c_dr_pc == 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)) && (q_read_ev != 1)) && (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)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) Ensures: ((((((((((((q_req_up != 0) || (q_read_ev == 1)) || (t1_pc != 1)) || (\result == 1)) || (E_1 != 2)) || (q_free != 0)) || (t1_st != 0)) || (q_write_ev == 1)) || (token != local)) && (((((((((q_req_up != 0) || (m_pc == t1_pc)) || (q_read_ev == 1)) || (\result == 1)) || (E_1 != 2)) || (q_free != 0)) || (t1_st != 0)) || (q_write_ev == 1)) || (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)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) || (((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (q_read_ev != 1)) && (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)) && (p_dw_st == 0)) && (c_dr_pc == 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)) && (q_read_ev != 1)) && (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)) && (p_dw_st == 0)) && (c_dr_pc == 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)) && (q_read_ev != 1)) && (c_num_read == 0)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (p_dw_st == 0)) && (c_dr_pc == 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)) && (q_read_ev != 1)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (q_req_up == 0)) && (p_dw_st == 0)) && (c_dr_pc == 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)) && (q_read_ev != 1)) && (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)) && (p_dw_st == 0)) && (c_dr_pc == 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)) && (q_read_ev != 1)) && (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)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2)))) && (((((((((((((((((((((((((((((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))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 297]: Procedure Contract for reset_delta_events1 Derived contract for procedure reset_delta_events1. 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)) && (1 == c_dr_i)) && (q_req_up == 0)) && (t1_st == 0)) && (q_ev == 0)) && (m_i == 0)) && (q_write_ev == 2)) && (p_dw_st == 0)) && (local == 0)) && (token == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (m_pc == 0)) && (p_dw_i == 1)) && (E_M == 2)) && (a_t == 0)) && (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_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (q_read_ev != 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (q_write_ev != 1)) && (E_M == 2)) && (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_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)) && ((q_req_up != 1) || (q_free != 0))) && (p_dw_i == 1)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((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_pc != 1)) && (1 == c_dr_i)) && (q_free == 0)) && (q_read_ev != 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) && (q_write_ev == 1))) || ((((((((((((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (q_write_ev != 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)) && (p_dw_st == 0)) && ((q_req_up != 1) || (q_free != 0))) && (p_dw_i == 1)) && (q_write_ev != 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2))) Ensures: ((((((((((((((((((((((((((c_dr_st == 0) && (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_pc != 1)) && (1 == c_dr_i)) && (q_free == 0)) && (q_req_up == 0)) && (\old(q_write_ev) == 1)) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (\old(q_read_ev) != 1)) && (p_dw_i == 1)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) || (((((((((((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (\old(q_read_ev) != 0)) && (m_pc == t1_pc)) && (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)) && ((q_req_up != 1) || (q_free != 0))) && (p_dw_i == 1)) && (E_M == 2)) && (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_pc != 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (\old(q_write_ev) != 0)) && (\old(q_write_ev) != 1)) && (p_dw_pc == 1)) && (p_dw_i == 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)) && (q_buf_0 == 0)) && (t1_pc == 0)) && (p_last_write == 0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (c_last_read == 0)) && (1 == c_dr_i)) && (q_req_up == 0)) && (2 == \old(q_write_ev))) && (t1_st == 0)) && (q_ev == 0)) && (m_i == 0)) && (p_dw_st == 0)) && (local == 0)) && (token == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (\old(q_read_ev) == 2)) && (p_dw_i == 1)) && (E_M == 2)) && (a_t == 0)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 0))) && ((p_dw_st == 0) || (\old(q_read_ev) == q_read_ev))) && (((\old(q_write_ev) == 1) || (((q_read_ev != 1) && (q_write_ev == \old(q_write_ev))) && (\old(q_read_ev) == q_read_ev))) || ((q_write_ev == \old(q_write_ev)) && (q_read_ev == 2)))) && ((c_dr_st != 0) || (q_write_ev == 2))) && (((((((((((((((((((((((((((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))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 759]: Procedure Contract for reset_delta_events2 Derived contract for procedure reset_delta_events2. 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)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) || (((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (q_read_ev != 1)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (q_req_up == 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (q_read_ev != 1)) && (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)) && (p_dw_st == 0)) && (c_dr_pc == 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)) && (q_read_ev != 1)) && (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)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (token == local)) && (E_1 == 2))) || ((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (q_read_ev != 1)) && (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)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (q_read_ev != 1)) && (c_num_read == 0)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 1))) && (E_M == 2)) Ensures: (((((2 <= E_1) && (((2 != \old(E_1)) || (E_1 == 2)) || (token != local))) && (E_M == 2)) && (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (2 == \old(E_1))) && (q_read_ev != 1)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == \old(E_M))) && (q_free == 0)) && (q_req_up == 0)) && (p_dw_st == 0)) && (c_dr_pc == 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)) && (q_read_ev != 1)) && (c_num_read == 0)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (2 == \old(E_M))) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (2 <= \old(E_1))) && (p_dw_st == 0)) && (c_dr_pc == 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)) && (2 == \old(E_M))) && (m_pc != 1)) && (2 <= \old(E_1))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (2 == \old(E_1))) && (q_read_ev != 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)) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (p_dw_st == 0)) && (c_dr_pc == 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))) && (q_read_ev != 1)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == \old(E_M))) && (m_pc != 1)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (p_dw_st == 0)) && (c_dr_pc == 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)) && (q_read_ev != 1)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == \old(E_M))) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (2 <= \old(E_1))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (q_write_ev != 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))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (token == \old(token))) && (local == \old(local)))) RESULT: Ultimate proved your program to be correct! [2024-11-09 07:33:27,422 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084dca34-e464-40bc-989b-0bcf22132b88/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE