./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix016.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/pthread-wmm/mix016.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 19a854e56177f3540c5827f949efdd83ec94b87c6cd0ec772115563b836c4c8b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 13:32:05,189 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 13:32:05,260 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 13:32:05,268 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 13:32:05,268 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 13:32:05,302 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 13:32:05,302 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 13:32:05,302 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 13:32:05,303 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 13:32:05,304 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 13:32:05,305 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 13:32:05,305 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 13:32:05,305 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 13:32:05,306 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 13:32:05,308 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 13:32:05,308 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 13:32:05,308 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 13:32:05,308 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 13:32:05,309 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 13:32:05,309 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 13:32:05,309 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 13:32:05,313 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 13:32:05,313 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 13:32:05,313 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 13:32:05,314 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 13:32:05,315 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 13:32:05,315 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 13:32:05,315 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 13:32:05,315 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 13:32:05,316 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 13:32:05,316 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 13:32:05,316 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 13:32:05,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:32:05,316 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 13:32:05,316 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 13:32:05,317 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 13:32:05,317 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 13:32:05,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 13:32:05,317 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 13:32:05,317 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 13:32:05,317 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 13:32:05,318 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 13:32:05,318 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 -> 19a854e56177f3540c5827f949efdd83ec94b87c6cd0ec772115563b836c4c8b [2024-11-22 13:32:05,574 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 13:32:05,593 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 13:32:05,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 13:32:05,600 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 13:32:05,602 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 13:32:05,603 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix016.oepc.i [2024-11-22 13:32:07,026 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 13:32:07,224 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 13:32:07,224 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix016.oepc.i [2024-11-22 13:32:07,241 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7976e501f/ed1d4148cfbf4911b5be31b8ee218300/FLAG05e04aafb [2024-11-22 13:32:07,253 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7976e501f/ed1d4148cfbf4911b5be31b8ee218300 [2024-11-22 13:32:07,255 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 13:32:07,257 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 13:32:07,258 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 13:32:07,258 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 13:32:07,263 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 13:32:07,264 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:32:07" (1/1) ... [2024-11-22 13:32:07,264 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ff41797 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:32:07, skipping insertion in model container [2024-11-22 13:32:07,265 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:32:07" (1/1) ... [2024-11-22 13:32:07,311 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 13:32:07,485 WARN L250 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/mix016.oepc.i[945,958] [2024-11-22 13:32:07,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:32:07,688 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 13:32:07,697 WARN L250 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/mix016.oepc.i[945,958] [2024-11-22 13:32:07,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:32:07,763 INFO L204 MainTranslator]: Completed translation [2024-11-22 13:32:07,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:32:07 WrapperNode [2024-11-22 13:32:07,763 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 13:32:07,764 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 13:32:07,765 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 13:32:07,765 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 13:32:07,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:32:07" (1/1) ... [2024-11-22 13:32:07,788 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:32:07" (1/1) ... [2024-11-22 13:32:07,830 INFO L138 Inliner]: procedures = 175, calls = 44, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 117 [2024-11-22 13:32:07,833 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 13:32:07,834 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 13:32:07,834 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 13:32:07,834 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 13:32:07,843 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:32:07" (1/1) ... [2024-11-22 13:32:07,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:32:07" (1/1) ... [2024-11-22 13:32:07,847 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:32:07" (1/1) ... [2024-11-22 13:32:07,865 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-11-22 13:32:07,869 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:32:07" (1/1) ... [2024-11-22 13:32:07,869 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:32:07" (1/1) ... [2024-11-22 13:32:07,901 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:32:07" (1/1) ... [2024-11-22 13:32:07,902 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:32:07" (1/1) ... [2024-11-22 13:32:07,909 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:32:07" (1/1) ... [2024-11-22 13:32:07,918 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:32:07" (1/1) ... [2024-11-22 13:32:07,920 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 13:32:07,927 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 13:32:07,931 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 13:32:07,931 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 13:32:07,932 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:32:07" (1/1) ... [2024-11-22 13:32:07,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:32:07,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:32:08,008 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-11-22 13:32:08,014 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-11-22 13:32:08,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-22 13:32:08,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 13:32:08,053 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-22 13:32:08,054 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-22 13:32:08,054 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-22 13:32:08,054 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-22 13:32:08,054 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-22 13:32:08,054 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-22 13:32:08,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 13:32:08,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-22 13:32:08,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 13:32:08,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 13:32:08,059 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-22 13:32:08,160 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 13:32:08,166 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 13:32:08,473 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-22 13:32:08,473 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 13:32:08,596 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 13:32:08,597 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-22 13:32:08,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:32:08 BoogieIcfgContainer [2024-11-22 13:32:08,597 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 13:32:08,599 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 13:32:08,599 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 13:32:08,602 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 13:32:08,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:32:07" (1/3) ... [2024-11-22 13:32:08,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c751f96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:32:08, skipping insertion in model container [2024-11-22 13:32:08,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:32:07" (2/3) ... [2024-11-22 13:32:08,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c751f96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:32:08, skipping insertion in model container [2024-11-22 13:32:08,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:32:08" (3/3) ... [2024-11-22 13:32:08,604 INFO L112 eAbstractionObserver]: Analyzing ICFG mix016.oepc.i [2024-11-22 13:32:08,616 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 13:32:08,616 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-22 13:32:08,617 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-22 13:32:08,653 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-22 13:32:08,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 40 transitions, 92 flow [2024-11-22 13:32:08,697 INFO L124 PetriNetUnfolderBase]: 1/37 cut-off events. [2024-11-22 13:32:08,697 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 13:32:08,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 1/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2024-11-22 13:32:08,700 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 40 transitions, 92 flow [2024-11-22 13:32:08,702 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 37 transitions, 83 flow [2024-11-22 13:32:08,709 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 13:32:08,714 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;@377ff52d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 13:32:08,714 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-22 13:32:08,717 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 13:32:08,717 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-22 13:32:08,717 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 13:32:08,717 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:32:08,718 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-22 13:32:08,718 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-11-22 13:32:08,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:32:08,722 INFO L85 PathProgramCache]: Analyzing trace with hash 11108317, now seen corresponding path program 1 times [2024-11-22 13:32:08,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:32:08,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988205605] [2024-11-22 13:32:08,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:32:08,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:32:08,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:32:09,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:32:09,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:32:09,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988205605] [2024-11-22 13:32:09,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988205605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:32:09,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:32:09,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 13:32:09,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517600508] [2024-11-22 13:32:09,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:32:09,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 13:32:09,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:32:09,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 13:32:09,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 13:32:09,098 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 40 [2024-11-22 13:32:09,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:32:09,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:32:09,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 40 [2024-11-22 13:32:09,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:32:09,435 INFO L124 PetriNetUnfolderBase]: 617/1160 cut-off events. [2024-11-22 13:32:09,436 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-22 13:32:09,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2137 conditions, 1160 events. 617/1160 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7219 event pairs, 95 based on Foata normal form. 45/1183 useless extension candidates. Maximal degree in co-relation 2126. Up to 763 conditions per place. [2024-11-22 13:32:09,450 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 29 selfloop transitions, 2 changer transitions 2/49 dead transitions. [2024-11-22 13:32:09,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 49 transitions, 179 flow [2024-11-22 13:32:09,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 13:32:09,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 13:32:09,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-11-22 13:32:09,462 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.775 [2024-11-22 13:32:09,464 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 83 flow. Second operand 3 states and 93 transitions. [2024-11-22 13:32:09,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 49 transitions, 179 flow [2024-11-22 13:32:09,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 49 transitions, 174 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-22 13:32:09,470 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 78 flow [2024-11-22 13:32:09,473 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, 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=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2024-11-22 13:32:09,476 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, -2 predicate places. [2024-11-22 13:32:09,477 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 78 flow [2024-11-22 13:32:09,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:32:09,477 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:32:09,477 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:32:09,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 13:32:09,478 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-11-22 13:32:09,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:32:09,479 INFO L85 PathProgramCache]: Analyzing trace with hash 362133518, now seen corresponding path program 1 times [2024-11-22 13:32:09,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:32:09,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081711580] [2024-11-22 13:32:09,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:32:09,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:32:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:32:09,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:32:09,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:32:09,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081711580] [2024-11-22 13:32:09,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081711580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:32:09,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:32:09,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 13:32:09,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874886889] [2024-11-22 13:32:09,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:32:09,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:32:09,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:32:09,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:32:09,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:32:09,655 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2024-11-22 13:32:09,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:32:09,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:32:09,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2024-11-22 13:32:09,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:32:09,979 INFO L124 PetriNetUnfolderBase]: 1318/2354 cut-off events. [2024-11-22 13:32:09,980 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2024-11-22 13:32:09,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4533 conditions, 2354 events. 1318/2354 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 15056 event pairs, 188 based on Foata normal form. 100/2332 useless extension candidates. Maximal degree in co-relation 4523. Up to 1053 conditions per place. [2024-11-22 13:32:09,989 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 41 selfloop transitions, 5 changer transitions 1/59 dead transitions. [2024-11-22 13:32:09,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 59 transitions, 230 flow [2024-11-22 13:32:09,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:32:09,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 13:32:09,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-11-22 13:32:09,991 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.68125 [2024-11-22 13:32:09,991 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 78 flow. Second operand 4 states and 109 transitions. [2024-11-22 13:32:09,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 59 transitions, 230 flow [2024-11-22 13:32:09,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 59 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 13:32:09,993 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 108 flow [2024-11-22 13:32:09,993 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2024-11-22 13:32:09,993 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 0 predicate places. [2024-11-22 13:32:09,994 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 108 flow [2024-11-22 13:32:09,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:32:10,005 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:32:10,005 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-11-22 13:32:10,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 13:32:10,006 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-11-22 13:32:10,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:32:10,006 INFO L85 PathProgramCache]: Analyzing trace with hash 751234294, now seen corresponding path program 1 times [2024-11-22 13:32:10,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:32:10,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535474097] [2024-11-22 13:32:10,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:32:10,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:32:10,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:32:10,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:32:10,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:32:10,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535474097] [2024-11-22 13:32:10,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535474097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:32:10,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:32:10,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 13:32:10,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734336315] [2024-11-22 13:32:10,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:32:10,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 13:32:10,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:32:10,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 13:32:10,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 13:32:10,207 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2024-11-22 13:32:10,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:32:10,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:32:10,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2024-11-22 13:32:10,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:32:10,438 INFO L124 PetriNetUnfolderBase]: 886/1568 cut-off events. [2024-11-22 13:32:10,438 INFO L125 PetriNetUnfolderBase]: For 411/411 co-relation queries the response was YES. [2024-11-22 13:32:10,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3545 conditions, 1568 events. 886/1568 cut-off events. For 411/411 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8770 event pairs, 100 based on Foata normal form. 82/1577 useless extension candidates. Maximal degree in co-relation 3533. Up to 465 conditions per place. [2024-11-22 13:32:10,445 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 52 selfloop transitions, 8 changer transitions 1/73 dead transitions. [2024-11-22 13:32:10,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 73 transitions, 323 flow [2024-11-22 13:32:10,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:32:10,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 13:32:10,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2024-11-22 13:32:10,449 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.69 [2024-11-22 13:32:10,450 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 108 flow. Second operand 5 states and 138 transitions. [2024-11-22 13:32:10,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 73 transitions, 323 flow [2024-11-22 13:32:10,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 73 transitions, 313 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-22 13:32:10,453 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 148 flow [2024-11-22 13:32:10,453 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=148, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2024-11-22 13:32:10,454 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 4 predicate places. [2024-11-22 13:32:10,454 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 148 flow [2024-11-22 13:32:10,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:32:10,454 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:32:10,455 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-11-22 13:32:10,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 13:32:10,455 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-11-22 13:32:10,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:32:10,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1840932877, now seen corresponding path program 1 times [2024-11-22 13:32:10,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:32:10,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706047260] [2024-11-22 13:32:10,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:32:10,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:32:10,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:32:10,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:32:10,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:32:10,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706047260] [2024-11-22 13:32:10,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706047260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:32:10,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:32:10,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 13:32:10,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259118077] [2024-11-22 13:32:10,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:32:10,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:32:10,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:32:10,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:32:10,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:32:10,737 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2024-11-22 13:32:10,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 148 flow. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:32:10,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:32:10,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2024-11-22 13:32:10,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:32:10,917 INFO L124 PetriNetUnfolderBase]: 557/941 cut-off events. [2024-11-22 13:32:10,917 INFO L125 PetriNetUnfolderBase]: For 806/806 co-relation queries the response was YES. [2024-11-22 13:32:10,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2435 conditions, 941 events. 557/941 cut-off events. For 806/806 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4327 event pairs, 83 based on Foata normal form. 40/942 useless extension candidates. Maximal degree in co-relation 2421. Up to 308 conditions per place. [2024-11-22 13:32:10,922 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 45 selfloop transitions, 11 changer transitions 1/69 dead transitions. [2024-11-22 13:32:10,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 69 transitions, 330 flow [2024-11-22 13:32:10,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 13:32:10,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 13:32:10,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-11-22 13:32:10,924 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6208333333333333 [2024-11-22 13:32:10,924 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 148 flow. Second operand 6 states and 149 transitions. [2024-11-22 13:32:10,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 69 transitions, 330 flow [2024-11-22 13:32:10,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 69 transitions, 305 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-22 13:32:10,928 INFO L231 Difference]: Finished difference. Result has 53 places, 40 transitions, 162 flow [2024-11-22 13:32:10,928 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=162, PETRI_PLACES=53, PETRI_TRANSITIONS=40} [2024-11-22 13:32:10,929 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2024-11-22 13:32:10,929 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 162 flow [2024-11-22 13:32:10,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:32:10,929 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:32:10,930 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] [2024-11-22 13:32:10,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 13:32:10,930 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-11-22 13:32:10,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:32:10,930 INFO L85 PathProgramCache]: Analyzing trace with hash 384890394, now seen corresponding path program 1 times [2024-11-22 13:32:10,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:32:10,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592167943] [2024-11-22 13:32:10,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:32:10,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:32:11,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:32:12,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:32:12,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:32:12,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592167943] [2024-11-22 13:32:12,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592167943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:32:12,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:32:12,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 13:32:12,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15942414] [2024-11-22 13:32:12,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:32:12,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 13:32:12,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:32:12,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 13:32:12,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:32:12,284 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 40 [2024-11-22 13:32:12,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 162 flow. Second operand has 9 states, 9 states have (on average 18.88888888888889) internal successors, (170), 9 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:32:12,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:32:12,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 40 [2024-11-22 13:32:12,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:32:12,644 INFO L124 PetriNetUnfolderBase]: 453/876 cut-off events. [2024-11-22 13:32:12,644 INFO L125 PetriNetUnfolderBase]: For 479/503 co-relation queries the response was YES. [2024-11-22 13:32:12,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2062 conditions, 876 events. 453/876 cut-off events. For 479/503 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4516 event pairs, 90 based on Foata normal form. 8/839 useless extension candidates. Maximal degree in co-relation 2047. Up to 236 conditions per place. [2024-11-22 13:32:12,649 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 32 selfloop transitions, 4 changer transitions 24/80 dead transitions. [2024-11-22 13:32:12,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 80 transitions, 378 flow [2024-11-22 13:32:12,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 13:32:12,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-22 13:32:12,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 214 transitions. [2024-11-22 13:32:12,651 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5944444444444444 [2024-11-22 13:32:12,651 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 162 flow. Second operand 9 states and 214 transitions. [2024-11-22 13:32:12,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 80 transitions, 378 flow [2024-11-22 13:32:12,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 80 transitions, 314 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-11-22 13:32:12,656 INFO L231 Difference]: Finished difference. Result has 57 places, 40 transitions, 124 flow [2024-11-22 13:32:12,657 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=124, PETRI_PLACES=57, PETRI_TRANSITIONS=40} [2024-11-22 13:32:12,657 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 11 predicate places. [2024-11-22 13:32:12,658 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 40 transitions, 124 flow [2024-11-22 13:32:12,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.88888888888889) internal successors, (170), 9 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:32:12,659 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:32:12,659 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] [2024-11-22 13:32:12,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 13:32:12,659 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-11-22 13:32:12,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:32:12,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1896287066, now seen corresponding path program 2 times [2024-11-22 13:32:12,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:32:12,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016345622] [2024-11-22 13:32:12,661 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 13:32:12,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:32:12,722 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 13:32:12,722 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:32:12,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:32:12,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:32:12,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016345622] [2024-11-22 13:32:12,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016345622] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:32:12,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:32:12,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 13:32:12,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863473739] [2024-11-22 13:32:12,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:32:12,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:32:12,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:32:12,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:32:12,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:32:12,906 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2024-11-22 13:32:12,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 40 transitions, 124 flow. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:32:12,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:32:12,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2024-11-22 13:32:12,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:32:13,169 INFO L124 PetriNetUnfolderBase]: 697/1320 cut-off events. [2024-11-22 13:32:13,169 INFO L125 PetriNetUnfolderBase]: For 235/235 co-relation queries the response was YES. [2024-11-22 13:32:13,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2865 conditions, 1320 events. 697/1320 cut-off events. For 235/235 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7198 event pairs, 182 based on Foata normal form. 8/1281 useless extension candidates. Maximal degree in co-relation 2850. Up to 562 conditions per place. [2024-11-22 13:32:13,173 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 29 selfloop transitions, 1 changer transitions 22/70 dead transitions. [2024-11-22 13:32:13,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 70 transitions, 311 flow [2024-11-22 13:32:13,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 13:32:13,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 13:32:13,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2024-11-22 13:32:13,175 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5958333333333333 [2024-11-22 13:32:13,175 INFO L175 Difference]: Start difference. First operand has 57 places, 40 transitions, 124 flow. Second operand 6 states and 143 transitions. [2024-11-22 13:32:13,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 70 transitions, 311 flow [2024-11-22 13:32:13,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 70 transitions, 285 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-11-22 13:32:13,179 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 121 flow [2024-11-22 13:32:13,179 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=121, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2024-11-22 13:32:13,181 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 9 predicate places. [2024-11-22 13:32:13,181 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 121 flow [2024-11-22 13:32:13,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:32:13,181 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:32:13,181 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] [2024-11-22 13:32:13,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 13:32:13,182 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-11-22 13:32:13,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:32:13,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1337897998, now seen corresponding path program 3 times [2024-11-22 13:32:13,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:32:13,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611539175] [2024-11-22 13:32:13,183 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 13:32:13,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:32:13,257 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-22 13:32:13,257 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:32:13,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:32:13,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:32:13,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611539175] [2024-11-22 13:32:13,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611539175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:32:13,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:32:13,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 13:32:13,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61179010] [2024-11-22 13:32:13,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:32:13,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:32:13,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:32:13,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:32:13,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:32:13,443 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2024-11-22 13:32:13,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 121 flow. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:32:13,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:32:13,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2024-11-22 13:32:13,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:32:13,711 INFO L124 PetriNetUnfolderBase]: 768/1477 cut-off events. [2024-11-22 13:32:13,711 INFO L125 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2024-11-22 13:32:13,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3026 conditions, 1477 events. 768/1477 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8446 event pairs, 233 based on Foata normal form. 8/1433 useless extension candidates. Maximal degree in co-relation 3011. Up to 541 conditions per place. [2024-11-22 13:32:13,715 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 24 selfloop transitions, 1 changer transitions 23/66 dead transitions. [2024-11-22 13:32:13,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 66 transitions, 278 flow [2024-11-22 13:32:13,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 13:32:13,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 13:32:13,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2024-11-22 13:32:13,716 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5791666666666667 [2024-11-22 13:32:13,716 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 121 flow. Second operand 6 states and 139 transitions. [2024-11-22 13:32:13,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 66 transitions, 278 flow [2024-11-22 13:32:13,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 66 transitions, 267 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-22 13:32:13,720 INFO L231 Difference]: Finished difference. Result has 57 places, 40 transitions, 125 flow [2024-11-22 13:32:13,720 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=125, PETRI_PLACES=57, PETRI_TRANSITIONS=40} [2024-11-22 13:32:13,720 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 11 predicate places. [2024-11-22 13:32:13,721 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 40 transitions, 125 flow [2024-11-22 13:32:13,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:32:13,721 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:32:13,721 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] [2024-11-22 13:32:13,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 13:32:13,721 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-11-22 13:32:13,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:32:13,722 INFO L85 PathProgramCache]: Analyzing trace with hash 540585806, now seen corresponding path program 4 times [2024-11-22 13:32:13,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:32:13,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210459284] [2024-11-22 13:32:13,722 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 13:32:13,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:32:13,785 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 13:32:13,785 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-22 13:32:13,785 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 13:32:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 13:32:13,893 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 13:32:13,893 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 13:32:13,894 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-11-22 13:32:13,895 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-11-22 13:32:13,896 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-11-22 13:32:13,896 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-22 13:32:13,896 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-22 13:32:13,896 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-11-22 13:32:13,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 13:32:13,896 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2024-11-22 13:32:13,966 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-22 13:32:13,966 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 13:32:13,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:32:13 BasicIcfg [2024-11-22 13:32:13,972 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 13:32:13,972 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 13:32:13,972 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 13:32:13,972 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 13:32:13,973 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:32:08" (3/4) ... [2024-11-22 13:32:13,978 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-22 13:32:14,063 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 13:32:14,063 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 13:32:14,064 INFO L158 Benchmark]: Toolchain (without parser) took 6806.88ms. Allocated memory was 218.1MB in the beginning and 417.3MB in the end (delta: 199.2MB). Free memory was 144.8MB in the beginning and 268.1MB in the end (delta: -123.3MB). Peak memory consumption was 78.9MB. Max. memory is 16.1GB. [2024-11-22 13:32:14,064 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 218.1MB. Free memory is still 175.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 13:32:14,067 INFO L158 Benchmark]: CACSL2BoogieTranslator took 505.50ms. Allocated memory is still 218.1MB. Free memory was 144.8MB in the beginning and 118.3MB in the end (delta: 26.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-22 13:32:14,068 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.91ms. Allocated memory is still 218.1MB. Free memory was 118.3MB in the beginning and 115.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 13:32:14,068 INFO L158 Benchmark]: Boogie Preprocessor took 86.33ms. Allocated memory is still 218.1MB. Free memory was 115.8MB in the beginning and 187.2MB in the end (delta: -71.5MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. [2024-11-22 13:32:14,068 INFO L158 Benchmark]: RCFGBuilder took 670.81ms. Allocated memory is still 218.1MB. Free memory was 187.2MB in the beginning and 135.3MB in the end (delta: 51.9MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-11-22 13:32:14,068 INFO L158 Benchmark]: TraceAbstraction took 5372.76ms. Allocated memory was 218.1MB in the beginning and 417.3MB in the end (delta: 199.2MB). Free memory was 134.3MB in the beginning and 281.8MB in the end (delta: -147.5MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. [2024-11-22 13:32:14,069 INFO L158 Benchmark]: Witness Printer took 91.26ms. Allocated memory is still 417.3MB. Free memory was 280.8MB in the beginning and 268.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-22 13:32:14,070 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.10ms. Allocated memory is still 218.1MB. Free memory is still 175.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 505.50ms. Allocated memory is still 218.1MB. Free memory was 144.8MB in the beginning and 118.3MB in the end (delta: 26.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.91ms. Allocated memory is still 218.1MB. Free memory was 118.3MB in the beginning and 115.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.33ms. Allocated memory is still 218.1MB. Free memory was 115.8MB in the beginning and 187.2MB in the end (delta: -71.5MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. * RCFGBuilder took 670.81ms. Allocated memory is still 218.1MB. Free memory was 187.2MB in the beginning and 135.3MB in the end (delta: 51.9MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5372.76ms. Allocated memory was 218.1MB in the beginning and 417.3MB in the end (delta: 199.2MB). Free memory was 134.3MB in the beginning and 281.8MB in the end (delta: -147.5MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. * Witness Printer took 91.26ms. Allocated memory is still 417.3MB. Free memory was 280.8MB in the beginning and 268.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L725] 0 int z = 0; [L726] 0 _Bool z$flush_delayed; [L727] 0 int z$mem_tmp; [L728] 0 _Bool z$r_buff0_thd0; [L729] 0 _Bool z$r_buff0_thd1; [L730] 0 _Bool z$r_buff0_thd2; [L731] 0 _Bool z$r_buff0_thd3; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$read_delayed; [L737] 0 int *z$read_delayed_var; [L738] 0 int z$w_buff0; [L739] 0 _Bool z$w_buff0_used; [L740] 0 int z$w_buff1; [L741] 0 _Bool z$w_buff1_used; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L840] 0 pthread_t t409; [L841] FCALL, FORK 0 pthread_create(&t409, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t409=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L747] 1 z$w_buff1 = z$w_buff0 [L748] 1 z$w_buff0 = 1 [L749] 1 z$w_buff1_used = z$w_buff0_used [L750] 1 z$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L752] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L753] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L754] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L755] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L756] 1 z$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L842] 0 pthread_t t410; [L843] FCALL, FORK 0 pthread_create(&t410, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t409=-3, t410=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L776] 2 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L779] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L844] 0 pthread_t t411; [L845] FCALL, FORK 0 pthread_create(&t411, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t409=-3, t410=-2, t411=-1, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L783] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L784] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L785] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L786] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L796] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L799] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L802] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L803] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L804] 3 z$flush_delayed = weak$$choice2 [L805] 3 z$mem_tmp = z [L806] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L807] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L808] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L809] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L810] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L812] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] 3 __unbuffered_p2_EBX = z [L814] 3 z = z$flush_delayed ? z$mem_tmp : z [L815] 3 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L762] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L763] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L764] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L765] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L766] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L818] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L819] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L820] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L821] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L822] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L847] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t409=-3, t410=-2, t411=-1, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L849] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L849] RET 0 assume_abort_if_not(main$tmp_guard0) [L851] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L852] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L853] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L854] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L855] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t409=-3, t410=-2, t411=-1, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L858] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t409=-3, t410=-2, t411=-1, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L860] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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: 845]: 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: 841]: 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: 843]: 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, 66 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: 5.2s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 336 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 318 mSDsluCounter, 88 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 82 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 902 IncrementalHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 6 mSDtfsCounter, 902 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred in iteration=4, InterpolantAutomatonStates: 39, 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.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 181 NumberOfCodeBlocks, 181 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 656 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-11-22 13:32:14,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE