/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix000.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 11:23:18,214 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 11:23:18,306 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2023-11-17 11:23:18,338 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 11:23:18,340 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 11:23:18,341 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 11:23:18,341 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 11:23:18,342 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 11:23:18,342 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 11:23:18,346 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 11:23:18,347 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 11:23:18,347 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 11:23:18,347 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 11:23:18,348 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 11:23:18,348 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 11:23:18,349 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 11:23:18,349 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 11:23:18,349 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 11:23:18,349 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 11:23:18,350 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 11:23:18,350 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 11:23:18,351 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 11:23:18,351 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 11:23:18,351 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 11:23:18,351 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 11:23:18,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:23:18,352 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 11:23:18,352 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 11:23:18,352 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 11:23:18,352 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 11:23:18,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 11:23:18,353 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 11:23:18,354 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true [2023-11-17 11:23:18,586 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 11:23:18,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 11:23:18,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 11:23:18,614 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 11:23:18,615 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 11:23:18,616 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix000.oepc.i [2023-11-17 11:23:19,836 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 11:23:20,108 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 11:23:20,108 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000.oepc.i [2023-11-17 11:23:20,124 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98b0b442f/ecc45ee1a76f4a17a0d5fb4c8c61d310/FLAG5e7253c2c [2023-11-17 11:23:20,136 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98b0b442f/ecc45ee1a76f4a17a0d5fb4c8c61d310 [2023-11-17 11:23:20,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 11:23:20,140 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 11:23:20,141 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 11:23:20,141 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 11:23:20,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 11:23:20,148 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:23:20" (1/1) ... [2023-11-17 11:23:20,149 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34dbae96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:23:20, skipping insertion in model container [2023-11-17 11:23:20,150 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:23:20" (1/1) ... [2023-11-17 11:23:20,215 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 11:23:20,392 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/mix000.oepc.i[988,1001] [2023-11-17 11:23:20,602 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:23:20,613 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 11:23:20,636 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/mix000.oepc.i[988,1001] [2023-11-17 11:23:20,712 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:23:20,750 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:23:20,750 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:23:20,756 INFO L206 MainTranslator]: Completed translation [2023-11-17 11:23:20,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:23:20 WrapperNode [2023-11-17 11:23:20,757 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 11:23:20,758 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 11:23:20,759 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 11:23:20,759 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 11:23:20,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:23:20" (1/1) ... [2023-11-17 11:23:20,796 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:23:20" (1/1) ... [2023-11-17 11:23:20,836 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 134 [2023-11-17 11:23:20,836 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 11:23:20,837 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 11:23:20,837 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 11:23:20,837 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 11:23:20,845 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:23:20" (1/1) ... [2023-11-17 11:23:20,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:23:20" (1/1) ... [2023-11-17 11:23:20,864 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:23:20" (1/1) ... [2023-11-17 11:23:20,865 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:23:20" (1/1) ... [2023-11-17 11:23:20,872 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:23:20" (1/1) ... [2023-11-17 11:23:20,874 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:23:20" (1/1) ... [2023-11-17 11:23:20,876 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:23:20" (1/1) ... [2023-11-17 11:23:20,894 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:23:20" (1/1) ... [2023-11-17 11:23:20,897 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 11:23:20,898 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 11:23:20,898 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 11:23:20,898 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 11:23:20,899 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:23:20" (1/1) ... [2023-11-17 11:23:20,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:23:20,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:23:20,938 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 11:23:20,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 11:23:20,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 11:23:20,976 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 11:23:20,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 11:23:20,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 11:23:20,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 11:23:20,978 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 11:23:20,978 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 11:23:20,978 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 11:23:20,978 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 11:23:20,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 11:23:20,978 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 11:23:20,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 11:23:20,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 11:23:20,980 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 11:23:21,109 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 11:23:21,111 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 11:23:21,479 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 11:23:21,702 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 11:23:21,704 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 11:23:21,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:23:21 BoogieIcfgContainer [2023-11-17 11:23:21,706 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 11:23:21,709 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 11:23:21,710 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 11:23:21,713 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 11:23:21,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 11:23:20" (1/3) ... [2023-11-17 11:23:21,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f7efec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:23:21, skipping insertion in model container [2023-11-17 11:23:21,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:23:20" (2/3) ... [2023-11-17 11:23:21,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f7efec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:23:21, skipping insertion in model container [2023-11-17 11:23:21,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:23:21" (3/3) ... [2023-11-17 11:23:21,716 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000.oepc.i [2023-11-17 11:23:21,732 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 11:23:21,733 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 11:23:21,733 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 11:23:21,782 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 11:23:21,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 32 transitions, 72 flow [2023-11-17 11:23:21,859 INFO L124 PetriNetUnfolderBase]: 1/30 cut-off events. [2023-11-17 11:23:21,859 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:23:21,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 30 events. 1/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 50 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2023-11-17 11:23:21,867 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 32 transitions, 72 flow [2023-11-17 11:23:21,871 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 30 transitions, 66 flow [2023-11-17 11:23:21,874 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:23:21,894 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 30 transitions, 66 flow [2023-11-17 11:23:21,899 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 30 transitions, 66 flow [2023-11-17 11:23:21,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 30 transitions, 66 flow [2023-11-17 11:23:21,918 INFO L124 PetriNetUnfolderBase]: 1/30 cut-off events. [2023-11-17 11:23:21,919 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:23:21,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 30 events. 1/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 50 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2023-11-17 11:23:21,920 INFO L119 LiptonReduction]: Number of co-enabled transitions 474 [2023-11-17 11:23:23,009 INFO L134 LiptonReduction]: Checked pairs total: 1352 [2023-11-17 11:23:23,009 INFO L136 LiptonReduction]: Total number of compositions: 16 [2023-11-17 11:23:23,028 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:23:23,035 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;@5ff3f2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:23:23,036 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-17 11:23:23,039 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:23:23,039 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-11-17 11:23:23,039 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:23:23,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:23:23,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-17 11:23:23,040 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:23:23,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:23:23,047 INFO L85 PathProgramCache]: Analyzing trace with hash 355118, now seen corresponding path program 1 times [2023-11-17 11:23:23,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:23:23,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037171623] [2023-11-17 11:23:23,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:23:23,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:23:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:23:23,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:23:23,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:23:23,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037171623] [2023-11-17 11:23:23,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037171623] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:23:23,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:23:23,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:23:23,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110763144] [2023-11-17 11:23:23,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:23:23,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:23:23,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:23:23,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:23:23,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:23:23,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2023-11-17 11:23:23,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:23,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:23:23,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2023-11-17 11:23:23,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:23:23,683 INFO L124 PetriNetUnfolderBase]: 184/334 cut-off events. [2023-11-17 11:23:23,683 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-17 11:23:23,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 670 conditions, 334 events. 184/334 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1302 event pairs, 61 based on Foata normal form. 0/308 useless extension candidates. Maximal degree in co-relation 660. Up to 277 conditions per place. [2023-11-17 11:23:23,687 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 22 selfloop transitions, 2 changer transitions 2/28 dead transitions. [2023-11-17 11:23:23,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 28 transitions, 117 flow [2023-11-17 11:23:23,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:23:23,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:23:23,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2023-11-17 11:23:23,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2023-11-17 11:23:23,700 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 69 transitions. [2023-11-17 11:23:23,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 69 transitions. [2023-11-17 11:23:23,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:23:23,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 69 transitions. [2023-11-17 11:23:23,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:23,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:23,712 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:23,714 INFO L175 Difference]: Start difference. First operand has 26 places, 19 transitions, 44 flow. Second operand 3 states and 69 transitions. [2023-11-17 11:23:23,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 28 transitions, 117 flow [2023-11-17 11:23:23,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 28 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:23:23,719 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 42 flow [2023-11-17 11:23:23,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2023-11-17 11:23:23,727 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2023-11-17 11:23:23,728 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 42 flow [2023-11-17 11:23:23,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:23,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:23:23,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:23:23,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 11:23:23,729 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:23:23,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:23:23,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1507800905, now seen corresponding path program 1 times [2023-11-17 11:23:23,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:23:23,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043440277] [2023-11-17 11:23:23,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:23:23,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:23:23,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:23:24,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:23:24,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:23:24,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043440277] [2023-11-17 11:23:24,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043440277] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:23:24,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:23:24,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:23:24,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886394606] [2023-11-17 11:23:24,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:23:24,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:23:24,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:23:24,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:23:24,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:23:24,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2023-11-17 11:23:24,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 17 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:24,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:23:24,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2023-11-17 11:23:24,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:23:24,151 INFO L124 PetriNetUnfolderBase]: 207/360 cut-off events. [2023-11-17 11:23:24,152 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-11-17 11:23:24,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 360 events. 207/360 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1246 event pairs, 87 based on Foata normal form. 4/364 useless extension candidates. Maximal degree in co-relation 752. Up to 333 conditions per place. [2023-11-17 11:23:24,155 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 22 selfloop transitions, 3 changer transitions 0/25 dead transitions. [2023-11-17 11:23:24,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 25 transitions, 112 flow [2023-11-17 11:23:24,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:23:24,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:23:24,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2023-11-17 11:23:24,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4097222222222222 [2023-11-17 11:23:24,160 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 59 transitions. [2023-11-17 11:23:24,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 59 transitions. [2023-11-17 11:23:24,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:23:24,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 59 transitions. [2023-11-17 11:23:24,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:24,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:24,164 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:24,164 INFO L175 Difference]: Start difference. First operand has 25 places, 17 transitions, 42 flow. Second operand 3 states and 59 transitions. [2023-11-17 11:23:24,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 25 transitions, 112 flow [2023-11-17 11:23:24,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 25 transitions, 106 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:23:24,166 INFO L231 Difference]: Finished difference. Result has 25 places, 19 transitions, 57 flow [2023-11-17 11:23:24,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=25, PETRI_TRANSITIONS=19} [2023-11-17 11:23:24,167 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2023-11-17 11:23:24,167 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 19 transitions, 57 flow [2023-11-17 11:23:24,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:24,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:23:24,168 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:23:24,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 11:23:24,168 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:23:24,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:23:24,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1792083191, now seen corresponding path program 1 times [2023-11-17 11:23:24,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:23:24,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662483794] [2023-11-17 11:23:24,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:23:24,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:23:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:23:24,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:23:24,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:23:24,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662483794] [2023-11-17 11:23:24,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662483794] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:23:24,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:23:24,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:23:24,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387358581] [2023-11-17 11:23:24,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:23:24,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:23:24,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:23:24,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:23:24,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:23:24,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2023-11-17 11:23:24,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:24,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:23:24,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2023-11-17 11:23:24,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:23:24,432 INFO L124 PetriNetUnfolderBase]: 157/280 cut-off events. [2023-11-17 11:23:24,432 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2023-11-17 11:23:24,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 648 conditions, 280 events. 157/280 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 950 event pairs, 53 based on Foata normal form. 6/285 useless extension candidates. Maximal degree in co-relation 637. Up to 200 conditions per place. [2023-11-17 11:23:24,435 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 20 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2023-11-17 11:23:24,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 24 transitions, 113 flow [2023-11-17 11:23:24,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:23:24,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:23:24,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2023-11-17 11:23:24,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4097222222222222 [2023-11-17 11:23:24,437 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 59 transitions. [2023-11-17 11:23:24,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 59 transitions. [2023-11-17 11:23:24,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:23:24,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 59 transitions. [2023-11-17 11:23:24,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:24,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:24,438 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:24,438 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 57 flow. Second operand 3 states and 59 transitions. [2023-11-17 11:23:24,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 24 transitions, 113 flow [2023-11-17 11:23:24,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 24 transitions, 110 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:23:24,440 INFO L231 Difference]: Finished difference. Result has 27 places, 19 transitions, 65 flow [2023-11-17 11:23:24,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=27, PETRI_TRANSITIONS=19} [2023-11-17 11:23:24,441 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 1 predicate places. [2023-11-17 11:23:24,441 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 19 transitions, 65 flow [2023-11-17 11:23:24,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:24,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:23:24,441 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:23:24,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 11:23:24,442 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:23:24,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:23:24,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1592722036, now seen corresponding path program 1 times [2023-11-17 11:23:24,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:23:24,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457555319] [2023-11-17 11:23:24,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:23:24,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:23:24,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:23:24,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:23:24,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:23:24,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457555319] [2023-11-17 11:23:24,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457555319] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:23:24,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:23:24,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:23:24,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411962697] [2023-11-17 11:23:24,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:23:24,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:23:24,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:23:24,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:23:24,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:23:24,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2023-11-17 11:23:24,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 19 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:24,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:23:24,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2023-11-17 11:23:24,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:23:24,621 INFO L124 PetriNetUnfolderBase]: 124/237 cut-off events. [2023-11-17 11:23:24,621 INFO L125 PetriNetUnfolderBase]: For 76/80 co-relation queries the response was YES. [2023-11-17 11:23:24,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 237 events. 124/237 cut-off events. For 76/80 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 823 event pairs, 67 based on Foata normal form. 8/242 useless extension candidates. Maximal degree in co-relation 530. Up to 156 conditions per place. [2023-11-17 11:23:24,624 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 21 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2023-11-17 11:23:24,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 27 transitions, 131 flow [2023-11-17 11:23:24,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:23:24,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:23:24,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2023-11-17 11:23:24,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2023-11-17 11:23:24,627 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 63 transitions. [2023-11-17 11:23:24,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 63 transitions. [2023-11-17 11:23:24,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:23:24,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 63 transitions. [2023-11-17 11:23:24,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:24,628 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:24,629 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:24,629 INFO L175 Difference]: Start difference. First operand has 27 places, 19 transitions, 65 flow. Second operand 3 states and 63 transitions. [2023-11-17 11:23:24,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 27 transitions, 131 flow [2023-11-17 11:23:24,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 27 transitions, 125 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:23:24,631 INFO L231 Difference]: Finished difference. Result has 28 places, 19 transitions, 70 flow [2023-11-17 11:23:24,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=28, PETRI_TRANSITIONS=19} [2023-11-17 11:23:24,632 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 2 predicate places. [2023-11-17 11:23:24,632 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 19 transitions, 70 flow [2023-11-17 11:23:24,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:24,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:23:24,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:23:24,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 11:23:24,633 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:23:24,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:23:24,634 INFO L85 PathProgramCache]: Analyzing trace with hash 2042217472, now seen corresponding path program 1 times [2023-11-17 11:23:24,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:23:24,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758336581] [2023-11-17 11:23:24,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:23:24,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:23:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:23:24,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:23:24,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:23:24,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758336581] [2023-11-17 11:23:24,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758336581] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:23:24,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:23:24,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:23:24,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552929426] [2023-11-17 11:23:24,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:23:24,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:23:24,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:23:24,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:23:24,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:23:24,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2023-11-17 11:23:24,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 19 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:24,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:23:24,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2023-11-17 11:23:24,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:23:24,952 INFO L124 PetriNetUnfolderBase]: 78/173 cut-off events. [2023-11-17 11:23:24,955 INFO L125 PetriNetUnfolderBase]: For 65/66 co-relation queries the response was YES. [2023-11-17 11:23:24,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 173 events. 78/173 cut-off events. For 65/66 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 615 event pairs, 35 based on Foata normal form. 25/197 useless extension candidates. Maximal degree in co-relation 424. Up to 82 conditions per place. [2023-11-17 11:23:24,958 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 30 selfloop transitions, 4 changer transitions 1/38 dead transitions. [2023-11-17 11:23:24,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 38 transitions, 190 flow [2023-11-17 11:23:24,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:23:24,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:23:24,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2023-11-17 11:23:24,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2023-11-17 11:23:24,961 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 80 transitions. [2023-11-17 11:23:24,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 80 transitions. [2023-11-17 11:23:24,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:23:24,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 80 transitions. [2023-11-17 11:23:24,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:24,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:24,965 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:24,965 INFO L175 Difference]: Start difference. First operand has 28 places, 19 transitions, 70 flow. Second operand 4 states and 80 transitions. [2023-11-17 11:23:24,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 38 transitions, 190 flow [2023-11-17 11:23:24,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 38 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:23:24,968 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 90 flow [2023-11-17 11:23:24,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-11-17 11:23:24,970 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 5 predicate places. [2023-11-17 11:23:24,971 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 90 flow [2023-11-17 11:23:24,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:24,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:23:24,971 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:23:24,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 11:23:24,971 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:23:24,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:23:24,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1510167821, now seen corresponding path program 1 times [2023-11-17 11:23:24,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:23:24,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406052820] [2023-11-17 11:23:24,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:23:24,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:23:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:23:25,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:23:25,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:23:25,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406052820] [2023-11-17 11:23:25,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406052820] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:23:25,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:23:25,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:23:25,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284191522] [2023-11-17 11:23:25,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:23:25,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:23:25,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:23:25,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:23:25,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:23:25,217 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2023-11-17 11:23:25,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:25,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:23:25,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2023-11-17 11:23:25,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:23:25,313 INFO L124 PetriNetUnfolderBase]: 32/86 cut-off events. [2023-11-17 11:23:25,314 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2023-11-17 11:23:25,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 86 events. 32/86 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 231 event pairs, 13 based on Foata normal form. 9/94 useless extension candidates. Maximal degree in co-relation 245. Up to 41 conditions per place. [2023-11-17 11:23:25,315 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 20 selfloop transitions, 6 changer transitions 1/30 dead transitions. [2023-11-17 11:23:25,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 170 flow [2023-11-17 11:23:25,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:23:25,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:23:25,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2023-11-17 11:23:25,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3458333333333333 [2023-11-17 11:23:25,317 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 83 transitions. [2023-11-17 11:23:25,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 83 transitions. [2023-11-17 11:23:25,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:23:25,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 83 transitions. [2023-11-17 11:23:25,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:25,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 48.0) internal successors, (288), 6 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:25,319 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 48.0) internal successors, (288), 6 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:25,320 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 90 flow. Second operand 5 states and 83 transitions. [2023-11-17 11:23:25,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 170 flow [2023-11-17 11:23:25,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 30 transitions, 148 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-17 11:23:25,322 INFO L231 Difference]: Finished difference. Result has 33 places, 21 transitions, 94 flow [2023-11-17 11:23:25,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=94, PETRI_PLACES=33, PETRI_TRANSITIONS=21} [2023-11-17 11:23:25,325 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 7 predicate places. [2023-11-17 11:23:25,325 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 21 transitions, 94 flow [2023-11-17 11:23:25,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:25,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:23:25,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:23:25,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 11:23:25,326 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:23:25,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:23:25,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1269444095, now seen corresponding path program 1 times [2023-11-17 11:23:25,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:23:25,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968992497] [2023-11-17 11:23:25,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:23:25,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:23:25,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:23:26,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:23:26,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:23:26,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968992497] [2023-11-17 11:23:26,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968992497] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:23:26,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:23:26,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 11:23:26,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327016381] [2023-11-17 11:23:26,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:23:26,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 11:23:26,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:23:26,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 11:23:26,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-17 11:23:26,527 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2023-11-17 11:23:26,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 21 transitions, 94 flow. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:26,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:23:26,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2023-11-17 11:23:26,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:23:26,719 INFO L124 PetriNetUnfolderBase]: 27/81 cut-off events. [2023-11-17 11:23:26,719 INFO L125 PetriNetUnfolderBase]: For 62/63 co-relation queries the response was YES. [2023-11-17 11:23:26,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 81 events. 27/81 cut-off events. For 62/63 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 210 event pairs, 3 based on Foata normal form. 2/83 useless extension candidates. Maximal degree in co-relation 234. Up to 21 conditions per place. [2023-11-17 11:23:26,720 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 22 selfloop transitions, 11 changer transitions 12/48 dead transitions. [2023-11-17 11:23:26,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 48 transitions, 294 flow [2023-11-17 11:23:26,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 11:23:26,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 11:23:26,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2023-11-17 11:23:26,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3776041666666667 [2023-11-17 11:23:26,722 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 145 transitions. [2023-11-17 11:23:26,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 145 transitions. [2023-11-17 11:23:26,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:23:26,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 145 transitions. [2023-11-17 11:23:26,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:26,723 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 48.0) internal successors, (432), 9 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:26,724 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 48.0) internal successors, (432), 9 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:26,724 INFO L175 Difference]: Start difference. First operand has 33 places, 21 transitions, 94 flow. Second operand 8 states and 145 transitions. [2023-11-17 11:23:26,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 48 transitions, 294 flow [2023-11-17 11:23:26,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 48 transitions, 227 flow, removed 10 selfloop flow, removed 7 redundant places. [2023-11-17 11:23:26,726 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 123 flow [2023-11-17 11:23:26,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=123, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2023-11-17 11:23:26,727 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 10 predicate places. [2023-11-17 11:23:26,727 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 123 flow [2023-11-17 11:23:26,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:26,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:23:26,727 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:23:26,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 11:23:26,728 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:23:26,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:23:26,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1708192191, now seen corresponding path program 2 times [2023-11-17 11:23:26,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:23:26,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213307920] [2023-11-17 11:23:26,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:23:26,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:23:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:23:26,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:23:26,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:23:26,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213307920] [2023-11-17 11:23:26,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213307920] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:23:26,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:23:26,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:23:26,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042463798] [2023-11-17 11:23:26,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:23:26,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:23:26,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:23:26,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:23:26,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:23:26,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2023-11-17 11:23:26,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:26,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:23:26,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2023-11-17 11:23:26,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:23:27,023 INFO L124 PetriNetUnfolderBase]: 29/85 cut-off events. [2023-11-17 11:23:27,023 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2023-11-17 11:23:27,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 85 events. 29/85 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 210 event pairs, 9 based on Foata normal form. 1/86 useless extension candidates. Maximal degree in co-relation 248. Up to 45 conditions per place. [2023-11-17 11:23:27,024 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 18 selfloop transitions, 1 changer transitions 22/41 dead transitions. [2023-11-17 11:23:27,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 41 transitions, 255 flow [2023-11-17 11:23:27,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:23:27,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:23:27,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2023-11-17 11:23:27,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.359375 [2023-11-17 11:23:27,025 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 69 transitions. [2023-11-17 11:23:27,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 69 transitions. [2023-11-17 11:23:27,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:23:27,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 69 transitions. [2023-11-17 11:23:27,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:27,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:27,026 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:27,027 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 123 flow. Second operand 4 states and 69 transitions. [2023-11-17 11:23:27,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 41 transitions, 255 flow [2023-11-17 11:23:27,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 41 transitions, 241 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-17 11:23:27,030 INFO L231 Difference]: Finished difference. Result has 38 places, 19 transitions, 75 flow [2023-11-17 11:23:27,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=75, PETRI_PLACES=38, PETRI_TRANSITIONS=19} [2023-11-17 11:23:27,031 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 12 predicate places. [2023-11-17 11:23:27,031 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 19 transitions, 75 flow [2023-11-17 11:23:27,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:27,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:23:27,032 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:23:27,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 11:23:27,032 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:23:27,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:23:27,033 INFO L85 PathProgramCache]: Analyzing trace with hash 219047545, now seen corresponding path program 3 times [2023-11-17 11:23:27,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:23:27,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159121495] [2023-11-17 11:23:27,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:23:27,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:23:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:23:27,102 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 11:23:27,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:23:27,164 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 11:23:27,165 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 11:23:27,166 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-11-17 11:23:27,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-17 11:23:27,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-11-17 11:23:27,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-11-17 11:23:27,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-17 11:23:27,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 11:23:27,170 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2023-11-17 11:23:27,176 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 11:23:27,176 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 11:23:27,217 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 11:23:27,220 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-17 11:23:27,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 11:23:27 BasicIcfg [2023-11-17 11:23:27,238 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 11:23:27,238 INFO L158 Benchmark]: Toolchain (without parser) took 7098.37ms. Allocated memory was 179.3MB in the beginning and 269.5MB in the end (delta: 90.2MB). Free memory was 135.1MB in the beginning and 113.5MB in the end (delta: 21.5MB). Peak memory consumption was 113.3MB. Max. memory is 8.0GB. [2023-11-17 11:23:27,238 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 179.3MB. Free memory is still 138.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 11:23:27,239 INFO L158 Benchmark]: CACSL2BoogieTranslator took 616.50ms. Allocated memory is still 179.3MB. Free memory was 134.7MB in the beginning and 110.6MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-11-17 11:23:27,239 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.08ms. Allocated memory is still 179.3MB. Free memory was 110.6MB in the beginning and 108.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:23:27,239 INFO L158 Benchmark]: Boogie Preprocessor took 60.42ms. Allocated memory is still 179.3MB. Free memory was 108.2MB in the beginning and 106.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:23:27,240 INFO L158 Benchmark]: RCFGBuilder took 807.50ms. Allocated memory is still 179.3MB. Free memory was 106.1MB in the beginning and 117.2MB in the end (delta: -11.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-11-17 11:23:27,240 INFO L158 Benchmark]: TraceAbstraction took 5528.35ms. Allocated memory was 179.3MB in the beginning and 269.5MB in the end (delta: 90.2MB). Free memory was 116.7MB in the beginning and 113.5MB in the end (delta: 3.2MB). Peak memory consumption was 94.4MB. Max. memory is 8.0GB. [2023-11-17 11:23:27,241 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 179.3MB. Free memory is still 138.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 616.50ms. Allocated memory is still 179.3MB. Free memory was 134.7MB in the beginning and 110.6MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 78.08ms. Allocated memory is still 179.3MB. Free memory was 110.6MB in the beginning and 108.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 60.42ms. Allocated memory is still 179.3MB. Free memory was 108.2MB in the beginning and 106.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 807.50ms. Allocated memory is still 179.3MB. Free memory was 106.1MB in the beginning and 117.2MB in the end (delta: -11.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 5528.35ms. Allocated memory was 179.3MB in the beginning and 269.5MB in the end (delta: 90.2MB). Free memory was 116.7MB in the beginning and 113.5MB in the end (delta: 3.2MB). Peak memory consumption was 94.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 36 PlacesBefore, 26 PlacesAfterwards, 30 TransitionsBefore, 19 TransitionsAfterwards, 474 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 14 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 1 ChoiceCompositions, 16 TotalNumberOfCompositions, 1352 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 688, independent: 607, independent conditional: 0, independent unconditional: 607, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 370, independent: 334, independent conditional: 0, independent unconditional: 334, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 370, independent: 332, independent conditional: 0, independent unconditional: 332, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 38, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 391, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 386, dependent conditional: 0, dependent unconditional: 386, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 688, independent: 273, independent conditional: 0, independent unconditional: 273, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 370, unknown conditional: 0, unknown unconditional: 370] , Statistics on independence cache: Total cache size (in pairs): 80, Positive cache size: 64, Positive conditional cache size: 0, Positive unconditional cache size: 64, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L831] 0 pthread_t t0; [L832] FCALL, FORK 0 pthread_create(&t0, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t0={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L833] 0 pthread_t t1; [L743] 1 y$w_buff1 = y$w_buff0 [L744] 1 y$w_buff0 = 1 [L745] 1 y$w_buff1_used = y$w_buff0_used [L746] 1 y$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L748] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L749] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L750] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L751] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L834] FCALL, FORK 0 pthread_create(&t1, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t0={5:0}, t1={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L770] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L787] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L790] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L793] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 2 y$flush_delayed = weak$$choice2 [L796] 2 y$mem_tmp = y [L797] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L798] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L799] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L800] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L801] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L802] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L803] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L804] 2 __unbuffered_p1_EBX = y [L805] 2 y = y$flush_delayed ? y$mem_tmp : y [L806] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L809] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L810] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L811] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L812] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L813] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 2 return 0; [L773] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L774] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L775] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L776] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L777] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L780] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 1 return 0; [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0={5:0}, t1={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L841] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L842] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L843] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L844] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0={5:0}, t1={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L847] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 19]: 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: 832]: 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: 834]: 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, 51 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: 5.4s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 110 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 110 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 325 IncrementalHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 4 mSDtfsCounter, 325 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=7, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 104 NumberOfCodeBlocks, 104 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 79 ConstructedInterpolants, 0 QuantifiedInterpolants, 589 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-17 11:23:27,261 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...