/usr/lib/jvm/java-1.11.0-openjdk-amd64/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-SemanticLbe.epf --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 11:27:14,921 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 11:27:15,005 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-SemanticLbe.epf [2023-11-17 11:27:15,037 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 11:27:15,038 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 11:27:15,038 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 11:27:15,039 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 11:27:15,039 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 11:27:15,040 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 11:27:15,044 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 11:27:15,044 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 11:27:15,045 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 11:27:15,045 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 11:27:15,046 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 11:27:15,046 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 11:27:15,046 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 11:27:15,047 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 11:27:15,047 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 11:27:15,047 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 11:27:15,047 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 11:27:15,047 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 11:27:15,048 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 11:27:15,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 11:27:15,049 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 11:27:15,049 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 11:27:15,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:27:15,049 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 11:27:15,050 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 11:27:15,050 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 11:27:15,050 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 11:27:15,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 11:27:15,051 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 11:27:15,051 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true [2023-11-17 11:27:15,273 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 11:27:15,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 11:27:15,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 11:27:15,297 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 11:27:15,298 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 11:27:15,298 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2023-11-17 11:27:16,492 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 11:27:16,745 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 11:27:16,746 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2023-11-17 11:27:16,758 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dee706f4c/833b9b858ec948c28098820304c7d02c/FLAG71826d44c [2023-11-17 11:27:16,770 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dee706f4c/833b9b858ec948c28098820304c7d02c [2023-11-17 11:27:16,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 11:27:16,774 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 11:27:16,777 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 11:27:16,777 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 11:27:16,781 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 11:27:16,782 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:27:16" (1/1) ... [2023-11-17 11:27:16,783 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@604207bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:27:16, skipping insertion in model container [2023-11-17 11:27:16,783 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:27:16" (1/1) ... [2023-11-17 11:27:16,843 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 11:27:16,991 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/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] [2023-11-17 11:27:17,201 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:27:17,213 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 11:27:17,226 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/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] [2023-11-17 11:27:17,265 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:27:17,296 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:27:17,296 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:27:17,303 INFO L206 MainTranslator]: Completed translation [2023-11-17 11:27:17,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:27:17 WrapperNode [2023-11-17 11:27:17,304 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 11:27:17,305 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 11:27:17,305 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 11:27:17,305 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 11:27:17,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:27:17" (1/1) ... [2023-11-17 11:27:17,350 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:27:17" (1/1) ... [2023-11-17 11:27:17,372 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 111 [2023-11-17 11:27:17,372 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 11:27:17,374 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 11:27:17,374 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 11:27:17,374 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 11:27:17,382 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:27:17" (1/1) ... [2023-11-17 11:27:17,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:27:17" (1/1) ... [2023-11-17 11:27:17,396 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:27:17" (1/1) ... [2023-11-17 11:27:17,396 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:27:17" (1/1) ... [2023-11-17 11:27:17,420 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:27:17" (1/1) ... [2023-11-17 11:27:17,422 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:27:17" (1/1) ... [2023-11-17 11:27:17,424 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:27:17" (1/1) ... [2023-11-17 11:27:17,425 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:27:17" (1/1) ... [2023-11-17 11:27:17,427 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 11:27:17,428 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 11:27:17,428 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 11:27:17,429 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 11:27:17,429 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:27:17" (1/1) ... [2023-11-17 11:27:17,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:27:17,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:27:17,551 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-17 11:27:17,559 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-17 11:27:17,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 11:27:17,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 11:27:17,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 11:27:17,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 11:27:17,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 11:27:17,578 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 11:27:17,578 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 11:27:17,578 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 11:27:17,579 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 11:27:17,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 11:27:17,579 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 11:27:17,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 11:27:17,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 11:27:17,580 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 11:27:17,707 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 11:27:17,709 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 11:27:17,943 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 11:27:18,130 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 11:27:18,131 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 11:27:18,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:27:18 BoogieIcfgContainer [2023-11-17 11:27:18,134 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 11:27:18,137 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 11:27:18,137 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 11:27:18,140 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 11:27:18,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 11:27:16" (1/3) ... [2023-11-17 11:27:18,141 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c159115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:27:18, skipping insertion in model container [2023-11-17 11:27:18,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:27:17" (2/3) ... [2023-11-17 11:27:18,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c159115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:27:18, skipping insertion in model container [2023-11-17 11:27:18,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:27:18" (3/3) ... [2023-11-17 11:27:18,143 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2023-11-17 11:27:18,159 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 11:27:18,159 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 11:27:18,159 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 11:27:18,205 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 11:27:18,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 31 transitions, 70 flow [2023-11-17 11:27:18,269 INFO L124 PetriNetUnfolderBase]: 2/29 cut-off events. [2023-11-17 11:27:18,269 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:27:18,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 29 events. 2/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 44 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place. [2023-11-17 11:27:18,275 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 31 transitions, 70 flow [2023-11-17 11:27:18,280 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 29 transitions, 64 flow [2023-11-17 11:27:18,284 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:27:18,298 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 29 transitions, 64 flow [2023-11-17 11:27:18,300 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 29 transitions, 64 flow [2023-11-17 11:27:18,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 29 transitions, 64 flow [2023-11-17 11:27:18,315 INFO L124 PetriNetUnfolderBase]: 2/29 cut-off events. [2023-11-17 11:27:18,315 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:27:18,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 29 events. 2/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 44 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place. [2023-11-17 11:27:18,316 INFO L119 LiptonReduction]: Number of co-enabled transitions 436 [2023-11-17 11:27:19,182 INFO L134 LiptonReduction]: Checked pairs total: 1240 [2023-11-17 11:27:19,182 INFO L136 LiptonReduction]: Total number of compositions: 20 [2023-11-17 11:27:19,195 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:27:19,201 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;@4c62c6f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:27:19,201 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-17 11:27:19,203 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:27:19,203 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-11-17 11:27:19,203 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:27:19,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:19,204 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-17 11:27:19,204 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:27:19,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:19,209 INFO L85 PathProgramCache]: Analyzing trace with hash 314311, now seen corresponding path program 1 times [2023-11-17 11:27:19,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:19,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854844552] [2023-11-17 11:27:19,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:19,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:19,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:19,535 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-17 11:27:19,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:19,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854844552] [2023-11-17 11:27:19,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854844552] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:19,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:19,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:27:19,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971206285] [2023-11-17 11:27:19,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:19,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:27:19,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:19,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:27:19,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:27:19,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2023-11-17 11:27:19,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 18 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-17 11:27:19,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:19,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2023-11-17 11:27:19,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:19,705 INFO L124 PetriNetUnfolderBase]: 142/278 cut-off events. [2023-11-17 11:27:19,705 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-17 11:27:19,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 278 events. 142/278 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1147 event pairs, 16 based on Foata normal form. 0/258 useless extension candidates. Maximal degree in co-relation 533. Up to 208 conditions per place. [2023-11-17 11:27:19,710 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 21 selfloop transitions, 2 changer transitions 2/26 dead transitions. [2023-11-17 11:27:19,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 26 transitions, 111 flow [2023-11-17 11:27:19,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:27:19,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:27:19,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2023-11-17 11:27:19,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43137254901960786 [2023-11-17 11:27:19,722 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 66 transitions. [2023-11-17 11:27:19,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 66 transitions. [2023-11-17 11:27:19,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:19,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 66 transitions. [2023-11-17 11:27:19,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-17 11:27:19,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 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-17 11:27:19,733 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 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-17 11:27:19,734 INFO L175 Difference]: Start difference. First operand has 24 places, 18 transitions, 42 flow. Second operand 3 states and 66 transitions. [2023-11-17 11:27:19,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 26 transitions, 111 flow [2023-11-17 11:27:19,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 26 transitions, 108 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:27:19,740 INFO L231 Difference]: Finished difference. Result has 23 places, 15 transitions, 38 flow [2023-11-17 11:27:19,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=38, PETRI_PLACES=23, PETRI_TRANSITIONS=15} [2023-11-17 11:27:19,745 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2023-11-17 11:27:19,745 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 38 flow [2023-11-17 11:27:19,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-17 11:27:19,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:19,746 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:19,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 11:27:19,746 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:27:19,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:19,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1822699573, now seen corresponding path program 1 times [2023-11-17 11:27:19,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:19,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115938890] [2023-11-17 11:27:19,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:19,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:19,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:19,943 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-17 11:27:19,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:19,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115938890] [2023-11-17 11:27:19,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115938890] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:19,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:19,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:27:19,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677015231] [2023-11-17 11:27:19,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:19,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:27:19,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:19,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:27:19,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:27:19,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 51 [2023-11-17 11:27:19,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 38 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-17 11:27:19,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:19,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 51 [2023-11-17 11:27:19,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:20,044 INFO L124 PetriNetUnfolderBase]: 140/249 cut-off events. [2023-11-17 11:27:20,045 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-17 11:27:20,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 535 conditions, 249 events. 140/249 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 808 event pairs, 56 based on Foata normal form. 2/251 useless extension candidates. Maximal degree in co-relation 525. Up to 235 conditions per place. [2023-11-17 11:27:20,047 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 19 selfloop transitions, 3 changer transitions 0/22 dead transitions. [2023-11-17 11:27:20,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 22 transitions, 100 flow [2023-11-17 11:27:20,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:27:20,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:27:20,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2023-11-17 11:27:20,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3464052287581699 [2023-11-17 11:27:20,049 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 53 transitions. [2023-11-17 11:27:20,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 53 transitions. [2023-11-17 11:27:20,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:20,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 53 transitions. [2023-11-17 11:27:20,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-17 11:27:20,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 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-17 11:27:20,051 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 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-17 11:27:20,051 INFO L175 Difference]: Start difference. First operand has 23 places, 15 transitions, 38 flow. Second operand 3 states and 53 transitions. [2023-11-17 11:27:20,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 22 transitions, 100 flow [2023-11-17 11:27:20,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 22 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:27:20,052 INFO L231 Difference]: Finished difference. Result has 23 places, 17 transitions, 53 flow [2023-11-17 11:27:20,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=53, PETRI_PLACES=23, PETRI_TRANSITIONS=17} [2023-11-17 11:27:20,053 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2023-11-17 11:27:20,054 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 17 transitions, 53 flow [2023-11-17 11:27:20,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-17 11:27:20,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:20,054 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:20,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 11:27:20,054 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:27:20,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:20,055 INFO L85 PathProgramCache]: Analyzing trace with hash -669111935, now seen corresponding path program 1 times [2023-11-17 11:27:20,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:20,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443940022] [2023-11-17 11:27:20,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:20,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:20,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:20,190 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-17 11:27:20,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:20,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443940022] [2023-11-17 11:27:20,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443940022] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:20,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:20,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:27:20,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418775177] [2023-11-17 11:27:20,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:20,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:27:20,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:20,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:27:20,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:27:20,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 51 [2023-11-17 11:27:20,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 17 transitions, 53 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-17 11:27:20,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:20,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 51 [2023-11-17 11:27:20,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:20,301 INFO L124 PetriNetUnfolderBase]: 68/154 cut-off events. [2023-11-17 11:27:20,301 INFO L125 PetriNetUnfolderBase]: For 9/10 co-relation queries the response was YES. [2023-11-17 11:27:20,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 351 conditions, 154 events. 68/154 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 523 event pairs, 30 based on Foata normal form. 24/177 useless extension candidates. Maximal degree in co-relation 340. Up to 67 conditions per place. [2023-11-17 11:27:20,304 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 28 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2023-11-17 11:27:20,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 34 transitions, 157 flow [2023-11-17 11:27:20,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:27:20,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:27:20,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2023-11-17 11:27:20,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35784313725490197 [2023-11-17 11:27:20,306 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 73 transitions. [2023-11-17 11:27:20,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 73 transitions. [2023-11-17 11:27:20,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:20,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 73 transitions. [2023-11-17 11:27:20,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-17 11:27:20,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 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-17 11:27:20,310 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 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-17 11:27:20,310 INFO L175 Difference]: Start difference. First operand has 23 places, 17 transitions, 53 flow. Second operand 4 states and 73 transitions. [2023-11-17 11:27:20,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 34 transitions, 157 flow [2023-11-17 11:27:20,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 34 transitions, 154 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:27:20,311 INFO L231 Difference]: Finished difference. Result has 27 places, 20 transitions, 80 flow [2023-11-17 11:27:20,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=80, PETRI_PLACES=27, PETRI_TRANSITIONS=20} [2023-11-17 11:27:20,312 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 3 predicate places. [2023-11-17 11:27:20,313 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 20 transitions, 80 flow [2023-11-17 11:27:20,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-17 11:27:20,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:20,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:20,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 11:27:20,313 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:27:20,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:20,314 INFO L85 PathProgramCache]: Analyzing trace with hash 259244600, now seen corresponding path program 1 times [2023-11-17 11:27:20,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:20,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765314636] [2023-11-17 11:27:20,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:20,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:20,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:20,467 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-17 11:27:20,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:20,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765314636] [2023-11-17 11:27:20,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765314636] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:20,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:20,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:27:20,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891365764] [2023-11-17 11:27:20,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:20,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:27:20,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:20,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:27:20,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:27:20,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 51 [2023-11-17 11:27:20,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 20 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-17 11:27:20,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:20,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 51 [2023-11-17 11:27:20,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:20,542 INFO L124 PetriNetUnfolderBase]: 103/229 cut-off events. [2023-11-17 11:27:20,543 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2023-11-17 11:27:20,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 670 conditions, 229 events. 103/229 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 919 event pairs, 24 based on Foata normal form. 7/236 useless extension candidates. Maximal degree in co-relation 656. Up to 129 conditions per place. [2023-11-17 11:27:20,544 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 21 selfloop transitions, 5 changer transitions 5/31 dead transitions. [2023-11-17 11:27:20,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 31 transitions, 185 flow [2023-11-17 11:27:20,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:27:20,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:27:20,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2023-11-17 11:27:20,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35947712418300654 [2023-11-17 11:27:20,547 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 55 transitions. [2023-11-17 11:27:20,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 55 transitions. [2023-11-17 11:27:20,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:20,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 55 transitions. [2023-11-17 11:27:20,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-17 11:27:20,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 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-17 11:27:20,548 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 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-17 11:27:20,548 INFO L175 Difference]: Start difference. First operand has 27 places, 20 transitions, 80 flow. Second operand 3 states and 55 transitions. [2023-11-17 11:27:20,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 31 transitions, 185 flow [2023-11-17 11:27:20,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 31 transitions, 182 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:27:20,552 INFO L231 Difference]: Finished difference. Result has 29 places, 20 transitions, 95 flow [2023-11-17 11:27:20,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=95, PETRI_PLACES=29, PETRI_TRANSITIONS=20} [2023-11-17 11:27:20,553 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 5 predicate places. [2023-11-17 11:27:20,553 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 20 transitions, 95 flow [2023-11-17 11:27:20,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-17 11:27:20,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:20,554 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:20,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 11:27:20,554 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:27:20,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:20,555 INFO L85 PathProgramCache]: Analyzing trace with hash 764749736, now seen corresponding path program 1 times [2023-11-17 11:27:20,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:20,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060822381] [2023-11-17 11:27:20,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:20,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:20,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:20,776 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-17 11:27:20,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:20,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060822381] [2023-11-17 11:27:20,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060822381] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:20,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:20,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:27:20,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549345958] [2023-11-17 11:27:20,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:20,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:27:20,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:20,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:27:20,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:27:20,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 51 [2023-11-17 11:27:20,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-17 11:27:20,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:20,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 51 [2023-11-17 11:27:20,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:20,886 INFO L124 PetriNetUnfolderBase]: 35/99 cut-off events. [2023-11-17 11:27:20,888 INFO L125 PetriNetUnfolderBase]: For 54/55 co-relation queries the response was YES. [2023-11-17 11:27:20,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308 conditions, 99 events. 35/99 cut-off events. For 54/55 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 313 event pairs, 11 based on Foata normal form. 14/112 useless extension candidates. Maximal degree in co-relation 292. Up to 44 conditions per place. [2023-11-17 11:27:20,891 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 19 selfloop transitions, 6 changer transitions 2/29 dead transitions. [2023-11-17 11:27:20,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 29 transitions, 181 flow [2023-11-17 11:27:20,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:27:20,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:27:20,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2023-11-17 11:27:20,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2980392156862745 [2023-11-17 11:27:20,898 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 76 transitions. [2023-11-17 11:27:20,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 76 transitions. [2023-11-17 11:27:20,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:20,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 76 transitions. [2023-11-17 11:27:20,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-17 11:27:20,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 51.0) internal successors, (306), 6 states have internal predecessors, (306), 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-17 11:27:20,900 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 51.0) internal successors, (306), 6 states have internal predecessors, (306), 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-17 11:27:20,900 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 95 flow. Second operand 5 states and 76 transitions. [2023-11-17 11:27:20,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 29 transitions, 181 flow [2023-11-17 11:27:20,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 164 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-17 11:27:20,902 INFO L231 Difference]: Finished difference. Result has 33 places, 20 transitions, 104 flow [2023-11-17 11:27:20,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=104, PETRI_PLACES=33, PETRI_TRANSITIONS=20} [2023-11-17 11:27:20,902 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 9 predicate places. [2023-11-17 11:27:20,903 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 20 transitions, 104 flow [2023-11-17 11:27:20,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-17 11:27:20,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:20,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:20,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 11:27:20,903 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:27:20,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:20,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1777443101, now seen corresponding path program 1 times [2023-11-17 11:27:20,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:20,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884785695] [2023-11-17 11:27:20,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:20,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:20,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:21,445 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-17 11:27:21,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:21,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884785695] [2023-11-17 11:27:21,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884785695] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:21,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:21,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:27:21,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922305497] [2023-11-17 11:27:21,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:21,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:27:21,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:21,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:27:21,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:27:21,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2023-11-17 11:27:21,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 20 transitions, 104 flow. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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-17 11:27:21,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:21,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2023-11-17 11:27:21,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:21,587 INFO L124 PetriNetUnfolderBase]: 26/85 cut-off events. [2023-11-17 11:27:21,587 INFO L125 PetriNetUnfolderBase]: For 98/98 co-relation queries the response was YES. [2023-11-17 11:27:21,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 85 events. 26/85 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 258 event pairs, 6 based on Foata normal form. 1/86 useless extension candidates. Maximal degree in co-relation 277. Up to 39 conditions per place. [2023-11-17 11:27:21,588 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 17 selfloop transitions, 4 changer transitions 17/40 dead transitions. [2023-11-17 11:27:21,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 40 transitions, 284 flow [2023-11-17 11:27:21,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 11:27:21,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 11:27:21,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2023-11-17 11:27:21,591 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32492997198879553 [2023-11-17 11:27:21,591 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 116 transitions. [2023-11-17 11:27:21,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 116 transitions. [2023-11-17 11:27:21,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:21,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 116 transitions. [2023-11-17 11:27:21,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 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-17 11:27:21,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 51.0) internal successors, (408), 8 states have internal predecessors, (408), 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-17 11:27:21,595 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 51.0) internal successors, (408), 8 states have internal predecessors, (408), 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-17 11:27:21,595 INFO L175 Difference]: Start difference. First operand has 33 places, 20 transitions, 104 flow. Second operand 7 states and 116 transitions. [2023-11-17 11:27:21,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 40 transitions, 284 flow [2023-11-17 11:27:21,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 40 transitions, 218 flow, removed 10 selfloop flow, removed 7 redundant places. [2023-11-17 11:27:21,600 INFO L231 Difference]: Finished difference. Result has 35 places, 20 transitions, 91 flow [2023-11-17 11:27:21,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=91, PETRI_PLACES=35, PETRI_TRANSITIONS=20} [2023-11-17 11:27:21,602 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 11 predicate places. [2023-11-17 11:27:21,603 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 20 transitions, 91 flow [2023-11-17 11:27:21,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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-17 11:27:21,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:21,603 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:21,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 11:27:21,604 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:27:21,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:21,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1673924901, now seen corresponding path program 2 times [2023-11-17 11:27:21,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:21,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582212481] [2023-11-17 11:27:21,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:21,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:21,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:27:21,691 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 11:27:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:27:21,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 11:27:21,751 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 11:27:21,752 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-11-17 11:27:21,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-17 11:27:21,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-11-17 11:27:21,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-11-17 11:27:21,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-17 11:27:21,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 11:27:21,754 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2023-11-17 11:27:21,759 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 11:27:21,759 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 11:27:21,802 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-17 11:27:21,804 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 11:27:21,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 11:27:21 BasicIcfg [2023-11-17 11:27:21,822 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 11:27:21,822 INFO L158 Benchmark]: Toolchain (without parser) took 5048.23ms. Allocated memory was 273.7MB in the beginning and 329.3MB in the end (delta: 55.6MB). Free memory was 215.6MB in the beginning and 217.4MB in the end (delta: -1.8MB). Peak memory consumption was 54.8MB. Max. memory is 8.0GB. [2023-11-17 11:27:21,822 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 188.7MB. Free memory is still 132.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 11:27:21,823 INFO L158 Benchmark]: CACSL2BoogieTranslator took 526.88ms. Allocated memory is still 273.7MB. Free memory was 215.6MB in the beginning and 193.0MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-11-17 11:27:21,823 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.42ms. Allocated memory is still 273.7MB. Free memory was 193.0MB in the beginning and 190.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 11:27:21,823 INFO L158 Benchmark]: Boogie Preprocessor took 53.39ms. Allocated memory is still 273.7MB. Free memory was 190.4MB in the beginning and 188.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-11-17 11:27:21,826 INFO L158 Benchmark]: RCFGBuilder took 705.40ms. Allocated memory is still 273.7MB. Free memory was 188.8MB in the beginning and 147.4MB in the end (delta: 41.4MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. [2023-11-17 11:27:21,827 INFO L158 Benchmark]: TraceAbstraction took 3684.88ms. Allocated memory was 273.7MB in the beginning and 329.3MB in the end (delta: 55.6MB). Free memory was 146.4MB in the beginning and 217.4MB in the end (delta: -71.0MB). There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 11:27:21,833 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.14ms. Allocated memory is still 188.7MB. Free memory is still 132.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 526.88ms. Allocated memory is still 273.7MB. Free memory was 215.6MB in the beginning and 193.0MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 67.42ms. Allocated memory is still 273.7MB. Free memory was 193.0MB in the beginning and 190.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.39ms. Allocated memory is still 273.7MB. Free memory was 190.4MB in the beginning and 188.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 705.40ms. Allocated memory is still 273.7MB. Free memory was 188.8MB in the beginning and 147.4MB in the end (delta: 41.4MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. * TraceAbstraction took 3684.88ms. Allocated memory was 273.7MB in the beginning and 329.3MB in the end (delta: 55.6MB). Free memory was 146.4MB in the beginning and 217.4MB in the end (delta: -71.0MB). There was no memory consumed. 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 The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 34 PlacesBefore, 24 PlacesAfterwards, 29 TransitionsBefore, 18 TransitionsAfterwards, 436 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 14 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 20 TotalNumberOfCompositions, 1240 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 663, independent: 587, independent conditional: 0, independent unconditional: 587, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 355, independent: 327, independent conditional: 0, independent unconditional: 327, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 355, independent: 303, independent conditional: 0, independent unconditional: 303, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 52, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 229, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 203, dependent conditional: 0, dependent unconditional: 203, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 663, independent: 260, independent conditional: 0, independent unconditional: 260, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 355, unknown conditional: 0, unknown unconditional: 355] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 56, Positive conditional cache size: 0, Positive unconditional cache size: 56, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L716] 0 int y = 0; [L717] 0 _Bool y$flush_delayed; [L718] 0 int y$mem_tmp; [L719] 0 _Bool y$r_buff0_thd0; [L720] 0 _Bool y$r_buff0_thd1; [L721] 0 _Bool y$r_buff0_thd2; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$read_delayed; [L726] 0 int *y$read_delayed_var; [L727] 0 int y$w_buff0; [L728] 0 _Bool y$w_buff0_used; [L729] 0 int y$w_buff1; [L730] 0 _Bool y$w_buff1_used; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L805] 0 pthread_t t1441; [L806] FCALL, FORK 0 pthread_create(&t1441, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1441={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L807] 0 pthread_t t1442; [L808] FCALL, FORK 0 pthread_create(&t1442, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1441={5:0}, t1442={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L736] 1 y$w_buff1 = y$w_buff0 [L737] 1 y$w_buff0 = 1 [L738] 1 y$w_buff1_used = y$w_buff0_used [L739] 1 y$w_buff0_used = (_Bool)1 [L740] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L740] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L741] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L747] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L764] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L767] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L768] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L769] 2 y$flush_delayed = weak$$choice2 [L770] 2 y$mem_tmp = y [L771] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L772] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L773] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L774] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L775] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L777] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 __unbuffered_p1_EAX = y [L779] 2 y = y$flush_delayed ? y$mem_tmp : y [L780] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L783] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L784] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L785] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L786] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L787] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L790] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L792] 2 return 0; [L750] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L751] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L752] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L753] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L754] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L810] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1441={5:0}, t1442={3:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L812] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L812] RET 0 assume_abort_if_not(main$tmp_guard0) [L814] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L815] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L816] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L817] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L818] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1441={5:0}, t1442={3:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L821] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L823] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=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: 808]: 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: 806]: 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 5 procedures, 47 locations, 5 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: 3.5s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 76 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 260 IncrementalHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 2 mSDtfsCounter, 260 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=5, InterpolantAutomatonStates: 25, 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.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 70 NumberOfCodeBlocks, 70 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 49 ConstructedInterpolants, 0 QuantifiedInterpolants, 254 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-17 11:27:21,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...