./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0792bb078b549cb8c62d642eddb09d42b03fb2451c67a454a8e8576be6796f29 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 12:58:48,179 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 12:58:48,253 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 12:58:48,258 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 12:58:48,259 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 12:58:48,288 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 12:58:48,289 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 12:58:48,290 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 12:58:48,291 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 12:58:48,291 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 12:58:48,292 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 12:58:48,293 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 12:58:48,293 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 12:58:48,294 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 12:58:48,294 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 12:58:48,295 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 12:58:48,296 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 12:58:48,296 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 12:58:48,297 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 12:58:48,297 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 12:58:48,298 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 12:58:48,299 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 12:58:48,300 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 12:58:48,301 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 12:58:48,301 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 12:58:48,302 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 12:58:48,302 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 12:58:48,303 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 12:58:48,303 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 12:58:48,304 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 12:58:48,304 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 12:58:48,304 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 12:58:48,305 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 12:58:48,305 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 12:58:48,306 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 12:58:48,306 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 12:58:48,306 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 12:58:48,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 12:58:48,307 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 12:58:48,307 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 12:58:48,307 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 12:58:48,308 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 12:58:48,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 12:58:48,308 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 12:58:48,308 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 12:58:48,308 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 12:58:48,309 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 12:58:48,309 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_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/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_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0792bb078b549cb8c62d642eddb09d42b03fb2451c67a454a8e8576be6796f29 [2023-12-02 12:58:48,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 12:58:48,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 12:58:48,593 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 12:58:48,594 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 12:58:48,595 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 12:58:48,596 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c [2023-12-02 12:58:51,631 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 12:58:51,898 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 12:58:51,898 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c [2023-12-02 12:58:51,915 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/data/2c2983a7c/bcb926f383e642b58344ec35f8f2924d/FLAGa1028f50f [2023-12-02 12:58:51,928 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/data/2c2983a7c/bcb926f383e642b58344ec35f8f2924d [2023-12-02 12:58:51,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 12:58:51,931 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 12:58:51,933 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 12:58:51,933 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 12:58:51,939 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 12:58:51,940 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:58:51" (1/1) ... [2023-12-02 12:58:51,942 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4debd819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:58:51, skipping insertion in model container [2023-12-02 12:58:51,942 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:58:51" (1/1) ... [2023-12-02 12:58:51,995 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 12:58:52,153 WARN L240 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_8f69b14d-683d-4b79-8ded-c494c8e083ff/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c[914,927] [2023-12-02 12:58:52,211 WARN L240 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_8f69b14d-683d-4b79-8ded-c494c8e083ff/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c[7115,7128] [2023-12-02 12:58:52,257 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 12:58:52,272 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 12:58:52,287 WARN L240 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_8f69b14d-683d-4b79-8ded-c494c8e083ff/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c[914,927] [2023-12-02 12:58:52,310 WARN L240 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_8f69b14d-683d-4b79-8ded-c494c8e083ff/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c[7115,7128] [2023-12-02 12:58:52,331 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 12:58:52,358 INFO L206 MainTranslator]: Completed translation [2023-12-02 12:58:52,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:58:52 WrapperNode [2023-12-02 12:58:52,359 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 12:58:52,360 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 12:58:52,360 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 12:58:52,360 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 12:58:52,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:58:52" (1/1) ... [2023-12-02 12:58:52,383 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:58:52" (1/1) ... [2023-12-02 12:58:52,432 INFO L138 Inliner]: procedures = 57, calls = 63, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 470 [2023-12-02 12:58:52,432 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 12:58:52,433 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 12:58:52,433 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 12:58:52,434 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 12:58:52,444 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:58:52" (1/1) ... [2023-12-02 12:58:52,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:58:52" (1/1) ... [2023-12-02 12:58:52,448 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:58:52" (1/1) ... [2023-12-02 12:58:52,448 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:58:52" (1/1) ... [2023-12-02 12:58:52,458 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:58:52" (1/1) ... [2023-12-02 12:58:52,467 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:58:52" (1/1) ... [2023-12-02 12:58:52,470 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:58:52" (1/1) ... [2023-12-02 12:58:52,472 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:58:52" (1/1) ... [2023-12-02 12:58:52,476 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 12:58:52,477 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 12:58:52,477 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 12:58:52,477 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 12:58:52,478 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:58:52" (1/1) ... [2023-12-02 12:58:52,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 12:58:52,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:58:52,513 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 12:58:52,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 12:58:52,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 12:58:52,572 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-12-02 12:58:52,572 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-12-02 12:58:52,572 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2023-12-02 12:58:52,573 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2023-12-02 12:58:52,573 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2023-12-02 12:58:52,573 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2023-12-02 12:58:52,573 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2023-12-02 12:58:52,574 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2023-12-02 12:58:52,574 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2023-12-02 12:58:52,574 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2023-12-02 12:58:52,574 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2023-12-02 12:58:52,575 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2023-12-02 12:58:52,575 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2023-12-02 12:58:52,575 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2023-12-02 12:58:52,575 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2023-12-02 12:58:52,575 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2023-12-02 12:58:52,576 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2023-12-02 12:58:52,576 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2023-12-02 12:58:52,576 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2023-12-02 12:58:52,576 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2023-12-02 12:58:52,577 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2023-12-02 12:58:52,577 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2023-12-02 12:58:52,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 12:58:52,578 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2023-12-02 12:58:52,578 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2023-12-02 12:58:52,578 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2023-12-02 12:58:52,578 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2023-12-02 12:58:52,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 12:58:52,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 12:58:52,579 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2023-12-02 12:58:52,579 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2023-12-02 12:58:52,700 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 12:58:52,702 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 12:58:53,211 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 12:58:53,458 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 12:58:53,458 INFO L309 CfgBuilder]: Removed 9 assume(true) statements. [2023-12-02 12:58:53,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:58:53 BoogieIcfgContainer [2023-12-02 12:58:53,461 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 12:58:53,465 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 12:58:53,465 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 12:58:53,469 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 12:58:53,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:58:51" (1/3) ... [2023-12-02 12:58:53,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d11898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:58:53, skipping insertion in model container [2023-12-02 12:58:53,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:58:52" (2/3) ... [2023-12-02 12:58:53,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d11898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:58:53, skipping insertion in model container [2023-12-02 12:58:53,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:58:53" (3/3) ... [2023-12-02 12:58:53,475 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.02.cil-1.c [2023-12-02 12:58:53,511 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 12:58:53,511 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-02 12:58:53,567 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 12:58:53,574 INFO L357 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, mHoare=true, 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;@72466979, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 12:58:53,574 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-02 12:58:53,578 INFO L276 IsEmpty]: Start isEmpty. Operand has 153 states, 106 states have (on average 1.471698113207547) internal successors, (156), 112 states have internal predecessors, (156), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2023-12-02 12:58:53,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 12:58:53,589 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:58:53,590 INFO L195 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] [2023-12-02 12:58:53,590 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:58:53,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:58:53,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1558148514, now seen corresponding path program 1 times [2023-12-02 12:58:53,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:58:53,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768771364] [2023-12-02 12:58:53,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:58:53,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:58:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:58:53,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:58:53,978 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:58:53,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768771364] [2023-12-02 12:58:53,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768771364] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:58:53,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:58:53,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 12:58:53,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834033166] [2023-12-02 12:58:53,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:58:53,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 12:58:53,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:58:54,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 12:58:54,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 12:58:54,026 INFO L87 Difference]: Start difference. First operand has 153 states, 106 states have (on average 1.471698113207547) internal successors, (156), 112 states have internal predecessors, (156), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-02 12:58:54,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:58:54,805 INFO L93 Difference]: Finished difference Result 575 states and 841 transitions. [2023-12-02 12:58:54,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 12:58:54,808 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2023-12-02 12:58:54,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:58:54,827 INFO L225 Difference]: With dead ends: 575 [2023-12-02 12:58:54,827 INFO L226 Difference]: Without dead ends: 417 [2023-12-02 12:58:54,834 INFO L412 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 [2023-12-02 12:58:54,838 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 552 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 12:58:54,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 525 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-02 12:58:54,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2023-12-02 12:58:54,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 406. [2023-12-02 12:58:54,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 292 states have (on average 1.356164383561644) internal successors, (396), 299 states have internal predecessors, (396), 75 states have call successors, (75), 38 states have call predecessors, (75), 37 states have return successors, (95), 70 states have call predecessors, (95), 73 states have call successors, (95) [2023-12-02 12:58:54,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 566 transitions. [2023-12-02 12:58:54,954 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 566 transitions. Word has length 37 [2023-12-02 12:58:54,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:58:54,954 INFO L495 AbstractCegarLoop]: Abstraction has 406 states and 566 transitions. [2023-12-02 12:58:54,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-02 12:58:54,955 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 566 transitions. [2023-12-02 12:58:54,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-02 12:58:54,959 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:58:54,959 INFO L195 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] [2023-12-02 12:58:54,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 12:58:54,960 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:58:54,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:58:54,961 INFO L85 PathProgramCache]: Analyzing trace with hash -619495534, now seen corresponding path program 1 times [2023-12-02 12:58:54,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:58:54,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44531632] [2023-12-02 12:58:54,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:58:54,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:58:55,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:58:55,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:58:55,104 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:58:55,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44531632] [2023-12-02 12:58:55,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44531632] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:58:55,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:58:55,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 12:58:55,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82892078] [2023-12-02 12:58:55,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:58:55,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 12:58:55,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:58:55,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 12:58:55,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 12:58:55,109 INFO L87 Difference]: Start difference. First operand 406 states and 566 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-02 12:58:55,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:58:55,403 INFO L93 Difference]: Finished difference Result 530 states and 728 transitions. [2023-12-02 12:58:55,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 12:58:55,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 45 [2023-12-02 12:58:55,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:58:55,411 INFO L225 Difference]: With dead ends: 530 [2023-12-02 12:58:55,411 INFO L226 Difference]: Without dead ends: 466 [2023-12-02 12:58:55,413 INFO L412 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 [2023-12-02 12:58:55,414 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 256 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 12:58:55,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 368 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 12:58:55,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2023-12-02 12:58:55,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 459. [2023-12-02 12:58:55,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 330 states have (on average 1.3424242424242425) internal successors, (443), 337 states have internal predecessors, (443), 83 states have call successors, (83), 45 states have call predecessors, (83), 44 states have return successors, (103), 78 states have call predecessors, (103), 81 states have call successors, (103) [2023-12-02 12:58:55,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 629 transitions. [2023-12-02 12:58:55,479 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 629 transitions. Word has length 45 [2023-12-02 12:58:55,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:58:55,479 INFO L495 AbstractCegarLoop]: Abstraction has 459 states and 629 transitions. [2023-12-02 12:58:55,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-02 12:58:55,480 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 629 transitions. [2023-12-02 12:58:55,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-02 12:58:55,483 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:58:55,483 INFO L195 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] [2023-12-02 12:58:55,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 12:58:55,484 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:58:55,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:58:55,484 INFO L85 PathProgramCache]: Analyzing trace with hash 299479089, now seen corresponding path program 1 times [2023-12-02 12:58:55,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:58:55,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204132129] [2023-12-02 12:58:55,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:58:55,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:58:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:58:55,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:58:55,598 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:58:55,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204132129] [2023-12-02 12:58:55,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204132129] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:58:55,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:58:55,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 12:58:55,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922845702] [2023-12-02 12:58:55,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:58:55,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 12:58:55,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:58:55,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 12:58:55,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 12:58:55,603 INFO L87 Difference]: Start difference. First operand 459 states and 629 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) [2023-12-02 12:58:56,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:58:56,341 INFO L93 Difference]: Finished difference Result 861 states and 1132 transitions. [2023-12-02 12:58:56,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 12:58:56,342 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 [2023-12-02 12:58:56,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:58:56,350 INFO L225 Difference]: With dead ends: 861 [2023-12-02 12:58:56,351 INFO L226 Difference]: Without dead ends: 729 [2023-12-02 12:58:56,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-02 12:58:56,354 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 594 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 12:58:56,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 696 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-02 12:58:56,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2023-12-02 12:58:56,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 645. [2023-12-02 12:58:56,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 462 states have (on average 1.3051948051948052) internal successors, (603), 470 states have internal predecessors, (603), 110 states have call successors, (110), 68 states have call predecessors, (110), 71 states have return successors, (134), 108 states have call predecessors, (134), 108 states have call successors, (134) [2023-12-02 12:58:56,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 847 transitions. [2023-12-02 12:58:56,459 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 847 transitions. Word has length 45 [2023-12-02 12:58:56,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:58:56,459 INFO L495 AbstractCegarLoop]: Abstraction has 645 states and 847 transitions. [2023-12-02 12:58:56,460 INFO L496 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) [2023-12-02 12:58:56,460 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 847 transitions. [2023-12-02 12:58:56,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-02 12:58:56,462 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:58:56,463 INFO L195 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] [2023-12-02 12:58:56,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 12:58:56,463 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:58:56,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:58:56,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1733252916, now seen corresponding path program 1 times [2023-12-02 12:58:56,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:58:56,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070666308] [2023-12-02 12:58:56,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:58:56,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:58:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:58:56,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:58:56,702 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:58:56,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070666308] [2023-12-02 12:58:56,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070666308] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:58:56,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:58:56,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 12:58:56,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990236552] [2023-12-02 12:58:56,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:58:56,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 12:58:56,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:58:56,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 12:58:56,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-02 12:58:56,705 INFO L87 Difference]: Start difference. First operand 645 states and 847 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) [2023-12-02 12:58:57,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:58:57,427 INFO L93 Difference]: Finished difference Result 1161 states and 1463 transitions. [2023-12-02 12:58:57,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 12:58:57,428 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 [2023-12-02 12:58:57,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:58:57,437 INFO L225 Difference]: With dead ends: 1161 [2023-12-02 12:58:57,437 INFO L226 Difference]: Without dead ends: 859 [2023-12-02 12:58:57,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-12-02 12:58:57,440 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 307 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 12:58:57,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 605 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 12:58:57,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2023-12-02 12:58:57,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 824. [2023-12-02 12:58:57,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 587 states have (on average 1.2862010221465077) internal successors, (755), 596 states have internal predecessors, (755), 137 states have call successors, (137), 91 states have call predecessors, (137), 98 states have return successors, (165), 138 states have call predecessors, (165), 135 states have call successors, (165) [2023-12-02 12:58:57,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1057 transitions. [2023-12-02 12:58:57,531 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1057 transitions. Word has length 46 [2023-12-02 12:58:57,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:58:57,532 INFO L495 AbstractCegarLoop]: Abstraction has 824 states and 1057 transitions. [2023-12-02 12:58:57,532 INFO L496 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) [2023-12-02 12:58:57,532 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1057 transitions. [2023-12-02 12:58:57,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-02 12:58:57,535 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:58:57,535 INFO L195 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] [2023-12-02 12:58:57,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 12:58:57,535 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:58:57,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:58:57,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1420471490, now seen corresponding path program 1 times [2023-12-02 12:58:57,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:58:57,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943958728] [2023-12-02 12:58:57,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:58:57,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:58:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:58:57,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:58:57,588 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:58:57,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943958728] [2023-12-02 12:58:57,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943958728] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:58:57,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:58:57,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 12:58:57,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111006648] [2023-12-02 12:58:57,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:58:57,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:58:57,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:58:57,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:58:57,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:58:57,591 INFO L87 Difference]: Start difference. First operand 824 states and 1057 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) [2023-12-02 12:58:57,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:58:57,756 INFO L93 Difference]: Finished difference Result 1388 states and 1727 transitions. [2023-12-02 12:58:57,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:58:57,757 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 [2023-12-02 12:58:57,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:58:57,766 INFO L225 Difference]: With dead ends: 1388 [2023-12-02 12:58:57,766 INFO L226 Difference]: Without dead ends: 956 [2023-12-02 12:58:57,768 INFO L412 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 [2023-12-02 12:58:57,769 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 67 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:58:57,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 319 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:58:57,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2023-12-02 12:58:57,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 851. [2023-12-02 12:58:57,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 610 states have (on average 1.278688524590164) internal successors, (780), 619 states have internal predecessors, (780), 139 states have call successors, (139), 93 states have call predecessors, (139), 100 states have return successors, (167), 140 states have call predecessors, (167), 137 states have call successors, (167) [2023-12-02 12:58:57,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1086 transitions. [2023-12-02 12:58:57,874 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1086 transitions. Word has length 47 [2023-12-02 12:58:57,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:58:57,875 INFO L495 AbstractCegarLoop]: Abstraction has 851 states and 1086 transitions. [2023-12-02 12:58:57,875 INFO L496 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) [2023-12-02 12:58:57,875 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1086 transitions. [2023-12-02 12:58:57,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-02 12:58:57,877 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:58:57,878 INFO L195 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] [2023-12-02 12:58:57,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 12:58:57,878 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:58:57,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:58:57,879 INFO L85 PathProgramCache]: Analyzing trace with hash -493605484, now seen corresponding path program 1 times [2023-12-02 12:58:57,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:58:57,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383473728] [2023-12-02 12:58:57,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:58:57,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:58:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:58:57,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 12:58:57,935 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:58:57,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383473728] [2023-12-02 12:58:57,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383473728] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:58:57,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:58:57,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 12:58:57,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619198880] [2023-12-02 12:58:57,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:58:57,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:58:57,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:58:57,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:58:57,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:58:57,939 INFO L87 Difference]: Start difference. First operand 851 states and 1086 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) [2023-12-02 12:58:58,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:58:58,081 INFO L93 Difference]: Finished difference Result 1041 states and 1307 transitions. [2023-12-02 12:58:58,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:58:58,082 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 [2023-12-02 12:58:58,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:58:58,088 INFO L225 Difference]: With dead ends: 1041 [2023-12-02 12:58:58,088 INFO L226 Difference]: Without dead ends: 768 [2023-12-02 12:58:58,089 INFO L412 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 [2023-12-02 12:58:58,090 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 169 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:58:58,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 238 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:58:58,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2023-12-02 12:58:58,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 659. [2023-12-02 12:58:58,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 470 states have (on average 1.2723404255319148) internal successors, (598), 477 states have internal predecessors, (598), 115 states have call successors, (115), 73 states have call predecessors, (115), 72 states have return successors, (135), 110 states have call predecessors, (135), 113 states have call successors, (135) [2023-12-02 12:58:58,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 848 transitions. [2023-12-02 12:58:58,168 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 848 transitions. Word has length 53 [2023-12-02 12:58:58,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:58:58,169 INFO L495 AbstractCegarLoop]: Abstraction has 659 states and 848 transitions. [2023-12-02 12:58:58,169 INFO L496 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) [2023-12-02 12:58:58,169 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 848 transitions. [2023-12-02 12:58:58,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-02 12:58:58,171 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:58:58,171 INFO L195 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] [2023-12-02 12:58:58,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 12:58:58,172 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:58:58,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:58:58,172 INFO L85 PathProgramCache]: Analyzing trace with hash -2016316846, now seen corresponding path program 1 times [2023-12-02 12:58:58,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:58:58,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247053153] [2023-12-02 12:58:58,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:58:58,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:58:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:58:58,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:58:58,267 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:58:58,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247053153] [2023-12-02 12:58:58,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247053153] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:58:58,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:58:58,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 12:58:58,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149693160] [2023-12-02 12:58:58,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:58:58,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 12:58:58,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:58:58,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 12:58:58,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 12:58:58,270 INFO L87 Difference]: Start difference. First operand 659 states and 848 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) [2023-12-02 12:58:58,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:58:58,583 INFO L93 Difference]: Finished difference Result 762 states and 964 transitions. [2023-12-02 12:58:58,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 12:58:58,584 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 [2023-12-02 12:58:58,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:58:58,590 INFO L225 Difference]: With dead ends: 762 [2023-12-02 12:58:58,590 INFO L226 Difference]: Without dead ends: 759 [2023-12-02 12:58:58,591 INFO L412 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 [2023-12-02 12:58:58,592 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 315 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 12:58:58,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 209 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 12:58:58,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2023-12-02 12:58:58,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 658. [2023-12-02 12:58:58,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 470 states have (on average 1.2659574468085106) internal successors, (595), 476 states have internal predecessors, (595), 114 states have call successors, (114), 73 states have call predecessors, (114), 72 states have return successors, (135), 110 states have call predecessors, (135), 113 states have call successors, (135) [2023-12-02 12:58:58,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 844 transitions. [2023-12-02 12:58:58,682 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 844 transitions. Word has length 54 [2023-12-02 12:58:58,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:58:58,682 INFO L495 AbstractCegarLoop]: Abstraction has 658 states and 844 transitions. [2023-12-02 12:58:58,682 INFO L496 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) [2023-12-02 12:58:58,683 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 844 transitions. [2023-12-02 12:58:58,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-02 12:58:58,684 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:58:58,684 INFO L195 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] [2023-12-02 12:58:58,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 12:58:58,685 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:58:58,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:58:58,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1917984295, now seen corresponding path program 1 times [2023-12-02 12:58:58,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:58:58,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114770532] [2023-12-02 12:58:58,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:58:58,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:58:58,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:58:58,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:58:58,845 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:58:58,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114770532] [2023-12-02 12:58:58,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114770532] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:58:58,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175477509] [2023-12-02 12:58:58,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:58:58,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:58:58,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:58:58,851 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:58:58,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 12:58:58,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:58:58,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-02 12:58:58,993 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:58:59,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:58:59,276 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:58:59,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:58:59,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175477509] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:58:59,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1049162964] [2023-12-02 12:58:59,401 INFO L159 IcfgInterpreter]: Started Sifa with 54 locations of interest [2023-12-02 12:58:59,401 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:58:59,406 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:58:59,412 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:58:59,412 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:59:02,000 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events1 with input of size 111 for LOIs [2023-12-02 12:59:02,093 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread1 with input of size 107 for LOIs [2023-12-02 12:59:02,160 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads1 with input of size 115 for LOIs [2023-12-02 12:59:02,789 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_write_p_triggered with input of size 111 for LOIs [2023-12-02 12:59:02,880 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_read_c_triggered with input of size 111 for LOIs [2023-12-02 12:59:02,977 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events1 with input of size 111 for LOIs [2023-12-02 12:59:03,019 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels1 with input of size 118 for LOIs [2023-12-02 12:59:03,060 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:59:12,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1049162964] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:59:12,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 12:59:12,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [5, 5, 4] total 41 [2023-12-02 12:59:12,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442964212] [2023-12-02 12:59:12,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:59:12,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-02 12:59:12,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:59:12,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-02 12:59:12,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1447, Unknown=0, NotChecked=0, Total=1640 [2023-12-02 12:59:12,521 INFO L87 Difference]: Start difference. First operand 658 states and 844 transitions. Second operand has 36 states, 26 states have (on average 1.5) internal successors, (39), 26 states have internal predecessors, (39), 8 states have call successors, (8), 7 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-02 12:59:28,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:59:28,480 INFO L93 Difference]: Finished difference Result 1022 states and 1255 transitions. [2023-12-02 12:59:28,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-12-02 12:59:28,481 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 26 states have (on average 1.5) internal successors, (39), 26 states have internal predecessors, (39), 8 states have call successors, (8), 7 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 55 [2023-12-02 12:59:28,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:59:28,487 INFO L225 Difference]: With dead ends: 1022 [2023-12-02 12:59:28,487 INFO L226 Difference]: Without dead ends: 707 [2023-12-02 12:59:28,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 126 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1430 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=601, Invalid=4091, Unknown=0, NotChecked=0, Total=4692 [2023-12-02 12:59:28,492 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 188 mSDsluCounter, 1652 mSDsCounter, 0 mSdLazyCounter, 3385 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 3535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 3385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2023-12-02 12:59:28,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 1792 Invalid, 3535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 3385 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2023-12-02 12:59:28,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2023-12-02 12:59:28,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 692. [2023-12-02 12:59:28,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 496 states have (on average 1.2560483870967742) internal successors, (623), 502 states have internal predecessors, (623), 116 states have call successors, (116), 79 states have call predecessors, (116), 78 states have return successors, (137), 112 states have call predecessors, (137), 115 states have call successors, (137) [2023-12-02 12:59:28,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 876 transitions. [2023-12-02 12:59:28,617 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 876 transitions. Word has length 55 [2023-12-02 12:59:28,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:59:28,618 INFO L495 AbstractCegarLoop]: Abstraction has 692 states and 876 transitions. [2023-12-02 12:59:28,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 26 states have (on average 1.5) internal successors, (39), 26 states have internal predecessors, (39), 8 states have call successors, (8), 7 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-02 12:59:28,618 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 876 transitions. [2023-12-02 12:59:28,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-02 12:59:28,620 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:59:28,620 INFO L195 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] [2023-12-02 12:59:28,632 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 12:59:28,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-12-02 12:59:28,821 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:59:28,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:59:28,822 INFO L85 PathProgramCache]: Analyzing trace with hash -2046508944, now seen corresponding path program 1 times [2023-12-02 12:59:28,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:59:28,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534752751] [2023-12-02 12:59:28,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:59:28,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:59:28,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:59:28,889 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 12:59:28,889 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:59:28,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534752751] [2023-12-02 12:59:28,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534752751] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:59:28,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:59:28,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 12:59:28,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321881546] [2023-12-02 12:59:28,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:59:28,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:59:28,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:59:28,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:59:28,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:59:28,893 INFO L87 Difference]: Start difference. First operand 692 states and 876 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) [2023-12-02 12:59:29,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:59:29,083 INFO L93 Difference]: Finished difference Result 973 states and 1198 transitions. [2023-12-02 12:59:29,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:59:29,083 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 [2023-12-02 12:59:29,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:59:29,090 INFO L225 Difference]: With dead ends: 973 [2023-12-02 12:59:29,090 INFO L226 Difference]: Without dead ends: 804 [2023-12-02 12:59:29,091 INFO L412 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 [2023-12-02 12:59:29,092 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 42 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:59:29,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 365 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:59:29,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2023-12-02 12:59:29,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 727. [2023-12-02 12:59:29,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 525 states have (on average 1.2552380952380953) internal successors, (659), 531 states have internal predecessors, (659), 119 states have call successors, (119), 82 states have call predecessors, (119), 81 states have return successors, (140), 115 states have call predecessors, (140), 118 states have call successors, (140) [2023-12-02 12:59:29,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 918 transitions. [2023-12-02 12:59:29,219 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 918 transitions. Word has length 61 [2023-12-02 12:59:29,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:59:29,219 INFO L495 AbstractCegarLoop]: Abstraction has 727 states and 918 transitions. [2023-12-02 12:59:29,219 INFO L496 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) [2023-12-02 12:59:29,220 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 918 transitions. [2023-12-02 12:59:29,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-02 12:59:29,221 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:59:29,222 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 12:59:29,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-02 12:59:29,222 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:59:29,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:59:29,223 INFO L85 PathProgramCache]: Analyzing trace with hash -187274692, now seen corresponding path program 1 times [2023-12-02 12:59:29,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:59:29,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756102734] [2023-12-02 12:59:29,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:59:29,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:59:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:59:29,417 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 12:59:29,418 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:59:29,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756102734] [2023-12-02 12:59:29,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756102734] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:59:29,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:59:29,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 12:59:29,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48929608] [2023-12-02 12:59:29,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:59:29,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 12:59:29,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:59:29,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 12:59:29,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-02 12:59:29,420 INFO L87 Difference]: Start difference. First operand 727 states and 918 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-02 12:59:30,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:59:30,002 INFO L93 Difference]: Finished difference Result 1190 states and 1444 transitions. [2023-12-02 12:59:30,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 12:59:30,003 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 63 [2023-12-02 12:59:30,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:59:30,009 INFO L225 Difference]: With dead ends: 1190 [2023-12-02 12:59:30,009 INFO L226 Difference]: Without dead ends: 887 [2023-12-02 12:59:30,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-12-02 12:59:30,012 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 291 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 12:59:30,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 485 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 12:59:30,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2023-12-02 12:59:30,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 866. [2023-12-02 12:59:30,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 619 states have (on average 1.2310177705977383) internal successors, (762), 625 states have internal predecessors, (762), 143 states have call successors, (143), 103 states have call predecessors, (143), 102 states have return successors, (164), 139 states have call predecessors, (164), 142 states have call successors, (164) [2023-12-02 12:59:30,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1069 transitions. [2023-12-02 12:59:30,187 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1069 transitions. Word has length 63 [2023-12-02 12:59:30,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:59:30,188 INFO L495 AbstractCegarLoop]: Abstraction has 866 states and 1069 transitions. [2023-12-02 12:59:30,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-02 12:59:30,188 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1069 transitions. [2023-12-02 12:59:30,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-02 12:59:30,190 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:59:30,191 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 12:59:30,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-02 12:59:30,191 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:59:30,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:59:30,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1844083599, now seen corresponding path program 1 times [2023-12-02 12:59:30,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:59:30,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822398630] [2023-12-02 12:59:30,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:59:30,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:59:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:59:30,331 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 12:59:30,332 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:59:30,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822398630] [2023-12-02 12:59:30,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822398630] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:59:30,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819208971] [2023-12-02 12:59:30,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:59:30,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:59:30,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:59:30,335 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:59:30,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 12:59:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:59:30,455 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-02 12:59:30,459 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:59:30,673 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 12:59:30,673 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:59:30,761 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 12:59:30,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819208971] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:59:30,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2060929932] [2023-12-02 12:59:30,766 INFO L159 IcfgInterpreter]: Started Sifa with 54 locations of interest [2023-12-02 12:59:30,766 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:59:30,767 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:59:30,767 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:59:30,767 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:59:35,368 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events1 with input of size 111 for LOIs [2023-12-02 12:59:35,405 INFO L197 IcfgInterpreter]: Interpreting procedure error1 with input of size 110 for LOIs [2023-12-02 12:59:35,541 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread1 with input of size 78 for LOIs [2023-12-02 12:59:35,651 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads1 with input of size 115 for LOIs [2023-12-02 12:59:36,135 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_write_p_triggered with input of size 111 for LOIs [2023-12-02 12:59:36,226 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_read_c_triggered with input of size 111 for LOIs [2023-12-02 12:59:36,321 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events1 with input of size 111 for LOIs [2023-12-02 12:59:36,359 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels1 with input of size 118 for LOIs [2023-12-02 12:59:36,398 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:59:47,127 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '22850#(and (= ~q_req_up~0 1) (exists ((|v_ULTIMATE.start_eval1_~tmp___0~2#1_BEFORE_CALL_5| Int)) (and (not (= |v_ULTIMATE.start_eval1_~tmp___0~2#1_BEFORE_CALL_5| 0)) (<= 0 (+ |v_ULTIMATE.start_eval1_~tmp___0~2#1_BEFORE_CALL_5| 2147483648)) (<= |v_ULTIMATE.start_eval1_~tmp___0~2#1_BEFORE_CALL_5| 2147483647))) (= ~q_free~0 1) (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) (exists ((|v_ULTIMATE.start_start_simulation1_~kernel_st~0#1_BEFORE_CALL_30| Int) (v_~c_last_read~0_10 Int) (v_~q_free~0_42 Int) (|v_ULTIMATE.start_eval1_~tmp___1~0#1_BEFORE_CALL_1| Int)) (and (not (= ~p_dw_st~0 0)) (<= 1 |#StackHeapBarrier|) (= v_~c_last_read~0_10 0) (= ~t1_pc~0 0) (<= 0 |v_ULTIMATE.start_eval1_~tmp___1~0#1_BEFORE_CALL_1|) (= |v_ULTIMATE.start_start_simulation1_~kernel_st~0#1_BEFORE_CALL_30| 1) (= ~T1_E~0 2) (<= 0 ~p_dw_pc~0) (= ~m_st~0 0) (<= 0 ~p_num_write~0) (= ~T2_E~0 2) (= 1 ~c_dr_i~0) (= ~t2_i~0 0) (= ~t1_st~0 0) (= ~c_num_read~0 1) (= ~m_i~0 0) (= ~E_2~0 2) (not (= v_~q_free~0_42 1)) (= ~local~0 0) (not (= |v_ULTIMATE.start_eval1_~tmp___1~0#1_BEFORE_CALL_1| 0)) (= ~token~0 0) (= ~m_pc~0 0) (= ~p_dw_i~0 1) (= 0 ~t2_pc~0) (= ~E_M~0 2) (= ~a_t~0 0) (= 0 ~t2_st~0) (<= |v_ULTIMATE.start_eval1_~tmp___1~0#1_BEFORE_CALL_1| 1) (<= v_~q_free~0_42 1) (= ~E_1~0 2) (= ~M_E~0 2) (= ~t1_i~0 0))) (= ~c_dr_st~0 1))' at error location [2023-12-02 12:59:47,127 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 12:59:47,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 12:59:47,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2023-12-02 12:59:47,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352508101] [2023-12-02 12:59:47,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 12:59:47,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 12:59:47,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:59:47,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 12:59:47,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1938, Unknown=0, NotChecked=0, Total=2162 [2023-12-02 12:59:47,131 INFO L87 Difference]: Start difference. First operand 866 states and 1069 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 6 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2023-12-02 12:59:47,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:59:47,743 INFO L93 Difference]: Finished difference Result 1960 states and 2310 transitions. [2023-12-02 12:59:47,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 12:59:47,743 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 6 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) Word has length 64 [2023-12-02 12:59:47,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:59:47,755 INFO L225 Difference]: With dead ends: 1960 [2023-12-02 12:59:47,756 INFO L226 Difference]: Without dead ends: 1957 [2023-12-02 12:59:47,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 148 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 948 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=224, Invalid=1938, Unknown=0, NotChecked=0, Total=2162 [2023-12-02 12:59:47,759 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 355 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 12:59:47,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 834 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 12:59:47,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1957 states. [2023-12-02 12:59:48,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1957 to 1380. [2023-12-02 12:59:48,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 975 states have (on average 1.2112820512820512) internal successors, (1181), 981 states have internal predecessors, (1181), 227 states have call successors, (227), 177 states have call predecessors, (227), 176 states have return successors, (248), 223 states have call predecessors, (248), 226 states have call successors, (248) [2023-12-02 12:59:48,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 1656 transitions. [2023-12-02 12:59:48,044 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 1656 transitions. Word has length 64 [2023-12-02 12:59:48,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:59:48,045 INFO L495 AbstractCegarLoop]: Abstraction has 1380 states and 1656 transitions. [2023-12-02 12:59:48,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 6 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2023-12-02 12:59:48,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 1656 transitions. [2023-12-02 12:59:48,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-02 12:59:48,047 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:59:48,048 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 12:59:48,055 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 12:59:48,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-02 12:59:48,251 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:59:48,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:59:48,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1051154436, now seen corresponding path program 2 times [2023-12-02 12:59:48,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:59:48,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608132117] [2023-12-02 12:59:48,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:59:48,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:59:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:59:48,296 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 12:59:48,296 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:59:48,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608132117] [2023-12-02 12:59:48,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608132117] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:59:48,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:59:48,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 12:59:48,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805496949] [2023-12-02 12:59:48,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:59:48,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:59:48,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:59:48,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:59:48,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:59:48,299 INFO L87 Difference]: Start difference. First operand 1380 states and 1656 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 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) [2023-12-02 12:59:48,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:59:48,574 INFO L93 Difference]: Finished difference Result 2132 states and 2512 transitions. [2023-12-02 12:59:48,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:59:48,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 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 67 [2023-12-02 12:59:48,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:59:48,583 INFO L225 Difference]: With dead ends: 2132 [2023-12-02 12:59:48,583 INFO L226 Difference]: Without dead ends: 1376 [2023-12-02 12:59:48,585 INFO L412 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 [2023-12-02 12:59:48,586 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 172 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:59:48,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 274 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:59:48,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2023-12-02 12:59:48,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1365. [2023-12-02 12:59:48,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 960 states have (on average 1.1989583333333333) internal successors, (1151), 966 states have internal predecessors, (1151), 227 states have call successors, (227), 177 states have call predecessors, (227), 176 states have return successors, (248), 223 states have call predecessors, (248), 226 states have call successors, (248) [2023-12-02 12:59:48,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 1626 transitions. [2023-12-02 12:59:48,827 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 1626 transitions. Word has length 67 [2023-12-02 12:59:48,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:59:48,828 INFO L495 AbstractCegarLoop]: Abstraction has 1365 states and 1626 transitions. [2023-12-02 12:59:48,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 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) [2023-12-02 12:59:48,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 1626 transitions. [2023-12-02 12:59:48,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-02 12:59:48,830 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:59:48,831 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:59:48,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-02 12:59:48,831 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:59:48,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:59:48,832 INFO L85 PathProgramCache]: Analyzing trace with hash -530613981, now seen corresponding path program 1 times [2023-12-02 12:59:48,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:59:48,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970283310] [2023-12-02 12:59:48,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:59:48,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:59:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:59:49,130 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 12:59:49,130 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:59:49,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970283310] [2023-12-02 12:59:49,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970283310] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:59:49,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:59:49,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 12:59:49,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747576858] [2023-12-02 12:59:49,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:59:49,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 12:59:49,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:59:49,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 12:59:49,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 12:59:49,133 INFO L87 Difference]: Start difference. First operand 1365 states and 1626 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-02 12:59:49,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:59:49,690 INFO L93 Difference]: Finished difference Result 2022 states and 2566 transitions. [2023-12-02 12:59:49,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 12:59:49,690 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 67 [2023-12-02 12:59:49,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:59:49,701 INFO L225 Difference]: With dead ends: 2022 [2023-12-02 12:59:49,701 INFO L226 Difference]: Without dead ends: 1691 [2023-12-02 12:59:49,703 INFO L412 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 [2023-12-02 12:59:49,704 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 309 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 12:59:49,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 458 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 12:59:49,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2023-12-02 12:59:49,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1664. [2023-12-02 12:59:49,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1664 states, 1177 states have (on average 1.2183517417162277) internal successors, (1434), 1186 states have internal predecessors, (1434), 279 states have call successors, (279), 207 states have call predecessors, (279), 206 states have return successors, (318), 272 states have call predecessors, (318), 278 states have call successors, (318) [2023-12-02 12:59:49,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 2031 transitions. [2023-12-02 12:59:49,957 INFO L78 Accepts]: Start accepts. Automaton has 1664 states and 2031 transitions. Word has length 67 [2023-12-02 12:59:49,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:59:49,957 INFO L495 AbstractCegarLoop]: Abstraction has 1664 states and 2031 transitions. [2023-12-02 12:59:49,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-02 12:59:49,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 2031 transitions. [2023-12-02 12:59:49,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-12-02 12:59:49,959 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:59:49,960 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:59:49,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-02 12:59:49,960 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:59:49,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:59:49,961 INFO L85 PathProgramCache]: Analyzing trace with hash -113326818, now seen corresponding path program 1 times [2023-12-02 12:59:49,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:59:49,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160050506] [2023-12-02 12:59:49,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:59:49,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:59:49,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:59:50,034 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 12:59:50,034 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:59:50,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160050506] [2023-12-02 12:59:50,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160050506] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:59:50,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:59:50,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 12:59:50,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519797749] [2023-12-02 12:59:50,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:59:50,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:59:50,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:59:50,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:59:50,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:59:50,036 INFO L87 Difference]: Start difference. First operand 1664 states and 2031 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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) [2023-12-02 12:59:50,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:59:50,414 INFO L93 Difference]: Finished difference Result 2319 states and 2966 transitions. [2023-12-02 12:59:50,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:59:50,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 69 [2023-12-02 12:59:50,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:59:50,429 INFO L225 Difference]: With dead ends: 2319 [2023-12-02 12:59:50,429 INFO L226 Difference]: Without dead ends: 1813 [2023-12-02 12:59:50,432 INFO L412 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 [2023-12-02 12:59:50,433 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 38 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:59:50,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 368 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:59:50,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2023-12-02 12:59:50,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1734. [2023-12-02 12:59:50,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1734 states, 1239 states have (on average 1.2300242130750605) internal successors, (1524), 1248 states have internal predecessors, (1524), 283 states have call successors, (283), 211 states have call predecessors, (283), 210 states have return successors, (322), 276 states have call predecessors, (322), 282 states have call successors, (322) [2023-12-02 12:59:50,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 2129 transitions. [2023-12-02 12:59:50,690 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 2129 transitions. Word has length 69 [2023-12-02 12:59:50,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:59:50,691 INFO L495 AbstractCegarLoop]: Abstraction has 1734 states and 2129 transitions. [2023-12-02 12:59:50,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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) [2023-12-02 12:59:50,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2129 transitions. [2023-12-02 12:59:50,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-02 12:59:50,694 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:59:50,694 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:59:50,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-02 12:59:50,695 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:59:50,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:59:50,695 INFO L85 PathProgramCache]: Analyzing trace with hash 116827474, now seen corresponding path program 1 times [2023-12-02 12:59:50,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:59:50,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403046190] [2023-12-02 12:59:50,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:59:50,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:59:50,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:59:50,743 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 12:59:50,743 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:59:50,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403046190] [2023-12-02 12:59:50,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403046190] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:59:50,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:59:50,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 12:59:50,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134198136] [2023-12-02 12:59:50,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:59:50,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:59:50,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:59:50,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:59:50,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:59:50,746 INFO L87 Difference]: Start difference. First operand 1734 states and 2129 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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) [2023-12-02 12:59:51,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:59:51,053 INFO L93 Difference]: Finished difference Result 2700 states and 3223 transitions. [2023-12-02 12:59:51,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:59:51,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 71 [2023-12-02 12:59:51,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:59:51,064 INFO L225 Difference]: With dead ends: 2700 [2023-12-02 12:59:51,064 INFO L226 Difference]: Without dead ends: 1910 [2023-12-02 12:59:51,067 INFO L412 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 [2023-12-02 12:59:51,068 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 37 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:59:51,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 356 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:59:51,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1910 states. [2023-12-02 12:59:51,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1910 to 1781. [2023-12-02 12:59:51,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1781 states, 1278 states have (on average 1.2284820031298904) internal successors, (1570), 1287 states have internal predecessors, (1570), 287 states have call successors, (287), 215 states have call predecessors, (287), 214 states have return successors, (326), 280 states have call predecessors, (326), 286 states have call successors, (326) [2023-12-02 12:59:51,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1781 states and 2183 transitions. [2023-12-02 12:59:51,321 INFO L78 Accepts]: Start accepts. Automaton has 1781 states and 2183 transitions. Word has length 71 [2023-12-02 12:59:51,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:59:51,321 INFO L495 AbstractCegarLoop]: Abstraction has 1781 states and 2183 transitions. [2023-12-02 12:59:51,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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) [2023-12-02 12:59:51,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 2183 transitions. [2023-12-02 12:59:51,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-12-02 12:59:51,324 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:59:51,324 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:59:51,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-02 12:59:51,325 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:59:51,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:59:51,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1903142021, now seen corresponding path program 1 times [2023-12-02 12:59:51,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:59:51,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696275475] [2023-12-02 12:59:51,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:59:51,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:59:51,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:59:51,371 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-02 12:59:51,371 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:59:51,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696275475] [2023-12-02 12:59:51,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696275475] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:59:51,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:59:51,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 12:59:51,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264996666] [2023-12-02 12:59:51,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:59:51,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:59:51,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:59:51,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:59:51,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:59:51,374 INFO L87 Difference]: Start difference. First operand 1781 states and 2183 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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) [2023-12-02 12:59:51,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:59:51,717 INFO L93 Difference]: Finished difference Result 2830 states and 3666 transitions. [2023-12-02 12:59:51,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:59:51,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 88 [2023-12-02 12:59:51,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:59:51,727 INFO L225 Difference]: With dead ends: 2830 [2023-12-02 12:59:51,727 INFO L226 Difference]: Without dead ends: 2129 [2023-12-02 12:59:51,730 INFO L412 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 [2023-12-02 12:59:51,731 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 162 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:59:51,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 272 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:59:51,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2129 states. [2023-12-02 12:59:52,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2129 to 2120. [2023-12-02 12:59:52,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2120 states, 1531 states have (on average 1.2384062704114958) internal successors, (1896), 1543 states have internal predecessors, (1896), 341 states have call successors, (341), 247 states have call predecessors, (341), 246 states have return successors, (398), 331 states have call predecessors, (398), 340 states have call successors, (398) [2023-12-02 12:59:52,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 2120 states and 2635 transitions. [2023-12-02 12:59:52,017 INFO L78 Accepts]: Start accepts. Automaton has 2120 states and 2635 transitions. Word has length 88 [2023-12-02 12:59:52,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:59:52,018 INFO L495 AbstractCegarLoop]: Abstraction has 2120 states and 2635 transitions. [2023-12-02 12:59:52,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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) [2023-12-02 12:59:52,018 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 2635 transitions. [2023-12-02 12:59:52,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-02 12:59:52,022 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:59:52,022 INFO L195 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] [2023-12-02 12:59:52,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-02 12:59:52,023 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:59:52,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:59:52,024 INFO L85 PathProgramCache]: Analyzing trace with hash 913647151, now seen corresponding path program 1 times [2023-12-02 12:59:52,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:59:52,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957078342] [2023-12-02 12:59:52,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:59:52,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:59:52,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:59:52,361 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-12-02 12:59:52,361 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:59:52,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957078342] [2023-12-02 12:59:52,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957078342] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:59:52,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145981525] [2023-12-02 12:59:52,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:59:52,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:59:52,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:59:52,363 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:59:52,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 12:59:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:59:52,493 INFO L262 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-02 12:59:52,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:59:52,540 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 12:59:52,541 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:59:52,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145981525] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:59:52,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 12:59:52,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 17 [2023-12-02 12:59:52,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533158273] [2023-12-02 12:59:52,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:59:52,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 12:59:52,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:59:52,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 12:59:52,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2023-12-02 12:59:52,543 INFO L87 Difference]: Start difference. First operand 2120 states and 2635 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) [2023-12-02 12:59:52,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:59:52,916 INFO L93 Difference]: Finished difference Result 2982 states and 3639 transitions. [2023-12-02 12:59:52,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 12:59:52,916 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 [2023-12-02 12:59:52,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:59:52,925 INFO L225 Difference]: With dead ends: 2982 [2023-12-02 12:59:52,925 INFO L226 Difference]: Without dead ends: 1935 [2023-12-02 12:59:52,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2023-12-02 12:59:52,928 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 166 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:59:52,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 775 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:59:52,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2023-12-02 12:59:53,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1750. [2023-12-02 12:59:53,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1750 states, 1293 states have (on average 1.25676720804331) internal successors, (1625), 1305 states have internal predecessors, (1625), 270 states have call successors, (270), 186 states have call predecessors, (270), 185 states have return successors, (327), 260 states have call predecessors, (327), 269 states have call successors, (327) [2023-12-02 12:59:53,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 2222 transitions. [2023-12-02 12:59:53,136 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 2222 transitions. Word has length 102 [2023-12-02 12:59:53,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:59:53,136 INFO L495 AbstractCegarLoop]: Abstraction has 1750 states and 2222 transitions. [2023-12-02 12:59:53,136 INFO L496 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) [2023-12-02 12:59:53,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2222 transitions. [2023-12-02 12:59:53,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-02 12:59:53,140 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:59:53,140 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:59:53,146 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-02 12:59:53,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-02 12:59:53,341 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:59:53,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:59:53,342 INFO L85 PathProgramCache]: Analyzing trace with hash 997295754, now seen corresponding path program 1 times [2023-12-02 12:59:53,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:59:53,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240695357] [2023-12-02 12:59:53,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:59:53,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:59:53,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:59:53,452 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 12:59:53,453 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:59:53,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240695357] [2023-12-02 12:59:53,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240695357] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:59:53,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648043796] [2023-12-02 12:59:53,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:59:53,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:59:53,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:59:53,455 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:59:53,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 12:59:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:59:53,603 INFO L262 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 12:59:53,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:59:53,635 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-02 12:59:53,636 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:59:53,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648043796] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:59:53,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 12:59:53,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-12-02 12:59:53,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807027698] [2023-12-02 12:59:53,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:59:53,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:59:53,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:59:53,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:59:53,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 12:59:53,638 INFO L87 Difference]: Start difference. First operand 1750 states and 2222 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, (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) [2023-12-02 12:59:53,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:59:53,972 INFO L93 Difference]: Finished difference Result 2687 states and 3535 transitions. [2023-12-02 12:59:53,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:59:53,973 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, (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 101 [2023-12-02 12:59:53,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:59:53,986 INFO L225 Difference]: With dead ends: 2687 [2023-12-02 12:59:53,986 INFO L226 Difference]: Without dead ends: 1987 [2023-12-02 12:59:53,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 12:59:53,990 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 53 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:59:53,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 372 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:59:53,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2023-12-02 12:59:54,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1852. [2023-12-02 12:59:54,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1852 states, 1381 states have (on average 1.270818247646633) internal successors, (1755), 1393 states have internal predecessors, (1755), 277 states have call successors, (277), 193 states have call predecessors, (277), 192 states have return successors, (334), 267 states have call predecessors, (334), 276 states have call successors, (334) [2023-12-02 12:59:54,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1852 states to 1852 states and 2366 transitions. [2023-12-02 12:59:54,363 INFO L78 Accepts]: Start accepts. Automaton has 1852 states and 2366 transitions. Word has length 101 [2023-12-02 12:59:54,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:59:54,364 INFO L495 AbstractCegarLoop]: Abstraction has 1852 states and 2366 transitions. [2023-12-02 12:59:54,364 INFO L496 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, (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) [2023-12-02 12:59:54,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 2366 transitions. [2023-12-02 12:59:54,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-02 12:59:54,370 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:59:54,370 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:59:54,377 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-02 12:59:54,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-02 12:59:54,571 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:59:54,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:59:54,572 INFO L85 PathProgramCache]: Analyzing trace with hash -982830524, now seen corresponding path program 2 times [2023-12-02 12:59:54,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:59:54,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600298789] [2023-12-02 12:59:54,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:59:54,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:59:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:59:54,794 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-02 12:59:54,795 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:59:54,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600298789] [2023-12-02 12:59:54,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600298789] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:59:54,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623036253] [2023-12-02 12:59:54,795 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 12:59:54,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:59:54,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:59:54,797 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:59:54,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 12:59:54,919 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 12:59:54,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 12:59:54,921 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 12:59:54,925 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:59:54,947 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-02 12:59:54,947 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:59:54,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623036253] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:59:54,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 12:59:54,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-02 12:59:54,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206892052] [2023-12-02 12:59:54,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:59:54,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:59:54,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:59:54,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:59:54,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-02 12:59:54,950 INFO L87 Difference]: Start difference. First operand 1852 states and 2366 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-02 12:59:55,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:59:55,259 INFO L93 Difference]: Finished difference Result 2661 states and 3573 transitions. [2023-12-02 12:59:55,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:59:55,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 101 [2023-12-02 12:59:55,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:59:55,272 INFO L225 Difference]: With dead ends: 2661 [2023-12-02 12:59:55,272 INFO L226 Difference]: Without dead ends: 1859 [2023-12-02 12:59:55,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-02 12:59:55,277 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 85 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:59:55,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 359 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:59:55,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states. [2023-12-02 12:59:55,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1848. [2023-12-02 12:59:55,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1848 states, 1377 states have (on average 1.2541757443718229) internal successors, (1727), 1389 states have internal predecessors, (1727), 277 states have call successors, (277), 193 states have call predecessors, (277), 192 states have return successors, (334), 267 states have call predecessors, (334), 276 states have call successors, (334) [2023-12-02 12:59:55,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2338 transitions. [2023-12-02 12:59:55,588 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2338 transitions. Word has length 101 [2023-12-02 12:59:55,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:59:55,589 INFO L495 AbstractCegarLoop]: Abstraction has 1848 states and 2338 transitions. [2023-12-02 12:59:55,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-02 12:59:55,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2338 transitions. [2023-12-02 12:59:55,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-02 12:59:55,595 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:59:55,595 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:59:55,602 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 12:59:55,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:59:55,796 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:59:55,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:59:55,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1265761124, now seen corresponding path program 1 times [2023-12-02 12:59:55,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:59:55,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227076883] [2023-12-02 12:59:55,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:59:55,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:59:55,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:59:56,025 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-02 12:59:56,025 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:59:56,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227076883] [2023-12-02 12:59:56,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227076883] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:59:56,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799504608] [2023-12-02 12:59:56,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:59:56,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:59:56,026 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:59:56,027 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:59:56,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 12:59:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:59:56,173 INFO L262 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 12:59:56,176 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:59:56,201 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 12:59:56,201 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:59:56,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799504608] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:59:56,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 12:59:56,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-02 12:59:56,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550934666] [2023-12-02 12:59:56,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:59:56,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:59:56,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:59:56,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:59:56,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-02 12:59:56,203 INFO L87 Difference]: Start difference. First operand 1848 states and 2338 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, (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) [2023-12-02 12:59:56,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:59:56,620 INFO L93 Difference]: Finished difference Result 3511 states and 4600 transitions. [2023-12-02 12:59:56,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:59:56,620 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, (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 101 [2023-12-02 12:59:56,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:59:56,637 INFO L225 Difference]: With dead ends: 3511 [2023-12-02 12:59:56,637 INFO L226 Difference]: Without dead ends: 2374 [2023-12-02 12:59:56,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-02 12:59:56,643 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 43 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:59:56,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 328 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:59:56,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2374 states. [2023-12-02 12:59:57,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2374 to 2029. [2023-12-02 12:59:57,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2029 states, 1530 states have (on average 1.2660130718954248) internal successors, (1937), 1543 states have internal predecessors, (1937), 291 states have call successors, (291), 207 states have call predecessors, (291), 206 states have return successors, (348), 280 states have call predecessors, (348), 290 states have call successors, (348) [2023-12-02 12:59:57,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 2029 states and 2576 transitions. [2023-12-02 12:59:57,128 INFO L78 Accepts]: Start accepts. Automaton has 2029 states and 2576 transitions. Word has length 101 [2023-12-02 12:59:57,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:59:57,128 INFO L495 AbstractCegarLoop]: Abstraction has 2029 states and 2576 transitions. [2023-12-02 12:59:57,129 INFO L496 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, (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) [2023-12-02 12:59:57,129 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 2576 transitions. [2023-12-02 12:59:57,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-02 12:59:57,137 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:59:57,138 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:59:57,145 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 12:59:57,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2023-12-02 12:59:57,339 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:59:57,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:59:57,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1690728467, now seen corresponding path program 1 times [2023-12-02 12:59:57,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:59:57,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788356109] [2023-12-02 12:59:57,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:59:57,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:59:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:59:57,537 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 14 proven. 19 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-12-02 12:59:57,537 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:59:57,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788356109] [2023-12-02 12:59:57,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788356109] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:59:57,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33305286] [2023-12-02 12:59:57,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:59:57,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:59:57,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:59:57,539 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:59:57,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 12:59:57,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:59:57,685 INFO L262 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-02 12:59:57,689 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:59:57,749 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-02 12:59:57,749 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:59:57,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33305286] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:59:57,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 12:59:57,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2023-12-02 12:59:57,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682509898] [2023-12-02 12:59:57,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:59:57,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 12:59:57,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:59:57,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 12:59:57,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 12:59:57,751 INFO L87 Difference]: Start difference. First operand 2029 states and 2576 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-02 12:59:58,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:59:58,338 INFO L93 Difference]: Finished difference Result 4046 states and 5267 transitions. [2023-12-02 12:59:58,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 12:59:58,339 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 103 [2023-12-02 12:59:58,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:59:58,357 INFO L225 Difference]: With dead ends: 4046 [2023-12-02 12:59:58,357 INFO L226 Difference]: Without dead ends: 2728 [2023-12-02 12:59:58,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2023-12-02 12:59:58,363 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 307 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 12:59:58,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 372 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 12:59:58,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2728 states. [2023-12-02 12:59:58,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2728 to 2726. [2023-12-02 12:59:58,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2726 states, 2050 states have (on average 1.2478048780487805) internal successors, (2558), 2069 states have internal predecessors, (2558), 399 states have call successors, (399), 276 states have call predecessors, (399), 275 states have return successors, (495), 382 states have call predecessors, (495), 398 states have call successors, (495) [2023-12-02 12:59:58,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2726 states to 2726 states and 3452 transitions. [2023-12-02 12:59:58,711 INFO L78 Accepts]: Start accepts. Automaton has 2726 states and 3452 transitions. Word has length 103 [2023-12-02 12:59:58,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:59:58,711 INFO L495 AbstractCegarLoop]: Abstraction has 2726 states and 3452 transitions. [2023-12-02 12:59:58,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-02 12:59:58,712 INFO L276 IsEmpty]: Start isEmpty. Operand 2726 states and 3452 transitions. [2023-12-02 12:59:58,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-02 12:59:58,717 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:59:58,717 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:59:58,723 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-02 12:59:58,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-12-02 12:59:58,918 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:59:58,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:59:58,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1878454463, now seen corresponding path program 1 times [2023-12-02 12:59:58,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:59:58,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267699185] [2023-12-02 12:59:58,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:59:58,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:59:58,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:59:58,984 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-12-02 12:59:58,984 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:59:58,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267699185] [2023-12-02 12:59:58,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267699185] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:59:58,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:59:58,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 12:59:58,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367385157] [2023-12-02 12:59:58,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:59:58,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 12:59:58,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:59:58,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 12:59:58,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 12:59:58,987 INFO L87 Difference]: Start difference. First operand 2726 states and 3452 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-02 12:59:59,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:59:59,496 INFO L93 Difference]: Finished difference Result 4555 states and 5955 transitions. [2023-12-02 12:59:59,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 12:59:59,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 107 [2023-12-02 12:59:59,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:59:59,508 INFO L225 Difference]: With dead ends: 4555 [2023-12-02 12:59:59,508 INFO L226 Difference]: Without dead ends: 3067 [2023-12-02 12:59:59,513 INFO L412 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 [2023-12-02 12:59:59,513 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 195 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:59:59,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 298 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:59:59,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3067 states. [2023-12-02 12:59:59,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3067 to 3011. [2023-12-02 12:59:59,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3011 states, 2297 states have (on average 1.2363952982150632) internal successors, (2840), 2313 states have internal predecessors, (2840), 405 states have call successors, (405), 306 states have call predecessors, (405), 307 states have return successors, (500), 393 states have call predecessors, (500), 404 states have call successors, (500) [2023-12-02 12:59:59,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3011 states to 3011 states and 3745 transitions. [2023-12-02 12:59:59,846 INFO L78 Accepts]: Start accepts. Automaton has 3011 states and 3745 transitions. Word has length 107 [2023-12-02 12:59:59,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:59:59,847 INFO L495 AbstractCegarLoop]: Abstraction has 3011 states and 3745 transitions. [2023-12-02 12:59:59,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-02 12:59:59,847 INFO L276 IsEmpty]: Start isEmpty. Operand 3011 states and 3745 transitions. [2023-12-02 12:59:59,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-02 12:59:59,853 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:59:59,853 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:59:59,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-02 12:59:59,853 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:59:59,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:59:59,853 INFO L85 PathProgramCache]: Analyzing trace with hash 826117856, now seen corresponding path program 2 times [2023-12-02 12:59:59,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:59:59,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341411271] [2023-12-02 12:59:59,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:59:59,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:59:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:59:59,908 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-02 12:59:59,909 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:59:59,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341411271] [2023-12-02 12:59:59,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341411271] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:59:59,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:59:59,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 12:59:59,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931623209] [2023-12-02 12:59:59,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:59:59,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 12:59:59,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:59:59,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 12:59:59,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 12:59:59,911 INFO L87 Difference]: Start difference. First operand 3011 states and 3745 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-02 13:00:00,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:00:00,553 INFO L93 Difference]: Finished difference Result 5135 states and 6620 transitions. [2023-12-02 13:00:00,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:00:00,553 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 107 [2023-12-02 13:00:00,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:00:00,569 INFO L225 Difference]: With dead ends: 5135 [2023-12-02 13:00:00,569 INFO L226 Difference]: Without dead ends: 3441 [2023-12-02 13:00:00,573 INFO L412 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 [2023-12-02 13:00:00,574 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 250 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:00:00,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 383 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:00:00,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3441 states. [2023-12-02 13:00:00,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3441 to 2773. [2023-12-02 13:00:00,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2773 states, 2113 states have (on average 1.2030288689067676) internal successors, (2542), 2129 states have internal predecessors, (2542), 374 states have call successors, (374), 285 states have call predecessors, (374), 284 states have return successors, (420), 360 states have call predecessors, (420), 373 states have call successors, (420) [2023-12-02 13:00:00,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2773 states to 2773 states and 3336 transitions. [2023-12-02 13:00:00,901 INFO L78 Accepts]: Start accepts. Automaton has 2773 states and 3336 transitions. Word has length 107 [2023-12-02 13:00:00,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:00:00,901 INFO L495 AbstractCegarLoop]: Abstraction has 2773 states and 3336 transitions. [2023-12-02 13:00:00,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-02 13:00:00,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2773 states and 3336 transitions. [2023-12-02 13:00:00,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-02 13:00:00,906 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:00:00,906 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:00:00,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-02 13:00:00,907 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:00:00,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:00:00,907 INFO L85 PathProgramCache]: Analyzing trace with hash -547953320, now seen corresponding path program 1 times [2023-12-02 13:00:00,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:00:00,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489209081] [2023-12-02 13:00:00,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:00:00,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:00:00,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:00:01,033 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-02 13:00:01,034 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:00:01,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489209081] [2023-12-02 13:00:01,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489209081] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:00:01,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202902026] [2023-12-02 13:00:01,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:00:01,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:00:01,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:00:01,036 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:00:01,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 13:00:01,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:00:01,171 INFO L262 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 13:00:01,173 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:00:01,190 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 13:00:01,190 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:00:01,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202902026] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:00:01,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 13:00:01,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-12-02 13:00:01,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638225353] [2023-12-02 13:00:01,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:00:01,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:00:01,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:00:01,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:00:01,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:00:01,193 INFO L87 Difference]: Start difference. First operand 2773 states and 3336 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-02 13:00:01,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:00:01,764 INFO L93 Difference]: Finished difference Result 4006 states and 4853 transitions. [2023-12-02 13:00:01,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 13:00:01,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 108 [2023-12-02 13:00:01,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:00:01,775 INFO L225 Difference]: With dead ends: 4006 [2023-12-02 13:00:01,775 INFO L226 Difference]: Without dead ends: 2844 [2023-12-02 13:00:01,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 13:00:01,779 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 166 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:00:01,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 505 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:00:01,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2844 states. [2023-12-02 13:00:02,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2844 to 2681. [2023-12-02 13:00:02,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2681 states, 2034 states have (on average 1.2010816125860373) internal successors, (2443), 2047 states have internal predecessors, (2443), 369 states have call successors, (369), 277 states have call predecessors, (369), 276 states have return successors, (409), 358 states have call predecessors, (409), 368 states have call successors, (409) [2023-12-02 13:00:02,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2681 states to 2681 states and 3221 transitions. [2023-12-02 13:00:02,108 INFO L78 Accepts]: Start accepts. Automaton has 2681 states and 3221 transitions. Word has length 108 [2023-12-02 13:00:02,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:00:02,108 INFO L495 AbstractCegarLoop]: Abstraction has 2681 states and 3221 transitions. [2023-12-02 13:00:02,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-02 13:00:02,108 INFO L276 IsEmpty]: Start isEmpty. Operand 2681 states and 3221 transitions. [2023-12-02 13:00:02,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-02 13:00:02,112 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:00:02,113 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:00:02,118 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-02 13:00:02,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-12-02 13:00:02,313 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:00:02,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:00:02,314 INFO L85 PathProgramCache]: Analyzing trace with hash -473107396, now seen corresponding path program 1 times [2023-12-02 13:00:02,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:00:02,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574484713] [2023-12-02 13:00:02,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:00:02,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:00:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:00:02,459 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 26 proven. 11 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-12-02 13:00:02,460 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:00:02,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574484713] [2023-12-02 13:00:02,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574484713] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:00:02,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856009637] [2023-12-02 13:00:02,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:00:02,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:00:02,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:00:02,462 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:00:02,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 13:00:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:00:02,609 INFO L262 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 13:00:02,613 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:00:02,665 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-02 13:00:02,666 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:00:02,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856009637] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:00:02,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 13:00:02,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2023-12-02 13:00:02,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795901802] [2023-12-02 13:00:02,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:00:02,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:00:02,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:00:02,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:00:02,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:00:02,668 INFO L87 Difference]: Start difference. First operand 2681 states and 3221 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-02 13:00:03,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:00:03,109 INFO L93 Difference]: Finished difference Result 4329 states and 5315 transitions. [2023-12-02 13:00:03,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:00:03,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 110 [2023-12-02 13:00:03,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:00:03,116 INFO L225 Difference]: With dead ends: 4329 [2023-12-02 13:00:03,116 INFO L226 Difference]: Without dead ends: 2986 [2023-12-02 13:00:03,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:00:03,120 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 150 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:00:03,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 206 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:00:03,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2986 states. [2023-12-02 13:00:03,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2986 to 2950. [2023-12-02 13:00:03,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2950 states, 2277 states have (on average 1.1831357048748352) internal successors, (2694), 2290 states have internal predecessors, (2694), 371 states have call successors, (371), 301 states have call predecessors, (371), 300 states have return successors, (441), 360 states have call predecessors, (441), 370 states have call successors, (441) [2023-12-02 13:00:03,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2950 states to 2950 states and 3506 transitions. [2023-12-02 13:00:03,469 INFO L78 Accepts]: Start accepts. Automaton has 2950 states and 3506 transitions. Word has length 110 [2023-12-02 13:00:03,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:00:03,470 INFO L495 AbstractCegarLoop]: Abstraction has 2950 states and 3506 transitions. [2023-12-02 13:00:03,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-02 13:00:03,470 INFO L276 IsEmpty]: Start isEmpty. Operand 2950 states and 3506 transitions. [2023-12-02 13:00:03,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-02 13:00:03,477 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:00:03,477 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:00:03,483 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 13:00:03,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:00:03,678 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:00:03,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:00:03,678 INFO L85 PathProgramCache]: Analyzing trace with hash 2105082985, now seen corresponding path program 1 times [2023-12-02 13:00:03,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:00:03,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834636487] [2023-12-02 13:00:03,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:00:03,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:00:03,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:00:03,765 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-12-02 13:00:03,765 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:00:03,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834636487] [2023-12-02 13:00:03,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834636487] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:00:03,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069761583] [2023-12-02 13:00:03,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:00:03,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:00:03,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:00:03,767 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:00:03,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-02 13:00:03,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:00:03,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 13:00:03,904 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:00:03,928 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-02 13:00:03,929 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:00:03,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069761583] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:00:03,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 13:00:03,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-12-02 13:00:03,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479218856] [2023-12-02 13:00:03,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:00:03,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:00:03,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:00:03,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:00:03,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:00:03,931 INFO L87 Difference]: Start difference. First operand 2950 states and 3506 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-02 13:00:04,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:00:04,390 INFO L93 Difference]: Finished difference Result 4539 states and 5483 transitions. [2023-12-02 13:00:04,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:00:04,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 106 [2023-12-02 13:00:04,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:00:04,397 INFO L225 Difference]: With dead ends: 4539 [2023-12-02 13:00:04,397 INFO L226 Difference]: Without dead ends: 3348 [2023-12-02 13:00:04,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:00:04,401 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 41 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:00:04,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 371 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:00:04,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3348 states. [2023-12-02 13:00:04,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3348 to 3138. [2023-12-02 13:00:04,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3138 states, 2433 states have (on average 1.1894780106863954) internal successors, (2894), 2446 states have internal predecessors, (2894), 387 states have call successors, (387), 317 states have call predecessors, (387), 316 states have return successors, (457), 376 states have call predecessors, (457), 386 states have call successors, (457) [2023-12-02 13:00:04,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 3738 transitions. [2023-12-02 13:00:04,933 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 3738 transitions. Word has length 106 [2023-12-02 13:00:04,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:00:04,933 INFO L495 AbstractCegarLoop]: Abstraction has 3138 states and 3738 transitions. [2023-12-02 13:00:04,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-02 13:00:04,934 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 3738 transitions. [2023-12-02 13:00:04,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-02 13:00:04,943 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:00:04,943 INFO L195 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] [2023-12-02 13:00:04,950 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-02 13:00:05,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-12-02 13:00:05,147 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:00:05,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:00:05,147 INFO L85 PathProgramCache]: Analyzing trace with hash -392345977, now seen corresponding path program 1 times [2023-12-02 13:00:05,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:00:05,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272516985] [2023-12-02 13:00:05,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:00:05,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:00:05,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:00:05,318 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 25 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-02 13:00:05,318 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:00:05,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272516985] [2023-12-02 13:00:05,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272516985] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:00:05,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113496920] [2023-12-02 13:00:05,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:00:05,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:00:05,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:00:05,320 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:00:05,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-02 13:00:05,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:00:05,455 INFO L262 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-02 13:00:05,459 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:00:05,540 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 13:00:05,540 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:00:05,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113496920] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:00:05,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 13:00:05,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2023-12-02 13:00:05,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751832264] [2023-12-02 13:00:05,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:00:05,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 13:00:05,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:00:05,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 13:00:05,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-12-02 13:00:05,543 INFO L87 Difference]: Start difference. First operand 3138 states and 3738 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) [2023-12-02 13:00:06,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:00:06,226 INFO L93 Difference]: Finished difference Result 3687 states and 4363 transitions. [2023-12-02 13:00:06,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 13:00:06,226 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 [2023-12-02 13:00:06,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:00:06,233 INFO L225 Difference]: With dead ends: 3687 [2023-12-02 13:00:06,233 INFO L226 Difference]: Without dead ends: 3094 [2023-12-02 13:00:06,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2023-12-02 13:00:06,235 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 65 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:00:06,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 974 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:00:06,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3094 states. [2023-12-02 13:00:06,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3094 to 3002. [2023-12-02 13:00:06,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3002 states, 2333 states have (on average 1.1903129018431204) internal successors, (2777), 2346 states have internal predecessors, (2777), 368 states have call successors, (368), 300 states have call predecessors, (368), 299 states have return successors, (438), 357 states have call predecessors, (438), 367 states have call successors, (438) [2023-12-02 13:00:06,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3002 states to 3002 states and 3583 transitions. [2023-12-02 13:00:06,585 INFO L78 Accepts]: Start accepts. Automaton has 3002 states and 3583 transitions. Word has length 112 [2023-12-02 13:00:06,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:00:06,586 INFO L495 AbstractCegarLoop]: Abstraction has 3002 states and 3583 transitions. [2023-12-02 13:00:06,586 INFO L496 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) [2023-12-02 13:00:06,586 INFO L276 IsEmpty]: Start isEmpty. Operand 3002 states and 3583 transitions. [2023-12-02 13:00:06,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-02 13:00:06,592 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:00:06,592 INFO L195 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] [2023-12-02 13:00:06,597 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-02 13:00:06,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-12-02 13:00:06,793 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:00:06,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:00:06,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1832516193, now seen corresponding path program 1 times [2023-12-02 13:00:06,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:00:06,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411821680] [2023-12-02 13:00:06,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:00:06,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:00:06,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:00:06,941 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-02 13:00:06,941 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:00:06,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411821680] [2023-12-02 13:00:06,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411821680] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:00:06,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718298893] [2023-12-02 13:00:06,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:00:06,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:00:06,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:00:06,943 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:00:06,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-02 13:00:07,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:00:07,072 INFO L262 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 13:00:07,075 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:00:07,155 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-12-02 13:00:07,155 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:00:07,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718298893] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:00:07,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 13:00:07,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2023-12-02 13:00:07,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456327654] [2023-12-02 13:00:07,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:00:07,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 13:00:07,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:00:07,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 13:00:07,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-02 13:00:07,157 INFO L87 Difference]: Start difference. First operand 3002 states and 3583 transitions. Second operand has 6 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-02 13:00:07,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:00:07,683 INFO L93 Difference]: Finished difference Result 3751 states and 4428 transitions. [2023-12-02 13:00:07,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 13:00:07,683 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 113 [2023-12-02 13:00:07,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:00:07,691 INFO L225 Difference]: With dead ends: 3751 [2023-12-02 13:00:07,691 INFO L226 Difference]: Without dead ends: 3294 [2023-12-02 13:00:07,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2023-12-02 13:00:07,694 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 151 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:00:07,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 856 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:00:07,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3294 states. [2023-12-02 13:00:08,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3294 to 3260. [2023-12-02 13:00:08,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3260 states, 2495 states have (on average 1.1851703406813627) internal successors, (2957), 2514 states have internal predecessors, (2957), 416 states have call successors, (416), 342 states have call predecessors, (416), 347 states have return successors, (498), 405 states have call predecessors, (498), 415 states have call successors, (498) [2023-12-02 13:00:08,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3260 states to 3260 states and 3871 transitions. [2023-12-02 13:00:08,198 INFO L78 Accepts]: Start accepts. Automaton has 3260 states and 3871 transitions. Word has length 113 [2023-12-02 13:00:08,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:00:08,199 INFO L495 AbstractCegarLoop]: Abstraction has 3260 states and 3871 transitions. [2023-12-02 13:00:08,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-02 13:00:08,199 INFO L276 IsEmpty]: Start isEmpty. Operand 3260 states and 3871 transitions. [2023-12-02 13:00:08,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-02 13:00:08,206 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:00:08,206 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:00:08,211 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-12-02 13:00:08,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-12-02 13:00:08,407 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:00:08,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:00:08,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1632163822, now seen corresponding path program 1 times [2023-12-02 13:00:08,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:00:08,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925105492] [2023-12-02 13:00:08,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:00:08,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:00:08,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:00:08,590 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 17 proven. 20 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-02 13:00:08,590 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:00:08,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925105492] [2023-12-02 13:00:08,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925105492] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:00:08,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513192974] [2023-12-02 13:00:08,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:00:08,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:00:08,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:00:08,592 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:00:08,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-02 13:00:08,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:00:08,726 INFO L262 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-02 13:00:08,729 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:00:08,821 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 13:00:08,821 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:00:08,998 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2023-12-02 13:00:08,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513192974] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:00:08,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [311557541] [2023-12-02 13:00:09,002 INFO L159 IcfgInterpreter]: Started Sifa with 66 locations of interest [2023-12-02 13:00:09,002 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:00:09,002 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:00:09,002 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:00:09,003 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:00:16,405 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 1 for LOIs [2023-12-02 13:00:16,409 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 1 for LOIs [2023-12-02 13:00:16,415 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 1 for LOIs [2023-12-02 13:00:16,416 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 40 for LOIs [2023-12-02 13:00:16,477 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 1 for LOIs [2023-12-02 13:00:16,522 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 120 for LOIs [2023-12-02 13:00:16,596 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:00:24,862 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '158846#(and (not (= ~token~0 (+ 2 ~local~0))) (<= 0 (+ |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483648)) (<= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483647) (= ~m_pc~0 1) (<= 0 |ULTIMATE.start_eval2_~tmp~5#1|) (<= |ULTIMATE.start_eval2_~tmp~5#1| 1) (= ~m_st~0 1) (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)) (not (= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 0)))' at error location [2023-12-02 13:00:24,863 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:00:24,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:00:24,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 6] total 16 [2023-12-02 13:00:24,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726570846] [2023-12-02 13:00:24,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:00:24,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-02 13:00:24,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:00:24,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-02 13:00:24,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=3707, Unknown=0, NotChecked=0, Total=4032 [2023-12-02 13:00:24,866 INFO L87 Difference]: Start difference. First operand 3260 states and 3871 transitions. Second operand has 16 states, 13 states have (on average 9.23076923076923) internal successors, (120), 14 states have internal predecessors, (120), 7 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (30), 6 states have call predecessors, (30), 7 states have call successors, (30) [2023-12-02 13:00:29,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:00:29,812 INFO L93 Difference]: Finished difference Result 7398 states and 9221 transitions. [2023-12-02 13:00:29,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2023-12-02 13:00:29,813 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 9.23076923076923) internal successors, (120), 14 states have internal predecessors, (120), 7 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (30), 6 states have call predecessors, (30), 7 states have call successors, (30) Word has length 112 [2023-12-02 13:00:29,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:00:29,826 INFO L225 Difference]: With dead ends: 7398 [2023-12-02 13:00:29,826 INFO L226 Difference]: Without dead ends: 5009 [2023-12-02 13:00:29,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 338 SyntacticMatches, 2 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11526 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=2386, Invalid=28064, Unknown=0, NotChecked=0, Total=30450 [2023-12-02 13:00:29,847 INFO L413 NwaCegarLoop]: 451 mSDtfsCounter, 1960 mSDsluCounter, 3425 mSDsCounter, 0 mSdLazyCounter, 2222 mSolverCounterSat, 547 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1971 SdHoareTripleChecker+Valid, 3876 SdHoareTripleChecker+Invalid, 2769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 547 IncrementalHoareTripleChecker+Valid, 2222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-02 13:00:29,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1971 Valid, 3876 Invalid, 2769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [547 Valid, 2222 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-02 13:00:29,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5009 states. [2023-12-02 13:00:30,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5009 to 3113. [2023-12-02 13:00:30,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3113 states, 2404 states have (on average 1.1688851913477538) internal successors, (2810), 2421 states have internal predecessors, (2810), 374 states have call successors, (374), 326 states have call predecessors, (374), 333 states have return successors, (433), 367 states have call predecessors, (433), 373 states have call successors, (433) [2023-12-02 13:00:30,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3113 states to 3113 states and 3617 transitions. [2023-12-02 13:00:30,377 INFO L78 Accepts]: Start accepts. Automaton has 3113 states and 3617 transitions. Word has length 112 [2023-12-02 13:00:30,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:00:30,378 INFO L495 AbstractCegarLoop]: Abstraction has 3113 states and 3617 transitions. [2023-12-02 13:00:30,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 9.23076923076923) internal successors, (120), 14 states have internal predecessors, (120), 7 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (30), 6 states have call predecessors, (30), 7 states have call successors, (30) [2023-12-02 13:00:30,378 INFO L276 IsEmpty]: Start isEmpty. Operand 3113 states and 3617 transitions. [2023-12-02 13:00:30,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-02 13:00:30,382 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:00:30,382 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:00:30,387 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-12-02 13:00:30,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-12-02 13:00:30,583 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:00:30,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:00:30,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1304758745, now seen corresponding path program 1 times [2023-12-02 13:00:30,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:00:30,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015995288] [2023-12-02 13:00:30,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:00:30,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:00:30,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:00:30,709 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 36 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-02 13:00:30,709 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:00:30,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015995288] [2023-12-02 13:00:30,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015995288] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:00:30,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184896621] [2023-12-02 13:00:30,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:00:30,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:00:30,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:00:30,711 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:00:30,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-02 13:00:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:00:30,835 INFO L262 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 13:00:30,838 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:00:30,910 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 13:00:30,910 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:00:30,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184896621] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:00:30,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 13:00:30,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2023-12-02 13:00:30,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525280692] [2023-12-02 13:00:30,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:00:30,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:00:30,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:00:30,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:00:30,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-02 13:00:30,913 INFO L87 Difference]: Start difference. First operand 3113 states and 3617 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-02 13:00:31,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:00:31,575 INFO L93 Difference]: Finished difference Result 5391 states and 6301 transitions. [2023-12-02 13:00:31,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:00:31,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 108 [2023-12-02 13:00:31,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:00:31,583 INFO L225 Difference]: With dead ends: 5391 [2023-12-02 13:00:31,583 INFO L226 Difference]: Without dead ends: 3855 [2023-12-02 13:00:31,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-02 13:00:31,587 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 269 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:00:31,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 298 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:00:31,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3855 states. [2023-12-02 13:00:32,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3855 to 3413. [2023-12-02 13:00:32,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3413 states, 2665 states have (on average 1.1590994371482177) internal successors, (3089), 2688 states have internal predecessors, (3089), 384 states have call successors, (384), 348 states have call predecessors, (384), 362 states have return successors, (449), 378 states have call predecessors, (449), 383 states have call successors, (449) [2023-12-02 13:00:32,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3413 states to 3413 states and 3922 transitions. [2023-12-02 13:00:32,063 INFO L78 Accepts]: Start accepts. Automaton has 3413 states and 3922 transitions. Word has length 108 [2023-12-02 13:00:32,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:00:32,063 INFO L495 AbstractCegarLoop]: Abstraction has 3413 states and 3922 transitions. [2023-12-02 13:00:32,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-02 13:00:32,063 INFO L276 IsEmpty]: Start isEmpty. Operand 3413 states and 3922 transitions. [2023-12-02 13:00:32,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-02 13:00:32,067 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:00:32,067 INFO L195 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] [2023-12-02 13:00:32,072 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-12-02 13:00:32,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:00:32,268 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:00:32,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:00:32,268 INFO L85 PathProgramCache]: Analyzing trace with hash 809413879, now seen corresponding path program 1 times [2023-12-02 13:00:32,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:00:32,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371674244] [2023-12-02 13:00:32,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:00:32,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:00:32,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:00:32,881 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 22 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-12-02 13:00:32,881 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:00:32,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371674244] [2023-12-02 13:00:32,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371674244] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:00:32,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292266954] [2023-12-02 13:00:32,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:00:32,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:00:32,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:00:32,883 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:00:32,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-02 13:00:32,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:00:32,989 INFO L262 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 59 conjunts are in the unsatisfiable core [2023-12-02 13:00:32,993 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:00:33,801 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 31 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 13:00:33,801 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:00:35,488 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-02 13:00:35,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292266954] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:00:35,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2055997814] [2023-12-02 13:00:35,492 INFO L159 IcfgInterpreter]: Started Sifa with 68 locations of interest [2023-12-02 13:00:35,492 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:00:35,492 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:00:35,493 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:00:35,493 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:00:53,235 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events1 with input of size 7 for LOIs [2023-12-02 13:00:53,237 INFO L197 IcfgInterpreter]: Interpreting procedure error1 with input of size 13 for LOIs [2023-12-02 13:00:53,238 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread1 with input of size 7 for LOIs [2023-12-02 13:00:53,242 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads1 with input of size 124 for LOIs [2023-12-02 13:00:53,990 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_write_p_triggered with input of size 125 for LOIs [2023-12-02 13:00:54,633 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_read_c_triggered with input of size 16 for LOIs [2023-12-02 13:00:54,654 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events1 with input of size 118 for LOIs [2023-12-02 13:00:54,757 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels1 with input of size 129 for LOIs [2023-12-02 13:00:54,868 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:01:02,622 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '184906#(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 [2023-12-02 13:01:02,622 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:01:02,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:01:02,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 16] total 49 [2023-12-02 13:01:02,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847228039] [2023-12-02 13:01:02,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:01:02,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-12-02 13:01:02,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:01:02,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-12-02 13:01:02,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=797, Invalid=9915, Unknown=0, NotChecked=0, Total=10712 [2023-12-02 13:01:02,630 INFO L87 Difference]: Start difference. First operand 3413 states and 3922 transitions. Second operand has 49 states, 32 states have (on average 6.125) internal successors, (196), 37 states have internal predecessors, (196), 17 states have call successors, (44), 14 states have call predecessors, (44), 22 states have return successors, (46), 17 states have call predecessors, (46), 17 states have call successors, (46) [2023-12-02 13:01:18,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:01:18,292 INFO L93 Difference]: Finished difference Result 6080 states and 7151 transitions. [2023-12-02 13:01:18,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 238 states. [2023-12-02 13:01:18,292 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 32 states have (on average 6.125) internal successors, (196), 37 states have internal predecessors, (196), 17 states have call successors, (44), 14 states have call predecessors, (44), 22 states have return successors, (46), 17 states have call predecessors, (46), 17 states have call successors, (46) Word has length 114 [2023-12-02 13:01:18,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:01:18,300 INFO L225 Difference]: With dead ends: 6080 [2023-12-02 13:01:18,301 INFO L226 Difference]: Without dead ends: 5281 [2023-12-02 13:01:18,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 631 GetRequests, 294 SyntacticMatches, 3 SemanticMatches, 334 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 46683 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=10057, Invalid=102503, Unknown=0, NotChecked=0, Total=112560 [2023-12-02 13:01:18,318 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 4024 mSDsluCounter, 2531 mSDsCounter, 0 mSdLazyCounter, 4838 mSolverCounterSat, 1999 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4025 SdHoareTripleChecker+Valid, 2712 SdHoareTripleChecker+Invalid, 6837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1999 IncrementalHoareTripleChecker+Valid, 4838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-12-02 13:01:18,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4025 Valid, 2712 Invalid, 6837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1999 Valid, 4838 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-12-02 13:01:18,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5281 states. [2023-12-02 13:01:18,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5281 to 3651. [2023-12-02 13:01:18,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3651 states, 2826 states have (on average 1.1592356687898089) internal successors, (3276), 2850 states have internal predecessors, (3276), 421 states have call successors, (421), 378 states have call predecessors, (421), 402 states have return successors, (498), 423 states have call predecessors, (498), 420 states have call successors, (498) [2023-12-02 13:01:18,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3651 states to 3651 states and 4195 transitions. [2023-12-02 13:01:18,920 INFO L78 Accepts]: Start accepts. Automaton has 3651 states and 4195 transitions. Word has length 114 [2023-12-02 13:01:18,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:01:18,920 INFO L495 AbstractCegarLoop]: Abstraction has 3651 states and 4195 transitions. [2023-12-02 13:01:18,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 32 states have (on average 6.125) internal successors, (196), 37 states have internal predecessors, (196), 17 states have call successors, (44), 14 states have call predecessors, (44), 22 states have return successors, (46), 17 states have call predecessors, (46), 17 states have call successors, (46) [2023-12-02 13:01:18,920 INFO L276 IsEmpty]: Start isEmpty. Operand 3651 states and 4195 transitions. [2023-12-02 13:01:18,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-02 13:01:18,924 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:01:18,925 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:01:18,930 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-12-02 13:01:19,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:01:19,125 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:01:19,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:01:19,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1352541915, now seen corresponding path program 1 times [2023-12-02 13:01:19,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:01:19,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759033459] [2023-12-02 13:01:19,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:01:19,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:01:19,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:01:19,332 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-02 13:01:19,333 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:01:19,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759033459] [2023-12-02 13:01:19,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759033459] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:01:19,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:01:19,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 13:01:19,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079224334] [2023-12-02 13:01:19,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:01:19,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 13:01:19,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:01:19,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 13:01:19,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 13:01:19,335 INFO L87 Difference]: Start difference. First operand 3651 states and 4195 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-02 13:01:20,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:01:20,440 INFO L93 Difference]: Finished difference Result 6374 states and 7381 transitions. [2023-12-02 13:01:20,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 13:01:20,441 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 109 [2023-12-02 13:01:20,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:01:20,447 INFO L225 Difference]: With dead ends: 6374 [2023-12-02 13:01:20,448 INFO L226 Difference]: Without dead ends: 4056 [2023-12-02 13:01:20,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-02 13:01:20,453 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 90 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 13:01:20,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 522 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 13:01:20,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4056 states. [2023-12-02 13:01:21,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4056 to 3959. [2023-12-02 13:01:21,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3959 states, 3058 states have (on average 1.1553302812295618) internal successors, (3533), 3079 states have internal predecessors, (3533), 466 states have call successors, (466), 417 states have call predecessors, (466), 433 states have return successors, (552), 463 states have call predecessors, (552), 465 states have call successors, (552) [2023-12-02 13:01:21,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3959 states to 3959 states and 4551 transitions. [2023-12-02 13:01:21,116 INFO L78 Accepts]: Start accepts. Automaton has 3959 states and 4551 transitions. Word has length 109 [2023-12-02 13:01:21,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:01:21,116 INFO L495 AbstractCegarLoop]: Abstraction has 3959 states and 4551 transitions. [2023-12-02 13:01:21,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-02 13:01:21,116 INFO L276 IsEmpty]: Start isEmpty. Operand 3959 states and 4551 transitions. [2023-12-02 13:01:21,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-02 13:01:21,120 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:01:21,120 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:01:21,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-12-02 13:01:21,120 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:01:21,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:01:21,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1776818057, now seen corresponding path program 1 times [2023-12-02 13:01:21,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:01:21,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524833313] [2023-12-02 13:01:21,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:01:21,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:01:21,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:01:21,247 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 39 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 13:01:21,247 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:01:21,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524833313] [2023-12-02 13:01:21,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524833313] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:01:21,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790110028] [2023-12-02 13:01:21,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:01:21,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:01:21,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:01:21,249 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:01:21,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-02 13:01:21,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:01:21,363 INFO L262 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-02 13:01:21,365 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:01:21,409 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:01:21,409 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:01:21,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790110028] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:01:21,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 13:01:21,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 6 [2023-12-02 13:01:21,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438546257] [2023-12-02 13:01:21,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:01:21,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 13:01:21,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:01:21,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 13:01:21,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:01:21,411 INFO L87 Difference]: Start difference. First operand 3959 states and 4551 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 5 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2023-12-02 13:01:22,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:01:22,561 INFO L93 Difference]: Finished difference Result 6438 states and 7482 transitions. [2023-12-02 13:01:22,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 13:01:22,562 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 5 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 109 [2023-12-02 13:01:22,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:01:22,568 INFO L225 Difference]: With dead ends: 6438 [2023-12-02 13:01:22,568 INFO L226 Difference]: Without dead ends: 4502 [2023-12-02 13:01:22,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-12-02 13:01:22,572 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 191 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:01:22,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 478 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:01:22,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4502 states. [2023-12-02 13:01:23,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4502 to 4195. [2023-12-02 13:01:23,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4195 states, 3229 states have (on average 1.1498916073087644) internal successors, (3713), 3251 states have internal predecessors, (3713), 504 states have call successors, (504), 447 states have call predecessors, (504), 460 states have return successors, (618), 497 states have call predecessors, (618), 503 states have call successors, (618) [2023-12-02 13:01:23,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4195 states to 4195 states and 4835 transitions. [2023-12-02 13:01:23,240 INFO L78 Accepts]: Start accepts. Automaton has 4195 states and 4835 transitions. Word has length 109 [2023-12-02 13:01:23,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:01:23,240 INFO L495 AbstractCegarLoop]: Abstraction has 4195 states and 4835 transitions. [2023-12-02 13:01:23,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 5 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2023-12-02 13:01:23,240 INFO L276 IsEmpty]: Start isEmpty. Operand 4195 states and 4835 transitions. [2023-12-02 13:01:23,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-02 13:01:23,243 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:01:23,244 INFO L195 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] [2023-12-02 13:01:23,248 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-12-02 13:01:23,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:01:23,444 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:01:23,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:01:23,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1364389688, now seen corresponding path program 1 times [2023-12-02 13:01:23,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:01:23,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321739548] [2023-12-02 13:01:23,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:01:23,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:01:23,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:01:23,713 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 23 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-02 13:01:23,713 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:01:23,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321739548] [2023-12-02 13:01:23,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321739548] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:01:23,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446361513] [2023-12-02 13:01:23,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:01:23,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:01:23,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:01:23,714 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:01:23,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-02 13:01:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:01:23,821 INFO L262 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-02 13:01:23,824 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:01:23,897 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-12-02 13:01:23,897 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:01:24,058 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-02 13:01:24,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446361513] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-02 13:01:24,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-02 13:01:24,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14, 8] total 20 [2023-12-02 13:01:24,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822661943] [2023-12-02 13:01:24,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:01:24,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 13:01:24,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:01:24,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 13:01:24,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2023-12-02 13:01:24,060 INFO L87 Difference]: Start difference. First operand 4195 states and 4835 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) [2023-12-02 13:01:25,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:01:25,350 INFO L93 Difference]: Finished difference Result 5523 states and 6388 transitions. [2023-12-02 13:01:25,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 13:01:25,350 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 [2023-12-02 13:01:25,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:01:25,360 INFO L225 Difference]: With dead ends: 5523 [2023-12-02 13:01:25,360 INFO L226 Difference]: Without dead ends: 4532 [2023-12-02 13:01:25,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2023-12-02 13:01:25,364 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 238 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 13:01:25,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 477 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 13:01:25,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4532 states. [2023-12-02 13:01:26,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4532 to 4275. [2023-12-02 13:01:26,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4275 states, 3274 states have (on average 1.1496640195479535) internal successors, (3764), 3299 states have internal predecessors, (3764), 523 states have call successors, (523), 456 states have call predecessors, (523), 476 states have return successors, (658), 520 states have call predecessors, (658), 522 states have call successors, (658) [2023-12-02 13:01:26,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4275 states to 4275 states and 4945 transitions. [2023-12-02 13:01:26,121 INFO L78 Accepts]: Start accepts. Automaton has 4275 states and 4945 transitions. Word has length 115 [2023-12-02 13:01:26,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:01:26,121 INFO L495 AbstractCegarLoop]: Abstraction has 4275 states and 4945 transitions. [2023-12-02 13:01:26,122 INFO L496 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) [2023-12-02 13:01:26,122 INFO L276 IsEmpty]: Start isEmpty. Operand 4275 states and 4945 transitions. [2023-12-02 13:01:26,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-02 13:01:26,125 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:01:26,125 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:01:26,131 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-12-02 13:01:26,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:01:26,326 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:01:26,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:01:26,326 INFO L85 PathProgramCache]: Analyzing trace with hash 539682615, now seen corresponding path program 1 times [2023-12-02 13:01:26,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:01:26,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929501724] [2023-12-02 13:01:26,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:01:26,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:01:26,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:01:26,765 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 13 proven. 34 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-02 13:01:26,765 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:01:26,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929501724] [2023-12-02 13:01:26,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929501724] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:01:26,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759593729] [2023-12-02 13:01:26,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:01:26,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:01:26,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:01:26,767 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:01:26,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-12-02 13:01:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:01:26,925 INFO L262 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-02 13:01:26,928 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:01:27,079 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 13:01:27,079 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:01:27,301 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2023-12-02 13:01:27,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759593729] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:01:27,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [663173688] [2023-12-02 13:01:27,304 INFO L159 IcfgInterpreter]: Started Sifa with 69 locations of interest [2023-12-02 13:01:27,304 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:01:27,304 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:01:27,305 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:01:27,305 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:01:34,839 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 116 for LOIs [2023-12-02 13:01:34,940 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 1 for LOIs [2023-12-02 13:01:34,945 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 1 for LOIs [2023-12-02 13:01:34,946 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 40 for LOIs [2023-12-02 13:01:34,997 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 1 for LOIs [2023-12-02 13:01:35,032 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 120 for LOIs [2023-12-02 13:01:35,104 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:01:43,767 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '239249#(and (not (= ~token~0 (+ 2 ~local~0))) (<= 0 (+ |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483648)) (<= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483647) (= ~m_pc~0 1) (<= 0 |ULTIMATE.start_eval2_~tmp~5#1|) (<= |ULTIMATE.start_eval2_~tmp~5#1| 1) (= ~m_st~0 1) (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)) (not (= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 0)))' at error location [2023-12-02 13:01:43,767 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:01:43,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:01:43,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 6] total 22 [2023-12-02 13:01:43,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505743955] [2023-12-02 13:01:43,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:01:43,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-02 13:01:43,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:01:43,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-02 13:01:43,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=5033, Unknown=0, NotChecked=0, Total=5402 [2023-12-02 13:01:43,770 INFO L87 Difference]: Start difference. First operand 4275 states and 4945 transitions. Second operand has 22 states, 18 states have (on average 8.333333333333334) internal successors, (150), 20 states have internal predecessors, (150), 9 states have call successors, (33), 5 states have call predecessors, (33), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) [2023-12-02 13:01:49,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:01:49,823 INFO L93 Difference]: Finished difference Result 7660 states and 9098 transitions. [2023-12-02 13:01:49,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2023-12-02 13:01:49,824 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 8.333333333333334) internal successors, (150), 20 states have internal predecessors, (150), 9 states have call successors, (33), 5 states have call predecessors, (33), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) Word has length 115 [2023-12-02 13:01:49,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:01:49,831 INFO L225 Difference]: With dead ends: 7660 [2023-12-02 13:01:49,831 INFO L226 Difference]: Without dead ends: 4538 [2023-12-02 13:01:49,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 339 SyntacticMatches, 2 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14838 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=2273, Invalid=35557, Unknown=0, NotChecked=0, Total=37830 [2023-12-02 13:01:49,841 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 1511 mSDsluCounter, 2607 mSDsCounter, 0 mSdLazyCounter, 3000 mSolverCounterSat, 535 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1528 SdHoareTripleChecker+Valid, 2925 SdHoareTripleChecker+Invalid, 3535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 535 IncrementalHoareTripleChecker+Valid, 3000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-02 13:01:49,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1528 Valid, 2925 Invalid, 3535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [535 Valid, 3000 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-02 13:01:49,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4538 states. [2023-12-02 13:01:50,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4538 to 3390. [2023-12-02 13:01:50,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3390 states, 2580 states have (on average 1.1457364341085272) internal successors, (2956), 2600 states have internal predecessors, (2956), 416 states have call successors, (416), 370 states have call predecessors, (416), 392 states have return successors, (532), 419 states have call predecessors, (532), 415 states have call successors, (532) [2023-12-02 13:01:50,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3390 states to 3390 states and 3904 transitions. [2023-12-02 13:01:50,467 INFO L78 Accepts]: Start accepts. Automaton has 3390 states and 3904 transitions. Word has length 115 [2023-12-02 13:01:50,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:01:50,467 INFO L495 AbstractCegarLoop]: Abstraction has 3390 states and 3904 transitions. [2023-12-02 13:01:50,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 8.333333333333334) internal successors, (150), 20 states have internal predecessors, (150), 9 states have call successors, (33), 5 states have call predecessors, (33), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) [2023-12-02 13:01:50,467 INFO L276 IsEmpty]: Start isEmpty. Operand 3390 states and 3904 transitions. [2023-12-02 13:01:50,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-02 13:01:50,470 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:01:50,470 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:01:50,476 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-12-02 13:01:50,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2023-12-02 13:01:50,671 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:01:50,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:01:50,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1765353202, now seen corresponding path program 1 times [2023-12-02 13:01:50,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:01:50,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320708506] [2023-12-02 13:01:50,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:01:50,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:01:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:01:51,167 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 21 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-02 13:01:51,167 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:01:51,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320708506] [2023-12-02 13:01:51,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320708506] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:01:51,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054820048] [2023-12-02 13:01:51,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:01:51,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:01:51,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:01:51,169 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:01:51,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-12-02 13:01:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:01:51,330 INFO L262 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-02 13:01:51,334 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:01:51,796 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 13:01:51,796 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:01:52,604 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-12-02 13:01:52,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054820048] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:01:52,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1820752558] [2023-12-02 13:01:52,607 INFO L159 IcfgInterpreter]: Started Sifa with 72 locations of interest [2023-12-02 13:01:52,607 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:01:52,607 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:01:52,608 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:01:52,608 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:02:06,422 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 1 for LOIs [2023-12-02 13:02:06,425 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 1 for LOIs [2023-12-02 13:02:06,431 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 1 for LOIs [2023-12-02 13:02:06,432 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 40 for LOIs [2023-12-02 13:02:06,602 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 1 for LOIs [2023-12-02 13:02:06,661 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 120 for LOIs [2023-12-02 13:02:06,733 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:02:19,840 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '254503#(and (not (= ~token~0 (+ 2 ~local~0))) (<= 0 (+ |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483648)) (<= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483647) (= ~m_pc~0 1) (<= 0 |ULTIMATE.start_eval2_~tmp~5#1|) (<= |ULTIMATE.start_eval2_~tmp~5#1| 1) (= ~m_st~0 1) (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)) (not (= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 0)))' at error location [2023-12-02 13:02:19,840 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:02:19,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:02:19,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 14] total 39 [2023-12-02 13:02:19,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542884221] [2023-12-02 13:02:19,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:02:19,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-02 13:02:19,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:02:19,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-02 13:02:19,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=541, Invalid=8015, Unknown=0, NotChecked=0, Total=8556 [2023-12-02 13:02:19,844 INFO L87 Difference]: Start difference. First operand 3390 states and 3904 transitions. Second operand has 39 states, 27 states have (on average 7.592592592592593) internal successors, (205), 30 states have internal predecessors, (205), 17 states have call successors, (44), 12 states have call predecessors, (44), 19 states have return successors, (44), 17 states have call predecessors, (44), 17 states have call successors, (44) [2023-12-02 13:02:36,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:02:36,145 INFO L93 Difference]: Finished difference Result 9569 states and 11312 transitions. [2023-12-02 13:02:36,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2023-12-02 13:02:36,146 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 27 states have (on average 7.592592592592593) internal successors, (205), 30 states have internal predecessors, (205), 17 states have call successors, (44), 12 states have call predecessors, (44), 19 states have return successors, (44), 17 states have call predecessors, (44), 17 states have call successors, (44) Word has length 117 [2023-12-02 13:02:36,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:02:36,157 INFO L225 Difference]: With dead ends: 9569 [2023-12-02 13:02:36,157 INFO L226 Difference]: Without dead ends: 7601 [2023-12-02 13:02:36,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 623 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 278 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29405 ImplicationChecksByTransitivity, 23.6s TimeCoverageRelationStatistics Valid=8331, Invalid=69789, Unknown=0, NotChecked=0, Total=78120 [2023-12-02 13:02:36,167 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 3249 mSDsluCounter, 2978 mSDsCounter, 0 mSdLazyCounter, 6005 mSolverCounterSat, 1563 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3249 SdHoareTripleChecker+Valid, 3210 SdHoareTripleChecker+Invalid, 7568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1563 IncrementalHoareTripleChecker+Valid, 6005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:02:36,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3249 Valid, 3210 Invalid, 7568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1563 Valid, 6005 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-12-02 13:02:36,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7601 states. [2023-12-02 13:02:36,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7601 to 3863. [2023-12-02 13:02:36,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3863 states, 2932 states have (on average 1.138130968622101) internal successors, (3337), 2969 states have internal predecessors, (3337), 474 states have call successors, (474), 423 states have call predecessors, (474), 455 states have return successors, (584), 470 states have call predecessors, (584), 473 states have call successors, (584) [2023-12-02 13:02:36,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3863 states to 3863 states and 4395 transitions. [2023-12-02 13:02:36,987 INFO L78 Accepts]: Start accepts. Automaton has 3863 states and 4395 transitions. Word has length 117 [2023-12-02 13:02:36,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:02:36,988 INFO L495 AbstractCegarLoop]: Abstraction has 3863 states and 4395 transitions. [2023-12-02 13:02:36,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 27 states have (on average 7.592592592592593) internal successors, (205), 30 states have internal predecessors, (205), 17 states have call successors, (44), 12 states have call predecessors, (44), 19 states have return successors, (44), 17 states have call predecessors, (44), 17 states have call successors, (44) [2023-12-02 13:02:36,988 INFO L276 IsEmpty]: Start isEmpty. Operand 3863 states and 4395 transitions. [2023-12-02 13:02:36,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-02 13:02:36,990 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:02:36,990 INFO L195 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] [2023-12-02 13:02:36,996 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-12-02 13:02:37,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2023-12-02 13:02:37,191 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:02:37,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:02:37,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1056687688, now seen corresponding path program 1 times [2023-12-02 13:02:37,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:02:37,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113142884] [2023-12-02 13:02:37,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:02:37,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:02:37,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:02:37,674 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 34 proven. 19 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-02 13:02:37,674 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:02:37,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113142884] [2023-12-02 13:02:37,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113142884] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:02:37,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353339281] [2023-12-02 13:02:37,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:02:37,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:02:37,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:02:37,675 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:02:37,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-12-02 13:02:37,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:02:37,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 62 conjunts are in the unsatisfiable core [2023-12-02 13:02:37,782 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:02:38,560 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 60 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 13:02:38,560 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:02:40,187 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 13 proven. 44 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-02 13:02:40,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353339281] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:02:40,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1068193033] [2023-12-02 13:02:40,189 INFO L159 IcfgInterpreter]: Started Sifa with 69 locations of interest [2023-12-02 13:02:40,189 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:02:40,189 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:02:40,190 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:02:40,190 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:02:48,123 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events1 with input of size 7 for LOIs [2023-12-02 13:02:48,126 INFO L197 IcfgInterpreter]: Interpreting procedure error1 with input of size 81 for LOIs [2023-12-02 13:02:48,181 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread1 with input of size 7 for LOIs [2023-12-02 13:02:48,187 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads1 with input of size 125 for LOIs [2023-12-02 13:02:48,803 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_write_p_triggered with input of size 126 for LOIs [2023-12-02 13:02:49,395 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_read_c_triggered with input of size 16 for LOIs [2023-12-02 13:02:49,422 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events1 with input of size 119 for LOIs [2023-12-02 13:02:49,512 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels1 with input of size 130 for LOIs [2023-12-02 13:02:49,622 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:03:00,648 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '272933#(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___1~0#1_BEFORE_CALL_10| Int) (v_~q_req_up~0_103 Int) (|v_ULTIMATE.start_eval1_~tmp~2#1_BEFORE_CALL_10| Int) (v_~q_free~0_104 Int)) (and (or (and (<= v_~q_free~0_104 1) (<= 0 ~p_dw_pc~0) (<= 0 |v_ULTIMATE.start_eval1_~tmp___1~0#1_BEFORE_CALL_10|) (= |v_ULTIMATE.start_eval1_~tmp~2#1_BEFORE_CALL_10| 0) (<= |v_ULTIMATE.start_eval1_~tmp___1~0#1_BEFORE_CALL_10| 1)) (and (= v_~q_free~0_104 0) (= ~p_dw_pc~0 1) (= 2 ~p_dw_st~0))) (or (exists ((v_~p_dw_pc~0_47 Int) (v_~p_dw_st~0_133 Int)) (and (or (and (<= |v_ULTIMATE.start_eval1_~tmp~2#1_BEFORE_CALL_10| 2147483647) (= v_~p_dw_st~0_133 1) (<= 0 |v_ULTIMATE.start_eval1_~tmp___1~0#1_BEFORE_CALL_10|) (<= 0 (+ |v_ULTIMATE.start_eval1_~tmp~2#1_BEFORE_CALL_10| 2147483648)) (= v_~p_dw_pc~0_47 0) (<= |v_ULTIMATE.start_eval1_~tmp___1~0#1_BEFORE_CALL_10| 1)) (and (<= |v_ULTIMATE.start_eval1_~tmp~2#1_BEFORE_CALL_10| 2147483647) (= v_~p_dw_pc~0_47 1) (<= 0 (+ ~p_last_write~0 2147483648)) (= v_~p_dw_st~0_133 1) (<= 0 |v_ULTIMATE.start_eval1_~tmp___1~0#1_BEFORE_CALL_10|) (<= ~p_last_write~0 2147483647) (<= 0 (+ |v_ULTIMATE.start_eval1_~tmp~2#1_BEFORE_CALL_10| 2147483648)) (<= |v_ULTIMATE.start_eval1_~tmp___1~0#1_BEFORE_CALL_10| 1) (= v_~q_req_up~0_103 1))) (not (= |v_ULTIMATE.start_eval1_~tmp~2#1_BEFORE_CALL_10| 0)) (not (= |v_ULTIMATE.start_eval1_~tmp___1~0#1_BEFORE_CALL_10| 0)))) (and (= ~p_dw_st~0 0) (not (= |v_ULTIMATE.start_eval1_~tmp___1~0#1_BEFORE_CALL_10| 0)))))) (exists ((|v_ULTIMATE.start_eval1_~tmp___0~2#1_BEFORE_CALL_15| Int)) (and (<= |v_ULTIMATE.start_eval1_~tmp___0~2#1_BEFORE_CALL_15| 2147483647) (<= 0 (+ |v_ULTIMATE.start_eval1_~tmp___0~2#1_BEFORE_CALL_15| 2147483648)) (not (= |v_ULTIMATE.start_eval1_~tmp___0~2#1_BEFORE_CALL_15| 0)))) (= ~c_dr_st~0 1))' at error location [2023-12-02 13:03:00,649 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:03:00,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:03:00,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 49 [2023-12-02 13:03:00,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427415023] [2023-12-02 13:03:00,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:03:00,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-12-02 13:03:00,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:03:00,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-12-02 13:03:00,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=917, Invalid=10213, Unknown=0, NotChecked=0, Total=11130 [2023-12-02 13:03:00,653 INFO L87 Difference]: Start difference. First operand 3863 states and 4395 transitions. Second operand has 49 states, 33 states have (on average 6.484848484848484) internal successors, (214), 38 states have internal predecessors, (214), 22 states have call successors, (49), 15 states have call predecessors, (49), 21 states have return successors, (51), 21 states have call predecessors, (51), 22 states have call successors, (51) [2023-12-02 13:03:07,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:03:07,138 INFO L93 Difference]: Finished difference Result 6712 states and 7737 transitions. [2023-12-02 13:03:07,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2023-12-02 13:03:07,139 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 33 states have (on average 6.484848484848484) internal successors, (214), 38 states have internal predecessors, (214), 22 states have call successors, (49), 15 states have call predecessors, (49), 21 states have return successors, (51), 21 states have call predecessors, (51), 22 states have call successors, (51) Word has length 124 [2023-12-02 13:03:07,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:03:07,147 INFO L225 Difference]: With dead ends: 6712 [2023-12-02 13:03:07,147 INFO L226 Difference]: Without dead ends: 5641 [2023-12-02 13:03:07,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 307 SyntacticMatches, 9 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 14579 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=3470, Invalid=30202, Unknown=0, NotChecked=0, Total=33672 [2023-12-02 13:03:07,151 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 2956 mSDsluCounter, 1686 mSDsCounter, 0 mSdLazyCounter, 3175 mSolverCounterSat, 1674 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2958 SdHoareTripleChecker+Valid, 1832 SdHoareTripleChecker+Invalid, 4849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1674 IncrementalHoareTripleChecker+Valid, 3175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-02 13:03:07,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2958 Valid, 1832 Invalid, 4849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1674 Valid, 3175 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-02 13:03:07,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5641 states. [2023-12-02 13:03:08,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5641 to 4400. [2023-12-02 13:03:08,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4400 states, 3318 states have (on average 1.1410488245931283) internal successors, (3786), 3355 states have internal predecessors, (3786), 548 states have call successors, (548), 482 states have call predecessors, (548), 532 states have return successors, (676), 562 states have call predecessors, (676), 547 states have call successors, (676) [2023-12-02 13:03:08,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4400 states to 4400 states and 5010 transitions. [2023-12-02 13:03:08,177 INFO L78 Accepts]: Start accepts. Automaton has 4400 states and 5010 transitions. Word has length 124 [2023-12-02 13:03:08,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:03:08,177 INFO L495 AbstractCegarLoop]: Abstraction has 4400 states and 5010 transitions. [2023-12-02 13:03:08,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 33 states have (on average 6.484848484848484) internal successors, (214), 38 states have internal predecessors, (214), 22 states have call successors, (49), 15 states have call predecessors, (49), 21 states have return successors, (51), 21 states have call predecessors, (51), 22 states have call successors, (51) [2023-12-02 13:03:08,177 INFO L276 IsEmpty]: Start isEmpty. Operand 4400 states and 5010 transitions. [2023-12-02 13:03:08,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-02 13:03:08,180 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:03:08,180 INFO L195 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] [2023-12-02 13:03:08,185 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-12-02 13:03:08,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2023-12-02 13:03:08,380 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:03:08,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:03:08,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1375387518, now seen corresponding path program 1 times [2023-12-02 13:03:08,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:03:08,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789603788] [2023-12-02 13:03:08,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:03:08,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:03:08,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:03:08,514 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 38 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-12-02 13:03:08,514 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:03:08,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789603788] [2023-12-02 13:03:08,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789603788] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:03:08,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703068298] [2023-12-02 13:03:08,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:03:08,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:03:08,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:03:08,516 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:03:08,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-12-02 13:03:08,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:03:08,624 INFO L262 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-02 13:03:08,626 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:03:08,704 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 50 proven. 17 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-02 13:03:08,704 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:03:08,847 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-12-02 13:03:08,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703068298] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-02 13:03:08,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-02 13:03:08,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 10] total 17 [2023-12-02 13:03:08,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46534901] [2023-12-02 13:03:08,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:03:08,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 13:03:08,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:03:08,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 13:03:08,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2023-12-02 13:03:08,849 INFO L87 Difference]: Start difference. First operand 4400 states and 5010 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) [2023-12-02 13:03:10,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:03:10,286 INFO L93 Difference]: Finished difference Result 5365 states and 6107 transitions. [2023-12-02 13:03:10,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 13:03:10,287 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 [2023-12-02 13:03:10,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:03:10,292 INFO L225 Difference]: With dead ends: 5365 [2023-12-02 13:03:10,293 INFO L226 Difference]: Without dead ends: 3757 [2023-12-02 13:03:10,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2023-12-02 13:03:10,296 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 319 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 13:03:10,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 517 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 13:03:10,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3757 states. [2023-12-02 13:03:11,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3757 to 3410. [2023-12-02 13:03:11,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3410 states, 2621 states have (on average 1.1308660816482259) internal successors, (2964), 2657 states have internal predecessors, (2964), 398 states have call successors, (398), 361 states have call predecessors, (398), 389 states have return successors, (493), 391 states have call predecessors, (493), 397 states have call successors, (493) [2023-12-02 13:03:11,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3410 states to 3410 states and 3855 transitions. [2023-12-02 13:03:11,078 INFO L78 Accepts]: Start accepts. Automaton has 3410 states and 3855 transitions. Word has length 125 [2023-12-02 13:03:11,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:03:11,078 INFO L495 AbstractCegarLoop]: Abstraction has 3410 states and 3855 transitions. [2023-12-02 13:03:11,078 INFO L496 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) [2023-12-02 13:03:11,079 INFO L276 IsEmpty]: Start isEmpty. Operand 3410 states and 3855 transitions. [2023-12-02 13:03:11,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-02 13:03:11,081 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:03:11,081 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:03:11,086 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2023-12-02 13:03:11,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-12-02 13:03:11,282 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:03:11,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:03:11,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1150107079, now seen corresponding path program 1 times [2023-12-02 13:03:11,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:03:11,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286975510] [2023-12-02 13:03:11,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:03:11,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:03:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:03:11,400 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2023-12-02 13:03:11,401 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:03:11,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286975510] [2023-12-02 13:03:11,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286975510] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:03:11,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:03:11,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 13:03:11,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075229810] [2023-12-02 13:03:11,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:03:11,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 13:03:11,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:03:11,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 13:03:11,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 13:03:11,403 INFO L87 Difference]: Start difference. First operand 3410 states and 3855 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-02 13:03:13,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:03:13,343 INFO L93 Difference]: Finished difference Result 7848 states and 8946 transitions. [2023-12-02 13:03:13,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 13:03:13,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 133 [2023-12-02 13:03:13,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:03:13,352 INFO L225 Difference]: With dead ends: 7848 [2023-12-02 13:03:13,352 INFO L226 Difference]: Without dead ends: 6001 [2023-12-02 13:03:13,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 13:03:13,356 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 319 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 13:03:13,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 700 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 13:03:13,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6001 states. [2023-12-02 13:03:14,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6001 to 4501. [2023-12-02 13:03:14,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4501 states, 3469 states have (on average 1.1392332084174113) internal successors, (3952), 3511 states have internal predecessors, (3952), 520 states have call successors, (520), 470 states have call predecessors, (520), 510 states have return successors, (635), 519 states have call predecessors, (635), 519 states have call successors, (635) [2023-12-02 13:03:14,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4501 states to 4501 states and 5107 transitions. [2023-12-02 13:03:14,439 INFO L78 Accepts]: Start accepts. Automaton has 4501 states and 5107 transitions. Word has length 133 [2023-12-02 13:03:14,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:03:14,439 INFO L495 AbstractCegarLoop]: Abstraction has 4501 states and 5107 transitions. [2023-12-02 13:03:14,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-02 13:03:14,439 INFO L276 IsEmpty]: Start isEmpty. Operand 4501 states and 5107 transitions. [2023-12-02 13:03:14,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-12-02 13:03:14,444 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:03:14,444 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:03:14,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-12-02 13:03:14,444 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:03:14,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:03:14,445 INFO L85 PathProgramCache]: Analyzing trace with hash 441878414, now seen corresponding path program 1 times [2023-12-02 13:03:14,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:03:14,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715099926] [2023-12-02 13:03:14,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:03:14,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:03:14,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:03:14,551 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 75 proven. 11 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2023-12-02 13:03:14,551 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:03:14,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715099926] [2023-12-02 13:03:14,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715099926] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:03:14,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80001103] [2023-12-02 13:03:14,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:03:14,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:03:14,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:03:14,553 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:03:14,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-12-02 13:03:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:03:14,695 INFO L262 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 13:03:14,697 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:03:14,725 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-02 13:03:14,725 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:03:14,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80001103] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:03:14,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 13:03:14,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-12-02 13:03:14,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341716702] [2023-12-02 13:03:14,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:03:14,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:03:14,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:03:14,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:03:14,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 13:03:14,727 INFO L87 Difference]: Start difference. First operand 4501 states and 5107 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-02 13:03:15,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:03:15,856 INFO L93 Difference]: Finished difference Result 7698 states and 8726 transitions. [2023-12-02 13:03:15,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 13:03:15,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 165 [2023-12-02 13:03:15,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:03:15,865 INFO L225 Difference]: With dead ends: 7698 [2023-12-02 13:03:15,865 INFO L226 Difference]: Without dead ends: 4240 [2023-12-02 13:03:15,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:03:15,870 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 147 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:03:15,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 527 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:03:15,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4240 states. [2023-12-02 13:03:16,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4240 to 4132. [2023-12-02 13:03:16,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4132 states, 3166 states have (on average 1.1092861655085282) internal successors, (3512), 3210 states have internal predecessors, (3512), 493 states have call successors, (493), 437 states have call predecessors, (493), 471 states have return successors, (592), 484 states have call predecessors, (592), 492 states have call successors, (592) [2023-12-02 13:03:16,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4132 states to 4132 states and 4597 transitions. [2023-12-02 13:03:16,794 INFO L78 Accepts]: Start accepts. Automaton has 4132 states and 4597 transitions. Word has length 165 [2023-12-02 13:03:16,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:03:16,795 INFO L495 AbstractCegarLoop]: Abstraction has 4132 states and 4597 transitions. [2023-12-02 13:03:16,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-02 13:03:16,795 INFO L276 IsEmpty]: Start isEmpty. Operand 4132 states and 4597 transitions. [2023-12-02 13:03:16,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-02 13:03:16,799 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:03:16,799 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-02 13:03:16,804 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2023-12-02 13:03:16,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2023-12-02 13:03:17,000 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:03:17,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:03:17,000 INFO L85 PathProgramCache]: Analyzing trace with hash -2021251267, now seen corresponding path program 1 times [2023-12-02 13:03:17,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:03:17,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824265527] [2023-12-02 13:03:17,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:03:17,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:03:17,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:03:17,118 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 38 proven. 32 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2023-12-02 13:03:17,118 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:03:17,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824265527] [2023-12-02 13:03:17,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824265527] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:03:17,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028487611] [2023-12-02 13:03:17,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:03:17,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:03:17,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:03:17,120 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:03:17,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-12-02 13:03:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:03:17,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 13:03:17,248 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:03:17,259 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2023-12-02 13:03:17,259 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:03:17,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028487611] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:03:17,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 13:03:17,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-12-02 13:03:17,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747726417] [2023-12-02 13:03:17,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:03:17,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:03:17,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:03:17,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:03:17,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:03:17,261 INFO L87 Difference]: Start difference. First operand 4132 states and 4597 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-02 13:03:17,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:03:17,978 INFO L93 Difference]: Finished difference Result 5642 states and 6261 transitions. [2023-12-02 13:03:17,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 13:03:17,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 167 [2023-12-02 13:03:17,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:03:17,982 INFO L225 Difference]: With dead ends: 5642 [2023-12-02 13:03:17,982 INFO L226 Difference]: Without dead ends: 2806 [2023-12-02 13:03:17,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-02 13:03:17,986 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 141 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:03:17,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 486 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:03:17,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2806 states. [2023-12-02 13:03:18,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2806 to 2496. [2023-12-02 13:03:18,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2496 states, 1892 states have (on average 1.0956659619450317) internal successors, (2073), 1919 states have internal predecessors, (2073), 302 states have call successors, (302), 268 states have call predecessors, (302), 300 states have return successors, (367), 308 states have call predecessors, (367), 301 states have call successors, (367) [2023-12-02 13:03:18,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 2742 transitions. [2023-12-02 13:03:18,559 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 2742 transitions. Word has length 167 [2023-12-02 13:03:18,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:03:18,559 INFO L495 AbstractCegarLoop]: Abstraction has 2496 states and 2742 transitions. [2023-12-02 13:03:18,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-02 13:03:18,560 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 2742 transitions. [2023-12-02 13:03:18,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-12-02 13:03:18,563 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:03:18,563 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:03:18,568 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-12-02 13:03:18,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:03:18,763 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:03:18,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:03:18,764 INFO L85 PathProgramCache]: Analyzing trace with hash -494484029, now seen corresponding path program 2 times [2023-12-02 13:03:18,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:03:18,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837475599] [2023-12-02 13:03:18,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:03:18,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:03:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:03:18,804 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2023-12-02 13:03:18,804 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:03:18,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837475599] [2023-12-02 13:03:18,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837475599] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:03:18,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:03:18,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 13:03:18,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911070943] [2023-12-02 13:03:18,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:03:18,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:03:18,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:03:18,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:03:18,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:03:18,805 INFO L87 Difference]: Start difference. First operand 2496 states and 2742 transitions. Second operand has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-02 13:03:19,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:03:19,492 INFO L93 Difference]: Finished difference Result 3757 states and 4150 transitions. [2023-12-02 13:03:19,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:03:19,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 168 [2023-12-02 13:03:19,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:03:19,496 INFO L225 Difference]: With dead ends: 3757 [2023-12-02 13:03:19,496 INFO L226 Difference]: Without dead ends: 2305 [2023-12-02 13:03:19,499 INFO L412 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 [2023-12-02 13:03:19,500 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 194 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:03:19,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 330 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:03:19,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2305 states. [2023-12-02 13:03:20,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2305 to 2246. [2023-12-02 13:03:20,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2246 states, 1704 states have (on average 1.0938967136150235) internal successors, (1864), 1726 states have internal predecessors, (1864), 279 states have call successors, (279), 245 states have call predecessors, (279), 261 states have return successors, (324), 274 states have call predecessors, (324), 278 states have call successors, (324) [2023-12-02 13:03:20,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 2467 transitions. [2023-12-02 13:03:20,019 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 2467 transitions. Word has length 168 [2023-12-02 13:03:20,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:03:20,019 INFO L495 AbstractCegarLoop]: Abstraction has 2246 states and 2467 transitions. [2023-12-02 13:03:20,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-02 13:03:20,019 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 2467 transitions. [2023-12-02 13:03:20,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-12-02 13:03:20,022 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:03:20,023 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:03:20,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-12-02 13:03:20,023 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:03:20,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:03:20,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1903318200, now seen corresponding path program 1 times [2023-12-02 13:03:20,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:03:20,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104279675] [2023-12-02 13:03:20,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:03:20,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:03:20,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:03:20,202 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 97 proven. 15 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-12-02 13:03:20,202 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:03:20,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104279675] [2023-12-02 13:03:20,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104279675] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:03:20,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491079811] [2023-12-02 13:03:20,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:03:20,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:03:20,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:03:20,204 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:03:20,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-12-02 13:03:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:03:20,340 INFO L262 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-02 13:03:20,343 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:03:20,393 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-12-02 13:03:20,393 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:03:20,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491079811] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:03:20,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 13:03:20,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 6 [2023-12-02 13:03:20,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174569631] [2023-12-02 13:03:20,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:03:20,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 13:03:20,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:03:20,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 13:03:20,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:03:20,396 INFO L87 Difference]: Start difference. First operand 2246 states and 2467 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 5 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2023-12-02 13:03:21,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:03:21,162 INFO L93 Difference]: Finished difference Result 2626 states and 2885 transitions. [2023-12-02 13:03:21,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 13:03:21,163 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 5 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 169 [2023-12-02 13:03:21,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:03:21,164 INFO L225 Difference]: With dead ends: 2626 [2023-12-02 13:03:21,164 INFO L226 Difference]: Without dead ends: 693 [2023-12-02 13:03:21,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-12-02 13:03:21,167 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 166 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:03:21,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 491 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:03:21,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2023-12-02 13:03:21,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 693. [2023-12-02 13:03:21,388 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) [2023-12-02 13:03:21,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 768 transitions. [2023-12-02 13:03:21,389 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 768 transitions. Word has length 169 [2023-12-02 13:03:21,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:03:21,390 INFO L495 AbstractCegarLoop]: Abstraction has 693 states and 768 transitions. [2023-12-02 13:03:21,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 5 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2023-12-02 13:03:21,390 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 768 transitions. [2023-12-02 13:03:21,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2023-12-02 13:03:21,392 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:03:21,392 INFO L195 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] [2023-12-02 13:03:21,398 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2023-12-02 13:03:21,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:03:21,593 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:03:21,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:03:21,593 INFO L85 PathProgramCache]: Analyzing trace with hash 770887062, now seen corresponding path program 1 times [2023-12-02 13:03:21,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:03:21,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035725726] [2023-12-02 13:03:21,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:03:21,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:03:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:03:22,041 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 115 proven. 55 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2023-12-02 13:03:22,041 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:03:22,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035725726] [2023-12-02 13:03:22,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035725726] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:03:22,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853201362] [2023-12-02 13:03:22,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:03:22,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:03:22,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:03:22,043 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:03:22,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-12-02 13:03:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:03:22,181 INFO L262 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-02 13:03:22,185 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:03:22,296 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-02 13:03:22,296 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:03:22,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853201362] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:03:22,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 13:03:22,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 26 [2023-12-02 13:03:22,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541334282] [2023-12-02 13:03:22,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:03:22,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 13:03:22,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:03:22,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 13:03:22,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2023-12-02 13:03:22,298 INFO L87 Difference]: Start difference. First operand 693 states and 768 transitions. Second operand has 9 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 3 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 5 states have call predecessors, (22), 3 states have call successors, (22) [2023-12-02 13:03:22,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:03:22,572 INFO L93 Difference]: Finished difference Result 946 states and 1046 transitions. [2023-12-02 13:03:22,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 13:03:22,573 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 3 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 5 states have call predecessors, (22), 3 states have call successors, (22) Word has length 220 [2023-12-02 13:03:22,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:03:22,573 INFO L225 Difference]: With dead ends: 946 [2023-12-02 13:03:22,573 INFO L226 Difference]: Without dead ends: 0 [2023-12-02 13:03:22,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2023-12-02 13:03:22,575 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 44 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:03:22,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 672 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:03:22,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-02 13:03:22,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-02 13:03:22,575 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) [2023-12-02 13:03:22,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-02 13:03:22,576 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 220 [2023-12-02 13:03:22,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:03:22,576 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-02 13:03:22,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 3 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 5 states have call predecessors, (22), 3 states have call successors, (22) [2023-12-02 13:03:22,577 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-02 13:03:22,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-02 13:03:22,579 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-02 13:03:22,579 INFO L805 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-02 13:03:22,586 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2023-12-02 13:03:22,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:03:22,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-02 13:03:34,989 WARN L293 SmtUtils]: Spent 12.20s on a formula simplification. DAG size of input: 232 DAG size of output: 207 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-02 13:03:44,925 WARN L293 SmtUtils]: Spent 6.81s on a formula simplification. DAG size of input: 173 DAG size of output: 202 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-02 13:04:10,763 WARN L293 SmtUtils]: Spent 14.67s on a formula simplification. DAG size of input: 688 DAG size of output: 480 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-02 13:04:33,099 WARN L293 SmtUtils]: Spent 5.08s on a formula simplification. DAG size of input: 228 DAG size of output: 105 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-02 13:04:48,130 WARN L293 SmtUtils]: Spent 14.75s on a formula simplification. DAG size of input: 206 DAG size of output: 234 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-02 13:05:02,816 WARN L293 SmtUtils]: Spent 14.68s on a formula simplification. DAG size of input: 688 DAG size of output: 480 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-02 13:05:15,791 WARN L293 SmtUtils]: Spent 12.33s on a formula simplification. DAG size of input: 512 DAG size of output: 527 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-02 13:05:41,564 WARN L293 SmtUtils]: Spent 18.46s on a formula simplification. DAG size of input: 248 DAG size of output: 240 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-02 13:06:06,318 WARN L293 SmtUtils]: Spent 18.27s on a formula simplification. DAG size of input: 248 DAG size of output: 240 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-02 13:06:32,640 WARN L293 SmtUtils]: Spent 11.90s on a formula simplification. DAG size of input: 512 DAG size of output: 527 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-02 13:06:42,244 WARN L293 SmtUtils]: Spent 5.11s on a formula simplification. DAG size of input: 180 DAG size of output: 182 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-02 13:08:02,806 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 926 936) no Hoare annotation was computed. [2023-12-02 13:08:02,807 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 926 936) no Hoare annotation was computed. [2023-12-02 13:08:02,807 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 926 936) the Hoare annotation is: (let ((.cse45 (= |old(~t2_st~0)| ~t2_st~0)) (.cse47 (= ~c_last_read~0 ~p_last_write~0)) (.cse53 (= ~q_free~0 0)) (.cse51 (= ~c_num_read~0 0)) (.cse52 (= ~p_last_write~0 ~q_buf_0~0)) (.cse48 (= ~p_dw_pc~0 0)) (.cse50 (= ~p_num_write~0 0)) (.cse49 (= ~c_dr_st~0 0)) (.cse54 (= ~t2_i~0 1)) (.cse10 (= ~E_1~0 1)) (.cse3 (= |old(~t2_st~0)| 0)) (.cse2 (= 2 |old(~t2_st~0)|)) (.cse0 (= ~m_st~0 2)) (.cse5 (= |old(~t1_st~0)| ~t1_st~0)) (.cse4 (= 0 ~t2_st~0)) (.cse46 (= ~E_2~0 1))) (let ((.cse16 (not .cse46)) (.cse24 (not (= (+ ~local~0 1) ~token~0))) (.cse29 (and .cse0 .cse5 .cse4)) (.cse34 (= ~t1_st~0 0)) (.cse31 (not (= |old(~t1_st~0)| 0))) (.cse36 (not (= ~t1_pc~0 0))) (.cse1 (= 2 ~t2_st~0)) (.cse25 (not .cse2)) (.cse41 (= ~E_M~0 1)) (.cse32 (not (= ~E_2~0 2))) (.cse33 (= ~m_st~0 |old(~m_st~0)|)) (.cse42 (= 2 ~t1_st~0)) (.cse9 (not (= ~E_M~0 2))) (.cse39 (= ~m_pc~0 ~t1_pc~0)) (.cse28 (not .cse3)) (.cse35 (not (= ~m_pc~0 0))) (.cse37 (not .cse10)) (.cse43 (not (= |old(~t1_st~0)| 2))) (.cse30 (not (= 0 ~t2_pc~0))) (.cse38 (not (= ~token~0 ~local~0))) (.cse6 (not (= ~q_req_up~0 0))) (.cse7 (not (= ~p_dw_st~0 0))) (.cse8 (not .cse54)) (.cse11 (not (= ~t1_pc~0 1))) (.cse12 (not .cse49)) (.cse13 (not .cse50)) (.cse14 (not (= ~E_1~0 2))) (.cse15 (not (= ~t1_i~0 1))) (.cse17 (not .cse48)) (.cse18 (not .cse52)) (.cse40 (= ~m_pc~0 1)) (.cse19 (not .cse51)) (.cse20 (not .cse53)) (.cse21 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse22 (not (= 2 |old(~m_st~0)|))) (.cse23 (not (= ~t2_pc~0 1))) (.cse44 (and .cse48 .cse49 .cse50 .cse51 .cse0 .cse52 .cse5 .cse53 .cse45 .cse54 (= ~c_dr_pc~0 0) .cse47)) (.cse26 (not .cse47)) (.cse27 (= ~q_write_ev~0 1))) (and (or (and (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse4)) .cse5) (and (or .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (or .cse6 .cse7 .cse8 .cse9 .cse28 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse26 .cse27))) (or .cse6 .cse7 .cse8 .cse29 .cse9 .cse28 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse24 .cse26 .cse27) (or .cse31 .cse6 .cse32 .cse7 .cse8 .cse9 (= |old(~m_st~0)| 0) .cse28 (and .cse33 .cse34 .cse4) .cse12 .cse35 .cse15 .cse17 .cse18 .cse36 .cse19 .cse20 (not (= ~c_num_read~0 ~p_num_write~0)) .cse21 .cse37 .cse30 .cse26 .cse27 .cse38) (or .cse6 .cse7 .cse8 .cse29 .cse39 .cse28 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse40 .cse19 .cse20 .cse21 .cse30 .cse22 .cse26 .cse27 .cse41) (or (and .cse1 .cse33 .cse34) .cse31 .cse6 .cse32 (not .cse39) .cse7 .cse8 .cse9 .cse12 .cse13 .cse15 .cse17 .cse18 .cse36 .cse19 .cse20 .cse21 .cse37 .cse23 .cse25 .cse26 .cse27 .cse38) (or .cse6 .cse32 .cse7 .cse8 .cse9 (and .cse1 .cse33 .cse42) .cse11 .cse12 .cse13 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse37 .cse43 .cse23 .cse25 .cse26 .cse27 .cse38) (or .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse40 .cse19 .cse20 .cse21 .cse22 .cse23 .cse44 .cse26 .cse27 .cse41) (or .cse6 .cse32 .cse7 .cse8 (not (= ~token~0 (+ 2 ~local~0))) .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 (and .cse0 .cse42 .cse45) .cse21 .cse43 .cse22 .cse23 .cse26 .cse27 (not .cse41)) (or .cse6 .cse32 .cse7 .cse8 (and .cse33 .cse42 .cse4) .cse9 .cse39 .cse28 .cse11 .cse12 .cse35 .cse13 .cse15 .cse17 .cse18 .cse40 .cse19 .cse20 .cse21 .cse37 .cse43 .cse30 .cse26 .cse27 .cse38) (or .cse6 .cse7 .cse8 .cse46 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse40 .cse19 .cse20 .cse21 .cse22 .cse23 .cse44 .cse26 .cse27)))) [2023-12-02 13:08:02,808 INFO L899 garLoopResultBuilder]: For program point update_channels1EXIT(lines 226 240) no Hoare annotation was computed. [2023-12-02 13:08:02,808 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 226 240) the Hoare annotation is: (let ((.cse2 (not (= ~m_pc~0 ~t1_pc~0))) (.cse3 (= |old(~q_read_ev~0)| 1)) (.cse5 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))) (.cse8 (= ~m_pc~0 1)) (.cse11 (not (= ~p_dw_pc~0 1))) (.cse15 (not (= ~c_dr_pc~0 1))) (.cse10 (= ~q_free~0 0)) (.cse19 (= |old(~q_read_ev~0)| 0)) (.cse1 (not (= ~E_2~0 2))) (.cse12 (= ~p_dw_st~0 0)) (.cse4 (not (= ~E_M~0 2))) (.cse0 (= ~c_dr_st~0 0)) (.cse6 (not (= ~E_1~0 2))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse9 (not (= ~t1_pc~0 0))) (.cse13 (not (= 0 ~t2_st~0))) (.cse14 (not (= ~m_st~0 0))) (.cse16 (not (= 0 ~t2_pc~0))) (.cse17 (not (= ~p_dw_i~0 1))) (.cse18 (not (= ~t1_st~0 0))) (.cse20 (not (= 1 ~c_dr_i~0))) (.cse21 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not .cse10) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |old(~q_write_ev~0)| 1) .cse7 .cse8 .cse9 .cse11 (not (= ~c_num_read~0 ~p_num_write~0)) .cse13 .cse14 .cse15 .cse16 .cse17 (and (= |old(~q_req_up~0)| 1) .cse10) (= |old(~q_write_ev~0)| 0) .cse18 .cse19 .cse20 .cse21) (let ((.cse22 (select |#memory_int| 1))) (or (not (= ~a_t~0 0)) .cse1 (not .cse12) (not (= ~t2_i~0 0)) (not (= (select .cse22 0) 48)) (not (= ~M_E~0 2)) (not (= ~t1_i~0 0)) .cse4 (not (= 2 (select |#length| 1))) (not (= |old(~q_ev~0)| 0)) (not .cse0) (not (= (select |#valid| 3) 1)) (not (= ~m_pc~0 0)) (not (= ~T2_E~0 2)) (not (= ~p_num_write~0 0)) .cse6 (not (= ~T1_E~0 2)) (not (= ~p_dw_pc~0 0)) (not (= (select |#length| 3) 12)) .cse7 (not (= (select |#valid| 0) 0)) (not (= (select .cse22 1) 0)) .cse9 (not (= ~c_num_read~0 0)) (not (= (select |#valid| 1) 1)) (not (= 19 (select |#length| 2))) (not (= ~token~0 0)) .cse13 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse14 (not (= |old(~q_read_ev~0)| 2)) .cse16 (< |#StackHeapBarrier| 1) .cse17 .cse18 (not (= (select |#valid| 2) 1)) (not (= ~q_free~0 1)) (not (= |old(~q_req_up~0)| 0)) (not (= ~m_i~0 0)) (not (= 2 |old(~q_write_ev~0)|)) (not (= ~c_last_read~0 ~p_last_write~0)) (not (= ~p_last_write~0 0)) .cse20 (and (= ~q_req_up~0 0) (= ~q_ev~0 0) (= ~q_write_ev~0 2) (= ~q_read_ev~0 2)) .cse21)))) [2023-12-02 13:08:02,808 INFO L899 garLoopResultBuilder]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2023-12-02 13:08:02,808 INFO L899 garLoopResultBuilder]: For program point L680(lines 680 689) no Hoare annotation was computed. [2023-12-02 13:08:02,808 INFO L899 garLoopResultBuilder]: For program point L680-2(lines 680 689) no Hoare annotation was computed. [2023-12-02 13:08:02,809 INFO L899 garLoopResultBuilder]: For program point L643(lines 643 648) no Hoare annotation was computed. [2023-12-02 13:08:02,809 INFO L899 garLoopResultBuilder]: For program point L672(lines 660 674) no Hoare annotation was computed. [2023-12-02 13:08:02,809 INFO L899 garLoopResultBuilder]: For program point L681(lines 681 686) no Hoare annotation was computed. [2023-12-02 13:08:02,809 INFO L899 garLoopResultBuilder]: For program point L661(lines 661 670) no Hoare annotation was computed. [2023-12-02 13:08:02,809 INFO L899 garLoopResultBuilder]: For program point L661-2(lines 661 670) no Hoare annotation was computed. [2023-12-02 13:08:02,809 INFO L899 garLoopResultBuilder]: For program point L653(lines 641 655) no Hoare annotation was computed. [2023-12-02 13:08:02,810 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 892 925) the Hoare annotation is: (let ((.cse26 (= |old(~t2_st~0)| 0)) (.cse23 (= ~m_st~0 2)) (.cse28 (= |old(~t1_st~0)| ~t1_st~0)) (.cse34 (= ~E_1~0 1)) (.cse25 (= 2 |old(~t2_st~0)|)) (.cse24 (= 2 ~t2_st~0)) (.cse48 (= 2 ~t1_st~0)) (.cse44 (= ~m_st~0 |old(~m_st~0)|)) (.cse45 (= ~t1_st~0 0)) (.cse27 (= 0 ~t2_st~0))) (let ((.cse30 (not (= ~E_2~0 1))) (.cse33 (not (= (+ ~local~0 1) ~token~0))) (.cse37 (and .cse44 .cse45 .cse27)) (.cse31 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse35 (not (= |old(~t1_st~0)| 0))) (.cse36 (not (= ~m_pc~0 ~t1_pc~0))) (.cse38 (not (= ~t1_pc~0 0))) (.cse5 (and .cse24 .cse44 .cse48)) (.cse46 (= |old(~t2_st~0)| ~t2_st~0)) (.cse47 (not (= ~token~0 (+ 2 ~local~0)))) (.cse43 (not (= |old(~m_st~0)| 0))) (.cse19 (not (= ~t2_pc~0 1))) (.cse20 (not .cse25)) (.cse1 (not (= ~E_2~0 2))) (.cse4 (not (= ~E_M~0 2))) (.cse8 (not (= ~m_pc~0 0))) (.cse39 (not .cse34)) (.cse18 (not (= |old(~t1_st~0)| 2))) (.cse41 (not (= ~token~0 ~local~0))) (.cse0 (not (= ~q_req_up~0 0))) (.cse2 (not (= ~p_dw_st~0 0))) (.cse3 (not (= ~t2_i~0 1))) (.cse42 (and .cse23 .cse28 .cse27)) (.cse29 (not .cse26)) (.cse6 (not (= ~t1_pc~0 1))) (.cse7 (not (= ~c_dr_st~0 0))) (.cse9 (not (= ~p_num_write~0 0))) (.cse10 (not (= ~E_1~0 2))) (.cse11 (not (= ~t1_i~0 1))) (.cse12 (not (= ~p_dw_pc~0 0))) (.cse13 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse14 (= ~m_pc~0 1)) (.cse15 (not (= ~c_num_read~0 0))) (.cse16 (not (= ~q_free~0 0))) (.cse17 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse40 (not (= 0 ~t2_pc~0))) (.cse32 (not (= 2 |old(~m_st~0)|))) (.cse21 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse22 (= ~q_write_ev~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or (and (or (and .cse23 .cse24 .cse25) (and .cse26 .cse23 .cse27)) .cse28) (and (or .cse0 .cse2 .cse3 .cse4 .cse29 .cse6 .cse7 .cse10 .cse11 .cse30 .cse12 .cse13 .cse15 .cse16 .cse31 .cse17 .cse32 .cse19 .cse33 .cse21 .cse22) (or .cse0 .cse2 .cse3 .cse4 .cse34 .cse6 .cse7 .cse9 .cse10 .cse11 .cse30 .cse12 .cse13 .cse15 .cse16 .cse17 .cse32 .cse19 .cse33 .cse20 .cse21 .cse22))) (or .cse35 .cse0 .cse1 .cse36 .cse2 .cse3 .cse4 .cse29 .cse37 .cse7 .cse11 .cse12 .cse13 .cse38 .cse15 .cse16 .cse31 .cse17 .cse39 .cse40 .cse21 .cse22 .cse41) (or .cse0 .cse2 .cse3 .cse42 .cse4 .cse29 .cse34 .cse6 .cse7 .cse10 .cse11 .cse30 .cse12 .cse13 .cse15 .cse16 .cse31 .cse17 .cse40 .cse32 .cse33 .cse21 .cse22) (or .cse35 .cse0 .cse1 .cse36 .cse2 .cse3 .cse4 .cse29 .cse37 .cse7 .cse10 .cse11 .cse12 .cse13 .cse38 .cse15 .cse16 .cse31 .cse17 .cse40 (and .cse43 .cse32) .cse21 .cse22 .cse41) (or (and .cse24 .cse44 .cse45) .cse35 .cse0 .cse1 .cse36 .cse2 .cse3 .cse4 .cse7 .cse9 .cse11 .cse12 .cse13 .cse38 .cse15 .cse16 .cse17 .cse39 .cse19 .cse20 .cse21 .cse22 .cse41) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse39 .cse18 .cse19 .cse20 .cse21 .cse22 .cse41) (or (and .cse23 .cse28 .cse46) .cse0 .cse2 .cse3 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse32 .cse19 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse3 .cse47 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 (and .cse23 .cse48 .cse46) .cse17 .cse18 .cse32 .cse19 .cse21 .cse22 (not (= ~E_M~0 1))) (or .cse0 .cse1 .cse2 .cse3 (and .cse24 (= ~m_st~0 0) .cse48) .cse47 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse43 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse23 .cse24 .cse48) .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse32 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse3 (and .cse44 .cse48 .cse27) .cse4 .cse29 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse39 .cse18 .cse40 .cse21 .cse22 .cse41) (or .cse0 .cse2 .cse3 .cse42 .cse29 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse40 .cse32 .cse21 .cse22)))) [2023-12-02 13:08:02,810 INFO L899 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 892 925) no Hoare annotation was computed. [2023-12-02 13:08:02,810 INFO L899 garLoopResultBuilder]: For program point L662(lines 662 667) no Hoare annotation was computed. [2023-12-02 13:08:02,810 INFO L899 garLoopResultBuilder]: For program point L691(lines 679 693) no Hoare annotation was computed. [2023-12-02 13:08:02,810 INFO L899 garLoopResultBuilder]: For program point L642(lines 642 651) no Hoare annotation was computed. [2023-12-02 13:08:02,812 INFO L895 garLoopResultBuilder]: At program point L321(line 321) the Hoare annotation is: (let ((.cse16 (= |old(~c_dr_st~0)| 0)) (.cse0 (not (= ~E_2~0 2))) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (not (= ~E_M~0 2))) (.cse20 (= |old(~p_dw_st~0)| 0)) (.cse3 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (.cse4 (not (= ~E_1~0 2))) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse7 (not (= ~t1_pc~0 0))) (.cse5 (= ~q_free~0 0)) (.cse8 (not (= ~p_dw_pc~0 1))) (.cse9 (not (= 0 ~t2_st~0))) (.cse10 (not (= ~m_st~0 0))) (.cse11 (not (= ~c_dr_pc~0 1))) (.cse12 (= ~q_read_ev~0 0)) (.cse13 (not (= 0 ~t2_pc~0))) (.cse14 (not (= ~p_dw_i~0 1))) (.cse15 (not (= ~t1_st~0 0))) (.cse17 (not (= 1 ~c_dr_i~0))) (.cse18 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and (= ~q_req_up~0 1) .cse5) .cse6 .cse7 .cse8 (not (= ~c_num_read~0 ~p_num_write~0)) .cse9 .cse10 (= ~q_write_ev~0 0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= ~q_write_ev~0 1) .cse17 .cse18) (let ((.cse19 (select |#memory_int| 1))) (or (not (= ~a_t~0 0)) (not (= ~q_req_up~0 0)) .cse0 (not .cse16) (not (= ~t2_i~0 0)) (not (= (select .cse19 0) 48)) (not (= ~M_E~0 2)) (not (= ~t1_i~0 0)) .cse2 (not (= 2 (select |#length| 1))) (not (= (select |#valid| 3) 1)) (not (= ~m_pc~0 0)) (not (= ~T2_E~0 2)) (not (= ~p_num_write~0 0)) .cse4 (not (= ~T1_E~0 2)) (not (= ~p_dw_pc~0 0)) (not (= (select |#length| 3) 12)) .cse6 (not (= (select |#valid| 0) 0)) (not (= (select .cse19 1) 0)) .cse7 (not (= ~c_num_read~0 0)) (not (= (select |#valid| 1) 1)) (not (= 19 (select |#length| 2))) (not (= ~token~0 0)) .cse9 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse10 (not (= ~q_ev~0 0)) (not (= ~q_write_ev~0 2)) .cse13 (< |#StackHeapBarrier| 1) .cse14 .cse15 (not (= (select |#valid| 2) 1)) (not (= ~q_free~0 1)) (not (= ~m_i~0 0)) (not .cse20) (not (= ~q_read_ev~0 2)) (not (= ~c_last_read~0 ~p_last_write~0)) (not (= ~p_last_write~0 0)) (and (= ~c_dr_st~0 0) (= ~p_dw_st~0 0)) .cse17 .cse18)) (or .cse0 .cse1 .cse2 .cse20 (= ~q_read_ev~0 1) .cse3 .cse4 .cse6 .cse7 (not .cse5) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse17 .cse18))) [2023-12-02 13:08:02,813 INFO L895 garLoopResultBuilder]: At program point L323-2(lines 323 327) the Hoare annotation is: (let ((.cse41 (= ~q_free~0 0))) (let ((.cse19 (= 1 ~c_dr_i~0)) (.cse35 (= ~t1_st~0 0)) (.cse23 (= ~p_dw_i~0 1)) (.cse37 (= 0 ~t2_pc~0)) (.cse39 (= ~q_write_ev~0 1)) (.cse8 (not .cse41)) (.cse33 (= ~q_write_ev~0 0)) (.cse20 (= ~c_dr_pc~0 1)) (.cse21 (= ~p_dw_pc~0 1)) (.cse17 (= ~p_last_write~0 ~q_buf_0~0)) (.cse40 (= ~q_req_up~0 1)) (.cse28 (= ~p_dw_st~0 0)) (.cse3 (= |old(~p_dw_st~0)| 0))) (let ((.cse22 (or (not .cse28) .cse3)) (.cse4 (= ~q_read_ev~0 1)) (.cse0 (not (= ~E_2~0 2))) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (not (= ~E_M~0 2))) (.cse30 (= ~E_2~0 1)) (.cse5 (not (= ~E_1~0 2))) (.cse31 (and .cse40 .cse41)) (.cse6 (not .cse17)) (.cse7 (not (= ~t1_pc~0 0))) (.cse9 (not .cse21)) (.cse32 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse10 (not (= 0 ~t2_st~0))) (.cse11 (not (= ~m_st~0 0))) (.cse12 (not .cse20)) (.cse34 (not .cse33)) (.cse18 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse36 (or (not .cse40) .cse8)) (.cse38 (not .cse39)) (.cse13 (= ~q_read_ev~0 0)) (.cse14 (not .cse37)) (.cse15 (not .cse23)) (.cse16 (not .cse35)) (.cse26 (= |old(~c_dr_st~0)| 0)) (.cse29 (not .cse3)) (.cse24 (not .cse19)) (.cse25 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) (and .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) .cse24 .cse25) (let ((.cse27 (select |#memory_int| 1))) (or (not (= ~a_t~0 0)) (not (= ~q_req_up~0 0)) .cse0 (not .cse26) (not (= ~t2_i~0 0)) (not (= (select .cse27 0) 48)) (not (= ~M_E~0 2)) (not (= ~t1_i~0 0)) .cse2 (not (= 2 (select |#length| 1))) (not (= (select |#valid| 3) 1)) (not (= ~m_pc~0 0)) (not (= ~T2_E~0 2)) (not (= ~p_num_write~0 0)) .cse5 (not (= ~T1_E~0 2)) (not (= ~p_dw_pc~0 0)) (not (= (select |#length| 3) 12)) .cse6 (not (= (select |#valid| 0) 0)) (not (= (select .cse27 1) 0)) .cse7 (not (= ~c_num_read~0 0)) (not (= (select |#valid| 1) 1)) (not (= 19 (select |#length| 2))) (not (= ~token~0 0)) .cse10 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse11 (and (= ~c_dr_st~0 0) (= activate_threads1_~tmp~1 0) .cse28) (not (= ~q_ev~0 0)) (not (= ~q_write_ev~0 2)) .cse14 (< |#StackHeapBarrier| 1) .cse15 .cse16 (not (= (select |#valid| 2) 1)) (not (= ~q_free~0 1)) (not (= ~m_i~0 0)) .cse29 (not (= ~q_read_ev~0 2)) (not (= ~c_last_read~0 ~p_last_write~0)) (not (= ~p_last_write~0 0)) .cse24 .cse25)) (or .cse0 .cse1 .cse2 (and (not .cse4) .cse18 .cse22) .cse30 .cse5 .cse31 .cse6 .cse7 .cse9 .cse32 .cse10 .cse11 .cse33 .cse12 .cse13 .cse14 .cse15 .cse16 .cse26 (and .cse17 .cse34 .cse4 .cse18 .cse19 .cse20 .cse35 .cse21 .cse28 .cse36 .cse23 .cse37 .cse38) .cse39 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse30 .cse5 .cse31 .cse6 .cse7 .cse9 .cse32 .cse10 .cse11 .cse33 .cse12 (and .cse17 .cse34 .cse18 .cse19 .cse20 .cse35 .cse21 .cse28 .cse36 .cse23 .cse37 .cse38) .cse13 .cse14 .cse15 .cse16 .cse26 .cse29 .cse39 .cse24 .cse25))))) [2023-12-02 13:08:02,813 INFO L899 garLoopResultBuilder]: For program point L321-1(line 321) no Hoare annotation was computed. [2023-12-02 13:08:02,813 INFO L899 garLoopResultBuilder]: For program point activate_threads1EXIT(lines 315 339) no Hoare annotation was computed. [2023-12-02 13:08:02,814 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 315 339) the Hoare annotation is: (let ((.cse16 (= |old(~c_dr_st~0)| 0)) (.cse0 (not (= ~E_2~0 2))) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (not (= ~E_M~0 2))) (.cse20 (= |old(~p_dw_st~0)| 0)) (.cse3 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (.cse4 (not (= ~E_1~0 2))) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse7 (not (= ~t1_pc~0 0))) (.cse5 (= ~q_free~0 0)) (.cse8 (not (= ~p_dw_pc~0 1))) (.cse9 (not (= 0 ~t2_st~0))) (.cse10 (not (= ~m_st~0 0))) (.cse11 (not (= ~c_dr_pc~0 1))) (.cse12 (= ~q_read_ev~0 0)) (.cse13 (not (= 0 ~t2_pc~0))) (.cse14 (not (= ~p_dw_i~0 1))) (.cse15 (not (= ~t1_st~0 0))) (.cse17 (not (= 1 ~c_dr_i~0))) (.cse18 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and (= ~q_req_up~0 1) .cse5) .cse6 .cse7 .cse8 (not (= ~c_num_read~0 ~p_num_write~0)) .cse9 .cse10 (= ~q_write_ev~0 0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= ~q_write_ev~0 1) .cse17 .cse18) (let ((.cse19 (select |#memory_int| 1))) (or (not (= ~a_t~0 0)) (not (= ~q_req_up~0 0)) .cse0 (not .cse16) (not (= ~t2_i~0 0)) (not (= (select .cse19 0) 48)) (not (= ~M_E~0 2)) (not (= ~t1_i~0 0)) .cse2 (not (= 2 (select |#length| 1))) (not (= (select |#valid| 3) 1)) (not (= ~m_pc~0 0)) (not (= ~T2_E~0 2)) (not (= ~p_num_write~0 0)) .cse4 (not (= ~T1_E~0 2)) (not (= ~p_dw_pc~0 0)) (not (= (select |#length| 3) 12)) .cse6 (not (= (select |#valid| 0) 0)) (not (= (select .cse19 1) 0)) .cse7 (not (= ~c_num_read~0 0)) (not (= (select |#valid| 1) 1)) (not (= 19 (select |#length| 2))) (not (= ~token~0 0)) .cse9 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse10 (not (= ~q_ev~0 0)) (not (= ~q_write_ev~0 2)) .cse13 (< |#StackHeapBarrier| 1) .cse14 .cse15 (not (= (select |#valid| 2) 1)) (not (= ~q_free~0 1)) (not (= ~m_i~0 0)) (not .cse20) (not (= ~q_read_ev~0 2)) (not (= ~c_last_read~0 ~p_last_write~0)) (not (= ~p_last_write~0 0)) (and (= ~c_dr_st~0 0) (= ~p_dw_st~0 0)) .cse17 .cse18)) (or .cse0 .cse1 .cse2 .cse20 (= ~q_read_ev~0 1) .cse3 .cse4 .cse6 .cse7 (not .cse5) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse17 .cse18))) [2023-12-02 13:08:02,814 INFO L899 garLoopResultBuilder]: For program point L329(line 329) no Hoare annotation was computed. [2023-12-02 13:08:02,814 INFO L899 garLoopResultBuilder]: For program point update_channels2EXIT(lines 695 702) no Hoare annotation was computed. [2023-12-02 13:08:02,814 INFO L902 garLoopResultBuilder]: At program point update_channels2FINAL(lines 695 702) the Hoare annotation is: true [2023-12-02 13:08:02,815 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 816 853) the Hoare annotation is: (let ((.cse31 (= ~E_1~0 2))) (let ((.cse24 (= |old(~E_M~0)| 1)) (.cse26 (and (not (= ~E_2~0 1)) .cse31 (not (= ~E_M~0 1)))) (.cse15 (not (= ~m_st~0 2))) (.cse27 (not (= ~m_st~0 0))) (.cse16 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse28 (not (= 0 ~t2_st~0))) (.cse29 (not (= 0 ~t2_pc~0))) (.cse0 (not (= ~q_req_up~0 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (not (= 2 |old(~E_2~0)|))) (.cse3 (not (= ~t2_i~0 1))) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (not (= ~c_dr_st~0 0))) (.cse6 (not (= 2 |old(~E_1~0)|))) (.cse30 (not (= ~m_pc~0 0))) (.cse7 (not (= 2 ~t2_st~0))) (.cse8 (not (= 2 |old(~E_M~0)|))) (.cse22 (not (= ~p_num_write~0 0))) (.cse9 (not (= ~t1_i~0 1))) (.cse10 (not (= ~p_dw_pc~0 0))) (.cse11 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse12 (not (= 2 ~t1_st~0))) (.cse23 (= ~m_pc~0 1)) (.cse13 (not (= ~c_num_read~0 0))) (.cse14 (not (= ~q_free~0 0))) (.cse25 (= |old(~E_2~0)| 1)) (.cse17 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse18 (not (= ~t2_pc~0 1))) (.cse19 (and (= ~E_2~0 2) (= ~E_M~0 2) .cse31)) (.cse20 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse21 (= ~q_write_ev~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse22 .cse9 .cse10 .cse11 .cse23 .cse24 .cse13 .cse14 .cse15 .cse25 .cse17 .cse18 .cse20 .cse21 .cse26) (or .cse0 .cse1 .cse2 .cse3 (not (= ~token~0 (+ 2 ~local~0))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse27 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse3 (= ~m_pc~0 ~t1_pc~0) .cse4 .cse5 .cse6 .cse22 .cse9 .cse10 .cse11 .cse24 .cse13 .cse14 .cse15 .cse25 .cse28 .cse17 .cse29 .cse20 .cse21 .cse26) (or .cse0 .cse1 .cse2 .cse3 (and .cse15 .cse27) .cse5 .cse6 .cse30 .cse8 .cse9 .cse10 .cse11 (not (= ~t1_pc~0 0)) .cse13 .cse14 .cse16 .cse28 .cse17 .cse29 (not (= ~t1_st~0 0)) .cse19 .cse20 .cse21 (not (= ~token~0 ~local~0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse30 .cse7 .cse8 .cse22 .cse9 .cse10 .cse11 .cse12 .cse23 .cse13 .cse14 .cse25 .cse17 .cse18 .cse19 .cse20 .cse21)))) [2023-12-02 13:08:02,815 INFO L899 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 816 853) no Hoare annotation was computed. [2023-12-02 13:08:02,816 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 279 296) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse1 (not (= ~E_2~0 2))) (.cse2 (not (= ~m_pc~0 ~t1_pc~0))) (.cse3 (not (= ~E_M~0 2))) (.cse4 (not (= ~E_1~0 2))) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse7 (= ~m_pc~0 1)) (.cse8 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse9 (not (= ~t1_pc~0 0))) (.cse5 (= ~q_free~0 0)) (.cse10 (not (= ~p_dw_pc~0 1))) (.cse19 (= ~p_dw_st~0 0)) (.cse11 (not (= 0 ~t2_st~0))) (.cse12 (not (= ~m_st~0 0))) (.cse13 (not (= ~c_dr_pc~0 1))) (.cse14 (not (= 0 ~t2_pc~0))) (.cse15 (not (= ~p_dw_i~0 1))) (.cse16 (not (= ~t1_st~0 0))) (.cse17 (not (= 1 ~c_dr_i~0))) (.cse18 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and (= ~q_req_up~0 1) .cse5) (= |old(~q_write_ev~0)| 1) .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ~c_num_read~0 ~p_num_write~0)) .cse11 .cse12 .cse13 .cse14 .cse15 (= |old(~q_write_ev~0)| 0) .cse16 .cse17 .cse18) (let ((.cse20 (select |#memory_int| 1))) (or (not (= ~a_t~0 0)) (not (= ~q_req_up~0 0)) .cse1 (not .cse19) (not (= ~t2_i~0 0)) (not (= (select .cse20 0) 48)) (not (= ~M_E~0 2)) (not (= ~t1_i~0 0)) (and (= ~q_write_ev~0 2) (= ~q_read_ev~0 2)) .cse3 (not (= 2 (select |#length| 1))) (not .cse0) (not (= (select |#valid| 3) 1)) (not (= ~m_pc~0 0)) (not (= ~T2_E~0 2)) (not (= ~p_num_write~0 0)) .cse4 (not (= ~T1_E~0 2)) (not (= ~p_dw_pc~0 0)) (not (= (select |#length| 3) 12)) .cse6 (not (= (select |#valid| 0) 0)) (not (= (select .cse20 1) 0)) .cse9 (not (= ~c_num_read~0 0)) (not (= (select |#valid| 1) 1)) (not (= 19 (select |#length| 2))) (not (= ~token~0 0)) .cse11 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse12 (not (= |old(~q_read_ev~0)| 2)) (not (= ~q_ev~0 0)) .cse14 (< |#StackHeapBarrier| 1) .cse15 .cse16 (not (= (select |#valid| 2) 1)) (not (= ~q_free~0 1)) (not (= ~m_i~0 0)) (not (= 2 |old(~q_write_ev~0)|)) (not (= ~c_last_read~0 ~p_last_write~0)) (not (= ~p_last_write~0 0)) .cse17 .cse18)) (or .cse0 .cse1 .cse2 (= |old(~q_read_ev~0)| 1) .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 (not .cse5) .cse10 .cse19 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) (= |old(~q_read_ev~0)| 0) .cse17 .cse18))) [2023-12-02 13:08:02,816 INFO L899 garLoopResultBuilder]: For program point fire_delta_events1EXIT(lines 279 296) no Hoare annotation was computed. [2023-12-02 13:08:02,816 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 98) no Hoare annotation was computed. [2023-12-02 13:08:02,816 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 101) no Hoare annotation was computed. [2023-12-02 13:08:02,816 INFO L899 garLoopResultBuilder]: For program point L92-2(lines 92 101) no Hoare annotation was computed. [2023-12-02 13:08:02,816 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 88 106) the Hoare annotation is: true [2023-12-02 13:08:02,817 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 88 106) no Hoare annotation was computed. [2023-12-02 13:08:02,817 INFO L899 garLoopResultBuilder]: For program point L103(lines 91 105) no Hoare annotation was computed. [2023-12-02 13:08:02,817 INFO L899 garLoopResultBuilder]: For program point L762(lines 762 766) no Hoare annotation was computed. [2023-12-02 13:08:02,817 INFO L895 garLoopResultBuilder]: At program point L795-1(lines 757 809) the Hoare annotation is: (let ((.cse5 (= ~m_st~0 2)) (.cse27 (= ~m_st~0 0))) (let ((.cse20 (= (+ ~local~0 1) ~token~0)) (.cse8 (not (= ~m_pc~0 1))) (.cse10 (not (= ~E_2~0 1))) (.cse19 (not (= ~E_M~0 1))) (.cse0 (= ~t1_pc~0 1)) (.cse21 (= 2 ~t1_st~0)) (.cse30 (= |ULTIMATE.start_eval2_~tmp~5#1| 1)) (.cse34 (or .cse5 .cse27)) (.cse29 (= 0 ~t2_pc~0)) (.cse24 (= 0 ~t2_st~0)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~c_dr_st~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse33 (= ~t1_pc~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse26 (= 2 ~t2_st~0)) (.cse9 (= ~q_free~0 0)) (.cse11 (= ~q_req_up~0 0)) (.cse31 (= ~t1_st~0 0)) (.cse12 (= ~t2_pc~0 1)) (.cse22 (= ~E_2~0 2)) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~t2_i~0 1)) (.cse15 (= ~c_dr_pc~0 0)) (.cse28 (= ~m_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (not (= ~q_write_ev~0 1))) (.cse23 (= ~E_M~0 2)) (.cse32 (= ~token~0 ~local~0)) (.cse18 (= ~E_1~0 2)) (.cse25 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 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 .cse6 .cse20 .cse7 .cse9 .cse21 .cse11 .cse12 .cse22 .cse13 .cse14 .cse15 .cse16 .cse17 .cse23 .cse24 .cse18 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse26 .cse27 .cse8 .cse9 .cse21 .cse11 .cse12 .cse22 .cse13 .cse14 .cse15 .cse16 .cse17 .cse23 .cse18 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse26 .cse9 .cse21 .cse11 .cse12 .cse22 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse23 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse9 .cse21 .cse11 .cse22 .cse13 .cse14 .cse15 .cse29 .cse16 .cse17 .cse23 .cse24 .cse18 .cse30) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse26 .cse27 .cse9 .cse21 .cse11 .cse12 .cse22 (= ~token~0 (+ 2 ~local~0)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse23 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse31 .cse22 .cse13 .cse14 .cse15 .cse29 .cse16 .cse17 .cse23 .cse24 .cse32 .cse18 .cse30) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse33 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse31 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (<= 2 ~t2_st~0) .cse18 .cse30 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse26 .cse9 .cse11 .cse31 .cse12 .cse22 .cse13 .cse14 .cse15 .cse16 .cse17 .cse23 .cse32 .cse18 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse27 .cse9 .cse21 .cse11 .cse22 .cse13 .cse14 .cse15 .cse28 .cse29 .cse16 .cse17 .cse23 .cse24 .cse32 .cse18 .cse30) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse26 .cse9 .cse21 .cse11 .cse12 .cse22 .cse13 .cse14 .cse15 .cse16 .cse17 .cse23 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse33 .cse6 .cse7 .cse9 .cse11 .cse31 .cse22 .cse13 .cse14 .cse15 .cse29 .cse16 .cse17 .cse23 .cse24 .cse32 .cse18 .cse30) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse29 .cse16 .cse17 .cse24 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse21 .cse11 .cse22 .cse13 .cse14 .cse15 .cse29 .cse16 .cse17 .cse23 .cse24 .cse32 .cse18 .cse30) (and .cse1 .cse2 .cse3 .cse4 .cse33 .cse6 .cse7 .cse26 .cse9 (<= 2 ~m_st~0) .cse11 .cse31 .cse12 .cse34 .cse22 .cse13 .cse14 .cse15 .cse16 .cse17 .cse23 .cse32 .cse18 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse33 .cse6 .cse7 .cse9 .cse11 .cse31 .cse34 .cse22 .cse13 .cse14 .cse15 .cse28 .cse29 .cse16 .cse17 .cse23 .cse24 .cse32 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse33 .cse6 .cse7 .cse26 .cse27 .cse9 .cse11 .cse31 .cse12 .cse22 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse23 .cse32 .cse18 .cse25)))) [2023-12-02 13:08:02,817 INFO L899 garLoopResultBuilder]: For program point L762-1(lines 757 809) no Hoare annotation was computed. [2023-12-02 13:08:02,817 INFO L899 garLoopResultBuilder]: For program point do_write_p_returnLabel#1(lines 132 171) no Hoare annotation was computed. [2023-12-02 13:08:02,818 INFO L895 garLoopResultBuilder]: At program point L400(line 400) the Hoare annotation is: (let ((.cse0 (not (= ~p_dw_st~0 0))) (.cse4 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse1 (not (= ~q_read_ev~0 1))) (.cse2 (= ~t1_pc~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_st~0 0)) (.cse20 (not (= ~c_dr_st~0 0))) (.cse6 (= 1 ~c_dr_i~0)) (.cse8 (not (= ~q_read_ev~0 0))) (.cse9 (= ~c_dr_pc~0 1)) (.cse10 (= ~t1_st~0 0)) (.cse11 (= ~p_dw_pc~0 1)) (.cse12 (= ~E_2~0 2)) (.cse7 (= ~q_free~0 0)) (.cse13 (= ~m_pc~0 0)) (.cse14 (= ~p_dw_i~0 1)) (.cse15 (= 0 ~t2_pc~0)) (.cse16 (= ~E_M~0 2)) (.cse17 (= 0 ~t2_st~0)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~q_write_ev~0 2) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse1 (= ~c_num_read~0 ~p_num_write~0) .cse2 .cse3 (not (= ~q_write_ev~0 0)) .cse5 .cse20 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 (or (not (= ~q_req_up~0 1)) (not .cse7)) .cse13 .cse14 .cse15 (not (= ~q_write_ev~0 1)) .cse16 .cse17 .cse18 .cse19))) [2023-12-02 13:08:02,818 INFO L899 garLoopResultBuilder]: For program point L400-1(line 400) no Hoare annotation was computed. [2023-12-02 13:08:02,818 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 144) no Hoare annotation was computed. [2023-12-02 13:08:02,818 INFO L899 garLoopResultBuilder]: For program point L1061(lines 1061 1065) no Hoare annotation was computed. [2023-12-02 13:08:02,818 INFO L895 garLoopResultBuilder]: At program point L1029-1(lines 1029 1066) the Hoare annotation is: (let ((.cse20 (= 2 ~t2_st~0)) (.cse21 (= 2 ~t1_st~0)) (.cse12 (= ~t2_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse8 (not (= ~m_pc~0 1))) (.cse10 (not (= ~E_2~0 1))) (.cse19 (not (= ~E_M~0 1))) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~c_dr_st~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (= ~q_free~0 0)) (.cse11 (= ~q_req_up~0 0)) (.cse5 (= ~m_st~0 2)) (.cse25 (= ~m_st~0 0)) (.cse22 (= ~E_2~0 2)) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~t2_i~0 1)) (.cse15 (= ~c_dr_pc~0 0)) (.cse23 (= ~m_pc~0 0)) (.cse26 (= 0 ~t2_pc~0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (not (= ~q_write_ev~0 1))) (.cse24 (= ~E_M~0 2)) (.cse27 (= 0 ~t2_st~0)) (.cse18 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse20 .cse9 .cse21 .cse11 .cse12 .cse22 .cse13 .cse14 .cse15 .cse23 .cse16 .cse17 .cse24 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse20 .cse25 .cse9 .cse21 .cse11 .cse12 .cse22 (= ~token~0 (+ 2 ~local~0)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse24 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse9 .cse21 .cse11 .cse12 .cse22 .cse13 .cse14 .cse15 .cse16 .cse17 .cse24 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse26 .cse16 .cse17 .cse27 .cse18 .cse19) (and .cse1 .cse2 .cse3 .cse4 (= ~t1_pc~0 0) .cse6 .cse7 .cse9 .cse11 (= ~t1_st~0 0) (or .cse5 .cse25) .cse22 .cse13 .cse14 .cse15 .cse23 .cse26 .cse16 .cse17 .cse24 .cse27 (= ~token~0 ~local~0) .cse18))) [2023-12-02 13:08:02,818 INFO L899 garLoopResultBuilder]: For program point L798(lines 798 805) no Hoare annotation was computed. [2023-12-02 13:08:02,819 INFO L899 garLoopResultBuilder]: For program point L798-2(lines 798 805) no Hoare annotation was computed. [2023-12-02 13:08:02,819 INFO L895 garLoopResultBuilder]: At program point L435(line 435) the Hoare annotation is: (let ((.cse0 (not (= ~q_read_ev~0 1))) (.cse1 (= ~t1_pc~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_st~0 0)) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= 1 ~c_dr_i~0)) (.cse7 (not (= ~q_read_ev~0 0))) (.cse8 (= ~c_dr_pc~0 1)) (.cse9 (= ~t1_st~0 0)) (.cse10 (= ~p_dw_pc~0 1)) (.cse11 (= ~E_2~0 2)) (.cse6 (= ~q_free~0 0)) (.cse12 (= ~m_pc~0 0)) (.cse13 (= ~p_dw_i~0 1)) (.cse14 (= 0 ~t2_pc~0)) (.cse15 (= ~E_M~0 2)) (.cse16 (= 0 ~t2_st~0)) (.cse17 (= ~token~0 ~local~0)) (.cse18 (= ~E_1~0 2))) (or (and (not (= ~p_dw_st~0 0)) .cse0 .cse1 .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 (= ~c_num_read~0 ~p_num_write~0) .cse1 .cse2 (not (= ~q_write_ev~0 0)) .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 (or (not (= ~q_req_up~0 1)) (not .cse6)) .cse12 .cse13 .cse14 (not (= ~q_write_ev~0 1)) .cse15 .cse16 .cse17 .cse18))) [2023-12-02 13:08:02,819 INFO L899 garLoopResultBuilder]: For program point L435-1(line 435) no Hoare annotation was computed. [2023-12-02 13:08:02,819 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 143) no Hoare annotation was computed. [2023-12-02 13:08:02,819 INFO L899 garLoopResultBuilder]: For program point L767-1(lines 757 809) no Hoare annotation was computed. [2023-12-02 13:08:02,820 INFO L899 garLoopResultBuilder]: For program point start_simulation2_returnLabel#1(lines 1014 1072) no Hoare annotation was computed. [2023-12-02 13:08:02,820 INFO L899 garLoopResultBuilder]: For program point L206(lines 206 218) no Hoare annotation was computed. [2023-12-02 13:08:02,820 INFO L899 garLoopResultBuilder]: For program point master_returnLabel#1(lines 522 565) no Hoare annotation was computed. [2023-12-02 13:08:02,820 INFO L899 garLoopResultBuilder]: For program point L570(lines 570 578) no Hoare annotation was computed. [2023-12-02 13:08:02,821 INFO L895 garLoopResultBuilder]: At program point L372(lines 347 387) the Hoare annotation is: (let ((.cse36 (= ~q_free~0 0)) (.cse37 (= ~c_dr_st~0 0)) (.cse15 (= ~p_dw_st~0 0))) (let ((.cse4 (= ~c_dr_st~0 2)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse8 (= ~q_free~0 1)) (.cse10 (= ~q_req_up~0 0)) (.cse34 (not .cse15)) (.cse35 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse24 (not (= ~q_read_ev~0 1))) (.cse25 (= ~c_num_read~0 ~p_num_write~0)) (.cse29 (not (= ~q_write_ev~0 0))) (.cse30 (not .cse37)) (.cse26 (not (= ~q_read_ev~0 0))) (.cse11 (= ~c_dr_pc~0 1)) (.cse33 (not .cse36)) (.cse31 (not (= ~q_write_ev~0 1))) (.cse32 (= ~q_req_up~0 1)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (not (= |ULTIMATE.start_eval1_~tmp___1~0#1| 0))) (.cse5 (= ~t1_pc~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~m_st~0 0)) (.cse9 (= 1 ~c_dr_i~0)) (.cse12 (= ~t1_st~0 0)) (.cse28 (= ~p_dw_pc~0 1)) (.cse13 (= ~q_write_ev~0 2)) (.cse14 (= ~E_2~0 2)) (.cse16 (= ~q_read_ev~0 2)) (.cse38 (= ~c_dr_pc~0 0)) (.cse17 (= ~m_pc~0 0)) (.cse18 (= ~p_dw_i~0 1)) (.cse19 (= 0 ~t2_pc~0)) (.cse20 (= ~E_M~0 2)) (.cse21 (= 0 ~t2_st~0)) (.cse22 (= ~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 .cse19 (= ~c_last_read~0 ~p_last_write~0) .cse20 .cse21 .cse22 .cse23) (and .cse24 .cse25 .cse5 .cse7 .cse26 .cse14 (let ((.cse27 (or .cse3 (and .cse32 .cse33 .cse13)))) (or (and .cse4 .cse6 .cse9 .cse11 .cse27 .cse12 .cse28 .cse15 .cse18 .cse19) (and .cse6 .cse29 .cse30 .cse9 .cse11 .cse27 .cse12 .cse28 .cse15 .cse18 .cse19 .cse31))) .cse17 .cse20 .cse21 .cse22 .cse23) (and .cse34 .cse24 .cse5 .cse6 .cse35 .cse7 .cse9 .cse36 .cse26 .cse11 .cse12 .cse28 .cse13 .cse14 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (let ((.cse39 (select |#memory_int| 1))) (and .cse0 .cse37 .cse1 (= (select |#length| 3) 12) (<= 1 |#StackHeapBarrier|) .cse2 (= ~q_buf_0~0 0) .cse5 (= ~p_last_write~0 0) (= ~T1_E~0 2) .cse7 .cse8 (= ~c_last_read~0 0) (= ~T2_E~0 2) .cse9 (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) .cse10 (= ~t2_i~0 0) .cse12 (= ~m_i~0 0) .cse13 .cse14 .cse15 (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= ~token~0 0) .cse16 .cse38 .cse17 .cse18 (= (select |#valid| 0) 0) .cse19 (= (select |#valid| 2) 1) .cse20 (= ~a_t~0 0) (= |ULTIMATE.start_start_simulation1_~kernel_st~0#1| 1) (= (select .cse39 0) 48) .cse21 .cse22 (= (select .cse39 1) 0) .cse23 (= ~M_E~0 2) (= ~t1_i~0 0))) (and .cse34 .cse24 .cse5 .cse6 .cse35 .cse7 .cse30 .cse9 .cse36 .cse26 .cse11 .cse12 .cse28 .cse14 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse24 .cse25 .cse5 .cse6 .cse29 .cse7 .cse30 .cse9 .cse26 .cse11 .cse12 .cse28 .cse14 (or (not .cse32) .cse33) .cse17 .cse18 .cse19 .cse31 .cse20 .cse21 .cse22 .cse23) (and .cse37 .cse32 .cse2 .cse3 .cse5 .cse6 .cse7 .cse9 .cse36 .cse12 .cse28 .cse13 .cse14 .cse16 .cse38 (= 2 ~p_dw_st~0) .cse17 .cse18 (= ~p_num_write~0 1) .cse19 .cse20 .cse21 .cse22 .cse23)))) [2023-12-02 13:08:02,821 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 213) no Hoare annotation was computed. [2023-12-02 13:08:02,821 INFO L895 garLoopResultBuilder]: At program point L439(line 439) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~m_st~0 0)) (.cse3 (not (= ~c_dr_st~0 0))) (.cse4 (= 1 ~c_dr_i~0)) (.cse9 (= ~q_free~0 0)) (.cse5 (= ~c_dr_pc~0 1)) (.cse6 (= ~t1_st~0 0)) (.cse7 (= ~p_dw_pc~0 1)) (.cse8 (= ~E_2~0 2)) (.cse10 (= ~m_pc~0 0)) (.cse11 (= ~p_dw_i~0 1)) (.cse12 (= 0 ~t2_pc~0)) (.cse13 (= ~E_M~0 2)) (.cse14 (= 0 ~t2_st~0)) (.cse15 (= ~token~0 ~local~0)) (.cse16 (= ~E_1~0 2))) (or (and (= ~c_num_read~0 ~p_num_write~0) .cse0 .cse1 (not (= ~q_write_ev~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (not (= ~q_req_up~0 1)) (not .cse9)) .cse10 .cse11 .cse12 (not (= ~q_write_ev~0 1)) .cse13 .cse14 .cse15 .cse16) (and (not (= ~p_dw_st~0 0)) (not (= ~q_read_ev~0 1)) .cse0 .cse1 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse2 .cse3 .cse4 .cse9 (not (= ~q_read_ev~0 0)) .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2023-12-02 13:08:02,821 INFO L895 garLoopResultBuilder]: At program point L439-1(line 439) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~m_st~0 0)) (.cse3 (not (= ~c_dr_st~0 0))) (.cse4 (= 1 ~c_dr_i~0)) (.cse10 (= ~q_free~0 0)) (.cse5 (not (= ~q_read_ev~0 0))) (.cse6 (= ~c_dr_pc~0 1)) (.cse7 (= ~t1_st~0 0)) (.cse8 (= ~p_dw_pc~0 1)) (.cse9 (= ~E_2~0 2)) (.cse11 (= ~m_pc~0 0)) (.cse12 (= ~p_dw_i~0 1)) (.cse13 (= 0 ~t2_pc~0)) (.cse14 (= ~E_M~0 2)) (.cse15 (= 0 ~t2_st~0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (= ~E_1~0 2))) (or (and (= ~c_num_read~0 ~p_num_write~0) .cse0 .cse1 (not (= ~q_write_ev~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (or (not (= ~q_req_up~0 1)) (not .cse10)) .cse11 .cse12 .cse13 (not (= ~q_write_ev~0 1)) .cse14 .cse15 .cse16 .cse17) (and (not (= ~p_dw_st~0 0)) (not (= ~q_read_ev~0 1)) .cse0 .cse1 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse2 .cse3 .cse4 .cse10 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2023-12-02 13:08:02,822 INFO L899 garLoopResultBuilder]: For program point start_simulation1_returnLabel#1(lines 413 455) no Hoare annotation was computed. [2023-12-02 13:08:02,822 INFO L895 garLoopResultBuilder]: At program point L1001(line 1001) the Hoare annotation is: (let ((.cse20 (= 2 ~t2_st~0)) (.cse21 (= 2 ~t1_st~0)) (.cse12 (= ~t2_pc~0 1)) (.cse22 (= ~E_2~0 2)) (.cse23 (= ~E_M~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~c_dr_st~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~m_st~0 2)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse10 (not (= ~E_2~0 1))) (.cse11 (= ~q_req_up~0 0)) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~t2_i~0 1)) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (not (= ~q_write_ev~0 1))) (.cse18 (= ~E_1~0 2)) (.cse19 (not (= ~E_M~0 1)))) (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 .cse6 .cse7 .cse20 .cse9 .cse21 .cse11 .cse12 .cse22 .cse13 .cse14 .cse15 (= ~m_pc~0 0) .cse16 .cse17 .cse23 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse20 (= ~m_st~0 0) .cse9 .cse21 .cse11 .cse12 .cse22 (= ~token~0 (+ 2 ~local~0)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse23 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse9 .cse21 .cse11 .cse12 .cse22 .cse13 .cse14 .cse15 .cse16 .cse17 .cse23 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 (= 0 ~t2_pc~0) .cse16 .cse17 (= 0 ~t2_st~0) .cse18 .cse19))) [2023-12-02 13:08:02,822 INFO L899 garLoopResultBuilder]: For program point L1001-1(line 1001) no Hoare annotation was computed. [2023-12-02 13:08:02,822 INFO L899 garLoopResultBuilder]: For program point L770(lines 770 777) no Hoare annotation was computed. [2023-12-02 13:08:02,822 INFO L899 garLoopResultBuilder]: For program point L770-2(lines 770 777) no Hoare annotation was computed. [2023-12-02 13:08:02,822 INFO L895 garLoopResultBuilder]: At program point L440(line 440) the Hoare annotation is: (let ((.cse20 (= ~q_write_ev~0 1)) (.cse7 (= ~q_free~0 0)) (.cse24 (= ~p_dw_st~0 0))) (let ((.cse0 (not .cse24)) (.cse4 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse1 (not (= ~q_read_ev~0 1))) (.cse21 (= ~c_num_read~0 ~p_num_write~0)) (.cse2 (= ~t1_pc~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse22 (not (= ~q_write_ev~0 0))) (.cse5 (= ~m_st~0 0)) (.cse23 (not (= ~c_dr_st~0 0))) (.cse6 (= 1 ~c_dr_i~0)) (.cse8 (not (= ~q_read_ev~0 0))) (.cse9 (= ~c_dr_pc~0 1)) (.cse10 (= ~t1_st~0 0)) (.cse11 (= ~p_dw_pc~0 1)) (.cse12 (= ~E_2~0 2)) (.cse25 (or (not (= ~q_req_up~0 1)) (not .cse7))) (.cse13 (= ~m_pc~0 0)) (.cse14 (= ~p_dw_i~0 1)) (.cse15 (= 0 ~t2_pc~0)) (.cse26 (not .cse20)) (.cse16 (= ~E_M~0 2)) (.cse17 (= 0 ~t2_st~0)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse21 .cse2 .cse3 .cse22 .cse5 .cse23 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse24 .cse25 .cse13 .cse14 .cse15 .cse26 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse21 .cse2 .cse3 .cse22 .cse5 .cse23 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse26 .cse16 .cse17 .cse18 .cse19)))) [2023-12-02 13:08:02,822 INFO L899 garLoopResultBuilder]: For program point eval2_returnLabel#1(lines 751 815) no Hoare annotation was computed. [2023-12-02 13:08:02,823 INFO L899 garLoopResultBuilder]: For program point L606(lines 606 614) no Hoare annotation was computed. [2023-12-02 13:08:02,823 INFO L899 garLoopResultBuilder]: For program point L573(lines 573 577) no Hoare annotation was computed. [2023-12-02 13:08:02,823 INFO L899 garLoopResultBuilder]: For program point L441(line 441) no Hoare annotation was computed. [2023-12-02 13:08:02,823 INFO L899 garLoopResultBuilder]: For program point L177(lines 177 185) no Hoare annotation was computed. [2023-12-02 13:08:02,823 INFO L899 garLoopResultBuilder]: For program point do_read_c_returnLabel#1(lines 173 225) no Hoare annotation was computed. [2023-12-02 13:08:02,823 INFO L899 garLoopResultBuilder]: For program point L376(lines 376 383) no Hoare annotation was computed. [2023-12-02 13:08:02,823 INFO L895 garLoopResultBuilder]: At program point L211(line 211) the Hoare annotation is: false [2023-12-02 13:08:02,824 INFO L895 garLoopResultBuilder]: At program point L1037(line 1037) the Hoare annotation is: (let ((.cse7 (= 2 ~t2_st~0)) (.cse9 (= 2 ~t1_st~0)) (.cse12 (= ~E_2~0 2)) (.cse18 (= ~E_M~0 2)) (.cse3 (= ~p_num_write~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~c_dr_st~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse20 (= ~m_st~0 2)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse21 (not (= ~m_pc~0 1))) (.cse8 (= ~q_free~0 0)) (.cse22 (not (= ~E_2~0 1))) (.cse10 (= ~q_req_up~0 0)) (.cse11 (= ~t2_pc~0 1)) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~t2_i~0 1)) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (not (= ~q_write_ev~0 1))) (.cse19 (= ~E_1~0 2)) (.cse23 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ~m_pc~0 0) .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~m_st~0 0) .cse8 .cse9 .cse10 .cse11 .cse12 (= ~token~0 (+ 2 ~local~0)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse6 .cse21 .cse8 .cse22 .cse10 .cse13 .cse14 .cse15 (= 0 ~t2_pc~0) .cse16 .cse17 (= 0 ~t2_st~0) .cse19 .cse23) (and .cse0 .cse1 .cse2 .cse4 (= ~c_num_read~0 ~p_num_write~0) .cse20 .cse5 .cse6 .cse21 .cse8 .cse22 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse23))) [2023-12-02 13:08:02,824 INFO L899 garLoopResultBuilder]: For program point L1037-1(line 1037) no Hoare annotation was computed. [2023-12-02 13:08:02,824 INFO L899 garLoopResultBuilder]: For program point eval1_returnLabel#1(lines 340 393) no Hoare annotation was computed. [2023-12-02 13:08:02,824 INFO L899 garLoopResultBuilder]: For program point L609(lines 609 613) no Hoare annotation was computed. [2023-12-02 13:08:02,824 INFO L895 garLoopResultBuilder]: At program point L543(line 543) the Hoare annotation is: (let ((.cse4 (= ~t1_pc~0 0)) (.cse11 (= ~t1_st~0 0)) (.cse7 (= 2 ~t2_st~0)) (.cse12 (= ~t2_pc~0 1)) (.cse26 (= ~t1_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= ~E_1~0 1)) (.cse9 (= ~q_free~0 0)) (.cse27 (= 2 ~t1_st~0)) (.cse10 (= ~q_req_up~0 0)) (.cse13 (= ~E_2~0 2)) (.cse14 (= ~p_dw_st~0 0)) (.cse15 (not (= ~m_st~0 0))) (.cse16 (= ~t2_i~0 1)) (.cse17 (= ~c_dr_pc~0 0)) (.cse18 (= ~m_pc~0 0)) (.cse24 (= 0 ~t2_pc~0)) (.cse19 (= ~c_last_read~0 ~p_last_write~0)) (.cse20 (not (= ~q_write_ev~0 1))) (.cse21 (= ~E_M~0 2)) (.cse25 (= 0 ~t2_st~0)) (.cse22 (= ~token~0 ~local~0)) (.cse23 (= |ULTIMATE.start_eval2_~tmp~5#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse24 .cse19 .cse20 .cse21 .cse25 .cse22 .cse23) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse27 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse27 .cse10 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse24 .cse19 .cse20 .cse21 .cse25 .cse22 .cse23))) [2023-12-02 13:08:02,824 INFO L899 garLoopResultBuilder]: For program point L543-1(line 543) no Hoare annotation was computed. [2023-12-02 13:08:02,825 INFO L899 garLoopResultBuilder]: For program point L444(lines 444 448) no Hoare annotation was computed. [2023-12-02 13:08:02,825 INFO L899 garLoopResultBuilder]: For program point L180(lines 180 184) no Hoare annotation was computed. [2023-12-02 13:08:02,825 INFO L895 garLoopResultBuilder]: At program point L147-1(lines 147 165) the Hoare annotation is: (let ((.cse10 (= |ULTIMATE.start_eval1_~tmp___1~0#1| 1)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse4 (= ~c_dr_st~0 2)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse29 (= ~q_free~0 0)) (.cse12 (= ~c_dr_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse24 (= ~c_dr_st~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse25 (<= 1 |#StackHeapBarrier|)) (.cse3 (= ~c_num_read~0 0)) (.cse5 (= ~t1_pc~0 0)) (.cse26 (= ~T1_E~0 2)) (.cse7 (= ~m_st~0 0)) (.cse8 (= ~q_free~0 1)) (.cse27 (= ~c_last_read~0 0)) (.cse28 (= ~T2_E~0 2)) (.cse9 (= 1 ~c_dr_i~0)) (.cse11 (= ~q_req_up~0 0)) (.cse30 (= ~t2_i~0 0)) (.cse13 (= ~t1_st~0 0)) (.cse31 (<= |ULTIMATE.start_eval1_~tmp~2#1| 2147483647)) (.cse32 (= ~m_i~0 0)) (.cse14 (= ~q_write_ev~0 2)) (.cse33 (= ~p_dw_st~0 1)) (.cse34 (<= 0 (+ |ULTIMATE.start_eval1_~tmp~2#1| 2147483648))) (.cse15 (= ~E_2~0 2)) (.cse35 (= ~token~0 0)) (.cse36 (not (= |ULTIMATE.start_eval1_~tmp~2#1| 0))) (.cse16 (= ~q_read_ev~0 2)) (.cse37 (= ~c_dr_pc~0 0)) (.cse17 (= ~m_pc~0 0)) (.cse18 (= ~p_dw_i~0 1)) (.cse19 (= 0 ~t2_pc~0)) (.cse20 (= ~E_M~0 2)) (.cse38 (= ~a_t~0 0)) (.cse39 (= |ULTIMATE.start_start_simulation1_~kernel_st~0#1| 1)) (.cse21 (= 0 ~t2_st~0)) (.cse22 (= ~token~0 ~local~0)) (.cse23 (= ~E_1~0 2)) (.cse40 (= ~M_E~0 2)) (.cse41 (= ~t1_i~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (= ~c_last_read~0 ~p_last_write~0) .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse24 (= ~q_req_up~0 1) .cse25 .cse3 .cse5 .cse6 .cse26 .cse7 .cse27 .cse28 .cse9 .cse29 .cse10 .cse30 .cse13 .cse31 .cse32 (<= 0 (+ ~p_last_write~0 2147483648)) .cse14 .cse33 .cse34 .cse15 (= ~local~0 0) .cse35 .cse36 .cse16 .cse37 .cse17 .cse18 (= ~p_num_write~0 1) .cse19 (<= ~p_last_write~0 2147483647) .cse20 .cse38 .cse39 .cse21 .cse23 .cse40 .cse41) (and .cse2 .cse7 (let ((.cse47 (= ~p_dw_pc~0 1))) (let ((.cse42 (not (= ~q_read_ev~0 1))) (.cse43 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse44 (not (= ~q_read_ev~0 0))) (.cse45 (or (and .cse0 .cse14) .cse47)) (.cse46 (or (and .cse12 .cse47) (and .cse0 .cse12)))) (or (and .cse42 .cse5 .cse6 .cse43 (not (= ~q_write_ev~0 0)) (not .cse24) .cse9 .cse29 .cse44 .cse13 .cse15 .cse45 .cse46 .cse17 .cse18 .cse19 (not (= ~q_write_ev~0 1)) .cse20 .cse23) (and .cse42 .cse4 .cse5 .cse6 .cse43 .cse9 .cse29 .cse44 .cse13 .cse15 .cse45 .cse46 .cse17 .cse18 .cse19 .cse20 .cse23)))) .cse21 .cse22) (let ((.cse48 (select |#memory_int| 1))) (and .cse0 .cse24 .cse1 (= (select |#length| 3) 12) .cse25 .cse3 (= ~q_buf_0~0 0) (not (= |ULTIMATE.start_eval1_~tmp___1~0#1| 0)) .cse5 (= ~p_last_write~0 0) .cse26 .cse7 .cse8 .cse27 .cse28 .cse9 (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) .cse11 .cse30 .cse13 .cse31 .cse32 .cse14 .cse33 .cse34 (<= 0 |ULTIMATE.start_eval1_~tmp___1~0#1|) .cse15 (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) .cse35 .cse36 .cse16 .cse37 (<= |ULTIMATE.start_eval1_~tmp___1~0#1| 1) .cse17 .cse18 (= (select |#valid| 0) 0) .cse19 (= (select |#valid| 2) 1) .cse20 .cse38 .cse39 (= (select .cse48 0) 48) .cse21 .cse22 (= (select .cse48 1) 0) .cse23 .cse40 .cse41)))) [2023-12-02 13:08:02,826 INFO L899 garLoopResultBuilder]: For program point L148(lines 147 165) no Hoare annotation was computed. [2023-12-02 13:08:02,826 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 157) no Hoare annotation was computed. [2023-12-02 13:08:02,826 INFO L895 garLoopResultBuilder]: At program point L1041(line 1041) the Hoare annotation is: (let ((.cse7 (= 2 ~t2_st~0)) (.cse9 (= 2 ~t1_st~0)) (.cse12 (= ~E_2~0 2)) (.cse18 (= ~E_M~0 2)) (.cse3 (= ~p_num_write~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~c_dr_st~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse20 (= ~m_st~0 2)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse21 (not (= ~m_pc~0 1))) (.cse8 (= ~q_free~0 0)) (.cse22 (not (= ~E_2~0 1))) (.cse10 (= ~q_req_up~0 0)) (.cse11 (= ~t2_pc~0 1)) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~t2_i~0 1)) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (not (= ~q_write_ev~0 1))) (.cse19 (= ~E_1~0 2)) (.cse23 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ~m_pc~0 0) .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~m_st~0 0) .cse8 .cse9 .cse10 .cse11 .cse12 (= ~token~0 (+ 2 ~local~0)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse6 .cse21 .cse8 .cse22 .cse10 .cse13 .cse14 .cse15 (= 0 ~t2_pc~0) .cse16 .cse17 (= 0 ~t2_st~0) .cse19 .cse23) (and .cse0 .cse1 .cse2 .cse4 (= ~c_num_read~0 ~p_num_write~0) .cse20 .cse5 .cse6 .cse21 .cse8 .cse22 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse23))) [2023-12-02 13:08:02,826 INFO L895 garLoopResultBuilder]: At program point L1041-1(line 1041) the Hoare annotation is: (let ((.cse17 (= 2 ~t2_st~0)) (.cse18 (= 2 ~t1_st~0)) (.cse20 (= ~E_2~0 2)) (.cse21 (= ~E_M~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~c_dr_st~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~m_st~0 2)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~q_req_up~0 0)) (.cse19 (= ~t2_pc~0 1)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~t2_i~0 1)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (not (= ~q_write_ev~0 1))) (.cse16 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= 0 ~t2_pc~0) .cse14 .cse15 (= 0 ~t2_st~0) .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse9 .cse18 .cse10 .cse19 .cse20 .cse11 .cse12 .cse13 (= ~m_pc~0 0) .cse14 .cse15 .cse21 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 (= ~m_st~0 0) .cse9 .cse18 .cse10 .cse19 .cse20 (= ~token~0 (+ 2 ~local~0)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse21 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse9 .cse18 .cse10 .cse19 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse19 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2023-12-02 13:08:02,827 INFO L895 garLoopResultBuilder]: At program point L348(line 348) the Hoare annotation is: (let ((.cse36 (= ~q_free~0 0)) (.cse37 (= ~c_dr_st~0 0)) (.cse15 (= ~p_dw_st~0 0))) (let ((.cse4 (= ~c_dr_st~0 2)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse8 (= ~q_free~0 1)) (.cse10 (= ~q_req_up~0 0)) (.cse34 (not .cse15)) (.cse35 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse24 (not (= ~q_read_ev~0 1))) (.cse25 (= ~c_num_read~0 ~p_num_write~0)) (.cse29 (not (= ~q_write_ev~0 0))) (.cse30 (not .cse37)) (.cse26 (not (= ~q_read_ev~0 0))) (.cse11 (= ~c_dr_pc~0 1)) (.cse33 (not .cse36)) (.cse31 (not (= ~q_write_ev~0 1))) (.cse32 (= ~q_req_up~0 1)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (not (= |ULTIMATE.start_eval1_~tmp___1~0#1| 0))) (.cse5 (= ~t1_pc~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~m_st~0 0)) (.cse9 (= 1 ~c_dr_i~0)) (.cse12 (= ~t1_st~0 0)) (.cse28 (= ~p_dw_pc~0 1)) (.cse13 (= ~q_write_ev~0 2)) (.cse14 (= ~E_2~0 2)) (.cse16 (= ~q_read_ev~0 2)) (.cse38 (= ~c_dr_pc~0 0)) (.cse17 (= ~m_pc~0 0)) (.cse18 (= ~p_dw_i~0 1)) (.cse19 (= 0 ~t2_pc~0)) (.cse20 (= ~E_M~0 2)) (.cse21 (= 0 ~t2_st~0)) (.cse22 (= ~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 .cse19 (= ~c_last_read~0 ~p_last_write~0) .cse20 .cse21 .cse22 .cse23) (and .cse24 .cse25 .cse5 .cse7 .cse26 .cse14 (let ((.cse27 (or .cse3 (and .cse32 .cse33 .cse13)))) (or (and .cse4 .cse6 .cse9 .cse11 .cse27 .cse12 .cse28 .cse15 .cse18 .cse19) (and .cse6 .cse29 .cse30 .cse9 .cse11 .cse27 .cse12 .cse28 .cse15 .cse18 .cse19 .cse31))) .cse17 .cse20 .cse21 .cse22 .cse23) (and .cse34 .cse24 .cse5 .cse6 .cse35 .cse7 .cse9 .cse36 .cse26 .cse11 .cse12 .cse28 .cse13 .cse14 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (let ((.cse39 (select |#memory_int| 1))) (and .cse0 .cse37 .cse1 (= (select |#length| 3) 12) (<= 1 |#StackHeapBarrier|) .cse2 (= ~q_buf_0~0 0) .cse5 (= ~p_last_write~0 0) (= ~T1_E~0 2) .cse7 .cse8 (= ~c_last_read~0 0) (= ~T2_E~0 2) .cse9 (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) .cse10 (= ~t2_i~0 0) .cse12 (= ~m_i~0 0) .cse13 .cse14 .cse15 (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= ~token~0 0) .cse16 .cse38 .cse17 .cse18 (= (select |#valid| 0) 0) .cse19 (= (select |#valid| 2) 1) .cse20 (= ~a_t~0 0) (= |ULTIMATE.start_start_simulation1_~kernel_st~0#1| 1) (= (select .cse39 0) 48) .cse21 .cse22 (= (select .cse39 1) 0) .cse23 (= ~M_E~0 2) (= ~t1_i~0 0))) (and .cse34 .cse24 .cse5 .cse6 .cse35 .cse7 .cse30 .cse9 .cse36 .cse26 .cse11 .cse12 .cse28 .cse14 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse24 .cse25 .cse5 .cse6 .cse29 .cse7 .cse30 .cse9 .cse26 .cse11 .cse12 .cse28 .cse14 (or (not .cse32) .cse33) .cse17 .cse18 .cse19 .cse31 .cse20 .cse21 .cse22 .cse23) (and .cse37 .cse32 .cse2 .cse3 .cse5 .cse6 .cse7 .cse9 .cse36 .cse12 .cse28 .cse13 .cse14 .cse16 .cse38 (= 2 ~p_dw_st~0) .cse17 .cse18 (= ~p_num_write~0 1) .cse19 .cse20 .cse21 .cse22 .cse23)))) [2023-12-02 13:08:02,827 INFO L895 garLoopResultBuilder]: At program point L216(line 216) the Hoare annotation is: false [2023-12-02 13:08:02,828 INFO L895 garLoopResultBuilder]: At program point L216-1(lines 188 219) the Hoare annotation is: (let ((.cse1 (= ~c_num_read~0 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse12 (= ~q_read_ev~0 2)) (.cse5 (= ~m_st~0 0)) (.cse14 (= 2 ~p_dw_st~0)) (.cse2 (not (= |ULTIMATE.start_eval1_~tmp___1~0#1| 0))) (.cse0 (= ~q_req_up~0 1)) (.cse10 (= ~q_write_ev~0 2)) (.cse23 (= ~p_dw_st~0 0)) (.cse3 (= ~t1_pc~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse22 (= ~q_free~0 1)) (.cse6 (not (= ~c_dr_st~0 0))) (.cse7 (= 1 ~c_dr_i~0)) (.cse8 (= ~t1_st~0 0)) (.cse9 (= ~p_dw_pc~0 1)) (.cse11 (= ~E_2~0 2)) (.cse15 (= ~m_pc~0 0)) (.cse16 (= ~p_dw_i~0 1)) (.cse17 (= 0 ~t2_pc~0)) (.cse24 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ~E_M~0 2)) (.cse21 (= ~E_1~0 2)) (.cse19 (= 0 ~t2_st~0)) (.cse20 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~q_free~0 0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= ~p_num_write~0 1) .cse17 .cse18 .cse19 .cse20 .cse21) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse22 .cse6 .cse7 (= ~q_req_up~0 0) (or (= ~c_dr_pc~0 1) .cse13) .cse8 .cse10 .cse11 .cse23 .cse12 .cse15 .cse16 .cse17 .cse24 .cse18 .cse19 .cse20 .cse21) (and .cse5 (let ((.cse25 (not (= ~q_read_ev~0 1))) (.cse26 (= ~c_num_read~0 ~p_num_write~0)) (.cse27 (not (= ~q_write_ev~0 0))) (.cse28 (not (= ~q_read_ev~0 0))) (.cse29 (not (= ~q_write_ev~0 1)))) (or (and .cse25 .cse26 .cse3 .cse4 .cse27 .cse22 .cse6 .cse7 .cse28 .cse8 .cse9 .cse11 .cse14 .cse15 .cse16 .cse17 .cse24 .cse29 .cse18 .cse21) (and (or .cse2 (and .cse0 .cse10)) (not .cse23) .cse25 .cse26 .cse3 .cse4 .cse27 .cse22 .cse6 .cse7 .cse28 .cse8 .cse9 .cse11 .cse15 .cse16 .cse17 .cse24 .cse29 .cse18 .cse21))) .cse19 .cse20))) [2023-12-02 13:08:02,828 INFO L895 garLoopResultBuilder]: At program point L1042(line 1042) the Hoare annotation is: (let ((.cse17 (= 2 ~t2_st~0)) (.cse18 (= 2 ~t1_st~0)) (.cse20 (= ~E_2~0 2)) (.cse21 (= ~E_M~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~c_dr_st~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~m_st~0 2)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~q_req_up~0 0)) (.cse19 (= ~t2_pc~0 1)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~t2_i~0 1)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (not (= ~q_write_ev~0 1))) (.cse16 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= 0 ~t2_pc~0) .cse14 .cse15 (= 0 ~t2_st~0) .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse9 .cse18 .cse10 .cse19 .cse20 .cse11 .cse12 .cse13 (= ~m_pc~0 0) .cse14 .cse15 .cse21 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 (= ~m_st~0 0) .cse9 .cse18 .cse10 .cse19 .cse20 (= ~token~0 (+ 2 ~local~0)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse21 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse9 .cse18 .cse10 .cse19 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse19 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2023-12-02 13:08:02,828 INFO L895 garLoopResultBuilder]: At program point L1043(line 1043) the Hoare annotation is: (let ((.cse20 (= 2 ~t2_st~0)) (.cse21 (= 2 ~t1_st~0)) (.cse12 (= ~t2_pc~0 1)) (.cse22 (= ~E_2~0 2)) (.cse23 (= ~E_M~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~c_dr_st~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~m_st~0 2)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse10 (not (= ~E_2~0 1))) (.cse11 (= ~q_req_up~0 0)) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~t2_i~0 1)) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (not (= ~q_write_ev~0 1))) (.cse18 (= ~E_1~0 2)) (.cse19 (not (= ~E_M~0 1)))) (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 .cse6 .cse7 .cse20 .cse9 .cse21 .cse11 .cse12 .cse22 .cse13 .cse14 .cse15 (= ~m_pc~0 0) .cse16 .cse17 .cse23 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse20 (= ~m_st~0 0) .cse9 .cse21 .cse11 .cse12 .cse22 (= ~token~0 (+ 2 ~local~0)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse23 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse9 .cse21 .cse11 .cse12 .cse22 .cse13 .cse14 .cse15 .cse16 .cse17 .cse23 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 (= 0 ~t2_pc~0) .cse16 .cse17 (= 0 ~t2_st~0) .cse18 .cse19))) [2023-12-02 13:08:02,829 INFO L895 garLoopResultBuilder]: At program point L581-1(lines 581 594) the Hoare annotation is: (let ((.cse22 (= (+ ~local~0 1) ~token~0)) (.cse7 (= ~m_st~0 0)) (.cse15 (= ~m_pc~0 0)) (.cse24 (= 0 ~t2_pc~0)) (.cse23 (= 0 ~t2_st~0)) (.cse26 (= |ULTIMATE.start_eval2_~tmp~5#1| 1)) (.cse6 (= 2 ~t2_st~0)) (.cse11 (= ~E_2~0 2)) (.cse18 (= ~E_M~0 2)) (.cse25 (= ~token~0 ~local~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse21 (= ~m_st~0 2)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse27 (not (= ~m_pc~0 1))) (.cse8 (= ~q_free~0 0)) (.cse28 (not (= ~E_2~0 1))) (.cse9 (= ~q_req_up~0 0)) (.cse10 (= ~t2_pc~0 1)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~t2_i~0 1)) (.cse14 (= ~c_dr_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (not (= ~q_write_ev~0 1))) (.cse19 (= ~E_1~0 2)) (.cse20 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))) (.cse29 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse4 .cse22 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse23 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse4 .cse5 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse24 .cse16 .cse17 .cse18 .cse23 .cse25 .cse19 .cse26) (and .cse0 .cse1 .cse3 (= ~c_num_read~0 ~p_num_write~0) .cse21 .cse4 .cse22 .cse5 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse24 .cse16 .cse17 .cse18 .cse23 .cse19 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse4 .cse5 .cse27 .cse8 .cse28 .cse9 .cse12 .cse13 .cse14 .cse24 .cse16 .cse17 .cse23 .cse19 .cse20 .cse29) (and .cse0 .cse1 .cse2 .cse3 (= ~t1_pc~0 0) .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse24 .cse16 .cse17 .cse18 .cse23 .cse25 .cse19 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse25 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse4 .cse5 .cse27 .cse8 .cse28 .cse9 .cse10 .cse12 .cse13 .cse14 .cse16 .cse17 .cse19 .cse20 .cse29))) [2023-12-02 13:08:02,829 INFO L899 garLoopResultBuilder]: For program point L350(line 350) no Hoare annotation was computed. [2023-12-02 13:08:02,829 INFO L899 garLoopResultBuilder]: For program point L781-1(lines 757 809) no Hoare annotation was computed. [2023-12-02 13:08:02,829 INFO L899 garLoopResultBuilder]: For program point L352(lines 352 356) no Hoare annotation was computed. [2023-12-02 13:08:02,829 INFO L899 garLoopResultBuilder]: For program point L352-1(lines 347 387) no Hoare annotation was computed. [2023-12-02 13:08:02,829 INFO L899 garLoopResultBuilder]: For program point L1046(line 1046) no Hoare annotation was computed. [2023-12-02 13:08:02,829 INFO L895 garLoopResultBuilder]: At program point L617-1(lines 617 630) the Hoare annotation is: (let ((.cse5 (= ~t1_pc~0 0)) (.cse27 (not (= ~m_pc~0 1))) (.cse28 (not (= ~E_2~0 1))) (.cse26 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))) (.cse29 (not (= ~E_M~0 1))) (.cse10 (= ~t1_st~0 0)) (.cse4 (= ~m_st~0 2)) (.cse24 (= ~t1_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse22 (= ~m_st~0 0)) (.cse8 (= ~q_free~0 0)) (.cse25 (= 2 ~t1_st~0)) (.cse9 (= ~q_req_up~0 0)) (.cse11 (= ~E_2~0 2)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~t2_i~0 1)) (.cse14 (= ~c_dr_pc~0 0)) (.cse23 (= ~m_pc~0 0)) (.cse15 (or (= |exists_runnable_thread2_#res| 1) (not (= 0 ~t2_st~0)))) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (not (= ~q_write_ev~0 1))) (.cse18 (= ~E_M~0 2)) (.cse19 (= ~token~0 ~local~0)) (.cse20 (= ~E_1~0 2)) (.cse21 (= |ULTIMATE.start_eval2_~tmp~5#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse22 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse23 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse24 .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse22 .cse8 .cse25 .cse9 .cse11 (= ~token~0 (+ 2 ~local~0)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse27 .cse8 .cse28 .cse9 .cse10 .cse12 .cse13 .cse14 .cse16 .cse17 .cse20 .cse21 .cse29) (and .cse24 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse27 .cse8 .cse28 .cse9 .cse12 .cse13 .cse14 .cse16 .cse17 .cse20 .cse26 .cse29) (and .cse24 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (= (+ ~local~0 1) ~token~0) .cse7 .cse8 .cse25 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21) (and .cse24 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse24 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse25 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse24 .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse22 .cse8 .cse25 .cse9 .cse11 .cse12 .cse13 .cse14 .cse23 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) [2023-12-02 13:08:02,830 INFO L895 garLoopResultBuilder]: At program point L551-1(lines 537 558) the Hoare annotation is: (let ((.cse21 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))) (.cse0 (= ~t1_pc~0 1)) (.cse9 (= 2 ~t1_st~0)) (.cse23 (= 0 ~t2_pc~0)) (.cse24 (= 0 ~t2_st~0)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~c_dr_st~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse27 (= ~t1_pc~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= 2 ~t2_st~0)) (.cse8 (= ~q_free~0 0)) (.cse10 (= ~q_req_up~0 0)) (.cse28 (= ~t1_st~0 0)) (.cse11 (= ~t2_pc~0 1)) (.cse12 (= ~E_2~0 2)) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (not (= ~m_st~0 0))) (.cse15 (= ~t2_i~0 1)) (.cse16 (= ~c_dr_pc~0 0)) (.cse22 (= ~m_pc~0 0)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (not (= ~q_write_ev~0 1))) (.cse19 (= ~E_M~0 2)) (.cse25 (= ~token~0 ~local~0)) (.cse20 (= ~E_1~0 2)) (.cse26 (= |ULTIMATE.start_eval2_~tmp~5#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~m_pc~0 1)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~token~0 (+ 2 ~local~0)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse22 .cse23 .cse17 .cse18 .cse19 .cse24 .cse25 .cse20 .cse26) (and .cse1 .cse2 .cse3 .cse4 .cse27 .cse5 .cse6 .cse8 .cse10 .cse28 .cse12 .cse13 .cse14 .cse15 .cse16 .cse22 .cse23 .cse17 .cse18 .cse19 .cse24 .cse25 .cse20 .cse26) (and .cse1 .cse2 .cse3 .cse4 .cse27 .cse5 .cse6 .cse7 .cse8 .cse10 .cse28 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse22 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26))) [2023-12-02 13:08:02,830 INFO L895 garLoopResultBuilder]: At program point L420(line 420) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= ~p_dw_pc~0 0) (= ~c_dr_st~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) (= ~T2_E~0 2) (= 1 ~c_dr_i~0) (= 2 (select |#length| 1)) (= |ULTIMATE.start_start_simulation1_~kernel_st~0#1| 0) (= (select |#valid| 3) 1) (= ~q_req_up~0 0) (= ~t2_i~0 0) (= ~t1_st~0 0) (= ~q_ev~0 0) (= ~m_i~0 0) (= ~q_write_ev~0 2) (= ~E_2~0 2) (= ~p_dw_st~0 0) (= (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) (= ~p_dw_i~0 1) (= (select |#valid| 0) 0) (= 0 ~t2_pc~0) (= (select |#valid| 2) 1) (= ~E_M~0 2) (= ~a_t~0 0) (= (select .cse0 0) 48) (= 0 ~t2_st~0) (= (select .cse0 1) 0) (= ~E_1~0 2) (= ~M_E~0 2) (= ~t1_i~0 0))) [2023-12-02 13:08:02,830 INFO L899 garLoopResultBuilder]: For program point L420-1(line 420) no Hoare annotation was computed. [2023-12-02 13:08:02,830 INFO L899 garLoopResultBuilder]: For program point L189(lines 188 219) no Hoare annotation was computed. [2023-12-02 13:08:02,830 INFO L899 garLoopResultBuilder]: For program point L1048(lines 1048 1057) no Hoare annotation was computed. [2023-12-02 13:08:02,830 INFO L899 garLoopResultBuilder]: For program point L1048-2(lines 1048 1057) no Hoare annotation was computed. [2023-12-02 13:08:02,830 INFO L899 garLoopResultBuilder]: For program point L784(lines 784 791) no Hoare annotation was computed. [2023-12-02 13:08:02,831 INFO L899 garLoopResultBuilder]: For program point L784-2(lines 784 791) no Hoare annotation was computed. [2023-12-02 13:08:02,831 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-02 13:08:02,831 INFO L899 garLoopResultBuilder]: For program point L190-1(lines 190 200) no Hoare annotation was computed. [2023-12-02 13:08:02,831 INFO L895 garLoopResultBuilder]: At program point L422(line 422) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= ~p_dw_pc~0 0) (= ~c_dr_st~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) (= ~T2_E~0 2) (= 1 ~c_dr_i~0) (= 2 (select |#length| 1)) (= |ULTIMATE.start_start_simulation1_~kernel_st~0#1| 0) (= (select |#valid| 3) 1) (= ~q_req_up~0 0) (= ~t2_i~0 0) (= ~t1_st~0 0) (= ~q_ev~0 0) (= ~m_i~0 0) (= ~q_write_ev~0 2) (= ~E_2~0 2) (= ~p_dw_st~0 0) (= (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) (= ~p_dw_i~0 1) (= (select |#valid| 0) 0) (= 0 ~t2_pc~0) (= (select |#valid| 2) 1) (= ~E_M~0 2) (= ~a_t~0 0) (= (select .cse0 0) 48) (= 0 ~t2_st~0) (= (select .cse0 1) 0) (= ~E_1~0 2) (= ~M_E~0 2) (= ~t1_i~0 0))) [2023-12-02 13:08:02,832 INFO L895 garLoopResultBuilder]: At program point L422-1(line 422) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= ~p_dw_pc~0 0) (= ~c_dr_st~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) (= ~T2_E~0 2) (= 1 ~c_dr_i~0) (= 2 (select |#length| 1)) (= |ULTIMATE.start_start_simulation1_~kernel_st~0#1| 0) (= (select |#valid| 3) 1) (= ~q_req_up~0 0) (= ~t2_i~0 0) (= ~t1_st~0 0) (= ~q_ev~0 0) (= ~m_i~0 0) (= ~q_write_ev~0 2) (= ~E_2~0 2) (= ~p_dw_st~0 0) (= (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) (= ~p_dw_i~0 1) (= (select |#valid| 0) 0) (= 0 ~t2_pc~0) (= (select |#valid| 2) 1) (= ~E_M~0 2) (= ~a_t~0 0) (= (select .cse0 0) 48) (= 0 ~t2_st~0) (= (select .cse0 1) 0) (= ~E_1~0 2) (= ~M_E~0 2) (= ~t1_i~0 0))) [2023-12-02 13:08:02,832 INFO L895 garLoopResultBuilder]: At program point L423(line 423) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= ~p_dw_pc~0 0) (= ~c_dr_st~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) (= ~T2_E~0 2) (= 1 ~c_dr_i~0) (= 2 (select |#length| 1)) (= |ULTIMATE.start_start_simulation1_~kernel_st~0#1| 0) (= (select |#valid| 3) 1) (= ~q_req_up~0 0) (= ~t2_i~0 0) (= ~t1_st~0 0) (= ~q_ev~0 0) (= ~m_i~0 0) (= ~q_write_ev~0 2) (= ~E_2~0 2) (= ~p_dw_st~0 0) (= (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) (= ~p_dw_i~0 1) (= (select |#valid| 0) 0) (= 0 ~t2_pc~0) (= (select |#valid| 2) 1) (= ~E_M~0 2) (= ~a_t~0 0) (= (select .cse0 0) 48) (= 0 ~t2_st~0) (= (select .cse0 1) 0) (= ~E_1~0 2) (= ~M_E~0 2) (= ~t1_i~0 0))) [2023-12-02 13:08:02,832 INFO L899 garLoopResultBuilder]: For program point L357(lines 347 387) no Hoare annotation was computed. [2023-12-02 13:08:02,832 INFO L899 garLoopResultBuilder]: For program point L1085(lines 1085 1091) no Hoare annotation was computed. [2023-12-02 13:08:02,832 INFO L895 garLoopResultBuilder]: At program point L1052(line 1052) the Hoare annotation is: (let ((.cse20 (= 2 ~t2_st~0)) (.cse21 (= 2 ~t1_st~0)) (.cse12 (= ~t2_pc~0 1)) (.cse22 (= ~E_2~0 2)) (.cse23 (= ~E_M~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~c_dr_st~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~m_st~0 2)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse10 (not (= ~E_2~0 1))) (.cse11 (= ~q_req_up~0 0)) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~t2_i~0 1)) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (not (= ~q_write_ev~0 1))) (.cse18 (= ~E_1~0 2)) (.cse19 (not (= ~E_M~0 1)))) (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 .cse6 .cse7 .cse20 .cse9 .cse21 .cse11 .cse12 .cse22 .cse13 .cse14 .cse15 (= ~m_pc~0 0) .cse16 .cse17 .cse23 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse20 (= ~m_st~0 0) .cse9 .cse21 .cse11 .cse12 .cse22 (= ~token~0 (+ 2 ~local~0)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse23 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse9 .cse21 .cse11 .cse12 .cse22 .cse13 .cse14 .cse15 .cse16 .cse17 .cse23 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 (= 0 ~t2_pc~0) .cse16 .cse17 (= 0 ~t2_st~0) .cse18 .cse19))) [2023-12-02 13:08:02,833 INFO L899 garLoopResultBuilder]: For program point L1052-1(line 1052) no Hoare annotation was computed. [2023-12-02 13:08:02,833 INFO L895 garLoopResultBuilder]: At program point L591(line 591) the Hoare annotation is: (let ((.cse16 (= 0 ~t2_pc~0)) (.cse23 (not (= ~m_pc~0 1))) (.cse25 (not (= ~E_M~0 1))) (.cse24 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~c_dr_st~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~m_st~0 2)) (.cse6 (or (= |exists_runnable_thread2_#res| 1) (not (= ~t1_st~0 0)))) (.cse7 (= ~t1_i~0 1)) (.cse8 (= (+ ~local~0 1) ~token~0)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (= ~E_2~0 1)) (.cse11 (= ~q_free~0 0)) (.cse12 (= ~q_req_up~0 0)) (.cse26 (= ~t2_pc~0 1)) (.cse13 (= ~p_dw_st~0 0)) (.cse15 (= ~c_dr_pc~0 0)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (not (= ~q_write_ev~0 1))) (.cse19 (= ~E_M~0 2)) (.cse20 (= 0 ~t2_st~0)) (.cse21 (= ~E_1~0 2)) (.cse22 (= |ULTIMATE.start_eval2_~tmp~5#1| 1)) (.cse14 (= ~t2_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse23 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse23 .cse11 .cse12 .cse26 .cse13 .cse14 .cse15 .cse17 .cse18 .cse21 .cse24 .cse25) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 2 ~t2_st~0) .cse11 .cse12 .cse26 .cse13 .cse15 .cse17 .cse18 .cse19 .cse21 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse26 .cse13 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22)) .cse14))) [2023-12-02 13:08:02,833 INFO L899 garLoopResultBuilder]: For program point L591-1(line 591) no Hoare annotation was computed. [2023-12-02 13:08:02,833 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-02 13:08:02,833 INFO L899 garLoopResultBuilder]: For program point L1087(lines 1087 1090) no Hoare annotation was computed. [2023-12-02 13:08:02,833 INFO L899 garLoopResultBuilder]: For program point L526(lines 526 534) no Hoare annotation was computed. [2023-12-02 13:08:02,834 INFO L895 garLoopResultBuilder]: At program point L427-1(lines 427 449) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse7 (= ~p_dw_st~0 0))) (let ((.cse5 (= ~q_write_ev~0 2)) (.cse15 (not .cse7)) (.cse18 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse16 (not (= ~q_read_ev~0 1))) (.cse1 (= ~t1_pc~0 0)) (.cse17 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~m_st~0 0)) (.cse24 (not .cse0)) (.cse3 (= 1 ~c_dr_i~0)) (.cse20 (not (= ~q_read_ev~0 0))) (.cse21 (= ~c_dr_pc~0 1)) (.cse4 (= ~t1_st~0 0)) (.cse22 (= ~p_dw_pc~0 1)) (.cse6 (= ~E_2~0 2)) (.cse19 (= ~q_free~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse9 (= ~p_dw_i~0 1)) (.cse10 (= 0 ~t2_pc~0)) (.cse11 (= ~E_M~0 2)) (.cse13 (= 0 ~t2_st~0)) (.cse23 (= ~token~0 ~local~0)) (.cse14 (= ~E_1~0 2))) (or (let ((.cse12 (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) .cse1 (= ~p_last_write~0 0) (= ~T1_E~0 2) .cse2 (= ~q_free~0 1) (= ~c_last_read~0 0) (= ~T2_E~0 2) .cse3 (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= ~q_req_up~0 0) (= ~t2_i~0 0) .cse4 (= ~m_i~0 0) .cse5 .cse6 .cse7 (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= ~local~0 0) (= ~token~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) .cse8 .cse9 (= (select |#valid| 0) 0) .cse10 (= (select |#valid| 2) 1) .cse11 (= ~a_t~0 0) (= (select .cse12 0) 48) .cse13 (= (select .cse12 1) 0) .cse14 (= ~M_E~0 2) (= ~t1_i~0 0))) (and .cse15 .cse16 .cse1 .cse17 .cse18 .cse2 .cse3 .cse19 .cse20 .cse21 .cse4 .cse22 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse13 .cse23 .cse14) (and .cse15 .cse16 .cse1 .cse17 .cse18 .cse2 .cse24 .cse3 .cse19 .cse20 .cse21 .cse4 .cse22 .cse6 .cse8 .cse9 .cse10 .cse11 .cse13 .cse23 .cse14) (and .cse16 (= ~c_num_read~0 ~p_num_write~0) .cse1 .cse17 (not (= ~q_write_ev~0 0)) .cse2 .cse24 .cse3 .cse20 .cse21 .cse4 .cse22 .cse6 (or (not (= ~q_req_up~0 1)) (not .cse19)) .cse8 .cse9 .cse10 (not (= ~q_write_ev~0 1)) .cse11 .cse13 .cse23 .cse14)))) [2023-12-02 13:08:02,834 INFO L899 garLoopResultBuilder]: For program point L361(lines 361 368) no Hoare annotation was computed. [2023-12-02 13:08:02,834 INFO L895 garLoopResultBuilder]: At program point L1022(line 1022) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~q_req_up~0 0) (= ~t1_st~0 0) (= ~E_2~0 2) (= ~p_dw_st~0 0) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= 0 ~t2_pc~0) (= ~c_last_read~0 ~p_last_write~0) (not (= ~q_write_ev~0 1)) (= ~E_M~0 2) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~E_1~0 2)) [2023-12-02 13:08:02,834 INFO L899 garLoopResultBuilder]: For program point L1022-1(line 1022) no Hoare annotation was computed. [2023-12-02 13:08:02,834 INFO L895 garLoopResultBuilder]: At program point L758(line 758) the Hoare annotation is: (let ((.cse5 (= ~m_st~0 2)) (.cse27 (= ~m_st~0 0))) (let ((.cse20 (= (+ ~local~0 1) ~token~0)) (.cse8 (not (= ~m_pc~0 1))) (.cse10 (not (= ~E_2~0 1))) (.cse19 (not (= ~E_M~0 1))) (.cse0 (= ~t1_pc~0 1)) (.cse21 (= 2 ~t1_st~0)) (.cse30 (= |ULTIMATE.start_eval2_~tmp~5#1| 1)) (.cse34 (or .cse5 .cse27)) (.cse29 (= 0 ~t2_pc~0)) (.cse24 (= 0 ~t2_st~0)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~c_dr_st~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse33 (= ~t1_pc~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse26 (= 2 ~t2_st~0)) (.cse9 (= ~q_free~0 0)) (.cse11 (= ~q_req_up~0 0)) (.cse31 (= ~t1_st~0 0)) (.cse12 (= ~t2_pc~0 1)) (.cse22 (= ~E_2~0 2)) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~t2_i~0 1)) (.cse15 (= ~c_dr_pc~0 0)) (.cse28 (= ~m_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (not (= ~q_write_ev~0 1))) (.cse23 (= ~E_M~0 2)) (.cse32 (= ~token~0 ~local~0)) (.cse18 (= ~E_1~0 2)) (.cse25 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 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 .cse6 .cse20 .cse7 .cse9 .cse21 .cse11 .cse12 .cse22 .cse13 .cse14 .cse15 .cse16 .cse17 .cse23 .cse24 .cse18 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse26 .cse27 .cse8 .cse9 .cse21 .cse11 .cse12 .cse22 .cse13 .cse14 .cse15 .cse16 .cse17 .cse23 .cse18 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse26 .cse9 .cse21 .cse11 .cse12 .cse22 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse23 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse9 .cse21 .cse11 .cse22 .cse13 .cse14 .cse15 .cse29 .cse16 .cse17 .cse23 .cse24 .cse18 .cse30) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse26 .cse27 .cse9 .cse21 .cse11 .cse12 .cse22 (= ~token~0 (+ 2 ~local~0)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse23 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse31 .cse22 .cse13 .cse14 .cse15 .cse29 .cse16 .cse17 .cse23 .cse24 .cse32 .cse18 .cse30) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse33 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse31 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (<= 2 ~t2_st~0) .cse18 .cse30 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse26 .cse9 .cse11 .cse31 .cse12 .cse22 .cse13 .cse14 .cse15 .cse16 .cse17 .cse23 .cse32 .cse18 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse27 .cse9 .cse21 .cse11 .cse22 .cse13 .cse14 .cse15 .cse28 .cse29 .cse16 .cse17 .cse23 .cse24 .cse32 .cse18 .cse30) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse26 .cse9 .cse21 .cse11 .cse12 .cse22 .cse13 .cse14 .cse15 .cse16 .cse17 .cse23 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse33 .cse6 .cse7 .cse9 .cse11 .cse31 .cse22 .cse13 .cse14 .cse15 .cse29 .cse16 .cse17 .cse23 .cse24 .cse32 .cse18 .cse30) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse29 .cse16 .cse17 .cse24 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse21 .cse11 .cse22 .cse13 .cse14 .cse15 .cse29 .cse16 .cse17 .cse23 .cse24 .cse32 .cse18 .cse30) (and .cse1 .cse2 .cse3 .cse4 .cse33 .cse6 .cse7 .cse26 .cse9 (<= 2 ~m_st~0) .cse11 .cse31 .cse12 .cse34 .cse22 .cse13 .cse14 .cse15 .cse16 .cse17 .cse23 .cse32 .cse18 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse33 .cse6 .cse7 .cse9 .cse11 .cse31 .cse34 .cse22 .cse13 .cse14 .cse15 .cse28 .cse29 .cse16 .cse17 .cse23 .cse24 .cse32 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse33 .cse6 .cse7 .cse26 .cse27 .cse9 .cse11 .cse31 .cse12 .cse22 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse23 .cse32 .cse18 .cse25)))) [2023-12-02 13:08:02,835 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 496) no Hoare annotation was computed. [2023-12-02 13:08:02,835 INFO L895 garLoopResultBuilder]: At program point L627(line 627) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~c_dr_st~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~m_st~0 2)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= ~q_free~0 0)) (.cse9 (= ~q_req_up~0 0)) (.cse10 (= ~t2_pc~0 1)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~t2_i~0 1)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (not (= ~q_write_ev~0 1))) (.cse16 (= ~E_1~0 2)) (.cse17 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 2 ~t1_st~0) .cse9 .cse10 (= ~E_2~0 2) (= ~token~0 (+ 2 ~local~0)) .cse11 .cse12 .cse13 (or (= |exists_runnable_thread2_#res| 1) (not (= 0 ~t2_st~0))) .cse14 .cse15 .cse16 .cse17 (= ~E_M~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~m_pc~0 1)) .cse8 (not (= ~E_2~0 1)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2023-12-02 13:08:02,835 INFO L899 garLoopResultBuilder]: For program point L627-1(line 627) no Hoare annotation was computed. [2023-12-02 13:08:02,835 INFO L899 garLoopResultBuilder]: For program point $Ultimate##104(lines 551 557) no Hoare annotation was computed. [2023-12-02 13:08:02,835 INFO L895 garLoopResultBuilder]: At program point L1024(line 1024) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_free~0 0) (= ~q_req_up~0 0) (= ~t1_st~0 0) (or (= ~m_st~0 2) (= ~m_st~0 0)) (= ~E_2~0 2) (= ~p_dw_st~0 0) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= 0 ~t2_pc~0) (= ~c_last_read~0 ~p_last_write~0) (not (= ~q_write_ev~0 1)) (= ~E_M~0 2) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~E_1~0 2)) [2023-12-02 13:08:02,836 INFO L895 garLoopResultBuilder]: At program point L1024-1(line 1024) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_free~0 0) (= ~q_req_up~0 0) (= ~t1_st~0 0) (or (= ~m_st~0 2) (= ~m_st~0 0)) (= ~E_2~0 2) (= ~p_dw_st~0 0) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= 0 ~t2_pc~0) (= ~c_last_read~0 ~p_last_write~0) (not (= ~q_write_ev~0 1)) (= ~E_M~0 2) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~E_1~0 2)) [2023-12-02 13:08:02,836 INFO L899 garLoopResultBuilder]: For program point L760(line 760) no Hoare annotation was computed. [2023-12-02 13:08:02,836 INFO L899 garLoopResultBuilder]: For program point L529(lines 529 533) no Hoare annotation was computed. [2023-12-02 13:08:02,836 INFO L899 garLoopResultBuilder]: For program point L496(line 496) no Hoare annotation was computed. [2023-12-02 13:08:02,836 INFO L895 garLoopResultBuilder]: At program point L1025(line 1025) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_free~0 0) (= ~q_req_up~0 0) (= ~t1_st~0 0) (or (= ~m_st~0 2) (= ~m_st~0 0)) (= ~E_2~0 2) (= ~p_dw_st~0 0) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= 0 ~t2_pc~0) (= ~c_last_read~0 ~p_last_write~0) (not (= ~q_write_ev~0 1)) (= ~E_M~0 2) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~E_1~0 2)) [2023-12-02 13:08:02,836 INFO L899 garLoopResultBuilder]: For program point L84(lines 72 86) no Hoare annotation was computed. [2023-12-02 13:08:02,836 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 69 87) no Hoare annotation was computed. [2023-12-02 13:08:02,836 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 79) no Hoare annotation was computed. [2023-12-02 13:08:02,836 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 69 87) the Hoare annotation is: true [2023-12-02 13:08:02,836 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 82) no Hoare annotation was computed. [2023-12-02 13:08:02,836 INFO L899 garLoopResultBuilder]: For program point L73-2(lines 73 82) no Hoare annotation was computed. [2023-12-02 13:08:02,837 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 259 278) the Hoare annotation is: true [2023-12-02 13:08:02,837 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 259 278) no Hoare annotation was computed. [2023-12-02 13:08:02,837 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 24 31) the Hoare annotation is: true [2023-12-02 13:08:02,837 INFO L899 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 28) no Hoare annotation was computed. [2023-12-02 13:08:02,837 INFO L899 garLoopResultBuilder]: For program point error1EXIT(lines 24 31) no Hoare annotation was computed. [2023-12-02 13:08:02,837 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 726 750) the Hoare annotation is: true [2023-12-02 13:08:02,837 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 726 750) no Hoare annotation was computed. [2023-12-02 13:08:02,838 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 297 314) the Hoare annotation is: (let ((.cse24 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse26 (= ~p_dw_st~0 0)) (.cse30 (= ~q_free~0 0))) (let ((.cse3 (= |old(~q_read_ev~0)| 1)) (.cse25 (not .cse30)) (.cse27 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (not (= ~E_2~0 2))) (.cse2 (not (= ~m_pc~0 ~t1_pc~0))) (.cse28 (not .cse26)) (.cse4 (not (= ~E_M~0 2))) (.cse5 (not (= ~E_1~0 2))) (.cse6 (and (= ~q_req_up~0 1) .cse30)) (.cse7 (= |old(~q_write_ev~0)| 1)) (.cse8 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse9 (= ~m_pc~0 1)) (.cse10 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) .cse24)) (.cse11 (not (= ~t1_pc~0 0))) (.cse12 (not (= ~p_dw_pc~0 1))) (.cse13 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse14 (not (= 0 ~t2_st~0))) (.cse15 (not (= ~m_st~0 0))) (.cse16 (not (= ~c_dr_pc~0 1))) (.cse17 (not (= 0 ~t2_pc~0))) (.cse18 (not (= ~p_dw_i~0 1))) (.cse19 (= |old(~q_write_ev~0)| 0)) (.cse20 (not (= ~t1_st~0 0))) (.cse21 (= |old(~q_read_ev~0)| 0)) (.cse22 (not (= 1 ~c_dr_i~0))) (.cse23 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 (and .cse24 (= ~q_write_ev~0 1)) .cse9 .cse11 .cse25 .cse12 (not .cse7) .cse26 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse27 .cse21 .cse22 .cse23) (let ((.cse29 (select |#memory_int| 1))) (or (not (= ~a_t~0 0)) (not (= ~q_req_up~0 0)) .cse1 .cse28 (not (= ~t2_i~0 0)) (not (= (select .cse29 0) 48)) (not (= ~M_E~0 2)) (not (= ~t1_i~0 0)) (and (= ~q_write_ev~0 2) (= ~q_read_ev~0 2)) .cse4 (not (= 2 (select |#length| 1))) (not .cse0) (not (= (select |#valid| 3) 1)) (not (= ~m_pc~0 0)) (not (= ~T2_E~0 2)) (not (= ~p_num_write~0 0)) .cse5 (not (= ~T1_E~0 2)) (not (= ~p_dw_pc~0 0)) (not (= (select |#length| 3) 12)) .cse8 (not (= (select |#valid| 0) 0)) (not (= (select .cse29 1) 0)) .cse11 (not (= ~c_num_read~0 0)) (not (= (select |#valid| 1) 1)) (not (= 19 (select |#length| 2))) (not (= ~token~0 0)) .cse14 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse15 (not (= |old(~q_read_ev~0)| 2)) (not (= ~q_ev~0 0)) .cse17 (< |#StackHeapBarrier| 1) .cse18 .cse20 (not (= (select |#valid| 2) 1)) (not (= ~q_free~0 1)) (not (= ~m_i~0 0)) (not (= 2 |old(~q_write_ev~0)|)) (not (= ~c_last_read~0 ~p_last_write~0)) (not (= ~p_last_write~0 0)) .cse22 .cse23)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse9 .cse10 .cse11 .cse25 .cse12 .cse26 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse27 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse2 .cse28 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23)))) [2023-12-02 13:08:02,838 INFO L899 garLoopResultBuilder]: For program point reset_delta_events1EXIT(lines 297 314) no Hoare annotation was computed. [2023-12-02 13:08:02,839 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 854 891) the Hoare annotation is: (let ((.cse25 (= ~E_1~0 2))) (let ((.cse7 (not (= 2 ~t2_st~0))) (.cse12 (not (= 2 ~t1_st~0))) (.cse18 (not (= ~t2_pc~0 1))) (.cse2 (not (= 2 |old(~E_2~0)|))) (.cse22 (not (= ~m_st~0 0))) (.cse23 (not (= ~m_pc~0 0))) (.cse8 (not (= 2 |old(~E_M~0)|))) (.cse19 (and (= ~E_2~0 2) (= ~E_M~0 2) .cse25)) (.cse0 (not (= ~q_req_up~0 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse3 (not (= ~t2_i~0 1))) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (not (= ~c_dr_st~0 0))) (.cse6 (not (= 2 |old(~E_1~0)|))) (.cse9 (not (= ~t1_i~0 1))) (.cse10 (not (= ~p_dw_pc~0 0))) (.cse11 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse24 (= ~m_pc~0 1)) (.cse13 (not (= ~c_num_read~0 0))) (.cse14 (not (= ~q_free~0 0))) (.cse15 (not (= ~m_st~0 2))) (.cse16 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse26 (not (= 0 ~t2_st~0))) (.cse17 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse27 (not (= 0 ~t2_pc~0))) (.cse20 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse21 (= ~q_write_ev~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse3 (not (= ~token~0 (+ 2 ~local~0))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse22 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse24 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse11 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse25 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse3 (and .cse15 .cse22) .cse5 .cse6 .cse23 .cse8 .cse9 .cse10 .cse11 (not (= ~t1_pc~0 0)) .cse13 .cse14 .cse16 .cse26 .cse17 .cse27 (not (= ~t1_st~0 0)) .cse19 .cse20 .cse21 (not (= ~token~0 ~local~0))) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse11 .cse24 .cse13 .cse14 .cse15 .cse16 .cse26 .cse17 .cse27 .cse25 .cse20 .cse21)))) [2023-12-02 13:08:02,839 INFO L899 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 854 891) no Hoare annotation was computed. [2023-12-02 13:08:02,842 INFO L445 BasicCegarLoop]: Path program histogram: [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] [2023-12-02 13:08:02,843 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 13:08:02,858 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-12-02 13:08:02,859 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-12-02 13:08:02,860 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-12-02 13:08:02,861 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-12-02 13:08:02,862 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-12-02 13:08:02,863 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-12-02 13:08:02,864 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-12-02 13:08:02,865 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-12-02 13:08:02,873 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-12-02 13:08:02,874 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[1] could not be translated [2023-12-02 13:08:02,874 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[3] could not be translated [2023-12-02 13:08:02,875 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[3] could not be translated [2023-12-02 13:08:02,875 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[0] could not be translated [2023-12-02 13:08:02,875 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-12-02 13:08:02,876 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[1] could not be translated [2023-12-02 13:08:02,876 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[2] could not be translated [2023-12-02 13:08:02,876 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[2] could not be translated [2023-12-02 13:08:02,893 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-12-02 13:08:02,894 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-12-02 13:08:02,895 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-12-02 13:08:02,896 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-12-02 13:08:02,897 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-12-02 13:08:02,898 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 [2023-12-02 13:08:02,899 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 [2023-12-02 13:08:02,900 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 [2023-12-02 13:08:02,907 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-12-02 13:08:02,907 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-12-02 13:08:02,908 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-12-02 13:08:02,909 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-12-02 13:08:02,909 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-12-02 13:08:02,910 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-12-02 13:08:02,911 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-12-02 13:08:02,911 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-12-02 13:08:02,912 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~5 [2023-12-02 13:08:02,914 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 [2023-12-02 13:08:02,914 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 [2023-12-02 13:08:02,915 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~2 [2023-12-02 13:08:02,915 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~2 [2023-12-02 13:08:02,915 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~2 [2023-12-02 13:08:02,916 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~kernel_st~0 [2023-12-02 13:08:02,917 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[3] could not be translated [2023-12-02 13:08:02,917 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 [2023-12-02 13:08:02,917 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[1] could not be translated [2023-12-02 13:08:02,917 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[3] could not be translated [2023-12-02 13:08:02,918 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~2 [2023-12-02 13:08:02,918 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~2 [2023-12-02 13:08:02,918 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 [2023-12-02 13:08:02,918 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[1] could not be translated [2023-12-02 13:08:02,918 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[2] could not be translated [2023-12-02 13:08:02,918 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp~2 [2023-12-02 13:08:02,919 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 [2023-12-02 13:08:02,919 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[0] could not be translated [2023-12-02 13:08:02,919 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[2] could not be translated [2023-12-02 13:08:02,919 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~kernel_st~0 [2023-12-02 13:08:02,919 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-12-02 13:08:02,919 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-12-02 13:08:02,920 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[3] could not be translated [2023-12-02 13:08:02,920 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[1] could not be translated [2023-12-02 13:08:02,921 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[3] could not be translated [2023-12-02 13:08:02,921 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[1] could not be translated [2023-12-02 13:08:02,921 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[2] could not be translated [2023-12-02 13:08:02,921 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[0] could not be translated [2023-12-02 13:08:02,921 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[2] could not be translated [2023-12-02 13:08:02,921 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-12-02 13:08:02,922 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-12-02 13:08:02,925 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[3] could not be translated [2023-12-02 13:08:02,925 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[1] could not be translated [2023-12-02 13:08:02,925 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[3] could not be translated [2023-12-02 13:08:02,925 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[1] could not be translated [2023-12-02 13:08:02,926 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[2] could not be translated [2023-12-02 13:08:02,926 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[0] could not be translated [2023-12-02 13:08:02,926 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[2] could not be translated [2023-12-02 13:08:02,926 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~kernel_st~0 [2023-12-02 13:08:02,926 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-12-02 13:08:02,926 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-12-02 13:08:02,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 01:08:02 BoogieIcfgContainer [2023-12-02 13:08:02,928 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 13:08:02,928 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 13:08:02,928 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 13:08:02,928 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 13:08:02,929 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:58:53" (3/4) ... [2023-12-02 13:08:02,930 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-12-02 13:08:02,933 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2023-12-02 13:08:02,933 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels1 [2023-12-02 13:08:02,933 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2023-12-02 13:08:02,933 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads1 [2023-12-02 13:08:02,933 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2023-12-02 13:08:02,933 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2023-12-02 13:08:02,934 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events1 [2023-12-02 13:08:02,934 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2023-12-02 13:08:02,934 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2023-12-02 13:08:02,934 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2023-12-02 13:08:02,934 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2023-12-02 13:08:02,934 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2023-12-02 13:08:02,934 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events1 [2023-12-02 13:08:02,934 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2023-12-02 13:08:02,950 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 85 nodes and edges [2023-12-02 13:08:02,951 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2023-12-02 13:08:02,953 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-12-02 13:08:02,955 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-12-02 13:08:02,980 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((c_dr_st == 0) || !((E_2 == 2))) || !((m_pc == t1_pc))) || (\old(q_read_ev) == 1)) || !((E_M == 2))) || (((q_write_ev == \old(q_write_ev)) && (\old(q_read_ev) == q_read_ev)) && (q_req_up == \old(q_req_up)))) || !((E_1 == 2))) || !((p_last_write == q_buf_0))) || (m_pc == 1)) || !((t1_pc == 0))) || !((q_free == 0))) || !((p_dw_pc == 1))) || (p_dw_st == 0)) || !((0 == t2_st))) || !((m_st == 0))) || !((c_dr_pc == 1))) || !((0 == t2_pc))) || !((p_dw_i == 1))) || !((t1_st == 0))) || !(((c_num_read + 1) == p_num_write))) || (\old(q_read_ev) == 0)) || !((1 == c_dr_i))) || !((token == local))) && ((((((((((((((((((((((((c_dr_st == 0) || !((E_2 == 2))) || !((m_pc == t1_pc))) || (\old(q_read_ev) == 1)) || !((E_M == 2))) || (((q_write_ev == \old(q_write_ev)) && (\old(q_read_ev) == q_read_ev)) && (q_req_up == \old(q_req_up)))) || !((E_1 == 2))) || (\old(q_write_ev) == 1)) || !((p_last_write == q_buf_0))) || (m_pc == 1)) || !((t1_pc == 0))) || !((p_dw_pc == 1))) || !((c_num_read == p_num_write))) || !((0 == t2_st))) || !((m_st == 0))) || !((c_dr_pc == 1))) || !((0 == t2_pc))) || !((p_dw_i == 1))) || ((\old(q_req_up) == 1) && (q_free == 0))) || (\old(q_write_ev) == 0)) || !((t1_st == 0))) || (\old(q_read_ev) == 0)) || !((1 == c_dr_i))) || !((token == local)))) [2023-12-02 13:08:02,986 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_pc == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && ((\result == 1) || !((0 == t2_st)))) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (token == local)) && (E_1 == 2)) || ((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_st == 0)) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && ((\result == 1) || !((0 == t2_st)))) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_st == 0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (E_2 == 2)) && (token == (2 + local))) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && ((\result == 1) || !((0 == t2_st)))) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (E_1 == 2))) || ((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_pc == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && !((m_pc == 1))) && (q_free == 0)) && !((E_2 == 1))) && (q_req_up == 0)) && (t1_st == 0)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_1 == 2)) && !((E_M == 1)))) || (((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && !((m_pc == 1))) && (q_free == 0)) && !((E_2 == 1))) && (q_req_up == 0)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_1 == 2)) && !((E_M == 1)))) || (((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && ((local + 1) == token)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && ((\result == 1) || !((0 == t2_st)))) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (E_1 == 2))) || (((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && ((\result == 1) || !((0 == t2_st)))) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && ((\result == 1) || !((0 == t2_st)))) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || ((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_st == 0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && ((\result == 1) || !((0 == t2_st)))) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (token == local)) && (E_1 == 2))) [2023-12-02 13:08:03,038 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((c_dr_st == 0) || !((E_2 == 2))) || !((m_pc == t1_pc))) || (\old(q_read_ev) == 1)) || !((E_M == 2))) || (((q_write_ev == \old(q_write_ev)) && (\old(q_read_ev) == q_read_ev)) && (q_req_up == \old(q_req_up)))) || !((E_1 == 2))) || !((p_last_write == q_buf_0))) || (m_pc == 1)) || !((t1_pc == 0))) || !((q_free == 0))) || !((p_dw_pc == 1))) || (p_dw_st == 0)) || !((0 == t2_st))) || !((m_st == 0))) || !((c_dr_pc == 1))) || !((0 == t2_pc))) || !((p_dw_i == 1))) || !((t1_st == 0))) || !(((c_num_read + 1) == p_num_write))) || (\old(q_read_ev) == 0)) || !((1 == c_dr_i))) || !((token == local))) && ((((((((((((((((((((((((c_dr_st == 0) || !((E_2 == 2))) || !((m_pc == t1_pc))) || (\old(q_read_ev) == 1)) || !((E_M == 2))) || (((q_write_ev == \old(q_write_ev)) && (\old(q_read_ev) == q_read_ev)) && (q_req_up == \old(q_req_up)))) || !((E_1 == 2))) || (\old(q_write_ev) == 1)) || !((p_last_write == q_buf_0))) || (m_pc == 1)) || !((t1_pc == 0))) || !((p_dw_pc == 1))) || !((c_num_read == p_num_write))) || !((0 == t2_st))) || !((m_st == 0))) || !((c_dr_pc == 1))) || !((0 == t2_pc))) || !((p_dw_i == 1))) || ((\old(q_req_up) == 1) && (q_free == 0))) || (\old(q_write_ev) == 0)) || !((t1_st == 0))) || (\old(q_read_ev) == 0)) || !((1 == c_dr_i))) || !((token == local)))) [2023-12-02 13:08:03,043 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_pc == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && ((\result == 1) || !((0 == t2_st)))) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (token == local)) && (E_1 == 2)) || ((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_st == 0)) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && ((\result == 1) || !((0 == t2_st)))) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_st == 0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (E_2 == 2)) && (token == (2 + local))) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && ((\result == 1) || !((0 == t2_st)))) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (E_1 == 2))) || ((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_pc == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && !((m_pc == 1))) && (q_free == 0)) && !((E_2 == 1))) && (q_req_up == 0)) && (t1_st == 0)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_1 == 2)) && !((E_M == 1)))) || (((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && !((m_pc == 1))) && (q_free == 0)) && !((E_2 == 1))) && (q_req_up == 0)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_1 == 2)) && !((E_M == 1)))) || (((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && ((local + 1) == token)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && ((\result == 1) || !((0 == t2_st)))) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (E_1 == 2))) || (((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && ((\result == 1) || !((0 == t2_st)))) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && ((\result == 1) || !((0 == t2_st)))) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || ((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_st == 0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && ((\result == 1) || !((0 == t2_st)))) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (token == local)) && (E_1 == 2))) [2023-12-02 13:08:03,122 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/witness.graphml [2023-12-02 13:08:03,123 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/witness.yml [2023-12-02 13:08:03,123 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 13:08:03,123 INFO L158 Benchmark]: Toolchain (without parser) took 551192.06ms. Allocated memory was 174.1MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 141.9MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 601.9MB. Max. memory is 16.1GB. [2023-12-02 13:08:03,123 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 119.5MB. Free memory is still 71.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 13:08:03,124 INFO L158 Benchmark]: CACSL2BoogieTranslator took 426.04ms. Allocated memory is still 174.1MB. Free memory was 141.9MB in the beginning and 124.2MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-12-02 13:08:03,124 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.78ms. Allocated memory is still 174.1MB. Free memory was 124.2MB in the beginning and 120.9MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 13:08:03,124 INFO L158 Benchmark]: Boogie Preprocessor took 42.98ms. Allocated memory is still 174.1MB. Free memory was 120.9MB in the beginning and 118.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-12-02 13:08:03,125 INFO L158 Benchmark]: RCFGBuilder took 984.13ms. Allocated memory is still 174.1MB. Free memory was 118.4MB in the beginning and 140.9MB in the end (delta: -22.6MB). Peak memory consumption was 68.1MB. Max. memory is 16.1GB. [2023-12-02 13:08:03,125 INFO L158 Benchmark]: TraceAbstraction took 549462.55ms. Allocated memory was 174.1MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 140.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2023-12-02 13:08:03,125 INFO L158 Benchmark]: Witness Printer took 194.88ms. Allocated memory is still 1.8GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-12-02 13:08:03,127 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.18ms. Allocated memory is still 119.5MB. Free memory is still 71.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 426.04ms. Allocated memory is still 174.1MB. Free memory was 141.9MB in the beginning and 124.2MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.78ms. Allocated memory is still 174.1MB. Free memory was 124.2MB in the beginning and 120.9MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.98ms. Allocated memory is still 174.1MB. Free memory was 120.9MB in the beginning and 118.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 984.13ms. Allocated memory is still 174.1MB. Free memory was 118.4MB in the beginning and 140.9MB in the end (delta: -22.6MB). Peak memory consumption was 68.1MB. Max. memory is 16.1GB. * TraceAbstraction took 549462.55ms. Allocated memory was 174.1MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 140.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 194.88ms. Allocated memory is still 1.8GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #length[1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #length[3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #length[2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~kernel_st~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #length[3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #length[1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #length[2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp~2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~tmp___1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~kernel_st~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #length[3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #length[1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #length[2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #length[3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #length[1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #length[2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~kernel_st~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 496]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 28]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 153 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 549.3s, OverallIterations: 44, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 89.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 280.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21507 SdHoareTripleChecker+Valid, 26.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21344 mSDsluCounter, 34016 SdHoareTripleChecker+Invalid, 22.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25216 mSDsCounter, 7782 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 31091 IncrementalHoareTripleChecker+Invalid, 38873 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7782 mSolverCounterUnsat, 8800 mSDtfsCounter, 31091 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6015 GetRequests, 4455 SyntacticMatches, 21 SemanticMatches, 1539 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 119924 ImplicationChecksByTransitivity, 111.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4501occurred in iteration=39, InterpolantAutomatonStates: 1036, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 17.3s AutomataMinimizationTime, 44 MinimizatonAttempts, 16414 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 52 LocationsWithAnnotation, 6604 PreInvPairs, 6913 NumberOfFragments, 18340 HoareAnnotationTreeSize, 6604 FomulaSimplifications, 3322697 FormulaSimplificationTreeSizeReduction, 217.3s HoareSimplificationTime, 52 FomulaSimplificationsInter, 1363696 FormulaSimplificationTreeSizeReductionInter, 62.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 16.1s InterpolantComputationTime, 7309 NumberOfCodeBlocks, 7269 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 8172 ConstructedInterpolants, 0 QuantifiedInterpolants, 19776 SizeOfPredicates, 78 NumberOfNonLiveVariables, 12326 ConjunctsInSsa, 395 ConjunctsInUnsatCore, 78 InterpolantComputations, 37 PerfectInterpolantSequences, 5087/5655 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.7s, 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.6s, 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.7s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 1, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 2, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 54, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME: 0.2s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.2s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 2, CALL_SUMMARIZER_APPLICATIONS: 18, CALL_SUMMARIZER_CACHE_MISSES: 7, CALL_SUMMARIZER_OVERALL_TIME: 0.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: 581]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (m_st == 0)) && (q_free == 0)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (E_1 == 2)) || ((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && ((local + 1) == token)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (0 == t2_st)) && (E_1 == 2))) || ((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (q_req_up == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (c_num_read == 0)) && (c_num_read == p_num_write)) && (m_st == 2)) && (t1_i == 1)) && ((local + 1) == token)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (q_req_up == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (0 == t2_st)) && (E_1 == 2))) || ((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && !((m_pc == 1))) && (q_free == 0)) && !((E_2 == 1))) && (q_req_up == 0)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (0 == t2_st)) && (E_1 == 2)) && !((E_M == 1)))) || ((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_st == 0)) && (q_free == 0)) && (q_req_up == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (0 == t2_pc)) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (q_free == 0)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && !((m_pc == 1))) && (q_free == 0)) && !((E_2 == 1))) && (q_req_up == 0)) && (t2_pc == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_1 == 2)) && !((E_M == 1)))) - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((c_dr_st == 0) || !((E_2 == 2))) || !((m_pc == t1_pc))) || (\old(q_read_ev) == 1)) || !((E_M == 2))) || (((q_write_ev == \old(q_write_ev)) && (\old(q_read_ev) == q_read_ev)) && (q_req_up == \old(q_req_up)))) || !((E_1 == 2))) || !((p_last_write == q_buf_0))) || (m_pc == 1)) || !((t1_pc == 0))) || !((q_free == 0))) || !((p_dw_pc == 1))) || (p_dw_st == 0)) || !((0 == t2_st))) || !((m_st == 0))) || !((c_dr_pc == 1))) || !((0 == t2_pc))) || !((p_dw_i == 1))) || !((t1_st == 0))) || !(((c_num_read + 1) == p_num_write))) || (\old(q_read_ev) == 0)) || !((1 == c_dr_i))) || !((token == local))) && ((((((((((((((((((((((((c_dr_st == 0) || !((E_2 == 2))) || !((m_pc == t1_pc))) || (\old(q_read_ev) == 1)) || !((E_M == 2))) || (((q_write_ev == \old(q_write_ev)) && (\old(q_read_ev) == q_read_ev)) && (q_req_up == \old(q_req_up)))) || !((E_1 == 2))) || (\old(q_write_ev) == 1)) || !((p_last_write == q_buf_0))) || (m_pc == 1)) || !((t1_pc == 0))) || !((p_dw_pc == 1))) || !((c_num_read == p_num_write))) || !((0 == t2_st))) || !((m_st == 0))) || !((c_dr_pc == 1))) || !((0 == t2_pc))) || !((p_dw_i == 1))) || ((\old(q_req_up) == 1) && (q_free == 0))) || (\old(q_write_ev) == 0)) || !((t1_st == 0))) || (\old(q_read_ev) == 0)) || !((1 == c_dr_i))) || !((token == local)))) - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 757]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && !((m_pc == 1))) && (q_free == 0)) && !((E_2 == 1))) && (q_req_up == 0)) && (t2_pc == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_1 == 2)) && !((E_M == 1))) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && ((local + 1) == token)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (0 == t2_st)) && (E_1 == 2)) && !((tmp == 0)))) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (E_1 == 2)) && !((tmp == 0)))) || (((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (E_1 == 2))) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && ((local + 1) == token)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (0 == t2_st)) && (E_1 == 2)) && (tmp == 1))) || ((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (m_st == 0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (token == (2 + local))) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (E_1 == 2))) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (tmp == 1))) || (((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_pc == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && !((m_pc == 1))) && (q_free == 0)) && !((E_2 == 1))) && (q_req_up == 0)) && (t1_st == 0)) && (t2_pc == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (2 <= t2_st)) && (E_1 == 2)) && (tmp == 1)) && !((E_M == 1)))) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (token == local)) && (E_1 == 2)) && !((tmp == 0)))) || ((((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_st == 0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (0 == t2_pc)) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (tmp == 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 == t2_st)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (E_1 == 2))) || (((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_pc == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (tmp == 1))) || (((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && !((m_pc == 1))) && (q_free == 0)) && !((E_2 == 1))) && (q_req_up == 0)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (0 == t2_st)) && (E_1 == 2)) && !((E_M == 1)))) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (tmp == 1))) || ((((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (q_free == 0)) && (2 <= m_st)) && (q_req_up == 0)) && (t1_st == 0)) && (t2_pc == 1)) && ((m_st == 2) || (m_st == 0))) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (token == local)) && (E_1 == 2)) && !((tmp == 0)))) || (((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && ((m_st == 2) || (m_st == 0))) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (0 == t2_pc)) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (m_st == 0)) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (token == local)) && (E_1 == 2)) && !((tmp == 0)))) - InvariantResult [Line: 537]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && !((m_pc == 1))) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && !((m_st == 0))) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (E_1 == 2)) || ((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (token == (2 + local))) && (p_dw_st == 0)) && !((m_st == 0))) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (E_1 == 2))) || (((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && !((m_st == 0))) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (0 == t2_pc)) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && !((m_st == 0))) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (0 == t2_pc)) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && !((m_st == 0))) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (token == local)) && (E_1 == 2))) - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((q_req_up == 1) && (c_num_read == 0)) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (m_st == 0)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && (t1_st == 0)) && (p_dw_pc == 1)) && (q_write_ev == 2)) && (E_2 == 2)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (2 == p_dw_st)) && (m_pc == 0)) && (p_dw_i == 1)) && (p_num_write == 1)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) || ((((((((((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (m_st == 0)) && (q_free == 1)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_req_up == 0)) && ((c_dr_pc == 1) || (c_dr_pc == 0))) && (t1_st == 0)) && (q_write_ev == 2)) && (E_2 == 2)) && (p_dw_st == 0)) && (q_read_ev == 2)) && (m_pc == 0)) && (p_dw_i == 1)) && (0 == t2_pc)) && (c_last_read == p_last_write)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((m_st == 0) && ((((((((((((((((((((!((q_read_ev == 1)) && (c_num_read == p_num_write)) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && !((q_write_ev == 0))) && (q_free == 1)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && !((q_read_ev == 0))) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && (2 == p_dw_st)) && (m_pc == 0)) && (p_dw_i == 1)) && (0 == t2_pc)) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (E_1 == 2)) || (((((((((((((((((((!((p_dw_st == 0)) && !((q_read_ev == 1))) && (c_num_read == p_num_write)) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && !((q_write_ev == 0))) && (q_free == 1)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && !((q_read_ev == 0))) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && (m_pc == 0)) && (p_dw_i == 1)) && (0 == t2_pc)) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (E_1 == 2)))) && (0 == t2_st)) && (token == local))) - InvariantResult [Line: 1029]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && !((m_pc == 1))) && (q_free == 0)) && !((E_2 == 1))) && (q_req_up == 0)) && (t2_pc == 1)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_1 == 2)) && !((E_M == 1))) || (((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (E_1 == 2))) || ((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (m_st == 0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (token == (2 + local))) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (E_1 == 2))) || (((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == t2_st)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (t2_pc == 1)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (E_1 == 2))) || (((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && !((m_pc == 1))) && (q_free == 0)) && !((E_2 == 1))) && (q_req_up == 0)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (0 == t2_pc)) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (0 == t2_st)) && (E_1 == 2)) && !((E_M == 1)))) || (((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && ((m_st == 2) || (m_st == 0))) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && (0 == t2_pc)) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) - InvariantResult [Line: 617]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_pc == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && ((\result == 1) || !((0 == t2_st)))) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (token == local)) && (E_1 == 2)) || ((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_st == 0)) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && ((\result == 1) || !((0 == t2_st)))) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_st == 0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (E_2 == 2)) && (token == (2 + local))) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && ((\result == 1) || !((0 == t2_st)))) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (E_1 == 2))) || ((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_pc == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && !((m_pc == 1))) && (q_free == 0)) && !((E_2 == 1))) && (q_req_up == 0)) && (t1_st == 0)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_1 == 2)) && !((E_M == 1)))) || (((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && !((m_pc == 1))) && (q_free == 0)) && !((E_2 == 1))) && (q_req_up == 0)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_1 == 2)) && !((E_M == 1)))) || (((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && ((local + 1) == token)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && ((\result == 1) || !((0 == t2_st)))) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (E_1 == 2))) || (((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (q_req_up == 0)) && (t1_st == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && ((\result == 1) || !((0 == t2_st)))) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (m_st == 2)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && ((\result == 1) || !((0 == t2_st)))) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (token == local)) && (E_1 == 2))) || ((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (m_st == 0)) && (q_free == 0)) && (2 == t1_st)) && (q_req_up == 0)) && (E_2 == 2)) && (p_dw_st == 0)) && (t2_i == 1)) && (c_dr_pc == 0)) && (m_pc == 0)) && ((\result == 1) || !((0 == t2_st)))) && (c_last_read == p_last_write)) && !((q_write_ev == 1))) && (E_M == 2)) && (token == local)) && (E_1 == 2))) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && !((p_dw_st == 0))) && (c_num_read == 0)) && (c_dr_st == 2)) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (m_st == 0)) && (q_free == 1)) && (1 == c_dr_i)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (q_write_ev == 2)) && (E_2 == 2)) && (q_read_ev == 2)) && (m_pc == 0)) && (p_dw_i == 1)) && (0 == t2_pc)) && (c_last_read == p_last_write)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) || ((((((((((((((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (q_req_up == 1)) && (c_num_read == 0)) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (c_last_read == 0)) && (T2_E == 2)) && (1 == c_dr_i)) && (q_free == 0)) && (t2_i == 0)) && (t1_st == 0)) && (m_i == 0)) && (0 <= (p_last_write + 2147483648))) && (q_write_ev == 2)) && (p_dw_st == 1)) && (E_2 == 2)) && (local == 0)) && (token == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (m_pc == 0)) && (p_dw_i == 1)) && (p_num_write == 1)) && (0 == t2_pc)) && (p_last_write <= 2147483647)) && (E_M == 2)) && (a_t == 0)) && (0 == t2_st)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 0))) || ((((!((p_dw_st == 0)) && (m_st == 0)) && (((((((((((((((((((!((q_read_ev == 1)) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && !((q_write_ev == 0))) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && !((q_read_ev == 0))) && (t1_st == 0)) && (E_2 == 2)) && (((p_dw_pc == 0) && (q_write_ev == 2)) || (p_dw_pc == 1))) && (((c_dr_pc == 1) && (p_dw_pc == 1)) || ((p_dw_pc == 0) && (c_dr_pc == 1)))) && (m_pc == 0)) && (p_dw_i == 1)) && (0 == t2_pc)) && !((q_write_ev == 1))) && (E_M == 2)) && (E_1 == 2)) || ((((((((((((((((!((q_read_ev == 1)) && (c_dr_st == 2)) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (1 == c_dr_i)) && (q_free == 0)) && !((q_read_ev == 0))) && (t1_st == 0)) && (E_2 == 2)) && (((p_dw_pc == 0) && (q_write_ev == 2)) || (p_dw_pc == 1))) && (((c_dr_pc == 1) && (p_dw_pc == 1)) || ((p_dw_pc == 0) && (c_dr_pc == 1)))) && (m_pc == 0)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (E_1 == 2)))) && (0 == t2_st)) && (token == local))) || (((((((((((((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_buf_0 == 0)) && (t1_pc == 0)) && (p_last_write == 0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (c_last_read == 0)) && (T2_E == 2)) && (1 == c_dr_i)) && (q_req_up == 0)) && (t2_i == 0)) && (t1_st == 0)) && (m_i == 0)) && (q_write_ev == 2)) && (p_dw_st == 1)) && (E_2 == 2)) && (token == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (m_pc == 0)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (a_t == 0)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 0))) - InvariantResult [Line: 726]: Loop Invariant Derived loop invariant: 1 - 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)) && (T2_E == 2)) && (1 == c_dr_i)) && (q_req_up == 0)) && (t2_i == 0)) && (t1_st == 0)) && (m_i == 0)) && (q_write_ev == 2)) && (E_2 == 2)) && (p_dw_st == 0)) && (local == 0)) && (token == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (m_pc == 0)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (a_t == 0)) && (0 == t2_st)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 0)) || ((((((((((((((((((((!((p_dw_st == 0)) && !((q_read_ev == 1))) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (m_st == 0)) && (1 == c_dr_i)) && (q_free == 0)) && !((q_read_ev == 0))) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (q_write_ev == 2)) && (E_2 == 2)) && (m_pc == 0)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((((((((((!((p_dw_st == 0)) && !((q_read_ev == 1))) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (m_st == 0)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && !((q_read_ev == 0))) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && (m_pc == 0)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((!((q_read_ev == 1)) && (c_num_read == p_num_write)) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && !((q_write_ev == 0))) && (m_st == 0)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && !((q_read_ev == 0))) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && (!((q_req_up == 1)) || !((q_free == 0)))) && (m_pc == 0)) && (p_dw_i == 1)) && (0 == t2_pc)) && !((q_write_ev == 1))) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && !((tmp___1 == 0))) && (c_dr_st == 2)) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (m_st == 0)) && (q_free == 1)) && (1 == c_dr_i)) && (q_req_up == 0)) && (c_dr_pc == 1)) && (t1_st == 0)) && (q_write_ev == 2)) && (E_2 == 2)) && (p_dw_st == 0)) && (q_read_ev == 2)) && (m_pc == 0)) && (p_dw_i == 1)) && (0 == t2_pc)) && (c_last_read == p_last_write)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) || (((((((((((!((q_read_ev == 1)) && (c_num_read == p_num_write)) && (t1_pc == 0)) && (m_st == 0)) && !((q_read_ev == 0))) && (E_2 == 2)) && (((((((((((c_dr_st == 2) && (p_last_write == q_buf_0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (!((tmp___1 == 0)) || (((q_req_up == 1) && !((q_free == 0))) && (q_write_ev == 2)))) && (t1_st == 0)) && (p_dw_pc == 1)) && (p_dw_st == 0)) && (p_dw_i == 1)) && (0 == t2_pc)) || ((((((((((((p_last_write == q_buf_0) && !((q_write_ev == 0))) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (!((tmp___1 == 0)) || (((q_req_up == 1) && !((q_free == 0))) && (q_write_ev == 2)))) && (t1_st == 0)) && (p_dw_pc == 1)) && (p_dw_st == 0)) && (p_dw_i == 1)) && (0 == t2_pc)) && !((q_write_ev == 1))))) && (m_pc == 0)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((((((((((!((p_dw_st == 0)) && !((q_read_ev == 1))) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (m_st == 0)) && (1 == c_dr_i)) && (q_free == 0)) && !((q_read_ev == 0))) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (q_write_ev == 2)) && (E_2 == 2)) && (m_pc == 0)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((((((((((((((p_dw_pc == 0) && (c_dr_st == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (q_buf_0 == 0)) && (t1_pc == 0)) && (p_last_write == 0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (c_last_read == 0)) && (T2_E == 2)) && (1 == c_dr_i)) && (q_req_up == 0)) && (t2_i == 0)) && (t1_st == 0)) && (m_i == 0)) && (q_write_ev == 2)) && (E_2 == 2)) && (p_dw_st == 0)) && (token == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (m_pc == 0)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (a_t == 0)) && (0 == t2_st)) && (token == local)) && (E_1 == 2)) && (M_E == 2)) && (t1_i == 0))) || ((((((((((((((((((((!((p_dw_st == 0)) && !((q_read_ev == 1))) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && ((c_num_read + 1) == p_num_write)) && (m_st == 0)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && (q_free == 0)) && !((q_read_ev == 0))) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && (m_pc == 0)) && (p_dw_i == 1)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || (((((((((((((((((((((!((q_read_ev == 1)) && (c_num_read == p_num_write)) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && !((q_write_ev == 0))) && (m_st == 0)) && !((c_dr_st == 0))) && (1 == c_dr_i)) && !((q_read_ev == 0))) && (c_dr_pc == 1)) && (t1_st == 0)) && (p_dw_pc == 1)) && (E_2 == 2)) && (!((q_req_up == 1)) || !((q_free == 0)))) && (m_pc == 0)) && (p_dw_i == 1)) && (0 == t2_pc)) && !((q_write_ev == 1))) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) || ((((((((((((((((((((((((c_dr_st == 0) && (q_req_up == 1)) && (c_num_read == 0)) && !((tmp___1 == 0))) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (m_st == 0)) && (1 == c_dr_i)) && (q_free == 0)) && (t1_st == 0)) && (p_dw_pc == 1)) && (q_write_ev == 2)) && (E_2 == 2)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (2 == p_dw_st)) && (m_pc == 0)) && (p_dw_i == 1)) && (p_num_write == 1)) && (0 == t2_pc)) && (E_M == 2)) && (0 == t2_st)) && (token == local)) && (E_1 == 2))) RESULT: Ultimate proved your program to be correct! [2023-12-02 13:08:03,168 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f69b14d-683d-4b79-8ded-c494c8e083ff/bin/utaipan-verify-nQ1chXbOIh/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