./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30e01a73 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_7b57fa33-5bb4-49aa-a9d7-d780fccc9435/bin/utaipan-verify-mE87zJ7Ire/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b57fa33-5bb4-49aa-a9d7-d780fccc9435/bin/utaipan-verify-mE87zJ7Ire/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b57fa33-5bb4-49aa-a9d7-d780fccc9435/bin/utaipan-verify-mE87zJ7Ire/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b57fa33-5bb4-49aa-a9d7-d780fccc9435/bin/utaipan-verify-mE87zJ7Ire/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b57fa33-5bb4-49aa-a9d7-d780fccc9435/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b57fa33-5bb4-49aa-a9d7-d780fccc9435/bin/utaipan-verify-mE87zJ7Ire --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 5e0f2637c3745e36a3708f37a9783771b3e1c15cb350f0e936eafd42058bd9cf --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 21:15:53,898 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 21:15:54,019 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b57fa33-5bb4-49aa-a9d7-d780fccc9435/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-23 21:15:54,027 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 21:15:54,028 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 21:15:54,069 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 21:15:54,070 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 21:15:54,071 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 21:15:54,072 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 21:15:54,078 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 21:15:54,079 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-23 21:15:54,080 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-23 21:15:54,081 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-23 21:15:54,083 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-23 21:15:54,083 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-23 21:15:54,084 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-23 21:15:54,084 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-23 21:15:54,085 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-23 21:15:54,085 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-23 21:15:54,086 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-23 21:15:54,086 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-23 21:15:54,087 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-23 21:15:54,088 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 21:15:54,089 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 21:15:54,089 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 21:15:54,090 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 21:15:54,090 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 21:15:54,091 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 21:15:54,091 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 21:15:54,092 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 21:15:54,093 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 21:15:54,094 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 21:15:54,094 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 21:15:54,094 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 21:15:54,095 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 21:15:54,095 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 21:15:54,095 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 21:15:54,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:15:54,096 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 21:15:54,096 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 21:15:54,097 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 21:15:54,097 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-23 21:15:54,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 21:15:54,098 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 21:15:54,099 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 21:15:54,099 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-23 21:15:54,099 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 21:15:54,099 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_7b57fa33-5bb4-49aa-a9d7-d780fccc9435/bin/utaipan-verify-mE87zJ7Ire/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_7b57fa33-5bb4-49aa-a9d7-d780fccc9435/bin/utaipan-verify-mE87zJ7Ire 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 -> 5e0f2637c3745e36a3708f37a9783771b3e1c15cb350f0e936eafd42058bd9cf [2023-11-23 21:15:54,474 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 21:15:54,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 21:15:54,504 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 21:15:54,505 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 21:15:54,506 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 21:15:54,507 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b57fa33-5bb4-49aa-a9d7-d780fccc9435/bin/utaipan-verify-mE87zJ7Ire/../../sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-23 21:15:57,742 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 21:15:58,147 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 21:15:58,158 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b57fa33-5bb4-49aa-a9d7-d780fccc9435/sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-23 21:15:58,180 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b57fa33-5bb4-49aa-a9d7-d780fccc9435/bin/utaipan-verify-mE87zJ7Ire/data/0c33b1a75/03c41628e9324938b7e68a62044e9167/FLAG513cc7afa [2023-11-23 21:15:58,203 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b57fa33-5bb4-49aa-a9d7-d780fccc9435/bin/utaipan-verify-mE87zJ7Ire/data/0c33b1a75/03c41628e9324938b7e68a62044e9167 [2023-11-23 21:15:58,209 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 21:15:58,211 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 21:15:58,214 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 21:15:58,215 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 21:15:58,220 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 21:15:58,221 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:15:58" (1/1) ... [2023-11-23 21:15:58,223 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7690975c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:15:58, skipping insertion in model container [2023-11-23 21:15:58,223 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:15:58" (1/1) ... [2023-11-23 21:15:58,290 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 21:15:58,494 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_7b57fa33-5bb4-49aa-a9d7-d780fccc9435/sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2023-11-23 21:15:58,764 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:15:58,781 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 21:15:58,794 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_7b57fa33-5bb4-49aa-a9d7-d780fccc9435/sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2023-11-23 21:15:58,914 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:15:58,956 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 21:15:58,957 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 21:15:58,964 INFO L206 MainTranslator]: Completed translation [2023-11-23 21:15:58,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:15:58 WrapperNode [2023-11-23 21:15:58,965 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 21:15:58,966 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 21:15:58,966 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 21:15:58,966 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 21:15:58,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:15:58" (1/1) ... [2023-11-23 21:15:58,995 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:15:58" (1/1) ... [2023-11-23 21:15:59,040 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-11-23 21:15:59,041 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 21:15:59,042 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 21:15:59,042 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 21:15:59,042 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 21:15:59,053 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:15:58" (1/1) ... [2023-11-23 21:15:59,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:15:58" (1/1) ... [2023-11-23 21:15:59,058 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:15:58" (1/1) ... [2023-11-23 21:15:59,058 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:15:58" (1/1) ... [2023-11-23 21:15:59,071 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:15:58" (1/1) ... [2023-11-23 21:15:59,074 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:15:58" (1/1) ... [2023-11-23 21:15:59,077 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:15:58" (1/1) ... [2023-11-23 21:15:59,080 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:15:58" (1/1) ... [2023-11-23 21:15:59,085 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 21:15:59,086 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 21:15:59,087 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 21:15:59,087 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 21:15:59,088 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:15:58" (1/1) ... [2023-11-23 21:15:59,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:15:59,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b57fa33-5bb4-49aa-a9d7-d780fccc9435/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 21:15:59,128 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b57fa33-5bb4-49aa-a9d7-d780fccc9435/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 21:15:59,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b57fa33-5bb4-49aa-a9d7-d780fccc9435/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 21:15:59,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 21:15:59,160 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-23 21:15:59,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 21:15:59,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 21:15:59,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 21:15:59,161 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-23 21:15:59,161 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-23 21:15:59,161 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-23 21:15:59,161 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-23 21:15:59,161 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-23 21:15:59,161 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-23 21:15:59,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 21:15:59,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-23 21:15:59,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 21:15:59,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 21:15:59,164 WARN L213 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-23 21:15:59,319 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 21:15:59,321 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 21:15:59,856 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 21:16:00,127 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 21:16:00,127 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 21:16:00,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:16:00 BoogieIcfgContainer [2023-11-23 21:16:00,128 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 21:16:00,130 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 21:16:00,131 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 21:16:00,134 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 21:16:00,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:15:58" (1/3) ... [2023-11-23 21:16:00,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2613cb65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:16:00, skipping insertion in model container [2023-11-23 21:16:00,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:15:58" (2/3) ... [2023-11-23 21:16:00,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2613cb65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:16:00, skipping insertion in model container [2023-11-23 21:16:00,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:16:00" (3/3) ... [2023-11-23 21:16:00,137 INFO L112 eAbstractionObserver]: Analyzing ICFG safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-23 21:16:00,147 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-23 21:16:00,158 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 21:16:00,158 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-23 21:16:00,158 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-23 21:16:00,241 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-23 21:16:00,270 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 48 places, 39 transitions, 90 flow [2023-11-23 21:16:00,520 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3952 states, 3949 states have (on average 3.481894150417827) internal successors, (13750), 3951 states have internal predecessors, (13750), 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-11-23 21:16:00,542 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 21:16:00,548 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;@5e21708b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 21:16:00,551 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-23 21:16:00,571 INFO L276 IsEmpty]: Start isEmpty. Operand has 3952 states, 3949 states have (on average 3.481894150417827) internal successors, (13750), 3951 states have internal predecessors, (13750), 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-11-23 21:16:00,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-23 21:16:00,576 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:00,577 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-23 21:16:00,578 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-23 21:16:00,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:00,583 INFO L85 PathProgramCache]: Analyzing trace with hash 13232445, now seen corresponding path program 1 times [2023-11-23 21:16:00,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:00,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445879671] [2023-11-23 21:16:00,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:00,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:01,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:16:01,073 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:01,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445879671] [2023-11-23 21:16:01,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445879671] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:16:01,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:16:01,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 21:16:01,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749165816] [2023-11-23 21:16:01,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:16:01,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:16:01,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:16:01,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:16:01,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:16:01,129 INFO L87 Difference]: Start difference. First operand has 3952 states, 3949 states have (on average 3.481894150417827) internal successors, (13750), 3951 states have internal predecessors, (13750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-11-23 21:16:01,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:16:01,437 INFO L93 Difference]: Finished difference Result 3397 states and 11606 transitions. [2023-11-23 21:16:01,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:16:01,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) Word has length 4 [2023-11-23 21:16:01,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:16:01,513 INFO L225 Difference]: With dead ends: 3397 [2023-11-23 21:16:01,513 INFO L226 Difference]: Without dead ends: 3201 [2023-11-23 21:16:01,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-11-23 21:16:01,523 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 20 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:16:01,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 24 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:16:01,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3201 states. [2023-11-23 21:16:01,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3201 to 3201. [2023-11-23 21:16:01,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3201 states, 3200 states have (on average 3.43) internal successors, (10976), 3200 states have internal predecessors, (10976), 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-11-23 21:16:01,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3201 states to 3201 states and 10976 transitions. [2023-11-23 21:16:01,825 INFO L78 Accepts]: Start accepts. Automaton has 3201 states and 10976 transitions. Word has length 4 [2023-11-23 21:16:01,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:16:01,826 INFO L495 AbstractCegarLoop]: Abstraction has 3201 states and 10976 transitions. [2023-11-23 21:16:01,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-11-23 21:16:01,829 INFO L276 IsEmpty]: Start isEmpty. Operand 3201 states and 10976 transitions. [2023-11-23 21:16:01,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-23 21:16:01,842 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:01,842 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:16:01,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 21:16:01,843 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-23 21:16:01,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:01,844 INFO L85 PathProgramCache]: Analyzing trace with hash 754446492, now seen corresponding path program 1 times [2023-11-23 21:16:01,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:01,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839203878] [2023-11-23 21:16:01,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:01,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:01,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:03,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:16:03,472 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:03,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839203878] [2023-11-23 21:16:03,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839203878] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:16:03,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:16:03,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:16:03,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683567819] [2023-11-23 21:16:03,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:16:03,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:16:03,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:16:03,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:16:03,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:16:03,477 INFO L87 Difference]: Start difference. First operand 3201 states and 10976 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-11-23 21:16:03,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:16:03,873 INFO L93 Difference]: Finished difference Result 3495 states and 11725 transitions. [2023-11-23 21:16:03,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:16:03,874 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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) Word has length 14 [2023-11-23 21:16:03,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:16:03,936 INFO L225 Difference]: With dead ends: 3495 [2023-11-23 21:16:03,936 INFO L226 Difference]: Without dead ends: 2809 [2023-11-23 21:16:03,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-23 21:16:03,944 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 93 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 21:16:03,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 83 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 21:16:03,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2809 states. [2023-11-23 21:16:04,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2809 to 2809. [2023-11-23 21:16:04,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2809 states, 2808 states have (on average 3.3903133903133904) internal successors, (9520), 2808 states have internal predecessors, (9520), 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-11-23 21:16:04,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2809 states to 2809 states and 9520 transitions. [2023-11-23 21:16:04,078 INFO L78 Accepts]: Start accepts. Automaton has 2809 states and 9520 transitions. Word has length 14 [2023-11-23 21:16:04,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:16:04,079 INFO L495 AbstractCegarLoop]: Abstraction has 2809 states and 9520 transitions. [2023-11-23 21:16:04,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-11-23 21:16:04,079 INFO L276 IsEmpty]: Start isEmpty. Operand 2809 states and 9520 transitions. [2023-11-23 21:16:04,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-23 21:16:04,084 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:04,084 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:16:04,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 21:16:04,085 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-23 21:16:04,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:04,087 INFO L85 PathProgramCache]: Analyzing trace with hash -805372259, now seen corresponding path program 1 times [2023-11-23 21:16:04,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:04,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717640921] [2023-11-23 21:16:04,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:04,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:04,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:04,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:16:04,422 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:04,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717640921] [2023-11-23 21:16:04,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717640921] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:16:04,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:16:04,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:16:04,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564853099] [2023-11-23 21:16:04,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:16:04,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:16:04,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:16:04,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:16:04,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:16:04,426 INFO L87 Difference]: Start difference. First operand 2809 states and 9520 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-11-23 21:16:04,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:16:04,751 INFO L93 Difference]: Finished difference Result 3019 states and 10043 transitions. [2023-11-23 21:16:04,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:16:04,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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) Word has length 16 [2023-11-23 21:16:04,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:16:04,780 INFO L225 Difference]: With dead ends: 3019 [2023-11-23 21:16:04,780 INFO L226 Difference]: Without dead ends: 2529 [2023-11-23 21:16:04,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-23 21:16:04,788 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 67 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:16:04,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 81 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:16:04,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2529 states. [2023-11-23 21:16:04,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2529 to 2529. [2023-11-23 21:16:04,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2529 states, 2528 states have (on average 3.3607594936708862) internal successors, (8496), 2528 states have internal predecessors, (8496), 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-11-23 21:16:04,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2529 states to 2529 states and 8496 transitions. [2023-11-23 21:16:04,929 INFO L78 Accepts]: Start accepts. Automaton has 2529 states and 8496 transitions. Word has length 16 [2023-11-23 21:16:04,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:16:04,929 INFO L495 AbstractCegarLoop]: Abstraction has 2529 states and 8496 transitions. [2023-11-23 21:16:04,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-11-23 21:16:04,930 INFO L276 IsEmpty]: Start isEmpty. Operand 2529 states and 8496 transitions. [2023-11-23 21:16:04,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-23 21:16:04,937 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:04,937 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:16:04,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 21:16:04,938 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-23 21:16:04,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:04,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1135445404, now seen corresponding path program 1 times [2023-11-23 21:16:04,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:04,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715156752] [2023-11-23 21:16:04,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:04,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:04,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:05,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:16:05,306 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:05,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715156752] [2023-11-23 21:16:05,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715156752] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:16:05,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:16:05,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:16:05,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984173194] [2023-11-23 21:16:05,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:16:05,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:16:05,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:16:05,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:16:05,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:16:05,309 INFO L87 Difference]: Start difference. First operand 2529 states and 8496 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-11-23 21:16:05,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:16:05,641 INFO L93 Difference]: Finished difference Result 3319 states and 10973 transitions. [2023-11-23 21:16:05,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 21:16:05,642 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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) Word has length 18 [2023-11-23 21:16:05,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:16:05,658 INFO L225 Difference]: With dead ends: 3319 [2023-11-23 21:16:05,658 INFO L226 Difference]: Without dead ends: 1674 [2023-11-23 21:16:05,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-11-23 21:16:05,660 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 105 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:16:05,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 77 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:16:05,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2023-11-23 21:16:05,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 1674. [2023-11-23 21:16:05,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1674 states, 1673 states have (on average 3.231320980274955) internal successors, (5406), 1673 states have internal predecessors, (5406), 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-11-23 21:16:05,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 5406 transitions. [2023-11-23 21:16:05,733 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 5406 transitions. Word has length 18 [2023-11-23 21:16:05,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:16:05,733 INFO L495 AbstractCegarLoop]: Abstraction has 1674 states and 5406 transitions. [2023-11-23 21:16:05,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-11-23 21:16:05,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 5406 transitions. [2023-11-23 21:16:05,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-23 21:16:05,738 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:05,738 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] [2023-11-23 21:16:05,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 21:16:05,738 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-23 21:16:05,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:05,739 INFO L85 PathProgramCache]: Analyzing trace with hash 220242353, now seen corresponding path program 1 times [2023-11-23 21:16:05,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:05,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199741073] [2023-11-23 21:16:05,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:05,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:05,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:06,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:16:06,734 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:06,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199741073] [2023-11-23 21:16:06,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199741073] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:16:06,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:16:06,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:16:06,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923097932] [2023-11-23 21:16:06,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:16:06,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:16:06,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:16:06,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:16:06,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:16:06,738 INFO L87 Difference]: Start difference. First operand 1674 states and 5406 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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-11-23 21:16:07,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:16:07,032 INFO L93 Difference]: Finished difference Result 1794 states and 5712 transitions. [2023-11-23 21:16:07,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:16:07,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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) Word has length 21 [2023-11-23 21:16:07,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:16:07,048 INFO L225 Difference]: With dead ends: 1794 [2023-11-23 21:16:07,048 INFO L226 Difference]: Without dead ends: 1594 [2023-11-23 21:16:07,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-23 21:16:07,049 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 48 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:16:07,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 81 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:16:07,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2023-11-23 21:16:07,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 1594. [2023-11-23 21:16:07,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1594 states, 1593 states have (on average 3.2153170119271812) internal successors, (5122), 1593 states have internal predecessors, (5122), 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-11-23 21:16:07,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 5122 transitions. [2023-11-23 21:16:07,115 INFO L78 Accepts]: Start accepts. Automaton has 1594 states and 5122 transitions. Word has length 21 [2023-11-23 21:16:07,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:16:07,116 INFO L495 AbstractCegarLoop]: Abstraction has 1594 states and 5122 transitions. [2023-11-23 21:16:07,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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-11-23 21:16:07,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 5122 transitions. [2023-11-23 21:16:07,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-23 21:16:07,121 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:07,121 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] [2023-11-23 21:16:07,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 21:16:07,121 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-23 21:16:07,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:07,122 INFO L85 PathProgramCache]: Analyzing trace with hash 492335024, now seen corresponding path program 1 times [2023-11-23 21:16:07,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:07,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459768612] [2023-11-23 21:16:07,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:07,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:07,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:08,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:16:08,752 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:08,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459768612] [2023-11-23 21:16:08,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459768612] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:16:08,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:16:08,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 21:16:08,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767505789] [2023-11-23 21:16:08,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:16:08,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 21:16:08,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:16:08,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 21:16:08,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-23 21:16:08,762 INFO L87 Difference]: Start difference. First operand 1594 states and 5122 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 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-11-23 21:16:09,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:16:09,302 INFO L93 Difference]: Finished difference Result 2452 states and 7862 transitions. [2023-11-23 21:16:09,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 21:16:09,303 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 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) Word has length 22 [2023-11-23 21:16:09,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:16:09,319 INFO L225 Difference]: With dead ends: 2452 [2023-11-23 21:16:09,319 INFO L226 Difference]: Without dead ends: 1692 [2023-11-23 21:16:09,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2023-11-23 21:16:09,320 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 121 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 21:16:09,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 136 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 21:16:09,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1692 states. [2023-11-23 21:16:09,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1692 to 1692. [2023-11-23 21:16:09,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1692 states, 1691 states have (on average 3.1780011827321113) internal successors, (5374), 1691 states have internal predecessors, (5374), 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-11-23 21:16:09,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1692 states and 5374 transitions. [2023-11-23 21:16:09,391 INFO L78 Accepts]: Start accepts. Automaton has 1692 states and 5374 transitions. Word has length 22 [2023-11-23 21:16:09,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:16:09,392 INFO L495 AbstractCegarLoop]: Abstraction has 1692 states and 5374 transitions. [2023-11-23 21:16:09,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 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-11-23 21:16:09,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1692 states and 5374 transitions. [2023-11-23 21:16:09,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-23 21:16:09,402 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:09,402 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] [2023-11-23 21:16:09,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 21:16:09,402 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-23 21:16:09,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:09,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1803275826, now seen corresponding path program 2 times [2023-11-23 21:16:09,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:09,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59409784] [2023-11-23 21:16:09,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:09,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:09,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:10,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:16:10,209 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:10,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59409784] [2023-11-23 21:16:10,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59409784] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:16:10,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:16:10,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 21:16:10,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713933210] [2023-11-23 21:16:10,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:16:10,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 21:16:10,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:16:10,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 21:16:10,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 21:16:10,211 INFO L87 Difference]: Start difference. First operand 1692 states and 5374 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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-11-23 21:16:10,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:16:10,496 INFO L93 Difference]: Finished difference Result 2546 states and 8094 transitions. [2023-11-23 21:16:10,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:16:10,496 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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) Word has length 22 [2023-11-23 21:16:10,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:16:10,523 INFO L225 Difference]: With dead ends: 2546 [2023-11-23 21:16:10,524 INFO L226 Difference]: Without dead ends: 1706 [2023-11-23 21:16:10,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-11-23 21:16:10,525 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 60 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:16:10,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 73 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:16:10,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2023-11-23 21:16:10,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1612. [2023-11-23 21:16:10,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1612 states, 1611 states have (on average 3.1719428926132838) internal successors, (5110), 1611 states have internal predecessors, (5110), 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-11-23 21:16:10,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 5110 transitions. [2023-11-23 21:16:10,597 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 5110 transitions. Word has length 22 [2023-11-23 21:16:10,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:16:10,597 INFO L495 AbstractCegarLoop]: Abstraction has 1612 states and 5110 transitions. [2023-11-23 21:16:10,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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-11-23 21:16:10,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 5110 transitions. [2023-11-23 21:16:10,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-23 21:16:10,602 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:10,603 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] [2023-11-23 21:16:10,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 21:16:10,603 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-23 21:16:10,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:10,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1071915064, now seen corresponding path program 3 times [2023-11-23 21:16:10,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:10,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481529246] [2023-11-23 21:16:10,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:10,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:10,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:11,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:16:11,046 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:11,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481529246] [2023-11-23 21:16:11,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481529246] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:16:11,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:16:11,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:16:11,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904928718] [2023-11-23 21:16:11,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:16:11,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:16:11,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:16:11,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:16:11,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:16:11,049 INFO L87 Difference]: Start difference. First operand 1612 states and 5110 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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-11-23 21:16:11,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:16:11,262 INFO L93 Difference]: Finished difference Result 2246 states and 7060 transitions. [2023-11-23 21:16:11,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:16:11,263 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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) Word has length 22 [2023-11-23 21:16:11,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:16:11,269 INFO L225 Difference]: With dead ends: 2246 [2023-11-23 21:16:11,270 INFO L226 Difference]: Without dead ends: 1316 [2023-11-23 21:16:11,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-23 21:16:11,272 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 51 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:16:11,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 75 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:16:11,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2023-11-23 21:16:11,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1316. [2023-11-23 21:16:11,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 1315 states have (on average 3.0950570342205324) internal successors, (4070), 1315 states have internal predecessors, (4070), 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-11-23 21:16:11,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 4070 transitions. [2023-11-23 21:16:11,326 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 4070 transitions. Word has length 22 [2023-11-23 21:16:11,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:16:11,328 INFO L495 AbstractCegarLoop]: Abstraction has 1316 states and 4070 transitions. [2023-11-23 21:16:11,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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-11-23 21:16:11,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 4070 transitions. [2023-11-23 21:16:11,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-23 21:16:11,332 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:11,332 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] [2023-11-23 21:16:11,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 21:16:11,332 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-23 21:16:11,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:11,334 INFO L85 PathProgramCache]: Analyzing trace with hash -271511748, now seen corresponding path program 4 times [2023-11-23 21:16:11,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:11,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192264606] [2023-11-23 21:16:11,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:11,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:11,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:12,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:16:12,392 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:12,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192264606] [2023-11-23 21:16:12,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192264606] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:16:12,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:16:12,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 21:16:12,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261087534] [2023-11-23 21:16:12,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:16:12,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 21:16:12,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:16:12,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 21:16:12,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-23 21:16:12,396 INFO L87 Difference]: Start difference. First operand 1316 states and 4070 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 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-11-23 21:16:12,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:16:12,922 INFO L93 Difference]: Finished difference Result 1626 states and 4958 transitions. [2023-11-23 21:16:12,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:16:12,923 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 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) Word has length 22 [2023-11-23 21:16:12,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:16:12,929 INFO L225 Difference]: With dead ends: 1626 [2023-11-23 21:16:12,929 INFO L226 Difference]: Without dead ends: 1346 [2023-11-23 21:16:12,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2023-11-23 21:16:12,932 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 104 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 21:16:12,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 129 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 21:16:12,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2023-11-23 21:16:12,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1321. [2023-11-23 21:16:12,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1320 states have (on average 3.0901515151515153) internal successors, (4079), 1320 states have internal predecessors, (4079), 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-11-23 21:16:12,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 4079 transitions. [2023-11-23 21:16:12,987 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 4079 transitions. Word has length 22 [2023-11-23 21:16:12,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:16:12,988 INFO L495 AbstractCegarLoop]: Abstraction has 1321 states and 4079 transitions. [2023-11-23 21:16:12,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 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-11-23 21:16:12,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 4079 transitions. [2023-11-23 21:16:12,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-23 21:16:12,992 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:12,992 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] [2023-11-23 21:16:12,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 21:16:12,993 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-23 21:16:12,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:12,994 INFO L85 PathProgramCache]: Analyzing trace with hash -618007132, now seen corresponding path program 5 times [2023-11-23 21:16:12,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:12,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159255952] [2023-11-23 21:16:12,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:12,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:13,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:14,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:16:14,538 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:14,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159255952] [2023-11-23 21:16:14,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159255952] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:16:14,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:16:14,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 21:16:14,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616963870] [2023-11-23 21:16:14,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:16:14,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 21:16:14,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:16:14,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 21:16:14,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-23 21:16:14,541 INFO L87 Difference]: Start difference. First operand 1321 states and 4079 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 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-11-23 21:16:14,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:16:14,983 INFO L93 Difference]: Finished difference Result 1704 states and 5186 transitions. [2023-11-23 21:16:14,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 21:16:14,984 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 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) Word has length 22 [2023-11-23 21:16:14,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:16:14,992 INFO L225 Difference]: With dead ends: 1704 [2023-11-23 21:16:14,992 INFO L226 Difference]: Without dead ends: 1424 [2023-11-23 21:16:14,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2023-11-23 21:16:14,994 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 89 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 21:16:14,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 136 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 21:16:14,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2023-11-23 21:16:15,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 1280. [2023-11-23 21:16:15,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1279 states have (on average 3.09147771696638) internal successors, (3954), 1279 states have internal predecessors, (3954), 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-11-23 21:16:15,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 3954 transitions. [2023-11-23 21:16:15,044 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 3954 transitions. Word has length 22 [2023-11-23 21:16:15,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:16:15,044 INFO L495 AbstractCegarLoop]: Abstraction has 1280 states and 3954 transitions. [2023-11-23 21:16:15,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 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-11-23 21:16:15,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 3954 transitions. [2023-11-23 21:16:15,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-23 21:16:15,049 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:15,049 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] [2023-11-23 21:16:15,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 21:16:15,049 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-23 21:16:15,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:15,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1395507893, now seen corresponding path program 1 times [2023-11-23 21:16:15,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:15,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895316761] [2023-11-23 21:16:15,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:15,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:15,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:16:15,779 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:15,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895316761] [2023-11-23 21:16:15,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895316761] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:16:15,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:16:15,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 21:16:15,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277965091] [2023-11-23 21:16:15,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:16:15,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 21:16:15,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:16:15,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 21:16:15,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-23 21:16:15,782 INFO L87 Difference]: Start difference. First operand 1280 states and 3954 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 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-11-23 21:16:16,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:16:16,112 INFO L93 Difference]: Finished difference Result 1932 states and 5932 transitions. [2023-11-23 21:16:16,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:16:16,112 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 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) Word has length 23 [2023-11-23 21:16:16,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:16:16,117 INFO L225 Difference]: With dead ends: 1932 [2023-11-23 21:16:16,118 INFO L226 Difference]: Without dead ends: 1251 [2023-11-23 21:16:16,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-11-23 21:16:16,119 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 142 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 21:16:16,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 108 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 21:16:16,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2023-11-23 21:16:16,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1251. [2023-11-23 21:16:16,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1251 states, 1250 states have (on average 3.0832) internal successors, (3854), 1250 states have internal predecessors, (3854), 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-11-23 21:16:16,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 3854 transitions. [2023-11-23 21:16:16,164 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 3854 transitions. Word has length 23 [2023-11-23 21:16:16,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:16:16,165 INFO L495 AbstractCegarLoop]: Abstraction has 1251 states and 3854 transitions. [2023-11-23 21:16:16,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 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-11-23 21:16:16,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 3854 transitions. [2023-11-23 21:16:16,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-23 21:16:16,169 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:16,169 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] [2023-11-23 21:16:16,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 21:16:16,170 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-23 21:16:16,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:16,170 INFO L85 PathProgramCache]: Analyzing trace with hash 64639279, now seen corresponding path program 2 times [2023-11-23 21:16:16,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:16,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846383039] [2023-11-23 21:16:16,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:16,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:16,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:16:16,986 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:16,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846383039] [2023-11-23 21:16:16,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846383039] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:16:16,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:16:16,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 21:16:16,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708119055] [2023-11-23 21:16:16,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:16:16,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 21:16:16,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:16:16,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 21:16:16,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-23 21:16:16,989 INFO L87 Difference]: Start difference. First operand 1251 states and 3854 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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-11-23 21:16:17,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:16:17,393 INFO L93 Difference]: Finished difference Result 1607 states and 4936 transitions. [2023-11-23 21:16:17,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 21:16:17,393 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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) Word has length 23 [2023-11-23 21:16:17,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:16:17,399 INFO L225 Difference]: With dead ends: 1607 [2023-11-23 21:16:17,400 INFO L226 Difference]: Without dead ends: 1407 [2023-11-23 21:16:17,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-11-23 21:16:17,401 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 92 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 21:16:17,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 140 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 21:16:17,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2023-11-23 21:16:17,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 1319. [2023-11-23 21:16:17,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 1318 states have (on average 3.080424886191199) internal successors, (4060), 1318 states have internal predecessors, (4060), 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-11-23 21:16:17,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 4060 transitions. [2023-11-23 21:16:17,448 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 4060 transitions. Word has length 23 [2023-11-23 21:16:17,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:16:17,448 INFO L495 AbstractCegarLoop]: Abstraction has 1319 states and 4060 transitions. [2023-11-23 21:16:17,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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-11-23 21:16:17,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 4060 transitions. [2023-11-23 21:16:17,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-23 21:16:17,453 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:17,453 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] [2023-11-23 21:16:17,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-23 21:16:17,453 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-23 21:16:17,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:17,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1640336757, now seen corresponding path program 1 times [2023-11-23 21:16:17,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:17,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517573437] [2023-11-23 21:16:17,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:17,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:17,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:16:17,694 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:17,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517573437] [2023-11-23 21:16:17,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517573437] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:16:17,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:16:17,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 21:16:17,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101680035] [2023-11-23 21:16:17,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:16:17,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 21:16:17,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:16:17,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 21:16:17,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 21:16:17,696 INFO L87 Difference]: Start difference. First operand 1319 states and 4060 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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-11-23 21:16:17,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:16:17,810 INFO L93 Difference]: Finished difference Result 1190 states and 3518 transitions. [2023-11-23 21:16:17,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 21:16:17,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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) Word has length 24 [2023-11-23 21:16:17,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:16:17,814 INFO L225 Difference]: With dead ends: 1190 [2023-11-23 21:16:17,814 INFO L226 Difference]: Without dead ends: 1018 [2023-11-23 21:16:17,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-11-23 21:16:17,815 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 48 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:16:17,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 23 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:16:17,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2023-11-23 21:16:17,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 1018. [2023-11-23 21:16:17,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 1017 states have (on average 3.0137659783677484) internal successors, (3065), 1017 states have internal predecessors, (3065), 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-11-23 21:16:17,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 3065 transitions. [2023-11-23 21:16:17,847 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 3065 transitions. Word has length 24 [2023-11-23 21:16:17,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:16:17,848 INFO L495 AbstractCegarLoop]: Abstraction has 1018 states and 3065 transitions. [2023-11-23 21:16:17,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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-11-23 21:16:17,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 3065 transitions. [2023-11-23 21:16:17,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-23 21:16:17,851 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:17,852 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] [2023-11-23 21:16:17,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-23 21:16:17,852 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-23 21:16:17,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:17,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1421746058, now seen corresponding path program 1 times [2023-11-23 21:16:17,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:17,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444696971] [2023-11-23 21:16:17,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:17,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:18,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:16:18,078 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:18,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444696971] [2023-11-23 21:16:18,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444696971] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:16:18,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:16:18,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:16:18,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594236310] [2023-11-23 21:16:18,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:16:18,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:16:18,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:16:18,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:16:18,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:16:18,081 INFO L87 Difference]: Start difference. First operand 1018 states and 3065 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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-11-23 21:16:18,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:16:18,224 INFO L93 Difference]: Finished difference Result 822 states and 2315 transitions. [2023-11-23 21:16:18,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 21:16:18,225 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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) Word has length 25 [2023-11-23 21:16:18,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:16:18,227 INFO L225 Difference]: With dead ends: 822 [2023-11-23 21:16:18,228 INFO L226 Difference]: Without dead ends: 700 [2023-11-23 21:16:18,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-23 21:16:18,228 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 78 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:16:18,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 21 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:16:18,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2023-11-23 21:16:18,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 688. [2023-11-23 21:16:18,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 687 states have (on average 2.8122270742358078) internal successors, (1932), 687 states have internal predecessors, (1932), 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-11-23 21:16:18,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1932 transitions. [2023-11-23 21:16:18,250 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1932 transitions. Word has length 25 [2023-11-23 21:16:18,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:16:18,251 INFO L495 AbstractCegarLoop]: Abstraction has 688 states and 1932 transitions. [2023-11-23 21:16:18,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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-11-23 21:16:18,251 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1932 transitions. [2023-11-23 21:16:18,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-23 21:16:18,253 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:18,253 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] [2023-11-23 21:16:18,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-23 21:16:18,254 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-23 21:16:18,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:18,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1596426871, now seen corresponding path program 1 times [2023-11-23 21:16:18,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:18,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341006135] [2023-11-23 21:16:18,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:18,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:18,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:18,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:16:18,825 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:18,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341006135] [2023-11-23 21:16:18,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341006135] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:16:18,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:16:18,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 21:16:18,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838888302] [2023-11-23 21:16:18,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:16:18,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 21:16:18,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:16:18,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 21:16:18,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-23 21:16:18,828 INFO L87 Difference]: Start difference. First operand 688 states and 1932 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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-11-23 21:16:19,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:16:19,143 INFO L93 Difference]: Finished difference Result 1020 states and 2873 transitions. [2023-11-23 21:16:19,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 21:16:19,144 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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) Word has length 27 [2023-11-23 21:16:19,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:16:19,147 INFO L225 Difference]: With dead ends: 1020 [2023-11-23 21:16:19,147 INFO L226 Difference]: Without dead ends: 688 [2023-11-23 21:16:19,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-11-23 21:16:19,149 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 42 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 21:16:19,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 150 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 21:16:19,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2023-11-23 21:16:19,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 688. [2023-11-23 21:16:19,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 687 states have (on average 2.7991266375545854) internal successors, (1923), 687 states have internal predecessors, (1923), 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-11-23 21:16:19,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1923 transitions. [2023-11-23 21:16:19,173 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1923 transitions. Word has length 27 [2023-11-23 21:16:19,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:16:19,173 INFO L495 AbstractCegarLoop]: Abstraction has 688 states and 1923 transitions. [2023-11-23 21:16:19,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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-11-23 21:16:19,174 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1923 transitions. [2023-11-23 21:16:19,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-23 21:16:19,176 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:19,176 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] [2023-11-23 21:16:19,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-23 21:16:19,177 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-23 21:16:19,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:19,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1383341013, now seen corresponding path program 2 times [2023-11-23 21:16:19,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:19,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489132502] [2023-11-23 21:16:19,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:19,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:19,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:16:19,433 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:19,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489132502] [2023-11-23 21:16:19,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489132502] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:16:19,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:16:19,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:16:19,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793488637] [2023-11-23 21:16:19,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:16:19,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:16:19,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:16:19,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:16:19,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:16:19,436 INFO L87 Difference]: Start difference. First operand 688 states and 1923 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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-11-23 21:16:19,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:16:19,598 INFO L93 Difference]: Finished difference Result 520 states and 1407 transitions. [2023-11-23 21:16:19,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:16:19,598 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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) Word has length 27 [2023-11-23 21:16:19,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:16:19,600 INFO L225 Difference]: With dead ends: 520 [2023-11-23 21:16:19,600 INFO L226 Difference]: Without dead ends: 472 [2023-11-23 21:16:19,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-11-23 21:16:19,601 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 91 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:16:19,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 21 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:16:19,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2023-11-23 21:16:19,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 454. [2023-11-23 21:16:19,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 2.7019867549668874) internal successors, (1224), 453 states have internal predecessors, (1224), 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-11-23 21:16:19,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 1224 transitions. [2023-11-23 21:16:19,616 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 1224 transitions. Word has length 27 [2023-11-23 21:16:19,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:16:19,616 INFO L495 AbstractCegarLoop]: Abstraction has 454 states and 1224 transitions. [2023-11-23 21:16:19,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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-11-23 21:16:19,616 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 1224 transitions. [2023-11-23 21:16:19,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-23 21:16:19,618 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:19,618 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] [2023-11-23 21:16:19,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-23 21:16:19,619 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-23 21:16:19,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:19,619 INFO L85 PathProgramCache]: Analyzing trace with hash -239007628, now seen corresponding path program 1 times [2023-11-23 21:16:19,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:19,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798946565] [2023-11-23 21:16:19,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:19,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:19,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:16:22,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:16:22,155 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:16:22,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798946565] [2023-11-23 21:16:22,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798946565] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:16:22,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:16:22,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-23 21:16:22,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655425340] [2023-11-23 21:16:22,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:16:22,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-23 21:16:22,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:16:22,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-23 21:16:22,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-11-23 21:16:22,159 INFO L87 Difference]: Start difference. First operand 454 states and 1224 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:16:22,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:16:22,673 INFO L93 Difference]: Finished difference Result 668 states and 1794 transitions. [2023-11-23 21:16:22,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 21:16:22,674 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-11-23 21:16:22,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:16:22,675 INFO L225 Difference]: With dead ends: 668 [2023-11-23 21:16:22,675 INFO L226 Difference]: Without dead ends: 280 [2023-11-23 21:16:22,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2023-11-23 21:16:22,676 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 66 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 21:16:22,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 149 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 21:16:22,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2023-11-23 21:16:22,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2023-11-23 21:16:22,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 279 states have (on average 2.5161290322580645) internal successors, (702), 279 states have internal predecessors, (702), 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-11-23 21:16:22,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 702 transitions. [2023-11-23 21:16:22,685 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 702 transitions. Word has length 29 [2023-11-23 21:16:22,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:16:22,685 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 702 transitions. [2023-11-23 21:16:22,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:16:22,686 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 702 transitions. [2023-11-23 21:16:22,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-23 21:16:22,687 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:16:22,687 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] [2023-11-23 21:16:22,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-23 21:16:22,688 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-23 21:16:22,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:16:22,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1214710220, now seen corresponding path program 2 times [2023-11-23 21:16:22,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:16:22,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915194136] [2023-11-23 21:16:22,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:16:22,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:16:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 21:16:22,764 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 21:16:22,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 21:16:22,873 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-23 21:16:22,873 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-23 21:16:22,874 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-23 21:16:22,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-23 21:16:22,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-23 21:16:22,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-23 21:16:22,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-23 21:16:22,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-23 21:16:22,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-23 21:16:22,882 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:16:22,888 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-23 21:16:22,888 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 21:16:22,983 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-23 21:16:22,992 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-23 21:16:22,999 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-23 21:16:23,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 09:16:23 BasicIcfg [2023-11-23 21:16:23,039 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 21:16:23,039 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 21:16:23,039 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 21:16:23,040 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 21:16:23,040 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:16:00" (3/4) ... [2023-11-23 21:16:23,041 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-23 21:16:23,070 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-23 21:16:23,072 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-23 21:16:23,073 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-23 21:16:23,177 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b57fa33-5bb4-49aa-a9d7-d780fccc9435/bin/utaipan-verify-mE87zJ7Ire/witness.graphml [2023-11-23 21:16:23,178 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 21:16:23,179 INFO L158 Benchmark]: Toolchain (without parser) took 24967.62ms. Allocated memory was 169.9MB in the beginning and 660.6MB in the end (delta: 490.7MB). Free memory was 127.4MB in the beginning and 406.8MB in the end (delta: -279.3MB). Peak memory consumption was 211.4MB. Max. memory is 16.1GB. [2023-11-23 21:16:23,179 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 113.2MB. Free memory is still 79.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 21:16:23,180 INFO L158 Benchmark]: CACSL2BoogieTranslator took 750.83ms. Allocated memory is still 169.9MB. Free memory was 127.1MB in the beginning and 119.2MB in the end (delta: 7.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-23 21:16:23,180 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.17ms. Allocated memory is still 169.9MB. Free memory was 119.2MB in the beginning and 116.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-23 21:16:23,181 INFO L158 Benchmark]: Boogie Preprocessor took 43.95ms. Allocated memory is still 169.9MB. Free memory was 116.1MB in the beginning and 114.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 21:16:23,181 INFO L158 Benchmark]: RCFGBuilder took 1041.78ms. Allocated memory is still 169.9MB. Free memory was 114.0MB in the beginning and 51.1MB in the end (delta: 62.9MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2023-11-23 21:16:23,182 INFO L158 Benchmark]: TraceAbstraction took 22908.26ms. Allocated memory was 169.9MB in the beginning and 660.6MB in the end (delta: 490.7MB). Free memory was 50.3MB in the beginning and 419.3MB in the end (delta: -369.0MB). Peak memory consumption was 124.5MB. Max. memory is 16.1GB. [2023-11-23 21:16:23,182 INFO L158 Benchmark]: Witness Printer took 138.50ms. Allocated memory is still 660.6MB. Free memory was 419.3MB in the beginning and 406.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-23 21:16:23,189 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.28ms. Allocated memory is still 113.2MB. Free memory is still 79.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 750.83ms. Allocated memory is still 169.9MB. Free memory was 127.1MB in the beginning and 119.2MB in the end (delta: 7.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.17ms. Allocated memory is still 169.9MB. Free memory was 119.2MB in the beginning and 116.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.95ms. Allocated memory is still 169.9MB. Free memory was 116.1MB in the beginning and 114.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1041.78ms. Allocated memory is still 169.9MB. Free memory was 114.0MB in the beginning and 51.1MB in the end (delta: 62.9MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. * TraceAbstraction took 22908.26ms. Allocated memory was 169.9MB in the beginning and 660.6MB in the end (delta: 490.7MB). Free memory was 50.3MB in the beginning and 419.3MB in the end (delta: -369.0MB). Peak memory consumption was 124.5MB. Max. memory is 16.1GB. * Witness Printer took 138.50ms. Allocated memory is still 660.6MB. Free memory was 419.3MB in the beginning and 406.8MB in the end (delta: 12.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: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1849; [L847] FCALL, FORK 0 pthread_create(&t1849, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1849={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L848] 0 pthread_t t1850; [L743] 1 y$w_buff1 = y$w_buff0 [L744] 1 y$w_buff0 = 2 [L745] 1 y$w_buff1_used = y$w_buff0_used [L746] 1 y$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L748] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L749] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L750] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L751] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L752] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L849] FCALL, FORK 0 pthread_create(&t1850, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1849={5:0}, t1850={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L850] 0 pthread_t t1851; [L851] FCALL, FORK 0 pthread_create(&t1851, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1849={5:0}, t1850={6:0}, t1851={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L772] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 y$flush_delayed = weak$$choice2 [L795] 3 y$mem_tmp = y [L796] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L797] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L798] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L799] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L800] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L802] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EAX = y [L804] 3 y = y$flush_delayed ? y$mem_tmp : y [L805] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L808] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 3 y$flush_delayed = weak$$choice2 [L811] 3 y$mem_tmp = y [L812] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L813] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L814] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L815] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L816] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L818] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 __unbuffered_p2_EBX = y [L820] 3 y = y$flush_delayed ? y$mem_tmp : y [L821] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L824] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L825] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L826] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L827] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L828] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L831] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L758] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L760] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L761] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L762] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L778] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L779] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L780] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L781] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L782] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1849={5:0}, t1850={6:0}, t1851={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1849={5:0}, t1850={6:0}, t1851={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 y$flush_delayed = weak$$choice2 [L867] 0 y$mem_tmp = y [L868] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L869] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L870] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L871] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L872] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L874] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L876] 0 y = y$flush_delayed ? y$mem_tmp : y [L877] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1849={5:0}, t1850={6:0}, t1851={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 64 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 22.6s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.1s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1317 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1317 mSDsluCounter, 1507 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1152 mSDsCounter, 104 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2809 IncrementalHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 104 mSolverCounterUnsat, 355 mSDtfsCounter, 2809 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3952occurred in iteration=0, InterpolantAutomatonStates: 117, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 381 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 13.7s InterpolantComputationTime, 390 NumberOfCodeBlocks, 390 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 344 ConstructedInterpolants, 0 QuantifiedInterpolants, 3672 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-23 21:16:23,242 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b57fa33-5bb4-49aa-a9d7-d780fccc9435/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE