./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix040_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53d23585-9840-430a-8ad3-93efc3049886/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53d23585-9840-430a-8ad3-93efc3049886/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53d23585-9840-430a-8ad3-93efc3049886/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53d23585-9840-430a-8ad3-93efc3049886/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix040_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53d23585-9840-430a-8ad3-93efc3049886/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53d23585-9840-430a-8ad3-93efc3049886/bin/uautomizer-verify-4GaUIPS5ZU --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 26c011a0e45020881b0eb90c07839ec48e6b26942e49028568b078c64e0cf722 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:19:32,087 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:19:32,186 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53d23585-9840-430a-8ad3-93efc3049886/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:19:32,194 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:19:32,194 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:19:32,223 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:19:32,223 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:19:32,224 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:19:32,225 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:19:32,225 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:19:32,226 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:19:32,227 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:19:32,227 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:19:32,228 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:19:32,229 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:19:32,229 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:19:32,230 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:19:32,230 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:19:32,231 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:19:32,231 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:19:32,232 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:19:32,236 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:19:32,237 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:19:32,237 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:19:32,238 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:19:32,238 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:19:32,239 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:19:32,239 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:19:32,244 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:19:32,244 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:19:32,245 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:19:32,245 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:19:32,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:19:32,249 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:19:32,249 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:19:32,250 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:19:32,250 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:19:32,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:19:32,252 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:19:32,252 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:19:32,253 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:19:32,254 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:19:32,254 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_53d23585-9840-430a-8ad3-93efc3049886/bin/uautomizer-verify-4GaUIPS5ZU/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_53d23585-9840-430a-8ad3-93efc3049886/bin/uautomizer-verify-4GaUIPS5ZU 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 -> Automizer 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 -> 26c011a0e45020881b0eb90c07839ec48e6b26942e49028568b078c64e0cf722 [2024-10-31 22:19:32,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:19:32,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:19:32,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:19:32,615 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:19:32,615 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:19:32,617 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53d23585-9840-430a-8ad3-93efc3049886/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/pthread-wmm/mix040_tso.oepc.i Unable to find full path for "g++" [2024-10-31 22:19:34,763 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:19:35,051 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:19:35,055 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53d23585-9840-430a-8ad3-93efc3049886/sv-benchmarks/c/pthread-wmm/mix040_tso.oepc.i [2024-10-31 22:19:35,081 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53d23585-9840-430a-8ad3-93efc3049886/bin/uautomizer-verify-4GaUIPS5ZU/data/857783593/a0ba34ccd3ac466e978d1caabcd81c6e/FLAG60add37ef [2024-10-31 22:19:35,098 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53d23585-9840-430a-8ad3-93efc3049886/bin/uautomizer-verify-4GaUIPS5ZU/data/857783593/a0ba34ccd3ac466e978d1caabcd81c6e [2024-10-31 22:19:35,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:19:35,102 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:19:35,104 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:19:35,104 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:19:35,112 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:19:35,113 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:19:35" (1/1) ... [2024-10-31 22:19:35,116 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32add24a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:35, skipping insertion in model container [2024-10-31 22:19:35,116 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:19:35" (1/1) ... [2024-10-31 22:19:35,177 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:19:35,416 WARN L251 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_53d23585-9840-430a-8ad3-93efc3049886/sv-benchmarks/c/pthread-wmm/mix040_tso.oepc.i[949,962] [2024-10-31 22:19:35,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:19:35,762 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:19:35,778 WARN L251 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_53d23585-9840-430a-8ad3-93efc3049886/sv-benchmarks/c/pthread-wmm/mix040_tso.oepc.i[949,962] [2024-10-31 22:19:35,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:19:35,872 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:19:35,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:35 WrapperNode [2024-10-31 22:19:35,873 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:19:35,874 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:19:35,874 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:19:35,874 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:19:35,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:35" (1/1) ... [2024-10-31 22:19:35,914 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:35" (1/1) ... [2024-10-31 22:19:35,959 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2024-10-31 22:19:35,974 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:19:35,975 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:19:35,975 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:19:35,975 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:19:36,001 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:35" (1/1) ... [2024-10-31 22:19:36,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:35" (1/1) ... [2024-10-31 22:19:36,007 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:35" (1/1) ... [2024-10-31 22:19:36,035 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-31 22:19:36,036 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:35" (1/1) ... [2024-10-31 22:19:36,036 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:35" (1/1) ... [2024-10-31 22:19:36,051 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:35" (1/1) ... [2024-10-31 22:19:36,053 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:35" (1/1) ... [2024-10-31 22:19:36,059 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:35" (1/1) ... [2024-10-31 22:19:36,061 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:35" (1/1) ... [2024-10-31 22:19:36,071 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:19:36,075 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:19:36,078 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:19:36,078 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:19:36,079 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:35" (1/1) ... [2024-10-31 22:19:36,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:19:36,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53d23585-9840-430a-8ad3-93efc3049886/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:19:36,119 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53d23585-9840-430a-8ad3-93efc3049886/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:19:36,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53d23585-9840-430a-8ad3-93efc3049886/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:19:36,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-31 22:19:36,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:19:36,170 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-31 22:19:36,170 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-31 22:19:36,171 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-31 22:19:36,171 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-31 22:19:36,171 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-31 22:19:36,171 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-31 22:19:36,171 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-10-31 22:19:36,171 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-10-31 22:19:36,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:19:36,172 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-31 22:19:36,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:19:36,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:19:36,174 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-31 22:19:36,386 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:19:36,389 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:19:36,841 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-31 22:19:36,841 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:19:37,142 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:19:37,142 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-31 22:19:37,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:19:37 BoogieIcfgContainer [2024-10-31 22:19:37,143 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:19:37,147 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:19:37,147 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:19:37,151 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:19:37,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:19:35" (1/3) ... [2024-10-31 22:19:37,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@360d458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:19:37, skipping insertion in model container [2024-10-31 22:19:37,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:35" (2/3) ... [2024-10-31 22:19:37,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@360d458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:19:37, skipping insertion in model container [2024-10-31 22:19:37,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:19:37" (3/3) ... [2024-10-31 22:19:37,158 INFO L112 eAbstractionObserver]: Analyzing ICFG mix040_tso.oepc.i [2024-10-31 22:19:37,178 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:19:37,178 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-31 22:19:37,178 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-31 22:19:37,245 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-31 22:19:37,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 50 transitions, 116 flow [2024-10-31 22:19:37,335 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2024-10-31 22:19:37,336 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:19:37,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 1/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 101 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2024-10-31 22:19:37,339 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 50 transitions, 116 flow [2024-10-31 22:19:37,346 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 46 transitions, 104 flow [2024-10-31 22:19:37,358 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:19:37,367 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, 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;@4059e825, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:19:37,368 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-31 22:19:37,378 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 22:19:37,380 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2024-10-31 22:19:37,380 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:19:37,381 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:37,381 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:37,382 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-31 22:19:37,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:37,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1366491271, now seen corresponding path program 1 times [2024-10-31 22:19:37,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:37,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989005509] [2024-10-31 22:19:37,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:37,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:38,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:38,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:38,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989005509] [2024-10-31 22:19:38,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989005509] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:38,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:38,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-31 22:19:38,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938048342] [2024-10-31 22:19:38,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:38,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:38,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:38,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:38,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:38,061 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 50 [2024-10-31 22:19:38,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:38,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:38,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 50 [2024-10-31 22:19:38,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:39,019 INFO L124 PetriNetUnfolderBase]: 1339/2269 cut-off events. [2024-10-31 22:19:39,019 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-10-31 22:19:39,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4249 conditions, 2269 events. 1339/2269 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 15221 event pairs, 412 based on Foata normal form. 72/2253 useless extension candidates. Maximal degree in co-relation 4237. Up to 1510 conditions per place. [2024-10-31 22:19:39,058 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 31 selfloop transitions, 2 changer transitions 2/57 dead transitions. [2024-10-31 22:19:39,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 57 transitions, 199 flow [2024-10-31 22:19:39,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:39,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:19:39,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2024-10-31 22:19:39,099 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7733333333333333 [2024-10-31 22:19:39,106 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 116 transitions. [2024-10-31 22:19:39,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 57 transitions, 199 flow [2024-10-31 22:19:39,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 57 transitions, 194 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-31 22:19:39,126 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 98 flow [2024-10-31 22:19:39,129 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2024-10-31 22:19:39,134 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2024-10-31 22:19:39,134 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 98 flow [2024-10-31 22:19:39,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:39,135 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:39,135 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:39,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:19:39,136 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-31 22:19:39,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:39,137 INFO L85 PathProgramCache]: Analyzing trace with hash -2133956667, now seen corresponding path program 1 times [2024-10-31 22:19:39,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:39,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615887638] [2024-10-31 22:19:39,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:39,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:39,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:39,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:39,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615887638] [2024-10-31 22:19:39,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615887638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:39,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:39,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:39,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021362878] [2024-10-31 22:19:39,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:39,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:19:39,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:39,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:19:39,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:19:39,654 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 50 [2024-10-31 22:19:39,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:39,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:39,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 50 [2024-10-31 22:19:39,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:41,339 INFO L124 PetriNetUnfolderBase]: 5293/8029 cut-off events. [2024-10-31 22:19:41,339 INFO L125 PetriNetUnfolderBase]: For 388/388 co-relation queries the response was YES. [2024-10-31 22:19:41,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15877 conditions, 8029 events. 5293/8029 cut-off events. For 388/388 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 55661 event pairs, 663 based on Foata normal form. 240/7954 useless extension candidates. Maximal degree in co-relation 15867. Up to 4461 conditions per place. [2024-10-31 22:19:41,401 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 47 selfloop transitions, 6 changer transitions 1/71 dead transitions. [2024-10-31 22:19:41,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 71 transitions, 272 flow [2024-10-31 22:19:41,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:19:41,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-31 22:19:41,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 140 transitions. [2024-10-31 22:19:41,405 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7 [2024-10-31 22:19:41,405 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 4 states and 140 transitions. [2024-10-31 22:19:41,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 71 transitions, 272 flow [2024-10-31 22:19:41,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 71 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:19:41,411 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 136 flow [2024-10-31 22:19:41,412 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2024-10-31 22:19:41,412 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, -1 predicate places. [2024-10-31 22:19:41,413 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 136 flow [2024-10-31 22:19:41,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:41,413 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:41,413 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:41,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:19:41,414 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-31 22:19:41,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:41,415 INFO L85 PathProgramCache]: Analyzing trace with hash -69719143, now seen corresponding path program 1 times [2024-10-31 22:19:41,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:41,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602616041] [2024-10-31 22:19:41,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:41,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:41,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:41,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:41,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:41,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602616041] [2024-10-31 22:19:41,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602616041] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:41,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:41,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:19:41,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334182658] [2024-10-31 22:19:41,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:41,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:19:41,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:41,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:19:41,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:19:41,743 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 50 [2024-10-31 22:19:41,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:41,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:41,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 50 [2024-10-31 22:19:41,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:43,312 INFO L124 PetriNetUnfolderBase]: 4321/6597 cut-off events. [2024-10-31 22:19:43,312 INFO L125 PetriNetUnfolderBase]: For 1765/1765 co-relation queries the response was YES. [2024-10-31 22:19:43,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15147 conditions, 6597 events. 4321/6597 cut-off events. For 1765/1765 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 43660 event pairs, 293 based on Foata normal form. 228/6595 useless extension candidates. Maximal degree in co-relation 15135. Up to 3201 conditions per place. [2024-10-31 22:19:43,372 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 60 selfloop transitions, 10 changer transitions 1/88 dead transitions. [2024-10-31 22:19:43,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 88 transitions, 389 flow [2024-10-31 22:19:43,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:19:43,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-31 22:19:43,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 178 transitions. [2024-10-31 22:19:43,374 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.712 [2024-10-31 22:19:43,374 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 136 flow. Second operand 5 states and 178 transitions. [2024-10-31 22:19:43,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 88 transitions, 389 flow [2024-10-31 22:19:43,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 88 transitions, 378 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-31 22:19:43,380 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 188 flow [2024-10-31 22:19:43,380 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2024-10-31 22:19:43,381 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 3 predicate places. [2024-10-31 22:19:43,381 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 188 flow [2024-10-31 22:19:43,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:43,382 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:43,382 INFO L204 CegarLoopForPetriNet]: 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] [2024-10-31 22:19:43,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:19:43,383 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-31 22:19:43,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:43,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1901438337, now seen corresponding path program 1 times [2024-10-31 22:19:43,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:43,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133280754] [2024-10-31 22:19:43,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:43,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:43,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:43,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:43,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133280754] [2024-10-31 22:19:43,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133280754] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:43,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:43,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:19:43,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912393731] [2024-10-31 22:19:43,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:43,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:19:43,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:43,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:19:43,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:19:43,726 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 50 [2024-10-31 22:19:43,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:43,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:43,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 50 [2024-10-31 22:19:43,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:44,664 INFO L124 PetriNetUnfolderBase]: 2837/4321 cut-off events. [2024-10-31 22:19:44,665 INFO L125 PetriNetUnfolderBase]: For 3619/3619 co-relation queries the response was YES. [2024-10-31 22:19:44,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11219 conditions, 4321 events. 2837/4321 cut-off events. For 3619/3619 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 25406 event pairs, 137 based on Foata normal form. 172/4368 useless extension candidates. Maximal degree in co-relation 11205. Up to 1361 conditions per place. [2024-10-31 22:19:44,707 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 71 selfloop transitions, 14 changer transitions 1/103 dead transitions. [2024-10-31 22:19:44,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 103 transitions, 512 flow [2024-10-31 22:19:44,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:19:44,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:19:44,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 214 transitions. [2024-10-31 22:19:44,710 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7133333333333334 [2024-10-31 22:19:44,710 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 188 flow. Second operand 6 states and 214 transitions. [2024-10-31 22:19:44,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 103 transitions, 512 flow [2024-10-31 22:19:44,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 103 transitions, 482 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-31 22:19:44,731 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 238 flow [2024-10-31 22:19:44,731 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2024-10-31 22:19:44,732 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places. [2024-10-31 22:19:44,732 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 238 flow [2024-10-31 22:19:44,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:44,733 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:44,733 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:44,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:19:44,733 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-31 22:19:44,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:44,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1376188051, now seen corresponding path program 1 times [2024-10-31 22:19:44,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:44,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676121915] [2024-10-31 22:19:44,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:44,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:44,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:45,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:45,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:45,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676121915] [2024-10-31 22:19:45,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676121915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:45,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:45,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:19:45,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487247292] [2024-10-31 22:19:45,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:45,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:19:45,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:45,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:19:45,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:19:45,336 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 50 [2024-10-31 22:19:45,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 238 flow. Second operand has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:45,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:45,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 50 [2024-10-31 22:19:45,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:46,121 INFO L124 PetriNetUnfolderBase]: 1825/2705 cut-off events. [2024-10-31 22:19:46,122 INFO L125 PetriNetUnfolderBase]: For 3953/3953 co-relation queries the response was YES. [2024-10-31 22:19:46,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7836 conditions, 2705 events. 1825/2705 cut-off events. For 3953/3953 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 13902 event pairs, 99 based on Foata normal form. 80/2727 useless extension candidates. Maximal degree in co-relation 7821. Up to 828 conditions per place. [2024-10-31 22:19:46,150 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 64 selfloop transitions, 18 changer transitions 1/100 dead transitions. [2024-10-31 22:19:46,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 100 transitions, 510 flow [2024-10-31 22:19:46,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 22:19:46,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-31 22:19:46,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 232 transitions. [2024-10-31 22:19:46,152 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6628571428571428 [2024-10-31 22:19:46,152 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 238 flow. Second operand 7 states and 232 transitions. [2024-10-31 22:19:46,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 100 transitions, 510 flow [2024-10-31 22:19:46,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 100 transitions, 464 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-10-31 22:19:46,182 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 248 flow [2024-10-31 22:19:46,182 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=248, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2024-10-31 22:19:46,183 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2024-10-31 22:19:46,183 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 248 flow [2024-10-31 22:19:46,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:46,184 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:46,184 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:46,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:19:46,185 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-31 22:19:46,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:46,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1361218787, now seen corresponding path program 1 times [2024-10-31 22:19:46,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:46,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020366010] [2024-10-31 22:19:46,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:46,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:46,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:47,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:47,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:47,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020366010] [2024-10-31 22:19:47,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020366010] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:47,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:47,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 22:19:47,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868047505] [2024-10-31 22:19:47,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:47,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:19:47,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:47,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:19:47,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:19:47,306 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2024-10-31 22:19:47,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 248 flow. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:47,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:47,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2024-10-31 22:19:47,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:49,275 INFO L124 PetriNetUnfolderBase]: 6726/10672 cut-off events. [2024-10-31 22:19:49,276 INFO L125 PetriNetUnfolderBase]: For 4889/5243 co-relation queries the response was YES. [2024-10-31 22:19:49,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24853 conditions, 10672 events. 6726/10672 cut-off events. For 4889/5243 co-relation queries the response was YES. Maximal size of possible extension queue 547. Compared 71889 event pairs, 1042 based on Foata normal form. 16/10243 useless extension candidates. Maximal degree in co-relation 24837. Up to 4218 conditions per place. [2024-10-31 22:19:49,356 INFO L140 encePairwiseOnDemand]: 35/50 looper letters, 46 selfloop transitions, 13 changer transitions 40/126 dead transitions. [2024-10-31 22:19:49,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 126 transitions, 622 flow [2024-10-31 22:19:49,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:19:49,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-31 22:19:49,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 252 transitions. [2024-10-31 22:19:49,358 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.63 [2024-10-31 22:19:49,358 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 248 flow. Second operand 8 states and 252 transitions. [2024-10-31 22:19:49,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 126 transitions, 622 flow [2024-10-31 22:19:49,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 126 transitions, 506 flow, removed 27 selfloop flow, removed 10 redundant places. [2024-10-31 22:19:49,499 INFO L231 Difference]: Finished difference. Result has 70 places, 65 transitions, 251 flow [2024-10-31 22:19:49,500 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=251, PETRI_PLACES=70, PETRI_TRANSITIONS=65} [2024-10-31 22:19:49,501 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 12 predicate places. [2024-10-31 22:19:49,502 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 65 transitions, 251 flow [2024-10-31 22:19:49,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:49,503 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:49,503 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:49,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:19:49,503 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-31 22:19:49,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:49,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1662675193, now seen corresponding path program 2 times [2024-10-31 22:19:49,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:49,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585725035] [2024-10-31 22:19:49,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:49,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:51,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:51,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:51,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585725035] [2024-10-31 22:19:51,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585725035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:51,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:51,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-31 22:19:51,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596461106] [2024-10-31 22:19:51,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:51,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-31 22:19:51,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:51,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-31 22:19:51,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-31 22:19:51,296 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2024-10-31 22:19:51,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 65 transitions, 251 flow. Second operand has 12 states, 12 states have (on average 21.0) internal successors, (252), 12 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:51,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:51,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2024-10-31 22:19:51,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:53,364 INFO L124 PetriNetUnfolderBase]: 10484/17038 cut-off events. [2024-10-31 22:19:53,364 INFO L125 PetriNetUnfolderBase]: For 6410/6640 co-relation queries the response was YES. [2024-10-31 22:19:53,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41845 conditions, 17038 events. 10484/17038 cut-off events. For 6410/6640 co-relation queries the response was YES. Maximal size of possible extension queue 1016. Compared 132640 event pairs, 2312 based on Foata normal form. 23/15777 useless extension candidates. Maximal degree in co-relation 41828. Up to 4405 conditions per place. [2024-10-31 22:19:53,628 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 49 selfloop transitions, 6 changer transitions 88/170 dead transitions. [2024-10-31 22:19:53,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 170 transitions, 913 flow [2024-10-31 22:19:53,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 22:19:53,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-31 22:19:53,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 313 transitions. [2024-10-31 22:19:53,631 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.626 [2024-10-31 22:19:53,631 INFO L175 Difference]: Start difference. First operand has 70 places, 65 transitions, 251 flow. Second operand 10 states and 313 transitions. [2024-10-31 22:19:53,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 170 transitions, 913 flow [2024-10-31 22:19:53,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 170 transitions, 881 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-31 22:19:53,640 INFO L231 Difference]: Finished difference. Result has 80 places, 64 transitions, 284 flow [2024-10-31 22:19:53,641 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=284, PETRI_PLACES=80, PETRI_TRANSITIONS=64} [2024-10-31 22:19:53,642 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 22 predicate places. [2024-10-31 22:19:53,642 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 64 transitions, 284 flow [2024-10-31 22:19:53,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 21.0) internal successors, (252), 12 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:53,643 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:53,644 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:53,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:19:53,644 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-31 22:19:53,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:53,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1020803597, now seen corresponding path program 3 times [2024-10-31 22:19:53,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:53,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843955214] [2024-10-31 22:19:53,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:53,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:54,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:54,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:54,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843955214] [2024-10-31 22:19:54,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843955214] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:54,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:54,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 22:19:54,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276566818] [2024-10-31 22:19:54,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:54,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:19:54,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:54,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:19:54,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:19:54,639 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2024-10-31 22:19:54,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 64 transitions, 284 flow. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:54,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:54,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2024-10-31 22:19:54,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:56,385 INFO L124 PetriNetUnfolderBase]: 5962/9953 cut-off events. [2024-10-31 22:19:56,385 INFO L125 PetriNetUnfolderBase]: For 9758/9936 co-relation queries the response was YES. [2024-10-31 22:19:56,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26613 conditions, 9953 events. 5962/9953 cut-off events. For 9758/9936 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 73823 event pairs, 1235 based on Foata normal form. 80/9393 useless extension candidates. Maximal degree in co-relation 26589. Up to 3632 conditions per place. [2024-10-31 22:19:56,481 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 36 selfloop transitions, 7 changer transitions 47/117 dead transitions. [2024-10-31 22:19:56,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 117 transitions, 705 flow [2024-10-31 22:19:56,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:19:56,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-31 22:19:56,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 234 transitions. [2024-10-31 22:19:56,483 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.585 [2024-10-31 22:19:56,484 INFO L175 Difference]: Start difference. First operand has 80 places, 64 transitions, 284 flow. Second operand 8 states and 234 transitions. [2024-10-31 22:19:56,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 117 transitions, 705 flow [2024-10-31 22:19:56,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 117 transitions, 618 flow, removed 30 selfloop flow, removed 9 redundant places. [2024-10-31 22:19:56,556 INFO L231 Difference]: Finished difference. Result has 77 places, 60 transitions, 250 flow [2024-10-31 22:19:56,556 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=250, PETRI_PLACES=77, PETRI_TRANSITIONS=60} [2024-10-31 22:19:56,557 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 19 predicate places. [2024-10-31 22:19:56,557 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 60 transitions, 250 flow [2024-10-31 22:19:56,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:56,558 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:56,558 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:56,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:19:56,559 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-31 22:19:56,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:56,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1903677759, now seen corresponding path program 4 times [2024-10-31 22:19:56,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:56,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362039075] [2024-10-31 22:19:56,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:56,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:59,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:59,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:59,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362039075] [2024-10-31 22:19:59,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362039075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:59,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:59,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-31 22:19:59,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875048042] [2024-10-31 22:19:59,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:59,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-31 22:19:59,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:59,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-31 22:19:59,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:19:59,185 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2024-10-31 22:19:59,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 60 transitions, 250 flow. Second operand has 11 states, 11 states have (on average 21.181818181818183) internal successors, (233), 11 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:59,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:59,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2024-10-31 22:19:59,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:20:00,400 INFO L124 PetriNetUnfolderBase]: 3586/6013 cut-off events. [2024-10-31 22:20:00,401 INFO L125 PetriNetUnfolderBase]: For 4483/4707 co-relation queries the response was YES. [2024-10-31 22:20:00,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14859 conditions, 6013 events. 3586/6013 cut-off events. For 4483/4707 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 40989 event pairs, 803 based on Foata normal form. 48/5592 useless extension candidates. Maximal degree in co-relation 14837. Up to 2382 conditions per place. [2024-10-31 22:20:00,458 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 53 selfloop transitions, 17 changer transitions 21/118 dead transitions. [2024-10-31 22:20:00,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 118 transitions, 654 flow [2024-10-31 22:20:00,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 22:20:00,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-31 22:20:00,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 258 transitions. [2024-10-31 22:20:00,461 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5733333333333334 [2024-10-31 22:20:00,461 INFO L175 Difference]: Start difference. First operand has 77 places, 60 transitions, 250 flow. Second operand 9 states and 258 transitions. [2024-10-31 22:20:00,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 118 transitions, 654 flow [2024-10-31 22:20:00,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 118 transitions, 632 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-10-31 22:20:00,469 INFO L231 Difference]: Finished difference. Result has 80 places, 67 transitions, 343 flow [2024-10-31 22:20:00,469 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=343, PETRI_PLACES=80, PETRI_TRANSITIONS=67} [2024-10-31 22:20:00,471 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 22 predicate places. [2024-10-31 22:20:00,471 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 67 transitions, 343 flow [2024-10-31 22:20:00,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 21.181818181818183) internal successors, (233), 11 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:20:00,472 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:20:00,472 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:20:00,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:20:00,473 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-31 22:20:00,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:20:00,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1482827217, now seen corresponding path program 5 times [2024-10-31 22:20:00,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:20:00,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811130151] [2024-10-31 22:20:00,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:20:00,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:20:00,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:20:00,615 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:20:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:20:00,797 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:20:00,798 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:20:00,799 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-10-31 22:20:00,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-10-31 22:20:00,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-10-31 22:20:00,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-10-31 22:20:00,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-10-31 22:20:00,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-10-31 22:20:00,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-10-31 22:20:00,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:20:00,808 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2024-10-31 22:20:00,950 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-31 22:20:00,950 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:20:00,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:20:00 BasicIcfg [2024-10-31 22:20:00,956 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:20:00,957 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:20:00,957 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:20:00,958 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:20:00,958 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:19:37" (3/4) ... [2024-10-31 22:20:00,959 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-31 22:20:01,093 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53d23585-9840-430a-8ad3-93efc3049886/bin/uautomizer-verify-4GaUIPS5ZU/witness.graphml [2024-10-31 22:20:01,094 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:20:01,094 INFO L158 Benchmark]: Toolchain (without parser) took 25992.41ms. Allocated memory was 107.0MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 70.9MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 209.1MB. Max. memory is 16.1GB. [2024-10-31 22:20:01,095 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 107.0MB. Free memory was 83.2MB in the beginning and 83.1MB in the end (delta: 168.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:20:01,095 INFO L158 Benchmark]: CACSL2BoogieTranslator took 769.64ms. Allocated memory is still 107.0MB. Free memory was 70.7MB in the beginning and 44.3MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-31 22:20:01,095 INFO L158 Benchmark]: Boogie Procedure Inliner took 100.71ms. Allocated memory was 107.0MB in the beginning and 144.7MB in the end (delta: 37.7MB). Free memory was 44.3MB in the beginning and 114.7MB in the end (delta: -70.4MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2024-10-31 22:20:01,096 INFO L158 Benchmark]: Boogie Preprocessor took 99.50ms. Allocated memory is still 144.7MB. Free memory was 114.7MB in the beginning and 111.3MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 22:20:01,096 INFO L158 Benchmark]: RCFGBuilder took 1068.06ms. Allocated memory is still 144.7MB. Free memory was 111.3MB in the beginning and 103.5MB in the end (delta: 7.7MB). Peak memory consumption was 52.9MB. Max. memory is 16.1GB. [2024-10-31 22:20:01,097 INFO L158 Benchmark]: TraceAbstraction took 23809.57ms. Allocated memory was 144.7MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 102.6MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-10-31 22:20:01,097 INFO L158 Benchmark]: Witness Printer took 136.79ms. Allocated memory is still 1.5GB. Free memory was 1.3GB in the beginning and 1.2GB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-31 22:20:01,099 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.32ms. Allocated memory is still 107.0MB. Free memory was 83.2MB in the beginning and 83.1MB in the end (delta: 168.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 769.64ms. Allocated memory is still 107.0MB. Free memory was 70.7MB in the beginning and 44.3MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 100.71ms. Allocated memory was 107.0MB in the beginning and 144.7MB in the end (delta: 37.7MB). Free memory was 44.3MB in the beginning and 114.7MB in the end (delta: -70.4MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.50ms. Allocated memory is still 144.7MB. Free memory was 114.7MB in the beginning and 111.3MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1068.06ms. Allocated memory is still 144.7MB. Free memory was 111.3MB in the beginning and 103.5MB in the end (delta: 7.7MB). Peak memory consumption was 52.9MB. Max. memory is 16.1GB. * TraceAbstraction took 23809.57ms. Allocated memory was 144.7MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 102.6MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 136.79ms. Allocated memory is still 1.5GB. Free memory was 1.3GB in the beginning and 1.2GB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff0_thd4; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$r_buff1_thd4; [L739] 0 _Bool y$read_delayed; [L740] 0 int *y$read_delayed_var; [L741] 0 int y$w_buff0; [L742] 0 _Bool y$w_buff0_used; [L743] 0 int y$w_buff1; [L744] 0 _Bool y$w_buff1_used; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L851] 0 pthread_t t1081; [L852] FCALL, FORK 0 pthread_create(&t1081, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1081=-3, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L853] 0 pthread_t t1082; [L854] FCALL, FORK 0 pthread_create(&t1082, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1081=-3, t1082=-2, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L855] 0 pthread_t t1083; [L856] FCALL, FORK 0 pthread_create(&t1083, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1081=-3, t1082=-2, t1083=-1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L857] 0 pthread_t t1084; [L858] FCALL, FORK 0 pthread_create(&t1084, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1081=-3, t1082=-2, t1083=-1, t1084=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L787] 3 y$w_buff1 = y$w_buff0 [L788] 3 y$w_buff0 = 2 [L789] 3 y$w_buff1_used = y$w_buff0_used [L790] 3 y$w_buff0_used = (_Bool)1 [L791] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L791] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L792] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L793] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L794] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L795] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L796] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L797] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L800] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L817] 4 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] [L820] 4 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] [L823] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] [L826] 4 __unbuffered_p3_EBX = b VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] [L752] 1 b = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] [L755] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] [L829] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L830] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L831] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L832] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L833] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] [L767] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] [L770] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] [L773] 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) [L774] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L775] 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 [L776] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L777] 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 [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] [L803] 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) [L804] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L805] 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 [L806] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L807] 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 [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] [L780] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1081=-3, t1082=-2, t1083=-1, t1084=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 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) [L865] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] 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 [L867] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] 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 [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1081=-3, t1082=-2, t1083=-1, t1084=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 y$flush_delayed = weak$$choice2 [L874] 0 y$mem_tmp = y [L875] 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) [L876] 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)) [L877] 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)) [L878] 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)) [L879] 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)) [L880] 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)) [L881] 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)) [L882] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L883] 0 y = y$flush_delayed ? y$mem_tmp : y [L884] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1081=-3, t1082=-2, t1083=-1, t1084=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] - 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: 856]: 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: 854]: 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: 852]: 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: 858]: 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 9 procedures, 85 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 23.5s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 14.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 846 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 821 mSDsluCounter, 593 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 547 mSDsCounter, 96 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1613 IncrementalHoareTripleChecker+Invalid, 1709 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 96 mSolverCounterUnsat, 46 mSDtfsCounter, 1613 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=343occurred in iteration=9, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 292 NumberOfCodeBlocks, 292 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 245 ConstructedInterpolants, 0 QuantifiedInterpolants, 1966 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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! [2024-10-31 22:20:01,133 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_53d23585-9840-430a-8ad3-93efc3049886/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0