/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.fix-rcfgbuilder-lbe-0ccecc1-m [2023-11-10 11:41:43,348 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-10 11:41:43,410 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-10 11:41:43,439 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-10 11:41:43,440 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-10 11:41:43,440 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-10 11:41:43,441 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-10 11:41:43,441 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-10 11:41:43,441 INFO L153 SettingsManager]: * Use SBE=true [2023-11-10 11:41:43,444 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-10 11:41:43,444 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-10 11:41:43,444 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-10 11:41:43,445 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-10 11:41:43,446 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-10 11:41:43,446 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-10 11:41:43,446 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-10 11:41:43,446 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-10 11:41:43,446 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-10 11:41:43,446 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-10 11:41:43,447 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-10 11:41:43,447 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-10 11:41:43,447 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-10 11:41:43,448 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-10 11:41:43,448 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-10 11:41:43,448 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-10 11:41:43,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 11:41:43,448 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-10 11:41:43,448 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-10 11:41:43,448 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-10 11:41:43,449 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-10 11:41:43,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-10 11:41:43,449 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-10 11:41:43,449 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-10 11:41:43,450 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2023-11-10 11:41:43,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-10 11:41:43,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-10 11:41:43,642 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-10 11:41:43,643 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-10 11:41:43,643 INFO L274 PluginConnector]: CDTParser initialized [2023-11-10 11:41:43,644 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i [2023-11-10 11:41:44,605 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-10 11:41:44,754 INFO L384 CDTParser]: Found 1 translation units. [2023-11-10 11:41:44,754 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i [2023-11-10 11:41:44,765 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58d3e2c78/edc8d20ed7254e589fdc1738cba6e009/FLAG208a4ad24 [2023-11-10 11:41:44,773 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58d3e2c78/edc8d20ed7254e589fdc1738cba6e009 [2023-11-10 11:41:44,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-10 11:41:44,776 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-10 11:41:44,777 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-10 11:41:44,777 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-10 11:41:44,779 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-10 11:41:44,780 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:41:44" (1/1) ... [2023-11-10 11:41:44,780 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@de4b845 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:41:44, skipping insertion in model container [2023-11-10 11:41:44,781 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:41:44" (1/1) ... [2023-11-10 11:41:44,818 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-10 11:41:44,922 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-11-10 11:41:45,018 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 11:41:45,028 INFO L202 MainTranslator]: Completed pre-run [2023-11-10 11:41:45,036 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-11-10 11:41:45,063 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 11:41:45,082 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-10 11:41:45,082 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-10 11:41:45,088 INFO L206 MainTranslator]: Completed translation [2023-11-10 11:41:45,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:41:45 WrapperNode [2023-11-10 11:41:45,088 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-10 11:41:45,089 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-10 11:41:45,089 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-10 11:41:45,089 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-10 11:41:45,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:41:45" (1/1) ... [2023-11-10 11:41:45,104 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:41:45" (1/1) ... [2023-11-10 11:41:45,121 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 131 [2023-11-10 11:41:45,122 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-10 11:41:45,122 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-10 11:41:45,122 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-10 11:41:45,122 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-10 11:41:45,128 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:41:45" (1/1) ... [2023-11-10 11:41:45,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:41:45" (1/1) ... [2023-11-10 11:41:45,131 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:41:45" (1/1) ... [2023-11-10 11:41:45,131 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:41:45" (1/1) ... [2023-11-10 11:41:45,136 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:41:45" (1/1) ... [2023-11-10 11:41:45,137 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:41:45" (1/1) ... [2023-11-10 11:41:45,139 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:41:45" (1/1) ... [2023-11-10 11:41:45,140 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:41:45" (1/1) ... [2023-11-10 11:41:45,142 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-10 11:41:45,142 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-10 11:41:45,142 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-10 11:41:45,142 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-10 11:41:45,143 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:41:45" (1/1) ... [2023-11-10 11:41:45,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 11:41:45,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:41:45,164 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-10 11:41:45,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-10 11:41:45,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-10 11:41:45,205 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-10 11:41:45,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-10 11:41:45,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-10 11:41:45,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-10 11:41:45,206 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-10 11:41:45,206 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-10 11:41:45,206 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-10 11:41:45,206 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-10 11:41:45,206 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-10 11:41:45,206 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-10 11:41:45,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-10 11:41:45,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-10 11:41:45,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-10 11:41:45,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-10 11:41:45,208 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-10 11:41:45,300 INFO L236 CfgBuilder]: Building ICFG [2023-11-10 11:41:45,302 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-10 11:41:45,515 INFO L277 CfgBuilder]: Performing block encoding [2023-11-10 11:41:45,592 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-10 11:41:45,592 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-10 11:41:45,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:41:45 BoogieIcfgContainer [2023-11-10 11:41:45,594 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-10 11:41:45,596 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-10 11:41:45,596 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-10 11:41:45,598 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-10 11:41:45,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 11:41:44" (1/3) ... [2023-11-10 11:41:45,599 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71111244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:41:45, skipping insertion in model container [2023-11-10 11:41:45,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:41:45" (2/3) ... [2023-11-10 11:41:45,599 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71111244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:41:45, skipping insertion in model container [2023-11-10 11:41:45,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:41:45" (3/3) ... [2023-11-10 11:41:45,600 INFO L112 eAbstractionObserver]: Analyzing ICFG mix033_power.oepc_pso.oepc_rmo.oepc.i [2023-11-10 11:41:45,610 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-10 11:41:45,611 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-10 11:41:45,611 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-10 11:41:45,650 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-10 11:41:45,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 120 transitions, 252 flow [2023-11-10 11:41:45,731 INFO L124 PetriNetUnfolderBase]: 3/117 cut-off events. [2023-11-10 11:41:45,732 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:41:45,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 117 events. 3/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2023-11-10 11:41:45,737 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 120 transitions, 252 flow [2023-11-10 11:41:45,741 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 117 transitions, 243 flow [2023-11-10 11:41:45,751 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-10 11:41:45,756 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, 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;@587c76bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-10 11:41:45,756 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-10 11:41:45,769 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-10 11:41:45,769 INFO L124 PetriNetUnfolderBase]: 1/47 cut-off events. [2023-11-10 11:41:45,769 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:41:45,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:41:45,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:41:45,770 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:41:45,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:41:45,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1873883124, now seen corresponding path program 1 times [2023-11-10 11:41:45,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:41:45,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232418161] [2023-11-10 11:41:45,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:41:45,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:41:45,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:41:46,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:41:46,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:41:46,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232418161] [2023-11-10 11:41:46,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232418161] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:41:46,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:41:46,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-10 11:41:46,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164539109] [2023-11-10 11:41:46,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:41:46,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-10 11:41:46,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:41:46,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-10 11:41:46,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-10 11:41:46,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 120 [2023-11-10 11:41:46,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 117 transitions, 243 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:41:46,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:41:46,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 120 [2023-11-10 11:41:46,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:41:46,370 INFO L124 PetriNetUnfolderBase]: 58/328 cut-off events. [2023-11-10 11:41:46,370 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-11-10 11:41:46,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 457 conditions, 328 events. 58/328 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1459 event pairs, 44 based on Foata normal form. 25/335 useless extension candidates. Maximal degree in co-relation 405. Up to 79 conditions per place. [2023-11-10 11:41:46,376 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 14 selfloop transitions, 2 changer transitions 0/118 dead transitions. [2023-11-10 11:41:46,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 118 transitions, 283 flow [2023-11-10 11:41:46,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-10 11:41:46,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-10 11:41:46,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions. [2023-11-10 11:41:46,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9361111111111111 [2023-11-10 11:41:46,390 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 337 transitions. [2023-11-10 11:41:46,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 337 transitions. [2023-11-10 11:41:46,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:41:46,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 337 transitions. [2023-11-10 11:41:46,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:41:46,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:41:46,413 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:41:46,414 INFO L175 Difference]: Start difference. First operand has 124 places, 117 transitions, 243 flow. Second operand 3 states and 337 transitions. [2023-11-10 11:41:46,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 118 transitions, 283 flow [2023-11-10 11:41:46,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 118 transitions, 278 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-10 11:41:46,423 INFO L231 Difference]: Finished difference. Result has 121 places, 112 transitions, 234 flow [2023-11-10 11:41:46,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=121, PETRI_TRANSITIONS=112} [2023-11-10 11:41:46,428 INFO L281 CegarLoopForPetriNet]: 124 programPoint places, -3 predicate places. [2023-11-10 11:41:46,428 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 112 transitions, 234 flow [2023-11-10 11:41:46,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:41:46,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:41:46,429 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:41:46,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-10 11:41:46,429 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:41:46,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:41:46,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1573281951, now seen corresponding path program 1 times [2023-11-10 11:41:46,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:41:46,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477183481] [2023-11-10 11:41:46,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:41:46,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:41:46,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:41:46,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:41:46,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:41:46,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477183481] [2023-11-10 11:41:46,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477183481] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:41:46,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:41:46,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-10 11:41:46,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68372574] [2023-11-10 11:41:46,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:41:46,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 11:41:46,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:41:46,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 11:41:46,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-10 11:41:46,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 120 [2023-11-10 11:41:46,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 112 transitions, 234 flow. Second operand has 7 states, 7 states have (on average 89.14285714285714) internal successors, (624), 7 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:41:46,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:41:46,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 120 [2023-11-10 11:41:46,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:41:47,821 INFO L124 PetriNetUnfolderBase]: 3558/7454 cut-off events. [2023-11-10 11:41:47,822 INFO L125 PetriNetUnfolderBase]: For 306/306 co-relation queries the response was YES. [2023-11-10 11:41:47,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13112 conditions, 7454 events. 3558/7454 cut-off events. For 306/306 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 60813 event pairs, 397 based on Foata normal form. 0/7305 useless extension candidates. Maximal degree in co-relation 13056. Up to 2042 conditions per place. [2023-11-10 11:41:47,844 INFO L140 encePairwiseOnDemand]: 105/120 looper letters, 36 selfloop transitions, 9 changer transitions 108/227 dead transitions. [2023-11-10 11:41:47,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 227 transitions, 764 flow [2023-11-10 11:41:47,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-10 11:41:47,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-10 11:41:47,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1277 transitions. [2023-11-10 11:41:47,847 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8185897435897436 [2023-11-10 11:41:47,847 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1277 transitions. [2023-11-10 11:41:47,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1277 transitions. [2023-11-10 11:41:47,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:41:47,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1277 transitions. [2023-11-10 11:41:47,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 98.23076923076923) internal successors, (1277), 13 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:41:47,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 120.0) internal successors, (1680), 14 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:41:47,853 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 120.0) internal successors, (1680), 14 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:41:47,854 INFO L175 Difference]: Start difference. First operand has 121 places, 112 transitions, 234 flow. Second operand 13 states and 1277 transitions. [2023-11-10 11:41:47,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 227 transitions, 764 flow [2023-11-10 11:41:47,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 227 transitions, 746 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-10 11:41:47,857 INFO L231 Difference]: Finished difference. Result has 143 places, 104 transitions, 312 flow [2023-11-10 11:41:47,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=312, PETRI_PLACES=143, PETRI_TRANSITIONS=104} [2023-11-10 11:41:47,858 INFO L281 CegarLoopForPetriNet]: 124 programPoint places, 19 predicate places. [2023-11-10 11:41:47,858 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 104 transitions, 312 flow [2023-11-10 11:41:47,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.14285714285714) internal successors, (624), 7 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:41:47,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:41:47,858 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:41:47,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-10 11:41:47,859 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:41:47,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:41:47,859 INFO L85 PathProgramCache]: Analyzing trace with hash -123412895, now seen corresponding path program 1 times [2023-11-10 11:41:47,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:41:47,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374518869] [2023-11-10 11:41:47,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:41:47,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:41:47,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:41:48,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:41:48,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:41:48,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374518869] [2023-11-10 11:41:48,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374518869] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:41:48,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:41:48,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-10 11:41:48,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631618932] [2023-11-10 11:41:48,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:41:48,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 11:41:48,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:41:48,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 11:41:48,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-10 11:41:48,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 120 [2023-11-10 11:41:48,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 104 transitions, 312 flow. Second operand has 7 states, 7 states have (on average 89.28571428571429) internal successors, (625), 7 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:41:48,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:41:48,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 120 [2023-11-10 11:41:48,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:41:48,820 INFO L124 PetriNetUnfolderBase]: 1662/3449 cut-off events. [2023-11-10 11:41:48,820 INFO L125 PetriNetUnfolderBase]: For 5808/5836 co-relation queries the response was YES. [2023-11-10 11:41:48,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10123 conditions, 3449 events. 1662/3449 cut-off events. For 5808/5836 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 23956 event pairs, 458 based on Foata normal form. 90/3413 useless extension candidates. Maximal degree in co-relation 10051. Up to 919 conditions per place. [2023-11-10 11:41:48,838 INFO L140 encePairwiseOnDemand]: 110/120 looper letters, 42 selfloop transitions, 9 changer transitions 76/201 dead transitions. [2023-11-10 11:41:48,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 201 transitions, 1066 flow [2023-11-10 11:41:48,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-10 11:41:48,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-10 11:41:48,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1246 transitions. [2023-11-10 11:41:48,840 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7987179487179488 [2023-11-10 11:41:48,840 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1246 transitions. [2023-11-10 11:41:48,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1246 transitions. [2023-11-10 11:41:48,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:41:48,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1246 transitions. [2023-11-10 11:41:48,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 95.84615384615384) internal successors, (1246), 13 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:41:48,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 120.0) internal successors, (1680), 14 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:41:48,846 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 120.0) internal successors, (1680), 14 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:41:48,846 INFO L175 Difference]: Start difference. First operand has 143 places, 104 transitions, 312 flow. Second operand 13 states and 1246 transitions. [2023-11-10 11:41:48,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 201 transitions, 1066 flow [2023-11-10 11:41:48,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 201 transitions, 1014 flow, removed 24 selfloop flow, removed 4 redundant places. [2023-11-10 11:41:48,869 INFO L231 Difference]: Finished difference. Result has 141 places, 109 transitions, 413 flow [2023-11-10 11:41:48,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=413, PETRI_PLACES=141, PETRI_TRANSITIONS=109} [2023-11-10 11:41:48,871 INFO L281 CegarLoopForPetriNet]: 124 programPoint places, 17 predicate places. [2023-11-10 11:41:48,871 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 109 transitions, 413 flow [2023-11-10 11:41:48,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.28571428571429) internal successors, (625), 7 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:41:48,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:41:48,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:41:48,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-10 11:41:48,872 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:41:48,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:41:48,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1121663135, now seen corresponding path program 1 times [2023-11-10 11:41:48,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:41:48,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954685497] [2023-11-10 11:41:48,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:41:48,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:41:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:41:49,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:41:49,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:41:49,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954685497] [2023-11-10 11:41:49,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954685497] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:41:49,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:41:49,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-10 11:41:49,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650970595] [2023-11-10 11:41:49,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:41:49,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-10 11:41:49,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:41:49,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-10 11:41:49,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-10 11:41:49,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 120 [2023-11-10 11:41:49,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 109 transitions, 413 flow. Second operand has 6 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:41:49,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:41:49,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 120 [2023-11-10 11:41:49,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:41:49,721 INFO L124 PetriNetUnfolderBase]: 3105/5845 cut-off events. [2023-11-10 11:41:49,721 INFO L125 PetriNetUnfolderBase]: For 8606/9639 co-relation queries the response was YES. [2023-11-10 11:41:49,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14354 conditions, 5845 events. 3105/5845 cut-off events. For 8606/9639 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 45867 event pairs, 330 based on Foata normal form. 46/5444 useless extension candidates. Maximal degree in co-relation 14276. Up to 1801 conditions per place. [2023-11-10 11:41:49,753 INFO L140 encePairwiseOnDemand]: 110/120 looper letters, 75 selfloop transitions, 17 changer transitions 13/190 dead transitions. [2023-11-10 11:41:49,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 190 transitions, 985 flow [2023-11-10 11:41:49,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-10 11:41:49,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-10 11:41:49,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1021 transitions. [2023-11-10 11:41:49,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8508333333333333 [2023-11-10 11:41:49,755 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1021 transitions. [2023-11-10 11:41:49,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1021 transitions. [2023-11-10 11:41:49,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:41:49,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1021 transitions. [2023-11-10 11:41:49,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 102.1) internal successors, (1021), 10 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:41:49,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:41:49,759 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:41:49,759 INFO L175 Difference]: Start difference. First operand has 141 places, 109 transitions, 413 flow. Second operand 10 states and 1021 transitions. [2023-11-10 11:41:49,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 190 transitions, 985 flow [2023-11-10 11:41:49,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 190 transitions, 952 flow, removed 15 selfloop flow, removed 7 redundant places. [2023-11-10 11:41:49,771 INFO L231 Difference]: Finished difference. Result has 140 places, 124 transitions, 500 flow [2023-11-10 11:41:49,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=500, PETRI_PLACES=140, PETRI_TRANSITIONS=124} [2023-11-10 11:41:49,771 INFO L281 CegarLoopForPetriNet]: 124 programPoint places, 16 predicate places. [2023-11-10 11:41:49,772 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 124 transitions, 500 flow [2023-11-10 11:41:49,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:41:49,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:41:49,772 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:41:49,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-10 11:41:49,772 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:41:49,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:41:49,773 INFO L85 PathProgramCache]: Analyzing trace with hash -935096048, now seen corresponding path program 1 times [2023-11-10 11:41:49,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:41:49,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527564437] [2023-11-10 11:41:49,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:41:49,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:41:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:41:49,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:41:49,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:41:49,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527564437] [2023-11-10 11:41:49,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527564437] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:41:49,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:41:49,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-10 11:41:49,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515605599] [2023-11-10 11:41:49,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:41:49,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 11:41:49,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:41:49,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 11:41:49,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-10 11:41:49,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 120 [2023-11-10 11:41:49,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 124 transitions, 500 flow. Second operand has 7 states, 7 states have (on average 88.14285714285714) internal successors, (617), 7 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:41:49,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:41:49,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 120 [2023-11-10 11:41:49,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:41:50,583 INFO L124 PetriNetUnfolderBase]: 1354/4285 cut-off events. [2023-11-10 11:41:50,583 INFO L125 PetriNetUnfolderBase]: For 5803/6094 co-relation queries the response was YES. [2023-11-10 11:41:50,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11423 conditions, 4285 events. 1354/4285 cut-off events. For 5803/6094 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 41893 event pairs, 190 based on Foata normal form. 96/4178 useless extension candidates. Maximal degree in co-relation 11352. Up to 738 conditions per place. [2023-11-10 11:41:50,627 INFO L140 encePairwiseOnDemand]: 104/120 looper letters, 68 selfloop transitions, 37 changer transitions 9/201 dead transitions. [2023-11-10 11:41:50,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 201 transitions, 1116 flow [2023-11-10 11:41:50,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-10 11:41:50,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-10 11:41:50,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1036 transitions. [2023-11-10 11:41:50,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7848484848484848 [2023-11-10 11:41:50,632 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1036 transitions. [2023-11-10 11:41:50,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1036 transitions. [2023-11-10 11:41:50,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:41:50,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1036 transitions. [2023-11-10 11:41:50,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 94.18181818181819) internal successors, (1036), 11 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:41:50,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 120.0) internal successors, (1440), 12 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:41:50,637 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 120.0) internal successors, (1440), 12 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:41:50,637 INFO L175 Difference]: Start difference. First operand has 140 places, 124 transitions, 500 flow. Second operand 11 states and 1036 transitions. [2023-11-10 11:41:50,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 201 transitions, 1116 flow [2023-11-10 11:41:50,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 201 transitions, 1102 flow, removed 6 selfloop flow, removed 7 redundant places. [2023-11-10 11:41:50,716 INFO L231 Difference]: Finished difference. Result has 153 places, 149 transitions, 889 flow [2023-11-10 11:41:50,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=889, PETRI_PLACES=153, PETRI_TRANSITIONS=149} [2023-11-10 11:41:50,719 INFO L281 CegarLoopForPetriNet]: 124 programPoint places, 29 predicate places. [2023-11-10 11:41:50,719 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 149 transitions, 889 flow [2023-11-10 11:41:50,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 88.14285714285714) internal successors, (617), 7 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:41:50,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:41:50,719 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:41:50,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-10 11:41:50,719 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:41:50,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:41:50,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1515323778, now seen corresponding path program 2 times [2023-11-10 11:41:50,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:41:50,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968231516] [2023-11-10 11:41:50,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:41:50,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:41:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:41:50,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:41:50,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:41:50,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968231516] [2023-11-10 11:41:50,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968231516] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:41:50,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:41:50,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-10 11:41:50,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852331501] [2023-11-10 11:41:50,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:41:50,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 11:41:50,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:41:50,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 11:41:50,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-10 11:41:50,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 120 [2023-11-10 11:41:50,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 149 transitions, 889 flow. Second operand has 7 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:41:50,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:41:50,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 120 [2023-11-10 11:41:50,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:41:51,762 INFO L124 PetriNetUnfolderBase]: 3625/7397 cut-off events. [2023-11-10 11:41:51,762 INFO L125 PetriNetUnfolderBase]: For 17163/17826 co-relation queries the response was YES. [2023-11-10 11:41:51,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23795 conditions, 7397 events. 3625/7397 cut-off events. For 17163/17826 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 63617 event pairs, 232 based on Foata normal form. 247/7390 useless extension candidates. Maximal degree in co-relation 23702. Up to 1186 conditions per place. [2023-11-10 11:41:51,809 INFO L140 encePairwiseOnDemand]: 110/120 looper letters, 83 selfloop transitions, 32 changer transitions 46/259 dead transitions. [2023-11-10 11:41:51,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 259 transitions, 1935 flow [2023-11-10 11:41:51,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-10 11:41:51,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-10 11:41:51,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1330 transitions. [2023-11-10 11:41:51,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8525641025641025 [2023-11-10 11:41:51,812 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1330 transitions. [2023-11-10 11:41:51,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1330 transitions. [2023-11-10 11:41:51,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:41:51,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1330 transitions. [2023-11-10 11:41:51,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 102.3076923076923) internal successors, (1330), 13 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:41:51,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 120.0) internal successors, (1680), 14 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:41:51,876 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 120.0) internal successors, (1680), 14 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:41:51,876 INFO L175 Difference]: Start difference. First operand has 153 places, 149 transitions, 889 flow. Second operand 13 states and 1330 transitions. [2023-11-10 11:41:51,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 259 transitions, 1935 flow [2023-11-10 11:41:51,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 259 transitions, 1891 flow, removed 22 selfloop flow, removed 0 redundant places. [2023-11-10 11:41:51,924 INFO L231 Difference]: Finished difference. Result has 169 places, 158 transitions, 986 flow [2023-11-10 11:41:51,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=986, PETRI_PLACES=169, PETRI_TRANSITIONS=158} [2023-11-10 11:41:51,927 INFO L281 CegarLoopForPetriNet]: 124 programPoint places, 45 predicate places. [2023-11-10 11:41:51,927 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 158 transitions, 986 flow [2023-11-10 11:41:51,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:41:51,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:41:51,928 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:41:51,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-10 11:41:51,929 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:41:51,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:41:51,929 INFO L85 PathProgramCache]: Analyzing trace with hash 2005460524, now seen corresponding path program 1 times [2023-11-10 11:41:51,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:41:51,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024279289] [2023-11-10 11:41:51,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:41:51,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:41:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:41:52,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:41:52,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:41:52,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024279289] [2023-11-10 11:41:52,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024279289] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:41:52,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:41:52,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-10 11:41:52,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591193303] [2023-11-10 11:41:52,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:41:52,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-10 11:41:52,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:41:52,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-10 11:41:52,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-10 11:41:52,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 120 [2023-11-10 11:41:52,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 158 transitions, 986 flow. Second operand has 8 states, 8 states have (on average 95.25) internal successors, (762), 8 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:41:52,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:41:52,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 120 [2023-11-10 11:41:52,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:41:53,406 INFO L124 PetriNetUnfolderBase]: 3425/6982 cut-off events. [2023-11-10 11:41:53,406 INFO L125 PetriNetUnfolderBase]: For 21654/22283 co-relation queries the response was YES. [2023-11-10 11:41:53,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24946 conditions, 6982 events. 3425/6982 cut-off events. For 21654/22283 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 60967 event pairs, 205 based on Foata normal form. 142/6871 useless extension candidates. Maximal degree in co-relation 24910. Up to 1063 conditions per place. [2023-11-10 11:41:53,447 INFO L140 encePairwiseOnDemand]: 110/120 looper letters, 54 selfloop transitions, 28 changer transitions 68/248 dead transitions. [2023-11-10 11:41:53,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 248 transitions, 1916 flow [2023-11-10 11:41:53,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-10 11:41:53,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-10 11:41:53,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1598 transitions. [2023-11-10 11:41:53,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8322916666666667 [2023-11-10 11:41:53,454 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1598 transitions. [2023-11-10 11:41:53,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1598 transitions. [2023-11-10 11:41:53,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:41:53,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1598 transitions. [2023-11-10 11:41:53,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 99.875) internal successors, (1598), 16 states have internal predecessors, (1598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:41:53,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 120.0) internal successors, (2040), 17 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:41:53,463 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 120.0) internal successors, (2040), 17 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:41:53,463 INFO L175 Difference]: Start difference. First operand has 169 places, 158 transitions, 986 flow. Second operand 16 states and 1598 transitions. [2023-11-10 11:41:53,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 248 transitions, 1916 flow [2023-11-10 11:41:53,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 248 transitions, 1727 flow, removed 77 selfloop flow, removed 14 redundant places. [2023-11-10 11:41:53,700 INFO L231 Difference]: Finished difference. Result has 171 places, 149 transitions, 861 flow [2023-11-10 11:41:53,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=861, PETRI_PLACES=171, PETRI_TRANSITIONS=149} [2023-11-10 11:41:53,700 INFO L281 CegarLoopForPetriNet]: 124 programPoint places, 47 predicate places. [2023-11-10 11:41:53,700 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 149 transitions, 861 flow [2023-11-10 11:41:53,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 95.25) internal successors, (762), 8 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:41:53,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:41:53,701 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:41:53,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-10 11:41:53,701 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:41:53,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:41:53,702 INFO L85 PathProgramCache]: Analyzing trace with hash 779969273, now seen corresponding path program 1 times [2023-11-10 11:41:53,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:41:53,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442540537] [2023-11-10 11:41:53,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:41:53,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:41:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:41:53,737 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-10 11:41:53,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:41:53,793 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-10 11:41:53,793 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-10 11:41:53,794 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-10 11:41:53,795 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-10 11:41:53,795 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-10 11:41:53,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-10 11:41:53,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-10 11:41:53,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-10 11:41:53,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-10 11:41:53,796 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2023-11-10 11:41:53,800 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-10 11:41:53,800 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-10 11:41:53,856 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-10 11:41:53,857 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-10 11:41:53,858 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-10 11:41:53,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 11:41:53 BasicIcfg [2023-11-10 11:41:53,874 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-10 11:41:53,875 INFO L158 Benchmark]: Toolchain (without parser) took 9098.89ms. Allocated memory was 178.3MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 130.5MB in the beginning and 839.7MB in the end (delta: -709.2MB). Peak memory consumption was 314.5MB. Max. memory is 8.0GB. [2023-11-10 11:41:53,875 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 178.3MB. Free memory is still 131.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-10 11:41:53,875 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.88ms. Allocated memory is still 178.3MB. Free memory was 130.1MB in the beginning and 106.7MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-11-10 11:41:53,875 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.64ms. Allocated memory is still 178.3MB. Free memory was 106.7MB in the beginning and 104.2MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-10 11:41:53,876 INFO L158 Benchmark]: Boogie Preprocessor took 19.42ms. Allocated memory is still 178.3MB. Free memory was 104.2MB in the beginning and 102.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-10 11:41:53,876 INFO L158 Benchmark]: RCFGBuilder took 452.31ms. Allocated memory was 178.3MB in the beginning and 298.8MB in the end (delta: 120.6MB). Free memory was 102.1MB in the beginning and 245.5MB in the end (delta: -143.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-11-10 11:41:53,876 INFO L158 Benchmark]: TraceAbstraction took 8278.55ms. Allocated memory was 298.8MB in the beginning and 1.2GB in the end (delta: 902.8MB). Free memory was 245.0MB in the beginning and 839.7MB in the end (delta: -594.7MB). Peak memory consumption was 308.2MB. Max. memory is 8.0GB. [2023-11-10 11:41:53,882 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.13ms. Allocated memory is still 178.3MB. Free memory is still 131.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 311.88ms. Allocated memory is still 178.3MB. Free memory was 130.1MB in the beginning and 106.7MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.64ms. Allocated memory is still 178.3MB. Free memory was 106.7MB in the beginning and 104.2MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.42ms. Allocated memory is still 178.3MB. Free memory was 104.2MB in the beginning and 102.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 452.31ms. Allocated memory was 178.3MB in the beginning and 298.8MB in the end (delta: 120.6MB). Free memory was 102.1MB in the beginning and 245.5MB in the end (delta: -143.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 8278.55ms. Allocated memory was 298.8MB in the beginning and 1.2GB in the end (delta: 902.8MB). Free memory was 245.0MB in the beginning and 839.7MB in the end (delta: -594.7MB). Peak memory consumption was 308.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L713] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L715] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L717] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L719] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L721] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0] [L722] 0 _Bool b$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b$flush_delayed=0, b=0] [L723] 0 int b$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b=0] [L724] 0 _Bool b$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b=0] [L725] 0 _Bool b$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b=0] [L726] 0 _Bool b$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b=0] [L727] 0 _Bool b$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b=0] [L728] 0 _Bool b$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b=0] [L729] 0 _Bool b$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b=0] [L730] 0 _Bool b$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b=0] [L731] 0 _Bool b$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b=0] [L732] 0 _Bool b$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b=0] [L733] 0 int *b$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b=0] [L734] 0 int b$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b=0] [L735] 0 _Bool b$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b=0] [L736] 0 int b$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b=0] [L737] 0 _Bool b$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0] [L738] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0] [L739] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L741] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L743] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L745] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L746] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L747] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L853] 0 pthread_t t873; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t873={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L854] FCALL, FORK 0 pthread_create(&t873, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t873={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L855] 0 pthread_t t874; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t873={5:0}, t874={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L856] FCALL, FORK 0 pthread_create(&t874, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t873={5:0}, t874={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L857] 0 pthread_t t875; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t873={5:0}, t874={6:0}, t875={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L858] FCALL, FORK 0 pthread_create(&t875, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t873={5:0}, t874={6:0}, t875={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L751] 1 b$w_buff1 = b$w_buff0 [L752] 1 b$w_buff0 = 1 [L753] 1 b$w_buff1_used = b$w_buff0_used [L754] 1 b$w_buff0_used = (_Bool)1 [L755] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L755] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L756] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L757] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L758] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L759] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L760] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L786] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L809] 3 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L812] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L815] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 3 b$flush_delayed = weak$$choice2 [L818] 3 b$mem_tmp = b [L819] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L820] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L821] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L822] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L823] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L824] 3 b$r_buff0_thd3 = weak$$choice2 ? b$r_buff0_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff0_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3)) [L825] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 __unbuffered_p2_EBX = b [L827] 3 b = b$flush_delayed ? b$mem_tmp : b [L828] 3 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L766] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L767] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L768] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L769] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L770] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L792] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L793] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L794] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L795] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L796] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L831] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L832] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L833] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L834] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L835] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t873={5:0}, t874={6:0}, t875={3:0}, weak$$choice2=1, x=2, y=1, z=1] [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L865] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L866] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L867] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L868] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t873={5:0}, t874={6:0}, t875={3:0}, weak$$choice2=1, x=2, y=1, z=1] [L871] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t873={5:0}, t874={6:0}, t875={3:0}, weak$$choice2=1, x=2, y=1, z=1] [L873] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 150 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: 8.1s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 598 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 598 mSDsluCounter, 505 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 396 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1038 IncrementalHoareTripleChecker+Invalid, 1062 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 109 mSDtfsCounter, 1038 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=986occurred in iteration=6, InterpolantAutomatonStates: 79, 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.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 623 NumberOfCodeBlocks, 623 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 524 ConstructedInterpolants, 0 QuantifiedInterpolants, 2224 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! [2023-11-10 11:41:53,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...