./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix045_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix045_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 ac99c7435b3707a16823c102e546d1d8821c1d75e1c740ce64249f2f34cab350 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:56:06,101 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:56:06,167 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 06:56:06,171 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:56:06,171 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:56:06,198 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:56:06,199 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:56:06,199 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:56:06,200 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:56:06,201 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:56:06,202 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:56:06,202 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:56:06,203 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:56:06,203 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:56:06,205 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:56:06,205 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:56:06,206 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:56:06,206 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:56:06,206 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 06:56:06,206 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:56:06,207 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:56:06,210 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:56:06,211 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:56:06,211 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:56:06,211 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:56:06,211 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:56:06,212 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:56:06,212 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:56:06,212 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:56:06,213 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:56:06,213 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:56:06,213 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:56:06,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:56:06,214 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:56:06,214 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:56:06,214 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:56:06,215 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 06:56:06,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 06:56:06,216 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:56:06,216 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:56:06,216 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:56:06,217 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:56:06,217 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> ac99c7435b3707a16823c102e546d1d8821c1d75e1c740ce64249f2f34cab350 [2024-10-13 06:56:06,532 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:56:06,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:56:06,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:56:06,561 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:56:06,562 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:56:06,563 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix045_power.oepc_pso.oepc_rmo.oepc.i [2024-10-13 06:56:08,028 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:56:08,289 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:56:08,290 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix045_power.oepc_pso.oepc_rmo.oepc.i [2024-10-13 06:56:08,311 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/672cae18e/e37ccd5087364a7ba3657a03b9e98bda/FLAG32ceb0339 [2024-10-13 06:56:08,338 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/672cae18e/e37ccd5087364a7ba3657a03b9e98bda [2024-10-13 06:56:08,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:56:08,342 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:56:08,344 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:56:08,344 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:56:08,351 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:56:08,352 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:56:08" (1/1) ... [2024-10-13 06:56:08,353 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5891b893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:56:08, skipping insertion in model container [2024-10-13 06:56:08,353 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:56:08" (1/1) ... [2024-10-13 06:56:08,411 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:56:08,623 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix045_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-10-13 06:56:08,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:56:08,843 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:56:08,857 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix045_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-10-13 06:56:08,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:56:08,949 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:56:08,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:56:08 WrapperNode [2024-10-13 06:56:08,953 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:56:08,955 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:56:08,955 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:56:08,955 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:56:08,963 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:56:08" (1/1) ... [2024-10-13 06:56:08,986 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:56:08" (1/1) ... [2024-10-13 06:56:09,015 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 116 [2024-10-13 06:56:09,016 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:56:09,017 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:56:09,017 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:56:09,017 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:56:09,033 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:56:08" (1/1) ... [2024-10-13 06:56:09,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:56:08" (1/1) ... [2024-10-13 06:56:09,037 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:56:08" (1/1) ... [2024-10-13 06:56:09,055 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-13 06:56:09,055 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:56:08" (1/1) ... [2024-10-13 06:56:09,055 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:56:08" (1/1) ... [2024-10-13 06:56:09,063 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:56:08" (1/1) ... [2024-10-13 06:56:09,065 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:56:08" (1/1) ... [2024-10-13 06:56:09,066 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:56:08" (1/1) ... [2024-10-13 06:56:09,068 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:56:08" (1/1) ... [2024-10-13 06:56:09,071 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:56:09,072 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:56:09,072 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:56:09,073 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:56:09,074 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:56:08" (1/1) ... [2024-10-13 06:56:09,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:56:09,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:56:09,117 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 06:56:09,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 06:56:09,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-13 06:56:09,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:56:09,194 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-13 06:56:09,194 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-13 06:56:09,195 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-13 06:56:09,195 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-13 06:56:09,195 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-13 06:56:09,195 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-13 06:56:09,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 06:56:09,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-13 06:56:09,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:56:09,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:56:09,198 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 06:56:09,400 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:56:09,402 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:56:09,729 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 06:56:09,730 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:56:09,958 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:56:09,959 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 06:56:09,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:56:09 BoogieIcfgContainer [2024-10-13 06:56:09,960 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:56:09,963 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:56:09,963 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:56:09,967 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:56:09,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:56:08" (1/3) ... [2024-10-13 06:56:09,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@557596f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:56:09, skipping insertion in model container [2024-10-13 06:56:09,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:56:08" (2/3) ... [2024-10-13 06:56:09,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@557596f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:56:09, skipping insertion in model container [2024-10-13 06:56:09,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:56:09" (3/3) ... [2024-10-13 06:56:09,972 INFO L112 eAbstractionObserver]: Analyzing ICFG mix045_power.oepc_pso.oepc_rmo.oepc.i [2024-10-13 06:56:09,992 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:56:09,992 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-13 06:56:09,993 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 06:56:10,055 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-13 06:56:10,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 41 transitions, 94 flow [2024-10-13 06:56:10,132 INFO L124 PetriNetUnfolderBase]: 1/38 cut-off events. [2024-10-13 06:56:10,133 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 06:56:10,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 1/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 40. Up to 2 conditions per place. [2024-10-13 06:56:10,137 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 41 transitions, 94 flow [2024-10-13 06:56:10,140 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 38 transitions, 85 flow [2024-10-13 06:56:10,149 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:56:10,155 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;@250117ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:56:10,156 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-13 06:56:10,160 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 06:56:10,160 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-10-13 06:56:10,160 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 06:56:10,160 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 06:56:10,161 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-13 06:56:10,162 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-13 06:56:10,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:56:10,167 INFO L85 PathProgramCache]: Analyzing trace with hash 11109278, now seen corresponding path program 1 times [2024-10-13 06:56:10,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:56:10,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931726515] [2024-10-13 06:56:10,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:56:10,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:56:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:56:10,664 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-13 06:56:10,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:56:10,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931726515] [2024-10-13 06:56:10,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931726515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:56:10,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:56:10,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 06:56:10,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151087346] [2024-10-13 06:56:10,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:56:10,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 06:56:10,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:56:10,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 06:56:10,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:56:10,711 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 41 [2024-10-13 06:56:10,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-13 06:56:10,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 06:56:10,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 41 [2024-10-13 06:56:10,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 06:56:11,168 INFO L124 PetriNetUnfolderBase]: 617/1109 cut-off events. [2024-10-13 06:56:11,169 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-10-13 06:56:11,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2086 conditions, 1109 events. 617/1109 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6406 event pairs, 343 based on Foata normal form. 45/1130 useless extension candidates. Maximal degree in co-relation 2075. Up to 763 conditions per place. [2024-10-13 06:56:11,185 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 29 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2024-10-13 06:56:11,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 50 transitions, 181 flow [2024-10-13 06:56:11,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 06:56:11,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 06:56:11,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2024-10-13 06:56:11,200 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7804878048780488 [2024-10-13 06:56:11,202 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 85 flow. Second operand 3 states and 96 transitions. [2024-10-13 06:56:11,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 50 transitions, 181 flow [2024-10-13 06:56:11,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 50 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-13 06:56:11,210 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 80 flow [2024-10-13 06:56:11,214 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2024-10-13 06:56:11,219 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2024-10-13 06:56:11,219 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 80 flow [2024-10-13 06:56:11,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-13 06:56:11,220 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 06:56:11,222 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:56:11,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 06:56:11,223 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-13 06:56:11,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:56:11,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1503286303, now seen corresponding path program 1 times [2024-10-13 06:56:11,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:56:11,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063377952] [2024-10-13 06:56:11,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:56:11,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:56:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:56:11,518 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-13 06:56:11,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:56:11,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063377952] [2024-10-13 06:56:11,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063377952] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:56:11,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:56:11,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:56:11,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331895357] [2024-10-13 06:56:11,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:56:11,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:56:11,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:56:11,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:56:11,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:56:11,535 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 41 [2024-10-13 06:56:11,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-13 06:56:11,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 06:56:11,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 41 [2024-10-13 06:56:11,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 06:56:11,963 INFO L124 PetriNetUnfolderBase]: 1318/2360 cut-off events. [2024-10-13 06:56:11,964 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2024-10-13 06:56:11,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4539 conditions, 2360 events. 1318/2360 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 15119 event pairs, 188 based on Foata normal form. 100/2311 useless extension candidates. Maximal degree in co-relation 4529. Up to 1053 conditions per place. [2024-10-13 06:56:11,986 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 41 selfloop transitions, 5 changer transitions 1/60 dead transitions. [2024-10-13 06:56:11,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 60 transitions, 232 flow [2024-10-13 06:56:11,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:56:11,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 06:56:11,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2024-10-13 06:56:11,990 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6890243902439024 [2024-10-13 06:56:11,990 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 80 flow. Second operand 4 states and 113 transitions. [2024-10-13 06:56:11,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 60 transitions, 232 flow [2024-10-13 06:56:11,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 60 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 06:56:11,995 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 110 flow [2024-10-13 06:56:11,995 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2024-10-13 06:56:11,996 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 0 predicate places. [2024-10-13 06:56:11,996 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 110 flow [2024-10-13 06:56:11,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-13 06:56:11,996 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 06:56:11,997 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:56:11,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 06:56:11,997 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-13 06:56:11,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:56:11,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1946249365, now seen corresponding path program 1 times [2024-10-13 06:56:11,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:56:12,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136727207] [2024-10-13 06:56:12,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:56:12,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:56:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:56:12,296 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-13 06:56:12,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:56:12,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136727207] [2024-10-13 06:56:12,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136727207] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:56:12,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:56:12,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:56:12,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383983385] [2024-10-13 06:56:12,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:56:12,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:56:12,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:56:12,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:56:12,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:56:12,305 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 41 [2024-10-13 06:56:12,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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-13 06:56:12,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 06:56:12,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 41 [2024-10-13 06:56:12,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 06:56:12,614 INFO L124 PetriNetUnfolderBase]: 886/1574 cut-off events. [2024-10-13 06:56:12,615 INFO L125 PetriNetUnfolderBase]: For 411/411 co-relation queries the response was YES. [2024-10-13 06:56:12,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3551 conditions, 1574 events. 886/1574 cut-off events. For 411/411 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8795 event pairs, 100 based on Foata normal form. 82/1568 useless extension candidates. Maximal degree in co-relation 3539. Up to 465 conditions per place. [2024-10-13 06:56:12,624 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 52 selfloop transitions, 8 changer transitions 1/74 dead transitions. [2024-10-13 06:56:12,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 74 transitions, 325 flow [2024-10-13 06:56:12,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:56:12,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 06:56:12,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2024-10-13 06:56:12,626 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.697560975609756 [2024-10-13 06:56:12,627 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 110 flow. Second operand 5 states and 143 transitions. [2024-10-13 06:56:12,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 74 transitions, 325 flow [2024-10-13 06:56:12,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 74 transitions, 315 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-13 06:56:12,630 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 150 flow [2024-10-13 06:56:12,630 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=150, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2024-10-13 06:56:12,631 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 4 predicate places. [2024-10-13 06:56:12,631 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 150 flow [2024-10-13 06:56:12,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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-13 06:56:12,632 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 06:56:12,632 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] [2024-10-13 06:56:12,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 06:56:12,632 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-13 06:56:12,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:56:12,633 INFO L85 PathProgramCache]: Analyzing trace with hash -154214498, now seen corresponding path program 1 times [2024-10-13 06:56:12,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:56:12,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743714992] [2024-10-13 06:56:12,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:56:12,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:56:12,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:56:12,941 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-13 06:56:12,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:56:12,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743714992] [2024-10-13 06:56:12,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743714992] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:56:12,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:56:12,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:56:12,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019036511] [2024-10-13 06:56:12,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:56:12,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:56:12,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:56:12,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:56:12,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:56:12,959 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 41 [2024-10-13 06:56:12,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 150 flow. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 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-13 06:56:12,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 06:56:12,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 41 [2024-10-13 06:56:12,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 06:56:13,254 INFO L124 PetriNetUnfolderBase]: 557/947 cut-off events. [2024-10-13 06:56:13,254 INFO L125 PetriNetUnfolderBase]: For 806/806 co-relation queries the response was YES. [2024-10-13 06:56:13,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2441 conditions, 947 events. 557/947 cut-off events. For 806/806 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4363 event pairs, 83 based on Foata normal form. 40/941 useless extension candidates. Maximal degree in co-relation 2427. Up to 308 conditions per place. [2024-10-13 06:56:13,262 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 45 selfloop transitions, 11 changer transitions 1/70 dead transitions. [2024-10-13 06:56:13,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 70 transitions, 332 flow [2024-10-13 06:56:13,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:56:13,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 06:56:13,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2024-10-13 06:56:13,266 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6300813008130082 [2024-10-13 06:56:13,266 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 150 flow. Second operand 6 states and 155 transitions. [2024-10-13 06:56:13,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 70 transitions, 332 flow [2024-10-13 06:56:13,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 70 transitions, 307 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-10-13 06:56:13,275 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 164 flow [2024-10-13 06:56:13,275 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=164, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2024-10-13 06:56:13,277 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 7 predicate places. [2024-10-13 06:56:13,277 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 164 flow [2024-10-13 06:56:13,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 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-13 06:56:13,277 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 06:56:13,278 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-13 06:56:13,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 06:56:13,278 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-13 06:56:13,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:56:13,280 INFO L85 PathProgramCache]: Analyzing trace with hash 2051302348, now seen corresponding path program 1 times [2024-10-13 06:56:13,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:56:13,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286177927] [2024-10-13 06:56:13,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:56:13,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:56:13,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:56:14,542 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-13 06:56:14,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:56:14,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286177927] [2024-10-13 06:56:14,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286177927] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:56:14,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:56:14,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 06:56:14,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916082381] [2024-10-13 06:56:14,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:56:14,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 06:56:14,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:56:14,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 06:56:14,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:56:14,559 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 41 [2024-10-13 06:56:14,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 164 flow. Second operand has 9 states, 9 states have (on average 19.88888888888889) internal successors, (179), 9 states have internal predecessors, (179), 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-13 06:56:14,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 06:56:14,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 41 [2024-10-13 06:56:14,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 06:56:15,042 INFO L124 PetriNetUnfolderBase]: 453/879 cut-off events. [2024-10-13 06:56:15,042 INFO L125 PetriNetUnfolderBase]: For 479/503 co-relation queries the response was YES. [2024-10-13 06:56:15,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2065 conditions, 879 events. 453/879 cut-off events. For 479/503 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4560 event pairs, 90 based on Foata normal form. 8/842 useless extension candidates. Maximal degree in co-relation 2050. Up to 236 conditions per place. [2024-10-13 06:56:15,048 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 32 selfloop transitions, 4 changer transitions 24/81 dead transitions. [2024-10-13 06:56:15,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 81 transitions, 380 flow [2024-10-13 06:56:15,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 06:56:15,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-13 06:56:15,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 223 transitions. [2024-10-13 06:56:15,050 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6043360433604336 [2024-10-13 06:56:15,050 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 164 flow. Second operand 9 states and 223 transitions. [2024-10-13 06:56:15,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 81 transitions, 380 flow [2024-10-13 06:56:15,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 81 transitions, 316 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-10-13 06:56:15,055 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 126 flow [2024-10-13 06:56:15,056 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=126, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2024-10-13 06:56:15,056 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 11 predicate places. [2024-10-13 06:56:15,056 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 126 flow [2024-10-13 06:56:15,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.88888888888889) internal successors, (179), 9 states have internal predecessors, (179), 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-13 06:56:15,057 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 06:56:15,057 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-13 06:56:15,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 06:56:15,058 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-13 06:56:15,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:56:15,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1275716082, now seen corresponding path program 2 times [2024-10-13 06:56:15,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:56:15,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425070424] [2024-10-13 06:56:15,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:56:15,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:56:15,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:56:15,370 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-13 06:56:15,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:56:15,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425070424] [2024-10-13 06:56:15,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425070424] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:56:15,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:56:15,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:56:15,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082885438] [2024-10-13 06:56:15,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:56:15,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:56:15,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:56:15,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:56:15,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:56:15,381 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 41 [2024-10-13 06:56:15,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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-13 06:56:15,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 06:56:15,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 41 [2024-10-13 06:56:15,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 06:56:15,674 INFO L124 PetriNetUnfolderBase]: 693/1335 cut-off events. [2024-10-13 06:56:15,674 INFO L125 PetriNetUnfolderBase]: For 219/230 co-relation queries the response was YES. [2024-10-13 06:56:15,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2863 conditions, 1335 events. 693/1335 cut-off events. For 219/230 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 7554 event pairs, 321 based on Foata normal form. 8/1276 useless extension candidates. Maximal degree in co-relation 2848. Up to 605 conditions per place. [2024-10-13 06:56:15,682 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 30 selfloop transitions, 2 changer transitions 13/64 dead transitions. [2024-10-13 06:56:15,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 64 transitions, 278 flow [2024-10-13 06:56:15,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:56:15,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 06:56:15,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2024-10-13 06:56:15,684 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6146341463414634 [2024-10-13 06:56:15,684 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 126 flow. Second operand 5 states and 126 transitions. [2024-10-13 06:56:15,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 64 transitions, 278 flow [2024-10-13 06:56:15,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 64 transitions, 256 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-10-13 06:56:15,689 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 124 flow [2024-10-13 06:56:15,689 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2024-10-13 06:56:15,691 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 7 predicate places. [2024-10-13 06:56:15,691 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 124 flow [2024-10-13 06:56:15,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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-13 06:56:15,692 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 06:56:15,692 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-13 06:56:15,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 06:56:15,693 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-13 06:56:15,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:56:15,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1221975374, now seen corresponding path program 3 times [2024-10-13 06:56:15,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:56:15,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340557942] [2024-10-13 06:56:15,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:56:15,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:56:15,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:56:16,022 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-13 06:56:16,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:56:16,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340557942] [2024-10-13 06:56:16,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340557942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:56:16,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:56:16,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:56:16,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667525617] [2024-10-13 06:56:16,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:56:16,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:56:16,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:56:16,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:56:16,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:56:16,038 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2024-10-13 06:56:16,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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-13 06:56:16,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 06:56:16,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2024-10-13 06:56:16,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 06:56:16,305 INFO L124 PetriNetUnfolderBase]: 811/1513 cut-off events. [2024-10-13 06:56:16,305 INFO L125 PetriNetUnfolderBase]: For 223/224 co-relation queries the response was YES. [2024-10-13 06:56:16,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3254 conditions, 1513 events. 811/1513 cut-off events. For 223/224 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 8073 event pairs, 352 based on Foata normal form. 8/1481 useless extension candidates. Maximal degree in co-relation 3240. Up to 686 conditions per place. [2024-10-13 06:56:16,313 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 29 selfloop transitions, 7 changer transitions 14/66 dead transitions. [2024-10-13 06:56:16,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 66 transitions, 290 flow [2024-10-13 06:56:16,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:56:16,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 06:56:16,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2024-10-13 06:56:16,315 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5658536585365853 [2024-10-13 06:56:16,315 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 124 flow. Second operand 5 states and 116 transitions. [2024-10-13 06:56:16,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 66 transitions, 290 flow [2024-10-13 06:56:16,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 66 transitions, 272 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-13 06:56:16,318 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 172 flow [2024-10-13 06:56:16,318 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=172, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2024-10-13 06:56:16,319 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 9 predicate places. [2024-10-13 06:56:16,319 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 172 flow [2024-10-13 06:56:16,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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-13 06:56:16,320 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 06:56:16,320 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-13 06:56:16,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 06:56:16,320 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-13 06:56:16,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:56:16,320 INFO L85 PathProgramCache]: Analyzing trace with hash -560776964, now seen corresponding path program 4 times [2024-10-13 06:56:16,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:56:16,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540324322] [2024-10-13 06:56:16,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:56:16,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:56:16,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:56:16,416 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 06:56:16,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:56:16,548 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 06:56:16,549 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 06:56:16,550 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-10-13 06:56:16,552 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-10-13 06:56:16,552 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-10-13 06:56:16,552 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-10-13 06:56:16,552 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-10-13 06:56:16,552 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-10-13 06:56:16,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 06:56:16,553 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2024-10-13 06:56:16,658 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 06:56:16,659 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 06:56:16,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 06:56:16 BasicIcfg [2024-10-13 06:56:16,667 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 06:56:16,668 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 06:56:16,669 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 06:56:16,669 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 06:56:16,670 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:56:09" (3/4) ... [2024-10-13 06:56:16,672 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-13 06:56:16,770 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 06:56:16,770 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 06:56:16,771 INFO L158 Benchmark]: Toolchain (without parser) took 8429.29ms. Allocated memory was 161.5MB in the beginning and 297.8MB in the end (delta: 136.3MB). Free memory was 126.1MB in the beginning and 247.4MB in the end (delta: -121.4MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2024-10-13 06:56:16,771 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 104.9MB. Free memory is still 75.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:56:16,771 INFO L158 Benchmark]: CACSL2BoogieTranslator took 610.33ms. Allocated memory is still 161.5MB. Free memory was 126.1MB in the beginning and 99.9MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-13 06:56:16,771 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.59ms. Allocated memory is still 161.5MB. Free memory was 99.9MB in the beginning and 96.9MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 06:56:16,772 INFO L158 Benchmark]: Boogie Preprocessor took 54.32ms. Allocated memory is still 161.5MB. Free memory was 96.9MB in the beginning and 93.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 06:56:16,772 INFO L158 Benchmark]: RCFGBuilder took 888.23ms. Allocated memory is still 161.5MB. Free memory was 93.7MB in the beginning and 82.5MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 06:56:16,772 INFO L158 Benchmark]: TraceAbstraction took 6704.88ms. Allocated memory was 161.5MB in the beginning and 297.8MB in the end (delta: 136.3MB). Free memory was 82.5MB in the beginning and 260.0MB in the end (delta: -177.6MB). Peak memory consumption was 132.0MB. Max. memory is 16.1GB. [2024-10-13 06:56:16,772 INFO L158 Benchmark]: Witness Printer took 102.32ms. Allocated memory is still 297.8MB. Free memory was 260.0MB in the beginning and 247.4MB in the end (delta: 12.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 06:56:16,774 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.11ms. Allocated memory is still 104.9MB. Free memory is still 75.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 610.33ms. Allocated memory is still 161.5MB. Free memory was 126.1MB in the beginning and 99.9MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.59ms. Allocated memory is still 161.5MB. Free memory was 99.9MB in the beginning and 96.9MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.32ms. Allocated memory is still 161.5MB. Free memory was 96.9MB in the beginning and 93.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 888.23ms. Allocated memory is still 161.5MB. Free memory was 93.7MB in the beginning and 82.5MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6704.88ms. Allocated memory was 161.5MB in the beginning and 297.8MB in the end (delta: 136.3MB). Free memory was 82.5MB in the beginning and 260.0MB in the end (delta: -177.6MB). Peak memory consumption was 132.0MB. Max. memory is 16.1GB. * Witness Printer took 102.32ms. Allocated memory is still 297.8MB. Free memory was 260.0MB in the beginning and 247.4MB in the end (delta: 12.6MB). Peak memory consumption was 14.7MB. 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L715] 0 int a = 0; [L716] 0 _Bool a$flush_delayed; [L717] 0 int a$mem_tmp; [L718] 0 _Bool a$r_buff0_thd0; [L719] 0 _Bool a$r_buff0_thd1; [L720] 0 _Bool a$r_buff0_thd2; [L721] 0 _Bool a$r_buff0_thd3; [L722] 0 _Bool a$r_buff1_thd0; [L723] 0 _Bool a$r_buff1_thd1; [L724] 0 _Bool a$r_buff1_thd2; [L725] 0 _Bool a$r_buff1_thd3; [L726] 0 _Bool a$read_delayed; [L727] 0 int *a$read_delayed_var; [L728] 0 int a$w_buff0; [L729] 0 _Bool a$w_buff0_used; [L730] 0 int a$w_buff1; [L731] 0 _Bool a$w_buff1_used; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L737] 0 int y = 0; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L841] 0 pthread_t t1193; [L842] FCALL, FORK 0 pthread_create(&t1193, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1193=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L745] 1 a$w_buff1 = a$w_buff0 [L746] 1 a$w_buff0 = 1 [L747] 1 a$w_buff1_used = a$w_buff0_used [L748] 1 a$w_buff0_used = (_Bool)1 [L749] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L749] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L750] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L751] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L752] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L753] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L754] 1 a$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L843] 0 pthread_t t1194; [L844] FCALL, FORK 0 pthread_create(&t1194, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1193=-3, t1194=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L757] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L845] 0 pthread_t t1195; [L846] FCALL, FORK 0 pthread_create(&t1195, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1193=-3, t1194=-2, t1195=-1, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L774] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L777] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L780] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L781] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L782] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L783] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L784] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L794] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L797] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L800] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 a$flush_delayed = weak$$choice2 [L806] 3 a$mem_tmp = a [L807] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L808] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L809] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L810] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L811] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L812] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L813] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 __unbuffered_p2_EBX = a [L815] 3 a = a$flush_delayed ? a$mem_tmp : a [L816] 3 a$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z=1] [L760] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L761] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L762] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L763] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L764] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z=1] [L819] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L820] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L821] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L822] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L823] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z=1] [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z=1] [L848] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1193=-3, t1194=-2, t1195=-1, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z=1] [L850] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L850] RET 0 assume_abort_if_not(main$tmp_guard0) [L852] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L853] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L854] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L855] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L856] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1193=-3, t1194=-2, t1195=-1, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z=1] [L859] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1193=-3, t1194=-2, t1195=-1, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z=1] [L861] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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: 842]: 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: 846]: 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: 844]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 68 locations, 6 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: 6.5s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 310 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 286 mSDsluCounter, 90 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 70 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 811 IncrementalHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 20 mSDtfsCounter, 811 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=172occurred in iteration=7, InterpolantAutomatonStates: 37, 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, 0.6s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 185 NumberOfCodeBlocks, 185 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 147 ConstructedInterpolants, 0 QuantifiedInterpolants, 700 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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-13 06:56:16,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE