/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 15:14:57,583 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 15:14:57,666 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 15:14:57,702 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 15:14:57,703 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 15:14:57,704 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 15:14:57,705 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 15:14:57,705 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 15:14:57,705 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 15:14:57,709 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 15:14:57,710 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 15:14:57,710 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 15:14:57,710 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 15:14:57,712 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 15:14:57,712 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 15:14:57,712 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 15:14:57,712 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 15:14:57,713 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 15:14:57,713 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 15:14:57,713 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 15:14:57,713 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 15:14:57,714 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 15:14:57,714 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 15:14:57,714 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 15:14:57,715 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 15:14:57,715 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:14:57,715 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 15:14:57,715 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 15:14:57,716 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 15:14:57,716 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 15:14:57,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 15:14:57,717 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 15:14:57,717 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-11-17 15:14:57,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 15:14:57,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 15:14:58,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 15:14:58,002 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 15:14:58,002 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 15:14:58,004 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2023-11-17 15:14:59,308 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 15:14:59,568 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 15:14:59,569 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2023-11-17 15:14:59,590 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/266885988/595721b4beba4d9ca23e3a1486bc7473/FLAG1a5ce09ea [2023-11-17 15:14:59,612 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/266885988/595721b4beba4d9ca23e3a1486bc7473 [2023-11-17 15:14:59,616 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 15:14:59,618 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 15:14:59,621 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 15:14:59,621 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 15:14:59,627 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 15:14:59,628 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:14:59" (1/1) ... [2023-11-17 15:14:59,629 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ea49c7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:59, skipping insertion in model container [2023-11-17 15:14:59,629 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:14:59" (1/1) ... [2023-11-17 15:14:59,683 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 15:14:59,859 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/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i[996,1009] [2023-11-17 15:15:00,018 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:15:00,029 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 15:15:00,039 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/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i[996,1009] [2023-11-17 15:15:00,093 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:15:00,123 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:15:00,124 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:15:00,130 INFO L206 MainTranslator]: Completed translation [2023-11-17 15:15:00,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:00 WrapperNode [2023-11-17 15:15:00,131 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 15:15:00,132 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 15:15:00,132 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 15:15:00,132 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 15:15:00,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:00" (1/1) ... [2023-11-17 15:15:00,153 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:00" (1/1) ... [2023-11-17 15:15:00,177 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 114 [2023-11-17 15:15:00,178 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 15:15:00,179 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 15:15:00,179 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 15:15:00,179 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 15:15:00,197 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:00" (1/1) ... [2023-11-17 15:15:00,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:00" (1/1) ... [2023-11-17 15:15:00,201 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:00" (1/1) ... [2023-11-17 15:15:00,201 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:00" (1/1) ... [2023-11-17 15:15:00,217 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:00" (1/1) ... [2023-11-17 15:15:00,229 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:00" (1/1) ... [2023-11-17 15:15:00,231 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:00" (1/1) ... [2023-11-17 15:15:00,233 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:00" (1/1) ... [2023-11-17 15:15:00,236 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 15:15:00,237 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 15:15:00,237 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 15:15:00,237 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 15:15:00,238 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:00" (1/1) ... [2023-11-17 15:15:00,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:15:00,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:15:00,272 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 15:15:00,302 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 15:15:00,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 15:15:00,313 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 15:15:00,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 15:15:00,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 15:15:00,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 15:15:00,314 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 15:15:00,315 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 15:15:00,315 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 15:15:00,315 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 15:15:00,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 15:15:00,315 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 15:15:00,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 15:15:00,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 15:15:00,317 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 15:15:00,485 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 15:15:00,487 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 15:15:00,853 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 15:15:00,995 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 15:15:00,996 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 15:15:00,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:15:00 BoogieIcfgContainer [2023-11-17 15:15:00,997 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 15:15:01,021 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 15:15:01,021 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 15:15:01,024 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 15:15:01,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:14:59" (1/3) ... [2023-11-17 15:15:01,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328a55a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:15:01, skipping insertion in model container [2023-11-17 15:15:01,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:00" (2/3) ... [2023-11-17 15:15:01,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328a55a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:15:01, skipping insertion in model container [2023-11-17 15:15:01,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:15:00" (3/3) ... [2023-11-17 15:15:01,028 INFO L112 eAbstractionObserver]: Analyzing ICFG mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2023-11-17 15:15:01,041 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 15:15:01,041 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 15:15:01,042 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 15:15:01,080 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 15:15:01,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 96 transitions, 200 flow [2023-11-17 15:15:01,152 INFO L124 PetriNetUnfolderBase]: 3/94 cut-off events. [2023-11-17 15:15:01,153 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:15:01,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 94 events. 3/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 48 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2023-11-17 15:15:01,158 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 96 transitions, 200 flow [2023-11-17 15:15:01,162 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 94 transitions, 194 flow [2023-11-17 15:15:01,165 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:15:01,180 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 94 transitions, 194 flow [2023-11-17 15:15:01,182 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 94 transitions, 194 flow [2023-11-17 15:15:01,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 94 transitions, 194 flow [2023-11-17 15:15:01,205 INFO L124 PetriNetUnfolderBase]: 3/94 cut-off events. [2023-11-17 15:15:01,205 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:15:01,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 94 events. 3/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 48 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2023-11-17 15:15:01,207 INFO L119 LiptonReduction]: Number of co-enabled transitions 1404 [2023-11-17 15:15:04,931 INFO L134 LiptonReduction]: Checked pairs total: 3417 [2023-11-17 15:15:04,932 INFO L136 LiptonReduction]: Total number of compositions: 91 [2023-11-17 15:15:04,954 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:15:04,960 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;@4afd54cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:15:04,960 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-17 15:15:04,963 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:15:04,963 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-11-17 15:15:04,963 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:15:04,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:04,964 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-17 15:15:04,965 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 15:15:04,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:04,974 INFO L85 PathProgramCache]: Analyzing trace with hash 432026, now seen corresponding path program 1 times [2023-11-17 15:15:04,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:04,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964840889] [2023-11-17 15:15:04,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:04,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:05,356 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 15:15:05,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:05,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964840889] [2023-11-17 15:15:05,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964840889] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:05,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:05,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:15:05,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271473171] [2023-11-17 15:15:05,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:05,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:15:05,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:05,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:15:05,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:15:05,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 187 [2023-11-17 15:15:05,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 20 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:05,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:05,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 187 [2023-11-17 15:15:05,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:05,584 INFO L124 PetriNetUnfolderBase]: 173/334 cut-off events. [2023-11-17 15:15:05,585 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-17 15:15:05,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 650 conditions, 334 events. 173/334 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1427 event pairs, 20 based on Foata normal form. 0/310 useless extension candidates. Maximal degree in co-relation 640. Up to 250 conditions per place. [2023-11-17 15:15:05,590 INFO L140 encePairwiseOnDemand]: 182/187 looper letters, 23 selfloop transitions, 2 changer transitions 2/28 dead transitions. [2023-11-17 15:15:05,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 28 transitions, 119 flow [2023-11-17 15:15:05,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:15:05,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:15:05,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 280 transitions. [2023-11-17 15:15:05,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49910873440285203 [2023-11-17 15:15:05,607 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 280 transitions. [2023-11-17 15:15:05,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 280 transitions. [2023-11-17 15:15:05,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:05,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 280 transitions. [2023-11-17 15:15:05,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 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 15:15:05,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 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 15:15:05,626 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 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 15:15:05,628 INFO L175 Difference]: Start difference. First operand has 25 places, 20 transitions, 46 flow. Second operand 3 states and 280 transitions. [2023-11-17 15:15:05,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 28 transitions, 119 flow [2023-11-17 15:15:05,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 28 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:15:05,633 INFO L231 Difference]: Finished difference. Result has 24 places, 16 transitions, 40 flow [2023-11-17 15:15:05,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=24, PETRI_TRANSITIONS=16} [2023-11-17 15:15:05,640 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2023-11-17 15:15:05,640 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 16 transitions, 40 flow [2023-11-17 15:15:05,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:05,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:05,640 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:05,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 15:15:05,641 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 15:15:05,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:05,642 INFO L85 PathProgramCache]: Analyzing trace with hash -401923221, now seen corresponding path program 1 times [2023-11-17 15:15:05,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:05,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373948450] [2023-11-17 15:15:05,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:05,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:05,910 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 15:15:05,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:05,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373948450] [2023-11-17 15:15:05,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373948450] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:05,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:05,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:15:05,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170574012] [2023-11-17 15:15:05,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:05,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:15:05,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:05,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:15:05,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:15:05,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 187 [2023-11-17 15:15:05,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 16 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 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 15:15:05,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:05,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 187 [2023-11-17 15:15:05,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:06,033 INFO L124 PetriNetUnfolderBase]: 121/219 cut-off events. [2023-11-17 15:15:06,034 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-11-17 15:15:06,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 475 conditions, 219 events. 121/219 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 720 event pairs, 41 based on Foata normal form. 8/226 useless extension candidates. Maximal degree in co-relation 465. Up to 157 conditions per place. [2023-11-17 15:15:06,037 INFO L140 encePairwiseOnDemand]: 184/187 looper letters, 18 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2023-11-17 15:15:06,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 21 transitions, 92 flow [2023-11-17 15:15:06,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:15:06,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:15:06,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 264 transitions. [2023-11-17 15:15:06,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2023-11-17 15:15:06,043 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 264 transitions. [2023-11-17 15:15:06,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 264 transitions. [2023-11-17 15:15:06,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:06,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 264 transitions. [2023-11-17 15:15:06,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 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 15:15:06,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 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 15:15:06,048 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 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 15:15:06,048 INFO L175 Difference]: Start difference. First operand has 24 places, 16 transitions, 40 flow. Second operand 3 states and 264 transitions. [2023-11-17 15:15:06,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 21 transitions, 92 flow [2023-11-17 15:15:06,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 21 transitions, 86 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:15:06,050 INFO L231 Difference]: Finished difference. Result has 24 places, 16 transitions, 44 flow [2023-11-17 15:15:06,050 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, 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=44, PETRI_PLACES=24, PETRI_TRANSITIONS=16} [2023-11-17 15:15:06,051 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2023-11-17 15:15:06,051 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 16 transitions, 44 flow [2023-11-17 15:15:06,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 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 15:15:06,052 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:06,052 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:06,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 15:15:06,053 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 15:15:06,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:06,056 INFO L85 PathProgramCache]: Analyzing trace with hash 249780095, now seen corresponding path program 1 times [2023-11-17 15:15:06,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:06,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640570313] [2023-11-17 15:15:06,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:06,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:06,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:06,259 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 15:15:06,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:06,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640570313] [2023-11-17 15:15:06,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640570313] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:06,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:06,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:15:06,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984748668] [2023-11-17 15:15:06,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:06,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:15:06,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:06,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:15:06,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:15:06,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 187 [2023-11-17 15:15:06,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 16 transitions, 44 flow. Second operand has 4 states, 4 states have (on average 79.25) internal successors, (317), 4 states have internal predecessors, (317), 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 15:15:06,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:06,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 187 [2023-11-17 15:15:06,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:06,389 INFO L124 PetriNetUnfolderBase]: 72/155 cut-off events. [2023-11-17 15:15:06,390 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-11-17 15:15:06,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 351 conditions, 155 events. 72/155 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 537 event pairs, 15 based on Foata normal form. 24/178 useless extension candidates. Maximal degree in co-relation 340. Up to 68 conditions per place. [2023-11-17 15:15:06,393 INFO L140 encePairwiseOnDemand]: 182/187 looper letters, 22 selfloop transitions, 3 changer transitions 17/43 dead transitions. [2023-11-17 15:15:06,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 43 transitions, 193 flow [2023-11-17 15:15:06,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:15:06,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:15:06,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 429 transitions. [2023-11-17 15:15:06,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4588235294117647 [2023-11-17 15:15:06,397 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 429 transitions. [2023-11-17 15:15:06,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 429 transitions. [2023-11-17 15:15:06,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:06,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 429 transitions. [2023-11-17 15:15:06,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 85.8) internal successors, (429), 5 states have internal predecessors, (429), 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 15:15:06,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 187.0) internal successors, (1122), 6 states have internal predecessors, (1122), 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 15:15:06,402 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 187.0) internal successors, (1122), 6 states have internal predecessors, (1122), 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 15:15:06,402 INFO L175 Difference]: Start difference. First operand has 24 places, 16 transitions, 44 flow. Second operand 5 states and 429 transitions. [2023-11-17 15:15:06,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 43 transitions, 193 flow [2023-11-17 15:15:06,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 43 transitions, 183 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:15:06,403 INFO L231 Difference]: Finished difference. Result has 29 places, 18 transitions, 67 flow [2023-11-17 15:15:06,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=67, PETRI_PLACES=29, PETRI_TRANSITIONS=18} [2023-11-17 15:15:06,405 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 4 predicate places. [2023-11-17 15:15:06,405 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 18 transitions, 67 flow [2023-11-17 15:15:06,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.25) internal successors, (317), 4 states have internal predecessors, (317), 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 15:15:06,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:06,406 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:06,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 15:15:06,406 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 15:15:06,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:06,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1867101883, now seen corresponding path program 1 times [2023-11-17 15:15:06,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:06,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310445095] [2023-11-17 15:15:06,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:06,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:06,607 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 15:15:06,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:06,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310445095] [2023-11-17 15:15:06,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310445095] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:06,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:06,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:15:06,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231784621] [2023-11-17 15:15:06,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:06,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:15:06,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:06,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:15:06,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:15:06,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 187 [2023-11-17 15:15:06,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 18 transitions, 67 flow. Second operand has 5 states, 5 states have (on average 79.4) internal successors, (397), 5 states have internal predecessors, (397), 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 15:15:06,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:06,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 187 [2023-11-17 15:15:06,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:06,728 INFO L124 PetriNetUnfolderBase]: 28/74 cut-off events. [2023-11-17 15:15:06,728 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-17 15:15:06,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 74 events. 28/74 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 189 event pairs, 12 based on Foata normal form. 9/82 useless extension candidates. Maximal degree in co-relation 196. Up to 34 conditions per place. [2023-11-17 15:15:06,729 INFO L140 encePairwiseOnDemand]: 182/187 looper letters, 20 selfloop transitions, 5 changer transitions 9/35 dead transitions. [2023-11-17 15:15:06,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 35 transitions, 183 flow [2023-11-17 15:15:06,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:15:06,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:15:06,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 498 transitions. [2023-11-17 15:15:06,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44385026737967914 [2023-11-17 15:15:06,732 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 498 transitions. [2023-11-17 15:15:06,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 498 transitions. [2023-11-17 15:15:06,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:06,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 498 transitions. [2023-11-17 15:15:06,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 83.0) internal successors, (498), 6 states have internal predecessors, (498), 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 15:15:06,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 187.0) internal successors, (1309), 7 states have internal predecessors, (1309), 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 15:15:06,737 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 187.0) internal successors, (1309), 7 states have internal predecessors, (1309), 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 15:15:06,737 INFO L175 Difference]: Start difference. First operand has 29 places, 18 transitions, 67 flow. Second operand 6 states and 498 transitions. [2023-11-17 15:15:06,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 35 transitions, 183 flow [2023-11-17 15:15:06,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 35 transitions, 164 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-11-17 15:15:06,740 INFO L231 Difference]: Finished difference. Result has 32 places, 18 transitions, 74 flow [2023-11-17 15:15:06,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=74, PETRI_PLACES=32, PETRI_TRANSITIONS=18} [2023-11-17 15:15:06,742 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 7 predicate places. [2023-11-17 15:15:06,742 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 18 transitions, 74 flow [2023-11-17 15:15:06,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.4) internal successors, (397), 5 states have internal predecessors, (397), 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 15:15:06,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:06,742 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:06,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 15:15:06,743 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 15:15:06,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:06,743 INFO L85 PathProgramCache]: Analyzing trace with hash 268011888, now seen corresponding path program 1 times [2023-11-17 15:15:06,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:06,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606001468] [2023-11-17 15:15:06,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:06,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:07,594 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 15:15:07,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:07,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606001468] [2023-11-17 15:15:07,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606001468] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:07,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:07,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:15:07,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224737414] [2023-11-17 15:15:07,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:07,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:15:07,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:07,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:15:07,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:15:07,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 187 [2023-11-17 15:15:07,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 18 transitions, 74 flow. Second operand has 5 states, 5 states have (on average 81.0) internal successors, (405), 5 states have internal predecessors, (405), 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 15:15:07,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:07,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 187 [2023-11-17 15:15:07,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:07,793 INFO L124 PetriNetUnfolderBase]: 26/88 cut-off events. [2023-11-17 15:15:07,794 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2023-11-17 15:15:07,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 88 events. 26/88 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 277 event pairs, 0 based on Foata normal form. 1/89 useless extension candidates. Maximal degree in co-relation 239. Up to 30 conditions per place. [2023-11-17 15:15:07,794 INFO L140 encePairwiseOnDemand]: 181/187 looper letters, 26 selfloop transitions, 6 changer transitions 13/46 dead transitions. [2023-11-17 15:15:07,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 46 transitions, 294 flow [2023-11-17 15:15:07,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:15:07,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:15:07,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 508 transitions. [2023-11-17 15:15:07,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45276292335115864 [2023-11-17 15:15:07,797 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 508 transitions. [2023-11-17 15:15:07,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 508 transitions. [2023-11-17 15:15:07,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:07,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 508 transitions. [2023-11-17 15:15:07,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 84.66666666666667) internal successors, (508), 6 states have internal predecessors, (508), 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 15:15:07,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 187.0) internal successors, (1309), 7 states have internal predecessors, (1309), 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 15:15:07,801 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 187.0) internal successors, (1309), 7 states have internal predecessors, (1309), 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 15:15:07,802 INFO L175 Difference]: Start difference. First operand has 32 places, 18 transitions, 74 flow. Second operand 6 states and 508 transitions. [2023-11-17 15:15:07,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 46 transitions, 294 flow [2023-11-17 15:15:07,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 46 transitions, 248 flow, removed 15 selfloop flow, removed 5 redundant places. [2023-11-17 15:15:07,804 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 99 flow [2023-11-17 15:15:07,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=99, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2023-11-17 15:15:07,804 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 8 predicate places. [2023-11-17 15:15:07,805 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 99 flow [2023-11-17 15:15:07,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.0) internal successors, (405), 5 states have internal predecessors, (405), 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 15:15:07,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:07,805 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:07,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 15:15:07,806 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 15:15:07,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:07,806 INFO L85 PathProgramCache]: Analyzing trace with hash -896776692, now seen corresponding path program 2 times [2023-11-17 15:15:07,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:07,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419215916] [2023-11-17 15:15:07,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:07,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:08,129 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 15:15:08,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:08,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419215916] [2023-11-17 15:15:08,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419215916] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:08,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:08,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:15:08,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226664862] [2023-11-17 15:15:08,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:08,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:15:08,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:08,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:15:08,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:15:08,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 187 [2023-11-17 15:15:08,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 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 15:15:08,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:08,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 187 [2023-11-17 15:15:08,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:08,336 INFO L124 PetriNetUnfolderBase]: 37/111 cut-off events. [2023-11-17 15:15:08,336 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2023-11-17 15:15:08,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 111 events. 37/111 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 358 event pairs, 12 based on Foata normal form. 1/112 useless extension candidates. Maximal degree in co-relation 351. Up to 44 conditions per place. [2023-11-17 15:15:08,337 INFO L140 encePairwiseOnDemand]: 184/187 looper letters, 17 selfloop transitions, 1 changer transitions 21/39 dead transitions. [2023-11-17 15:15:08,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 39 transitions, 252 flow [2023-11-17 15:15:08,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:15:08,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:15:08,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 345 transitions. [2023-11-17 15:15:08,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4612299465240642 [2023-11-17 15:15:08,340 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 345 transitions. [2023-11-17 15:15:08,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 345 transitions. [2023-11-17 15:15:08,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:08,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 345 transitions. [2023-11-17 15:15:08,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 86.25) internal successors, (345), 4 states have internal predecessors, (345), 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 15:15:08,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 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 15:15:08,345 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 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 15:15:08,345 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 99 flow. Second operand 4 states and 345 transitions. [2023-11-17 15:15:08,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 39 transitions, 252 flow [2023-11-17 15:15:08,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 39 transitions, 250 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-17 15:15:08,349 INFO L231 Difference]: Finished difference. Result has 35 places, 18 transitions, 77 flow [2023-11-17 15:15:08,349 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=77, PETRI_PLACES=35, PETRI_TRANSITIONS=18} [2023-11-17 15:15:08,352 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 10 predicate places. [2023-11-17 15:15:08,352 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 18 transitions, 77 flow [2023-11-17 15:15:08,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 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 15:15:08,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:08,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:08,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 15:15:08,353 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 15:15:08,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:08,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1380118012, now seen corresponding path program 3 times [2023-11-17 15:15:08,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:08,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711734397] [2023-11-17 15:15:08,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:08,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:08,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:15:08,405 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 15:15:08,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:15:08,520 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 15:15:08,520 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 15:15:08,521 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-11-17 15:15:08,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-17 15:15:08,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-11-17 15:15:08,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-11-17 15:15:08,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-17 15:15:08,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 15:15:08,535 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2023-11-17 15:15:08,549 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 15:15:08,549 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 15:15:08,630 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-17 15:15:08,633 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 15:15:08,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:15:08 BasicIcfg [2023-11-17 15:15:08,649 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 15:15:08,655 INFO L158 Benchmark]: Toolchain (without parser) took 9032.29ms. Allocated memory was 268.4MB in the beginning and 323.0MB in the end (delta: 54.5MB). Free memory was 216.2MB in the beginning and 208.7MB in the end (delta: 7.5MB). Peak memory consumption was 63.0MB. Max. memory is 8.0GB. [2023-11-17 15:15:08,655 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 185.6MB. Free memory is still 134.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 15:15:08,655 INFO L158 Benchmark]: CACSL2BoogieTranslator took 510.05ms. Allocated memory is still 268.4MB. Free memory was 216.2MB in the beginning and 193.6MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-11-17 15:15:08,656 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.88ms. Allocated memory is still 268.4MB. Free memory was 193.1MB in the beginning and 191.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:15:08,656 INFO L158 Benchmark]: Boogie Preprocessor took 57.50ms. Allocated memory is still 268.4MB. Free memory was 191.0MB in the beginning and 189.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:15:08,656 INFO L158 Benchmark]: RCFGBuilder took 760.78ms. Allocated memory is still 268.4MB. Free memory was 188.9MB in the beginning and 156.4MB in the end (delta: 32.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2023-11-17 15:15:08,657 INFO L158 Benchmark]: TraceAbstraction took 7628.37ms. Allocated memory was 268.4MB in the beginning and 323.0MB in the end (delta: 54.5MB). Free memory was 233.7MB in the beginning and 208.7MB in the end (delta: 25.0MB). Peak memory consumption was 79.0MB. Max. memory is 8.0GB. [2023-11-17 15:15:08,659 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.20ms. Allocated memory is still 185.6MB. Free memory is still 134.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 510.05ms. Allocated memory is still 268.4MB. Free memory was 216.2MB in the beginning and 193.6MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.88ms. Allocated memory is still 268.4MB. Free memory was 193.1MB in the beginning and 191.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 57.50ms. Allocated memory is still 268.4MB. Free memory was 191.0MB in the beginning and 189.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 760.78ms. Allocated memory is still 268.4MB. Free memory was 188.9MB in the beginning and 156.4MB in the end (delta: 32.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 7628.37ms. Allocated memory was 268.4MB in the beginning and 323.0MB in the end (delta: 54.5MB). Free memory was 233.7MB in the beginning and 208.7MB in the end (delta: 25.0MB). Peak memory consumption was 79.0MB. 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: 3.7s, 98 PlacesBefore, 25 PlacesAfterwards, 94 TransitionsBefore, 20 TransitionsAfterwards, 1404 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 91 TotalNumberOfCompositions, 3417 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1841, independent: 1703, independent conditional: 0, independent unconditional: 1703, dependent: 138, dependent conditional: 0, dependent unconditional: 138, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1097, independent: 1053, independent conditional: 0, independent unconditional: 1053, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1097, independent: 1027, independent conditional: 0, independent unconditional: 1027, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 70, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 377, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 324, dependent conditional: 0, dependent unconditional: 324, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1841, independent: 650, independent conditional: 0, independent unconditional: 650, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 1097, unknown conditional: 0, unknown unconditional: 1097] , Statistics on independence cache: Total cache size (in pairs): 103, Positive cache size: 82, Positive conditional cache size: 0, Positive unconditional cache size: 82, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, 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_p0_EAX = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L722] 0 int z = 0; [L723] 0 _Bool z$flush_delayed; [L724] 0 int z$mem_tmp; [L725] 0 _Bool z$r_buff0_thd0; [L726] 0 _Bool z$r_buff0_thd1; [L727] 0 _Bool z$r_buff0_thd2; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$read_delayed; [L732] 0 int *z$read_delayed_var; [L733] 0 int z$w_buff0; [L734] 0 _Bool z$w_buff0_used; [L735] 0 int z$w_buff1; [L736] 0 _Bool z$w_buff1_used; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L817] 0 pthread_t t897; [L818] FCALL, FORK 0 pthread_create(&t897, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t897={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L742] 1 z$w_buff1 = z$w_buff0 [L743] 1 z$w_buff0 = 1 [L744] 1 z$w_buff1_used = z$w_buff0_used [L745] 1 z$w_buff0_used = (_Bool)1 [L746] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L746] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L747] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L748] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L749] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L819] 0 pthread_t t898; [L753] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t898, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t897={5:0}, t898={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L773] 2 y = 1 [L776] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L779] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 2 z$flush_delayed = weak$$choice2 [L782] 2 z$mem_tmp = z [L783] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L784] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L785] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L786] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L787] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L789] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 __unbuffered_p1_EBX = z [L791] 2 z = z$flush_delayed ? z$mem_tmp : z [L792] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L795] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L796] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L797] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L798] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L799] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L824] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L824] RET 0 assume_abort_if_not(main$tmp_guard0) [L826] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L828] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L829] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L830] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t897={5:0}, t898={3:0}, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L833] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L835] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 820]: 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: 818]: 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, 115 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: 7.4s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 71 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 71 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 352 IncrementalHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 1 mSDtfsCounter, 352 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=5, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 257 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 15:15:08,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...