/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix036.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 15:15:05,611 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 15:15:05,681 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2023-11-17 15:15:05,711 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 15:15:05,711 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 15:15:05,712 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 15:15:05,712 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 15:15:05,712 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 15:15:05,712 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 15:15:05,713 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 15:15:05,713 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 15:15:05,713 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 15:15:05,713 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 15:15:05,714 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 15:15:05,714 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 15:15:05,714 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 15:15:05,714 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 15:15:05,715 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 15:15:05,715 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 15:15:05,715 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 15:15:05,715 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 15:15:05,719 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 15:15:05,719 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 15:15:05,719 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 15:15:05,725 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 15:15:05,725 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:15:05,726 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 15:15:05,726 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 15:15:05,726 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 15:15:05,726 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 15:15:05,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 15:15:05,727 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 15:15:05,727 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-11-17 15:15:05,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 15:15:06,024 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 15:15:06,026 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 15:15:06,027 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 15:15:06,029 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 15:15:06,030 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036.oepc.i [2023-11-17 15:15:07,255 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 15:15:07,503 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 15:15:07,506 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036.oepc.i [2023-11-17 15:15:07,524 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c4586181/13cec938e4dd44919d0a96a7a786abc1/FLAG4df0deaa5 [2023-11-17 15:15:07,535 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c4586181/13cec938e4dd44919d0a96a7a786abc1 [2023-11-17 15:15:07,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 15:15:07,538 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 15:15:07,540 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 15:15:07,540 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 15:15:07,544 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 15:15:07,544 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:15:07" (1/1) ... [2023-11-17 15:15:07,545 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fa48a94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:07, skipping insertion in model container [2023-11-17 15:15:07,545 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:15:07" (1/1) ... [2023-11-17 15:15:07,595 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 15:15:07,720 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/mix036.oepc.i[945,958] [2023-11-17 15:15:07,900 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:15:07,914 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 15:15:07,923 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/mix036.oepc.i[945,958] [2023-11-17 15:15:07,983 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:15:08,009 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:15:08,009 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:15:08,014 INFO L206 MainTranslator]: Completed translation [2023-11-17 15:15:08,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:08 WrapperNode [2023-11-17 15:15:08,016 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 15:15:08,017 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 15:15:08,017 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 15:15:08,017 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 15:15:08,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:08" (1/1) ... [2023-11-17 15:15:08,045 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:08" (1/1) ... [2023-11-17 15:15:08,079 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2023-11-17 15:15:08,080 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 15:15:08,080 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 15:15:08,080 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 15:15:08,080 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 15:15:08,087 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:08" (1/1) ... [2023-11-17 15:15:08,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:08" (1/1) ... [2023-11-17 15:15:08,099 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:08" (1/1) ... [2023-11-17 15:15:08,100 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:08" (1/1) ... [2023-11-17 15:15:08,108 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:08" (1/1) ... [2023-11-17 15:15:08,110 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:08" (1/1) ... [2023-11-17 15:15:08,112 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:08" (1/1) ... [2023-11-17 15:15:08,113 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:08" (1/1) ... [2023-11-17 15:15:08,115 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 15:15:08,116 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 15:15:08,116 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 15:15:08,116 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 15:15:08,129 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:08" (1/1) ... [2023-11-17 15:15:08,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:15:08,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:15:08,190 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 15:15:08,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 15:15:08,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 15:15:08,220 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 15:15:08,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 15:15:08,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 15:15:08,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 15:15:08,221 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 15:15:08,221 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 15:15:08,221 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 15:15:08,221 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 15:15:08,222 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 15:15:08,222 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 15:15:08,222 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-17 15:15:08,222 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-17 15:15:08,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 15:15:08,222 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 15:15:08,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 15:15:08,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 15:15:08,223 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 15:15:08,379 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 15:15:08,381 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 15:15:08,631 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 15:15:08,731 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 15:15:08,731 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 15:15:08,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:15:08 BoogieIcfgContainer [2023-11-17 15:15:08,732 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 15:15:08,734 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 15:15:08,734 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 15:15:08,736 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 15:15:08,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:15:07" (1/3) ... [2023-11-17 15:15:08,737 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@341c22d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:15:08, skipping insertion in model container [2023-11-17 15:15:08,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:08" (2/3) ... [2023-11-17 15:15:08,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@341c22d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:15:08, skipping insertion in model container [2023-11-17 15:15:08,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:15:08" (3/3) ... [2023-11-17 15:15:08,739 INFO L112 eAbstractionObserver]: Analyzing ICFG mix036.oepc.i [2023-11-17 15:15:08,751 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 15:15:08,751 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 15:15:08,752 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 15:15:08,803 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 15:15:08,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 138 transitions, 292 flow [2023-11-17 15:15:08,898 INFO L124 PetriNetUnfolderBase]: 3/134 cut-off events. [2023-11-17 15:15:08,898 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:15:08,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 134 events. 3/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2023-11-17 15:15:08,904 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 138 transitions, 292 flow [2023-11-17 15:15:08,910 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 134 transitions, 280 flow [2023-11-17 15:15:08,913 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:15:08,930 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 134 transitions, 280 flow [2023-11-17 15:15:08,933 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 134 transitions, 280 flow [2023-11-17 15:15:08,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 134 transitions, 280 flow [2023-11-17 15:15:08,960 INFO L124 PetriNetUnfolderBase]: 3/134 cut-off events. [2023-11-17 15:15:08,961 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:15:08,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 134 events. 3/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2023-11-17 15:15:08,963 INFO L119 LiptonReduction]: Number of co-enabled transitions 3676 [2023-11-17 15:15:12,859 INFO L134 LiptonReduction]: Checked pairs total: 9457 [2023-11-17 15:15:12,859 INFO L136 LiptonReduction]: Total number of compositions: 121 [2023-11-17 15:15:12,882 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:15:12,886 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;@4ef5808, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:15:12,886 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-17 15:15:12,902 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:15:12,902 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-17 15:15:12,902 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:15:12,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:12,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-17 15:15:12,903 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:12,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:12,907 INFO L85 PathProgramCache]: Analyzing trace with hash 577978, now seen corresponding path program 1 times [2023-11-17 15:15:12,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:12,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92119104] [2023-11-17 15:15:12,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:12,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:13,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:15:13,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:13,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92119104] [2023-11-17 15:15:13,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92119104] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:13,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:13,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:15:13,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744924094] [2023-11-17 15:15:13,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:13,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:15:13,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:13,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:15:13,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:15:13,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 259 [2023-11-17 15:15:13,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:13,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:13,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 259 [2023-11-17 15:15:13,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:14,099 INFO L124 PetriNetUnfolderBase]: 5879/8109 cut-off events. [2023-11-17 15:15:14,099 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-11-17 15:15:14,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16253 conditions, 8109 events. 5879/8109 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 40782 event pairs, 2239 based on Foata normal form. 0/7719 useless extension candidates. Maximal degree in co-relation 16241. Up to 6367 conditions per place. [2023-11-17 15:15:14,135 INFO L140 encePairwiseOnDemand]: 254/259 looper letters, 43 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2023-11-17 15:15:14,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 50 transitions, 215 flow [2023-11-17 15:15:14,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:15:14,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:15:14,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2023-11-17 15:15:14,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5328185328185329 [2023-11-17 15:15:14,145 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 414 transitions. [2023-11-17 15:15:14,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 414 transitions. [2023-11-17 15:15:14,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:14,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 414 transitions. [2023-11-17 15:15:14,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:14,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 259.0) internal successors, (1036), 4 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:14,154 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 259.0) internal successors, (1036), 4 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:14,155 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 76 flow. Second operand 3 states and 414 transitions. [2023-11-17 15:15:14,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 50 transitions, 215 flow [2023-11-17 15:15:14,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 208 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-17 15:15:14,159 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 68 flow [2023-11-17 15:15:14,160 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-11-17 15:15:14,163 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-11-17 15:15:14,164 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 68 flow [2023-11-17 15:15:14,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:14,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:14,164 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:14,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 15:15:14,165 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:14,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:14,165 INFO L85 PathProgramCache]: Analyzing trace with hash -345521452, now seen corresponding path program 1 times [2023-11-17 15:15:14,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:14,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637440592] [2023-11-17 15:15:14,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:14,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:14,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:15:14,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:14,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637440592] [2023-11-17 15:15:14,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637440592] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:14,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:14,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:15:14,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577223999] [2023-11-17 15:15:14,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:14,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:15:14,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:14,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:15:14,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:15:14,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 259 [2023-11-17 15:15:14,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:14,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:14,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 259 [2023-11-17 15:15:14,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:15,327 INFO L124 PetriNetUnfolderBase]: 4279/5884 cut-off events. [2023-11-17 15:15:15,327 INFO L125 PetriNetUnfolderBase]: For 393/393 co-relation queries the response was YES. [2023-11-17 15:15:15,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12308 conditions, 5884 events. 4279/5884 cut-off events. For 393/393 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 28135 event pairs, 1463 based on Foata normal form. 128/5987 useless extension candidates. Maximal degree in co-relation 12298. Up to 4033 conditions per place. [2023-11-17 15:15:15,358 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 34 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2023-11-17 15:15:15,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 39 transitions, 164 flow [2023-11-17 15:15:15,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:15:15,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:15:15,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2023-11-17 15:15:15,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5070785070785071 [2023-11-17 15:15:15,376 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 394 transitions. [2023-11-17 15:15:15,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 394 transitions. [2023-11-17 15:15:15,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:15,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 394 transitions. [2023-11-17 15:15:15,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:15,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 259.0) internal successors, (1036), 4 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:15,391 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 259.0) internal successors, (1036), 4 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:15,391 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 394 transitions. [2023-11-17 15:15:15,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 39 transitions, 164 flow [2023-11-17 15:15:15,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 39 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:15:15,393 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 72 flow [2023-11-17 15:15:15,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-11-17 15:15:15,394 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-11-17 15:15:15,394 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 72 flow [2023-11-17 15:15:15,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:15,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:15,395 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:15,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 15:15:15,398 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:15,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:15,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1335981137, now seen corresponding path program 1 times [2023-11-17 15:15:15,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:15,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389638945] [2023-11-17 15:15:15,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:15,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:15,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:15:15,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:15,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389638945] [2023-11-17 15:15:15,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389638945] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:15,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:15,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:15:15,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467606651] [2023-11-17 15:15:15,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:15,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:15:15,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:15,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:15:15,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:15:15,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 259 [2023-11-17 15:15:15,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:15,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:15,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 259 [2023-11-17 15:15:15,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:16,186 INFO L124 PetriNetUnfolderBase]: 3810/5442 cut-off events. [2023-11-17 15:15:16,187 INFO L125 PetriNetUnfolderBase]: For 233/233 co-relation queries the response was YES. [2023-11-17 15:15:16,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11616 conditions, 5442 events. 3810/5442 cut-off events. For 233/233 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 28428 event pairs, 701 based on Foata normal form. 384/5811 useless extension candidates. Maximal degree in co-relation 11605. Up to 3508 conditions per place. [2023-11-17 15:15:16,212 INFO L140 encePairwiseOnDemand]: 252/259 looper letters, 40 selfloop transitions, 5 changer transitions 29/77 dead transitions. [2023-11-17 15:15:16,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 77 transitions, 333 flow [2023-11-17 15:15:16,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:15:16,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:15:16,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 641 transitions. [2023-11-17 15:15:16,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49498069498069497 [2023-11-17 15:15:16,215 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 641 transitions. [2023-11-17 15:15:16,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 641 transitions. [2023-11-17 15:15:16,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:16,215 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 641 transitions. [2023-11-17 15:15:16,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:16,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:16,219 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:16,219 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 72 flow. Second operand 5 states and 641 transitions. [2023-11-17 15:15:16,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 77 transitions, 333 flow [2023-11-17 15:15:16,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 77 transitions, 323 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:15:16,223 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 113 flow [2023-11-17 15:15:16,223 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2023-11-17 15:15:16,224 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2023-11-17 15:15:16,224 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 113 flow [2023-11-17 15:15:16,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:16,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:16,224 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:16,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 15:15:16,225 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:16,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:16,225 INFO L85 PathProgramCache]: Analyzing trace with hash 961628043, now seen corresponding path program 1 times [2023-11-17 15:15:16,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:16,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456473794] [2023-11-17 15:15:16,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:16,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:16,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:15:16,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:16,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456473794] [2023-11-17 15:15:16,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456473794] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:16,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:16,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:15:16,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236696754] [2023-11-17 15:15:16,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:16,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:15:16,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:16,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:15:16,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:15:16,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 259 [2023-11-17 15:15:16,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:16,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:16,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 259 [2023-11-17 15:15:16,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:16,790 INFO L124 PetriNetUnfolderBase]: 2136/3201 cut-off events. [2023-11-17 15:15:16,790 INFO L125 PetriNetUnfolderBase]: For 1053/1053 co-relation queries the response was YES. [2023-11-17 15:15:16,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8745 conditions, 3201 events. 2136/3201 cut-off events. For 1053/1053 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 16286 event pairs, 428 based on Foata normal form. 249/3435 useless extension candidates. Maximal degree in co-relation 8731. Up to 1060 conditions per place. [2023-11-17 15:15:16,801 INFO L140 encePairwiseOnDemand]: 252/259 looper letters, 54 selfloop transitions, 9 changer transitions 29/95 dead transitions. [2023-11-17 15:15:16,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 95 transitions, 487 flow [2023-11-17 15:15:16,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:15:16,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:15:16,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 772 transitions. [2023-11-17 15:15:16,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4967824967824968 [2023-11-17 15:15:16,804 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 772 transitions. [2023-11-17 15:15:16,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 772 transitions. [2023-11-17 15:15:16,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:16,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 772 transitions. [2023-11-17 15:15:16,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.66666666666666) internal successors, (772), 6 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:16,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 259.0) internal successors, (1813), 7 states have internal predecessors, (1813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:16,808 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 259.0) internal successors, (1813), 7 states have internal predecessors, (1813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:16,808 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 113 flow. Second operand 6 states and 772 transitions. [2023-11-17 15:15:16,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 95 transitions, 487 flow [2023-11-17 15:15:16,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 95 transitions, 480 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-17 15:15:16,815 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 178 flow [2023-11-17 15:15:16,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=178, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2023-11-17 15:15:16,816 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places. [2023-11-17 15:15:16,816 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 178 flow [2023-11-17 15:15:16,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:16,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:16,816 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:16,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 15:15:16,817 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:16,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:16,817 INFO L85 PathProgramCache]: Analyzing trace with hash 507833274, now seen corresponding path program 1 times [2023-11-17 15:15:16,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:16,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921861692] [2023-11-17 15:15:16,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:16,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:16,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:17,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:15:17,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:17,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921861692] [2023-11-17 15:15:17,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921861692] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:17,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:17,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:15:17,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861792168] [2023-11-17 15:15:17,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:17,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:15:17,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:17,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:15:17,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:15:17,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 259 [2023-11-17 15:15:17,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 178 flow. Second operand has 5 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:17,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:17,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 259 [2023-11-17 15:15:17,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:17,633 INFO L124 PetriNetUnfolderBase]: 2858/4528 cut-off events. [2023-11-17 15:15:17,633 INFO L125 PetriNetUnfolderBase]: For 6341/6341 co-relation queries the response was YES. [2023-11-17 15:15:17,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14612 conditions, 4528 events. 2858/4528 cut-off events. For 6341/6341 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 26057 event pairs, 856 based on Foata normal form. 41/4556 useless extension candidates. Maximal degree in co-relation 14595. Up to 2329 conditions per place. [2023-11-17 15:15:17,655 INFO L140 encePairwiseOnDemand]: 251/259 looper letters, 80 selfloop transitions, 13 changer transitions 31/127 dead transitions. [2023-11-17 15:15:17,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 127 transitions, 946 flow [2023-11-17 15:15:17,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:15:17,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:15:17,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 786 transitions. [2023-11-17 15:15:17,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5057915057915058 [2023-11-17 15:15:17,658 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 786 transitions. [2023-11-17 15:15:17,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 786 transitions. [2023-11-17 15:15:17,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:17,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 786 transitions. [2023-11-17 15:15:17,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:17,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 259.0) internal successors, (1813), 7 states have internal predecessors, (1813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:17,662 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 259.0) internal successors, (1813), 7 states have internal predecessors, (1813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:17,662 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 178 flow. Second operand 6 states and 786 transitions. [2023-11-17 15:15:17,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 127 transitions, 946 flow [2023-11-17 15:15:17,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 127 transitions, 780 flow, removed 64 selfloop flow, removed 4 redundant places. [2023-11-17 15:15:17,697 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 220 flow [2023-11-17 15:15:17,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=220, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2023-11-17 15:15:17,698 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places. [2023-11-17 15:15:17,698 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 220 flow [2023-11-17 15:15:17,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:17,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:17,699 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:17,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 15:15:17,699 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:17,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:17,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1169904622, now seen corresponding path program 2 times [2023-11-17 15:15:17,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:17,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242212252] [2023-11-17 15:15:17,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:17,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:17,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:17,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:15:17,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:17,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242212252] [2023-11-17 15:15:17,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242212252] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:17,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:17,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:15:17,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905164902] [2023-11-17 15:15:17,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:17,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:15:17,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:17,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:15:17,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:15:17,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 259 [2023-11-17 15:15:17,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:17,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:17,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 259 [2023-11-17 15:15:17,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:18,238 INFO L124 PetriNetUnfolderBase]: 2275/3586 cut-off events. [2023-11-17 15:15:18,239 INFO L125 PetriNetUnfolderBase]: For 3409/3409 co-relation queries the response was YES. [2023-11-17 15:15:18,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11556 conditions, 3586 events. 2275/3586 cut-off events. For 3409/3409 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 19851 event pairs, 398 based on Foata normal form. 162/3729 useless extension candidates. Maximal degree in co-relation 11539. Up to 1236 conditions per place. [2023-11-17 15:15:18,260 INFO L140 encePairwiseOnDemand]: 252/259 looper letters, 96 selfloop transitions, 13 changer transitions 53/165 dead transitions. [2023-11-17 15:15:18,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 165 transitions, 1052 flow [2023-11-17 15:15:18,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:15:18,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:15:18,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 901 transitions. [2023-11-17 15:15:18,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49696635410921125 [2023-11-17 15:15:18,263 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 901 transitions. [2023-11-17 15:15:18,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 901 transitions. [2023-11-17 15:15:18,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:18,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 901 transitions. [2023-11-17 15:15:18,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.71428571428572) internal successors, (901), 7 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:18,266 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 259.0) internal successors, (2072), 8 states have internal predecessors, (2072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:18,267 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 259.0) internal successors, (2072), 8 states have internal predecessors, (2072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:18,267 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 220 flow. Second operand 7 states and 901 transitions. [2023-11-17 15:15:18,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 165 transitions, 1052 flow [2023-11-17 15:15:18,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 165 transitions, 1042 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-17 15:15:18,276 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 301 flow [2023-11-17 15:15:18,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=301, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2023-11-17 15:15:18,278 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places. [2023-11-17 15:15:18,278 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 301 flow [2023-11-17 15:15:18,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:18,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:18,279 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:18,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 15:15:18,279 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:18,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:18,279 INFO L85 PathProgramCache]: Analyzing trace with hash 408699414, now seen corresponding path program 1 times [2023-11-17 15:15:18,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:18,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529511923] [2023-11-17 15:15:18,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:18,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:18,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:18,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:15:18,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:18,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529511923] [2023-11-17 15:15:18,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529511923] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:18,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:18,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:15:18,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910801881] [2023-11-17 15:15:18,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:18,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:15:18,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:18,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:15:18,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:15:18,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 259 [2023-11-17 15:15:18,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 301 flow. Second operand has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:18,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:18,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 259 [2023-11-17 15:15:18,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:19,066 INFO L124 PetriNetUnfolderBase]: 5197/7734 cut-off events. [2023-11-17 15:15:19,066 INFO L125 PetriNetUnfolderBase]: For 10711/10711 co-relation queries the response was YES. [2023-11-17 15:15:19,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25519 conditions, 7734 events. 5197/7734 cut-off events. For 10711/10711 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 42148 event pairs, 501 based on Foata normal form. 16/7750 useless extension candidates. Maximal degree in co-relation 25506. Up to 4370 conditions per place. [2023-11-17 15:15:19,120 INFO L140 encePairwiseOnDemand]: 251/259 looper letters, 124 selfloop transitions, 12 changer transitions 4/140 dead transitions. [2023-11-17 15:15:19,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 140 transitions, 1077 flow [2023-11-17 15:15:19,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:15:19,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:15:19,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 634 transitions. [2023-11-17 15:15:19,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48957528957528956 [2023-11-17 15:15:19,122 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 634 transitions. [2023-11-17 15:15:19,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 634 transitions. [2023-11-17 15:15:19,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:19,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 634 transitions. [2023-11-17 15:15:19,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:19,125 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:19,125 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:19,125 INFO L175 Difference]: Start difference. First operand has 59 places, 50 transitions, 301 flow. Second operand 5 states and 634 transitions. [2023-11-17 15:15:19,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 140 transitions, 1077 flow [2023-11-17 15:15:19,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 140 transitions, 917 flow, removed 57 selfloop flow, removed 5 redundant places. [2023-11-17 15:15:19,218 INFO L231 Difference]: Finished difference. Result has 57 places, 60 transitions, 329 flow [2023-11-17 15:15:19,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=329, PETRI_PLACES=57, PETRI_TRANSITIONS=60} [2023-11-17 15:15:19,219 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places. [2023-11-17 15:15:19,219 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 60 transitions, 329 flow [2023-11-17 15:15:19,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:19,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:19,219 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:19,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 15:15:19,220 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:19,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:19,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1215452010, now seen corresponding path program 2 times [2023-11-17 15:15:19,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:19,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278182453] [2023-11-17 15:15:19,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:19,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:19,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:20,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:15:20,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:20,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278182453] [2023-11-17 15:15:20,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278182453] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:20,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:20,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:15:20,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484472525] [2023-11-17 15:15:20,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:20,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 15:15:20,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:20,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 15:15:20,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-17 15:15:20,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 259 [2023-11-17 15:15:20,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 60 transitions, 329 flow. Second operand has 8 states, 8 states have (on average 114.75) internal successors, (918), 8 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:20,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:20,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 259 [2023-11-17 15:15:20,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:20,947 INFO L124 PetriNetUnfolderBase]: 4366/7034 cut-off events. [2023-11-17 15:15:20,947 INFO L125 PetriNetUnfolderBase]: For 8651/8955 co-relation queries the response was YES. [2023-11-17 15:15:20,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24316 conditions, 7034 events. 4366/7034 cut-off events. For 8651/8955 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 44853 event pairs, 747 based on Foata normal form. 192/7152 useless extension candidates. Maximal degree in co-relation 24302. Up to 2812 conditions per place. [2023-11-17 15:15:20,978 INFO L140 encePairwiseOnDemand]: 252/259 looper letters, 103 selfloop transitions, 12 changer transitions 44/167 dead transitions. [2023-11-17 15:15:20,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 167 transitions, 1239 flow [2023-11-17 15:15:20,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:15:20,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:15:20,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 869 transitions. [2023-11-17 15:15:20,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4793160507446222 [2023-11-17 15:15:20,980 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 869 transitions. [2023-11-17 15:15:20,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 869 transitions. [2023-11-17 15:15:20,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:20,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 869 transitions. [2023-11-17 15:15:20,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.14285714285714) internal successors, (869), 7 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:20,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 259.0) internal successors, (2072), 8 states have internal predecessors, (2072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:20,984 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 259.0) internal successors, (2072), 8 states have internal predecessors, (2072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:20,984 INFO L175 Difference]: Start difference. First operand has 57 places, 60 transitions, 329 flow. Second operand 7 states and 869 transitions. [2023-11-17 15:15:20,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 167 transitions, 1239 flow [2023-11-17 15:15:21,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 167 transitions, 1237 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-17 15:15:21,070 INFO L231 Difference]: Finished difference. Result has 66 places, 65 transitions, 400 flow [2023-11-17 15:15:21,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=400, PETRI_PLACES=66, PETRI_TRANSITIONS=65} [2023-11-17 15:15:21,070 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places. [2023-11-17 15:15:21,071 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 65 transitions, 400 flow [2023-11-17 15:15:21,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 114.75) internal successors, (918), 8 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:21,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:21,071 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:21,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 15:15:21,071 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:21,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:21,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1594983645, now seen corresponding path program 1 times [2023-11-17 15:15:21,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:21,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446161119] [2023-11-17 15:15:21,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:21,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:21,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:21,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:15:21,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:21,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446161119] [2023-11-17 15:15:21,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446161119] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:21,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:21,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:15:21,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955147829] [2023-11-17 15:15:21,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:21,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 15:15:21,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:21,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 15:15:21,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-17 15:15:21,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 259 [2023-11-17 15:15:21,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 65 transitions, 400 flow. Second operand has 7 states, 7 states have (on average 117.14285714285714) internal successors, (820), 7 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:21,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:21,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 259 [2023-11-17 15:15:21,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:22,523 INFO L124 PetriNetUnfolderBase]: 4756/7700 cut-off events. [2023-11-17 15:15:22,524 INFO L125 PetriNetUnfolderBase]: For 14707/15025 co-relation queries the response was YES. [2023-11-17 15:15:22,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29317 conditions, 7700 events. 4756/7700 cut-off events. For 14707/15025 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 50184 event pairs, 1088 based on Foata normal form. 234/7842 useless extension candidates. Maximal degree in co-relation 29299. Up to 3911 conditions per place. [2023-11-17 15:15:22,576 INFO L140 encePairwiseOnDemand]: 251/259 looper letters, 98 selfloop transitions, 20 changer transitions 37/163 dead transitions. [2023-11-17 15:15:22,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 163 transitions, 1264 flow [2023-11-17 15:15:22,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:15:22,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:15:22,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 882 transitions. [2023-11-17 15:15:22,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2023-11-17 15:15:22,578 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 882 transitions. [2023-11-17 15:15:22,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 882 transitions. [2023-11-17 15:15:22,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:22,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 882 transitions. [2023-11-17 15:15:22,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.0) internal successors, (882), 7 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:22,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 259.0) internal successors, (2072), 8 states have internal predecessors, (2072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:22,582 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 259.0) internal successors, (2072), 8 states have internal predecessors, (2072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:22,583 INFO L175 Difference]: Start difference. First operand has 66 places, 65 transitions, 400 flow. Second operand 7 states and 882 transitions. [2023-11-17 15:15:22,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 163 transitions, 1264 flow [2023-11-17 15:15:22,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 163 transitions, 1253 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-11-17 15:15:22,727 INFO L231 Difference]: Finished difference. Result has 71 places, 74 transitions, 526 flow [2023-11-17 15:15:22,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=526, PETRI_PLACES=71, PETRI_TRANSITIONS=74} [2023-11-17 15:15:22,727 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 28 predicate places. [2023-11-17 15:15:22,727 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 74 transitions, 526 flow [2023-11-17 15:15:22,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.14285714285714) internal successors, (820), 7 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:22,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:22,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:22,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 15:15:22,728 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:22,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:22,728 INFO L85 PathProgramCache]: Analyzing trace with hash 550633626, now seen corresponding path program 3 times [2023-11-17 15:15:22,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:22,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419637018] [2023-11-17 15:15:22,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:22,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:22,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:15:22,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:22,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419637018] [2023-11-17 15:15:22,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419637018] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:22,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:22,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:15:22,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291751804] [2023-11-17 15:15:22,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:22,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 15:15:22,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:22,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 15:15:22,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-17 15:15:22,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 259 [2023-11-17 15:15:22,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 74 transitions, 526 flow. Second operand has 7 states, 7 states have (on average 116.14285714285714) internal successors, (813), 7 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:22,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:22,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 259 [2023-11-17 15:15:22,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:23,610 INFO L124 PetriNetUnfolderBase]: 4524/7164 cut-off events. [2023-11-17 15:15:23,611 INFO L125 PetriNetUnfolderBase]: For 21451/21653 co-relation queries the response was YES. [2023-11-17 15:15:23,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29969 conditions, 7164 events. 4524/7164 cut-off events. For 21451/21653 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 46203 event pairs, 624 based on Foata normal form. 128/7125 useless extension candidates. Maximal degree in co-relation 29949. Up to 2864 conditions per place. [2023-11-17 15:15:23,654 INFO L140 encePairwiseOnDemand]: 252/259 looper letters, 136 selfloop transitions, 18 changer transitions 28/190 dead transitions. [2023-11-17 15:15:23,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 190 transitions, 1735 flow [2023-11-17 15:15:23,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 15:15:23,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 15:15:23,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1000 transitions. [2023-11-17 15:15:23,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4826254826254826 [2023-11-17 15:15:23,659 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1000 transitions. [2023-11-17 15:15:23,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1000 transitions. [2023-11-17 15:15:23,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:23,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1000 transitions. [2023-11-17 15:15:23,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 125.0) internal successors, (1000), 8 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:23,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 259.0) internal successors, (2331), 9 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:23,664 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 259.0) internal successors, (2331), 9 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:23,664 INFO L175 Difference]: Start difference. First operand has 71 places, 74 transitions, 526 flow. Second operand 8 states and 1000 transitions. [2023-11-17 15:15:23,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 190 transitions, 1735 flow [2023-11-17 15:15:23,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 190 transitions, 1690 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-11-17 15:15:23,965 INFO L231 Difference]: Finished difference. Result has 76 places, 71 transitions, 532 flow [2023-11-17 15:15:23,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=532, PETRI_PLACES=76, PETRI_TRANSITIONS=71} [2023-11-17 15:15:23,966 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 33 predicate places. [2023-11-17 15:15:23,966 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 71 transitions, 532 flow [2023-11-17 15:15:23,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.14285714285714) internal successors, (813), 7 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:23,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:23,966 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:23,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 15:15:23,967 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:23,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:23,967 INFO L85 PathProgramCache]: Analyzing trace with hash -764836507, now seen corresponding path program 1 times [2023-11-17 15:15:23,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:23,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868880542] [2023-11-17 15:15:23,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:23,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:24,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:15:24,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:24,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868880542] [2023-11-17 15:15:24,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868880542] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:24,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:24,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-17 15:15:24,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881806888] [2023-11-17 15:15:24,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:24,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 15:15:24,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:24,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 15:15:24,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-17 15:15:24,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 259 [2023-11-17 15:15:24,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 71 transitions, 532 flow. Second operand has 8 states, 8 states have (on average 111.5) internal successors, (892), 8 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:24,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:24,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 259 [2023-11-17 15:15:24,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:26,080 INFO L124 PetriNetUnfolderBase]: 12852/20158 cut-off events. [2023-11-17 15:15:26,080 INFO L125 PetriNetUnfolderBase]: For 61506/61506 co-relation queries the response was YES. [2023-11-17 15:15:26,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90104 conditions, 20158 events. 12852/20158 cut-off events. For 61506/61506 co-relation queries the response was YES. Maximal size of possible extension queue 876. Compared 140154 event pairs, 1420 based on Foata normal form. 3/20161 useless extension candidates. Maximal degree in co-relation 90083. Up to 5341 conditions per place. [2023-11-17 15:15:26,191 INFO L140 encePairwiseOnDemand]: 246/259 looper letters, 179 selfloop transitions, 27 changer transitions 151/357 dead transitions. [2023-11-17 15:15:26,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 357 transitions, 3313 flow [2023-11-17 15:15:26,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-17 15:15:26,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-17 15:15:26,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1485 transitions. [2023-11-17 15:15:26,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4777992277992278 [2023-11-17 15:15:26,212 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1485 transitions. [2023-11-17 15:15:26,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1485 transitions. [2023-11-17 15:15:26,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:26,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1485 transitions. [2023-11-17 15:15:26,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 123.75) internal successors, (1485), 12 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:26,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 259.0) internal successors, (3367), 13 states have internal predecessors, (3367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:26,218 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 259.0) internal successors, (3367), 13 states have internal predecessors, (3367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:26,218 INFO L175 Difference]: Start difference. First operand has 76 places, 71 transitions, 532 flow. Second operand 12 states and 1485 transitions. [2023-11-17 15:15:26,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 357 transitions, 3313 flow [2023-11-17 15:15:27,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 357 transitions, 2885 flow, removed 126 selfloop flow, removed 6 redundant places. [2023-11-17 15:15:27,452 INFO L231 Difference]: Finished difference. Result has 88 places, 86 transitions, 677 flow [2023-11-17 15:15:27,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=677, PETRI_PLACES=88, PETRI_TRANSITIONS=86} [2023-11-17 15:15:27,453 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 45 predicate places. [2023-11-17 15:15:27,453 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 86 transitions, 677 flow [2023-11-17 15:15:27,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 111.5) internal successors, (892), 8 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:27,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:27,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:27,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 15:15:27,454 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:27,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:27,454 INFO L85 PathProgramCache]: Analyzing trace with hash 919472847, now seen corresponding path program 2 times [2023-11-17 15:15:27,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:27,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773708569] [2023-11-17 15:15:27,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:27,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:27,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:15:27,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:27,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773708569] [2023-11-17 15:15:27,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773708569] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:27,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:27,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:15:27,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608904221] [2023-11-17 15:15:27,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:27,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:15:27,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:27,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:15:27,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:15:27,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 259 [2023-11-17 15:15:27,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 86 transitions, 677 flow. Second operand has 4 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:27,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:27,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 259 [2023-11-17 15:15:27,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:29,213 INFO L124 PetriNetUnfolderBase]: 9629/15559 cut-off events. [2023-11-17 15:15:29,214 INFO L125 PetriNetUnfolderBase]: For 55340/55546 co-relation queries the response was YES. [2023-11-17 15:15:29,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68386 conditions, 15559 events. 9629/15559 cut-off events. For 55340/55546 co-relation queries the response was YES. Maximal size of possible extension queue 883. Compared 112770 event pairs, 2520 based on Foata normal form. 12/15422 useless extension candidates. Maximal degree in co-relation 68359. Up to 6293 conditions per place. [2023-11-17 15:15:29,372 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 97 selfloop transitions, 1 changer transitions 67/173 dead transitions. [2023-11-17 15:15:29,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 173 transitions, 1698 flow [2023-11-17 15:15:29,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:15:29,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:15:29,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 519 transitions. [2023-11-17 15:15:29,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.500965250965251 [2023-11-17 15:15:29,390 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 519 transitions. [2023-11-17 15:15:29,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 519 transitions. [2023-11-17 15:15:29,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:29,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 519 transitions. [2023-11-17 15:15:29,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:29,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 259.0) internal successors, (1295), 5 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:29,393 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 259.0) internal successors, (1295), 5 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:29,393 INFO L175 Difference]: Start difference. First operand has 88 places, 86 transitions, 677 flow. Second operand 4 states and 519 transitions. [2023-11-17 15:15:29,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 173 transitions, 1698 flow [2023-11-17 15:15:30,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 173 transitions, 1641 flow, removed 10 selfloop flow, removed 6 redundant places. [2023-11-17 15:15:30,149 INFO L231 Difference]: Finished difference. Result has 82 places, 79 transitions, 600 flow [2023-11-17 15:15:30,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=600, PETRI_PLACES=82, PETRI_TRANSITIONS=79} [2023-11-17 15:15:30,151 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 39 predicate places. [2023-11-17 15:15:30,151 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 79 transitions, 600 flow [2023-11-17 15:15:30,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:30,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:30,151 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:30,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-17 15:15:30,152 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:30,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:30,152 INFO L85 PathProgramCache]: Analyzing trace with hash -524482561, now seen corresponding path program 3 times [2023-11-17 15:15:30,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:30,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430280453] [2023-11-17 15:15:30,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:30,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:30,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:30,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:15:30,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:30,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430280453] [2023-11-17 15:15:30,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430280453] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:30,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:30,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:15:30,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766196358] [2023-11-17 15:15:30,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:30,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:15:30,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:30,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:15:30,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:15:30,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 259 [2023-11-17 15:15:30,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 79 transitions, 600 flow. Second operand has 4 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:30,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:30,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 259 [2023-11-17 15:15:30,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:31,784 INFO L124 PetriNetUnfolderBase]: 8115/13140 cut-off events. [2023-11-17 15:15:31,784 INFO L125 PetriNetUnfolderBase]: For 46240/46265 co-relation queries the response was YES. [2023-11-17 15:15:31,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57447 conditions, 13140 events. 8115/13140 cut-off events. For 46240/46265 co-relation queries the response was YES. Maximal size of possible extension queue 679. Compared 91983 event pairs, 1920 based on Foata normal form. 2/13085 useless extension candidates. Maximal degree in co-relation 57422. Up to 7550 conditions per place. [2023-11-17 15:15:31,975 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 72 selfloop transitions, 2 changer transitions 79/158 dead transitions. [2023-11-17 15:15:31,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 158 transitions, 1478 flow [2023-11-17 15:15:31,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:15:31,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:15:31,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 524 transitions. [2023-11-17 15:15:31,977 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5057915057915058 [2023-11-17 15:15:31,977 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 524 transitions. [2023-11-17 15:15:31,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 524 transitions. [2023-11-17 15:15:31,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:31,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 524 transitions. [2023-11-17 15:15:31,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:31,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 259.0) internal successors, (1295), 5 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:31,980 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 259.0) internal successors, (1295), 5 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:31,980 INFO L175 Difference]: Start difference. First operand has 82 places, 79 transitions, 600 flow. Second operand 4 states and 524 transitions. [2023-11-17 15:15:31,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 158 transitions, 1478 flow [2023-11-17 15:15:32,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 158 transitions, 1473 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-17 15:15:32,448 INFO L231 Difference]: Finished difference. Result has 84 places, 68 transitions, 510 flow [2023-11-17 15:15:32,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=597, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=510, PETRI_PLACES=84, PETRI_TRANSITIONS=68} [2023-11-17 15:15:32,449 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 41 predicate places. [2023-11-17 15:15:32,449 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 68 transitions, 510 flow [2023-11-17 15:15:32,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:32,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:32,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:32,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-17 15:15:32,449 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:32,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:32,450 INFO L85 PathProgramCache]: Analyzing trace with hash 864017721, now seen corresponding path program 4 times [2023-11-17 15:15:32,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:32,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409389542] [2023-11-17 15:15:32,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:32,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:32,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:33,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:15:33,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:33,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409389542] [2023-11-17 15:15:33,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409389542] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:33,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:33,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:15:33,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107819050] [2023-11-17 15:15:33,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:33,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 15:15:33,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:33,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 15:15:33,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-17 15:15:33,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 259 [2023-11-17 15:15:33,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 68 transitions, 510 flow. Second operand has 8 states, 8 states have (on average 115.125) internal successors, (921), 8 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:33,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:33,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 259 [2023-11-17 15:15:33,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:33,975 INFO L124 PetriNetUnfolderBase]: 4620/7756 cut-off events. [2023-11-17 15:15:33,975 INFO L125 PetriNetUnfolderBase]: For 26888/27007 co-relation queries the response was YES. [2023-11-17 15:15:34,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33613 conditions, 7756 events. 4620/7756 cut-off events. For 26888/27007 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 52405 event pairs, 986 based on Foata normal form. 65/7776 useless extension candidates. Maximal degree in co-relation 33587. Up to 4528 conditions per place. [2023-11-17 15:15:34,014 INFO L140 encePairwiseOnDemand]: 252/259 looper letters, 69 selfloop transitions, 12 changer transitions 66/156 dead transitions. [2023-11-17 15:15:34,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 156 transitions, 1326 flow [2023-11-17 15:15:34,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:15:34,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:15:34,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 858 transitions. [2023-11-17 15:15:34,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4732487589630447 [2023-11-17 15:15:34,016 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 858 transitions. [2023-11-17 15:15:34,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 858 transitions. [2023-11-17 15:15:34,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:34,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 858 transitions. [2023-11-17 15:15:34,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.57142857142857) internal successors, (858), 7 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:34,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 259.0) internal successors, (2072), 8 states have internal predecessors, (2072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:34,020 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 259.0) internal successors, (2072), 8 states have internal predecessors, (2072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:34,021 INFO L175 Difference]: Start difference. First operand has 84 places, 68 transitions, 510 flow. Second operand 7 states and 858 transitions. [2023-11-17 15:15:34,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 156 transitions, 1326 flow [2023-11-17 15:15:34,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 156 transitions, 1290 flow, removed 7 selfloop flow, removed 5 redundant places. [2023-11-17 15:15:34,322 INFO L231 Difference]: Finished difference. Result has 87 places, 66 transitions, 523 flow [2023-11-17 15:15:34,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=523, PETRI_PLACES=87, PETRI_TRANSITIONS=66} [2023-11-17 15:15:34,323 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 44 predicate places. [2023-11-17 15:15:34,323 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 66 transitions, 523 flow [2023-11-17 15:15:34,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 115.125) internal successors, (921), 8 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:34,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:34,323 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:34,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-17 15:15:34,324 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:34,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:34,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1976609099, now seen corresponding path program 5 times [2023-11-17 15:15:34,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:34,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343464322] [2023-11-17 15:15:34,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:34,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:34,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:15:34,375 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 15:15:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:15:34,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 15:15:34,461 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 15:15:34,462 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-17 15:15:34,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-17 15:15:34,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-17 15:15:34,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-17 15:15:34,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-17 15:15:34,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-17 15:15:34,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-17 15:15:34,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-17 15:15:34,464 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 2, 1, 1, 1, 1, 1] [2023-11-17 15:15:34,469 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 15:15:34,469 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 15:15:34,530 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-17 15:15:34,532 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 15:15:34,532 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-17 15:15:34,533 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-17 15:15:34,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:15:34 BasicIcfg [2023-11-17 15:15:34,549 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 15:15:34,549 INFO L158 Benchmark]: Toolchain (without parser) took 27011.58ms. Allocated memory was 281.0MB in the beginning and 3.7GB in the end (delta: 3.4GB). Free memory was 225.4MB in the beginning and 2.9GB in the end (delta: -2.7GB). Peak memory consumption was 763.9MB. Max. memory is 8.0GB. [2023-11-17 15:15:34,550 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 202.4MB. Free memory is still 153.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 15:15:34,550 INFO L158 Benchmark]: CACSL2BoogieTranslator took 476.22ms. Allocated memory is still 281.0MB. Free memory was 225.4MB in the beginning and 201.1MB in the end (delta: 24.4MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-11-17 15:15:34,550 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.98ms. Allocated memory is still 281.0MB. Free memory was 201.1MB in the beginning and 198.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:15:34,550 INFO L158 Benchmark]: Boogie Preprocessor took 35.07ms. Allocated memory is still 281.0MB. Free memory was 198.5MB in the beginning and 196.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:15:34,550 INFO L158 Benchmark]: RCFGBuilder took 616.38ms. Allocated memory is still 281.0MB. Free memory was 196.4MB in the beginning and 212.7MB in the end (delta: -16.3MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. [2023-11-17 15:15:34,551 INFO L158 Benchmark]: TraceAbstraction took 25814.88ms. Allocated memory was 281.0MB in the beginning and 3.7GB in the end (delta: 3.4GB). Free memory was 211.7MB in the beginning and 2.9GB in the end (delta: -2.7GB). Peak memory consumption was 749.8MB. Max. memory is 8.0GB. [2023-11-17 15:15:34,552 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.21ms. Allocated memory is still 202.4MB. Free memory is still 153.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 476.22ms. Allocated memory is still 281.0MB. Free memory was 225.4MB in the beginning and 201.1MB in the end (delta: 24.4MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.98ms. Allocated memory is still 281.0MB. Free memory was 201.1MB in the beginning and 198.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.07ms. Allocated memory is still 281.0MB. Free memory was 198.5MB in the beginning and 196.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 616.38ms. Allocated memory is still 281.0MB. Free memory was 196.4MB in the beginning and 212.7MB in the end (delta: -16.3MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. * TraceAbstraction took 25814.88ms. Allocated memory was 281.0MB in the beginning and 3.7GB in the end (delta: 3.4GB). Free memory was 211.7MB in the beginning and 2.9GB in the end (delta: -2.7GB). Peak memory consumption was 749.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 144 PlacesBefore, 43 PlacesAfterwards, 134 TransitionsBefore, 32 TransitionsAfterwards, 3676 CoEnabledTransitionPairs, 6 FixpointIterations, 44 TrivialSequentialCompositions, 63 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 1 ChoiceCompositions, 121 TotalNumberOfCompositions, 9457 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4908, independent: 4709, independent conditional: 0, independent unconditional: 4709, dependent: 199, dependent conditional: 0, dependent unconditional: 199, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2973, independent: 2897, independent conditional: 0, independent unconditional: 2897, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2973, independent: 2857, independent conditional: 0, independent unconditional: 2857, dependent: 116, dependent conditional: 0, dependent unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 116, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 406, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 354, dependent conditional: 0, dependent unconditional: 354, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4908, independent: 1812, independent conditional: 0, independent unconditional: 1812, dependent: 123, dependent conditional: 0, dependent unconditional: 123, unknown: 2973, unknown conditional: 0, unknown unconditional: 2973] , Statistics on independence cache: Total cache size (in pairs): 325, Positive cache size: 287, Positive conditional cache size: 0, Positive unconditional cache size: 287, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L724] 0 int b = 0; [L725] 0 _Bool b$flush_delayed; [L726] 0 int b$mem_tmp; [L727] 0 _Bool b$r_buff0_thd0; [L728] 0 _Bool b$r_buff0_thd1; [L729] 0 _Bool b$r_buff0_thd2; [L730] 0 _Bool b$r_buff0_thd3; [L731] 0 _Bool b$r_buff0_thd4; [L732] 0 _Bool b$r_buff1_thd0; [L733] 0 _Bool b$r_buff1_thd1; [L734] 0 _Bool b$r_buff1_thd2; [L735] 0 _Bool b$r_buff1_thd3; [L736] 0 _Bool b$r_buff1_thd4; [L737] 0 _Bool b$read_delayed; [L738] 0 int *b$read_delayed_var; [L739] 0 int b$w_buff0; [L740] 0 _Bool b$w_buff0_used; [L741] 0 int b$w_buff1; [L742] 0 _Bool b$w_buff1_used; [L743] 0 _Bool main$tmp_guard0; [L744] 0 _Bool main$tmp_guard1; [L746] 0 int x = 0; [L748] 0 int y = 0; [L750] 0 int z = 0; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L873] 0 pthread_t t937; [L874] FCALL, FORK 0 pthread_create(&t937, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t937={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t938; [L876] FCALL, FORK 0 pthread_create(&t938, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t937={5:0}, t938={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t939; [L878] FCALL, FORK 0 pthread_create(&t939, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t937={5:0}, t938={6:0}, t939={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L879] 0 pthread_t t940; [L880] FCALL, FORK 0 pthread_create(&t940, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t937={5:0}, t938={6:0}, t939={7:0}, t940={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L756] 1 b$w_buff1 = b$w_buff0 [L757] 1 b$w_buff0 = 1 [L758] 1 b$w_buff1_used = b$w_buff0_used [L759] 1 b$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L761] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L762] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L763] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L764] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L765] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L766] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L769] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L786] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L789] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L806] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L809] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L826] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L812] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L813] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L814] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L815] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L816] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L829] 4 a = 1 [L832] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L835] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 4 b$flush_delayed = weak$$choice2 [L838] 4 b$mem_tmp = b [L839] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L840] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L841] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L842] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L843] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L845] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L846] 4 __unbuffered_p3_EBX = b [L847] 4 b = b$flush_delayed ? b$mem_tmp : b [L848] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L792] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L793] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L794] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L795] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L796] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L851] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L852] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L853] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L854] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L855] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 3 return 0; [L772] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L773] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L774] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L775] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L776] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L858] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L860] 4 return 0; [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L882] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L884] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L884] RET 0 assume_abort_if_not(main$tmp_guard0) [L886] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L887] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L888] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L889] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L890] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t937={5:0}, t938={6:0}, t939={7:0}, t940={3:0}, weak$$choice2=1, x=1, y=1, z=1] [L893] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L895] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 880]: 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: 874]: 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: 876]: 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: 878]: 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 9 procedures, 175 locations, 7 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: 25.6s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 17.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 650 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 650 mSDsluCounter, 36 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2569 IncrementalHoareTripleChecker+Invalid, 2641 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 14 mSDtfsCounter, 2569 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=677occurred in iteration=11, InterpolantAutomatonStates: 84, 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, 3.8s InterpolantComputationTime, 319 NumberOfCodeBlocks, 319 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 277 ConstructedInterpolants, 0 QuantifiedInterpolants, 1814 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-17 15:15:34,570 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...