/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/safe021_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 15:19:06,116 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 15:19:06,183 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:19:06,208 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 15:19:06,209 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 15:19:06,209 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 15:19:06,209 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 15:19:06,210 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 15:19:06,210 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 15:19:06,213 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 15:19:06,213 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 15:19:06,214 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 15:19:06,214 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 15:19:06,215 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 15:19:06,215 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 15:19:06,215 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 15:19:06,215 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 15:19:06,215 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 15:19:06,216 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 15:19:06,216 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 15:19:06,216 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 15:19:06,216 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 15:19:06,217 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 15:19:06,217 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 15:19:06,217 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 15:19:06,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:19:06,218 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 15:19:06,218 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 15:19:06,218 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 15:19:06,219 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 15:19:06,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 15:19:06,219 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 15:19:06,220 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:19:06,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 15:19:06,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 15:19:06,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 15:19:06,433 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 15:19:06,434 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 15:19:06,434 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe021_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2023-11-17 15:19:07,385 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 15:19:07,614 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 15:19:07,614 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2023-11-17 15:19:07,631 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3090d01d2/4beab125b62946c4b255f90a097f4eae/FLAGc457f57a4 [2023-11-17 15:19:07,647 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3090d01d2/4beab125b62946c4b255f90a097f4eae [2023-11-17 15:19:07,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 15:19:07,650 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 15:19:07,651 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 15:19:07,651 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 15:19:07,655 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 15:19:07,655 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:19:07" (1/1) ... [2023-11-17 15:19:07,656 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@320af350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:07, skipping insertion in model container [2023-11-17 15:19:07,656 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:19:07" (1/1) ... [2023-11-17 15:19:07,698 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 15:19:07,839 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/safe021_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2023-11-17 15:19:07,953 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:19:07,960 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 15:19:07,967 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/safe021_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2023-11-17 15:19:07,994 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:19:08,014 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:19:08,014 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:19:08,019 INFO L206 MainTranslator]: Completed translation [2023-11-17 15:19:08,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:08 WrapperNode [2023-11-17 15:19:08,019 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 15:19:08,020 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 15:19:08,020 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 15:19:08,020 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 15:19:08,024 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:19:08" (1/1) ... [2023-11-17 15:19:08,038 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:19:08" (1/1) ... [2023-11-17 15:19:08,055 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2023-11-17 15:19:08,055 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 15:19:08,056 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 15:19:08,056 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 15:19:08,056 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 15:19:08,068 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:08" (1/1) ... [2023-11-17 15:19:08,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:08" (1/1) ... [2023-11-17 15:19:08,070 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:08" (1/1) ... [2023-11-17 15:19:08,070 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:08" (1/1) ... [2023-11-17 15:19:08,076 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:08" (1/1) ... [2023-11-17 15:19:08,077 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:08" (1/1) ... [2023-11-17 15:19:08,079 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:08" (1/1) ... [2023-11-17 15:19:08,080 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:08" (1/1) ... [2023-11-17 15:19:08,082 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 15:19:08,083 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 15:19:08,083 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 15:19:08,083 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 15:19:08,083 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:08" (1/1) ... [2023-11-17 15:19:08,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:19:08,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:19:08,119 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:19:08,128 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:19:08,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 15:19:08,141 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 15:19:08,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 15:19:08,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 15:19:08,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 15:19:08,142 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 15:19:08,142 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 15:19:08,142 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 15:19:08,142 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 15:19:08,142 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 15:19:08,142 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 15:19:08,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 15:19:08,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 15:19:08,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 15:19:08,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 15:19:08,144 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:19:08,258 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 15:19:08,259 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 15:19:08,536 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 15:19:08,643 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 15:19:08,644 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 15:19:08,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:19:08 BoogieIcfgContainer [2023-11-17 15:19:08,645 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 15:19:08,661 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 15:19:08,661 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 15:19:08,663 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 15:19:08,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:19:07" (1/3) ... [2023-11-17 15:19:08,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c3f2e83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:19:08, skipping insertion in model container [2023-11-17 15:19:08,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:19:08" (2/3) ... [2023-11-17 15:19:08,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c3f2e83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:19:08, skipping insertion in model container [2023-11-17 15:19:08,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:19:08" (3/3) ... [2023-11-17 15:19:08,665 INFO L112 eAbstractionObserver]: Analyzing ICFG safe021_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2023-11-17 15:19:08,678 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 15:19:08,678 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 15:19:08,678 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 15:19:08,718 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 15:19:08,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 112 transitions, 236 flow [2023-11-17 15:19:08,791 INFO L124 PetriNetUnfolderBase]: 3/109 cut-off events. [2023-11-17 15:19:08,791 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:19:08,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 3/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2023-11-17 15:19:08,797 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 112 transitions, 236 flow [2023-11-17 15:19:08,799 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 109 transitions, 227 flow [2023-11-17 15:19:08,801 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:19:08,812 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 109 transitions, 227 flow [2023-11-17 15:19:08,815 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 109 transitions, 227 flow [2023-11-17 15:19:08,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 109 transitions, 227 flow [2023-11-17 15:19:08,843 INFO L124 PetriNetUnfolderBase]: 3/109 cut-off events. [2023-11-17 15:19:08,843 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:19:08,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 3/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2023-11-17 15:19:08,845 INFO L119 LiptonReduction]: Number of co-enabled transitions 2218 [2023-11-17 15:19:11,950 INFO L134 LiptonReduction]: Checked pairs total: 5662 [2023-11-17 15:19:11,951 INFO L136 LiptonReduction]: Total number of compositions: 100 [2023-11-17 15:19:11,960 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:19:11,965 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;@1d663547, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:19:11,965 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-17 15:19:11,966 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:19:11,966 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-17 15:19:11,966 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:19:11,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:19:11,967 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-17 15:19:11,967 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:19:11,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:19:11,970 INFO L85 PathProgramCache]: Analyzing trace with hash 488251, now seen corresponding path program 1 times [2023-11-17 15:19:11,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:19:11,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233356302] [2023-11-17 15:19:11,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:19:11,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:19:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:19:12,283 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:19:12,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:19:12,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233356302] [2023-11-17 15:19:12,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233356302] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:19:12,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:19:12,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:19:12,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434728225] [2023-11-17 15:19:12,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:19:12,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:19:12,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:19:12,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:19:12,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:19:12,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 212 [2023-11-17 15:19:12,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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:19:12,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:19:12,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 212 [2023-11-17 15:19:12,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:19:12,524 INFO L124 PetriNetUnfolderBase]: 1079/1731 cut-off events. [2023-11-17 15:19:12,524 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-17 15:19:12,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3378 conditions, 1731 events. 1079/1731 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9181 event pairs, 173 based on Foata normal form. 0/1650 useless extension candidates. Maximal degree in co-relation 3367. Up to 1297 conditions per place. [2023-11-17 15:19:12,533 INFO L140 encePairwiseOnDemand]: 207/212 looper letters, 33 selfloop transitions, 2 changer transitions 2/39 dead transitions. [2023-11-17 15:19:12,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 39 transitions, 167 flow [2023-11-17 15:19:12,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:19:12,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:19:12,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2023-11-17 15:19:12,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5220125786163522 [2023-11-17 15:19:12,542 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 332 transitions. [2023-11-17 15:19:12,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 332 transitions. [2023-11-17 15:19:12,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:19:12,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 332 transitions. [2023-11-17 15:19:12,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:19:12,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 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:19:12,551 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 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:19:12,552 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 61 flow. Second operand 3 states and 332 transitions. [2023-11-17 15:19:12,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 39 transitions, 167 flow [2023-11-17 15:19:12,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 39 transitions, 162 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-17 15:19:12,555 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow [2023-11-17 15:19:12,556 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2023-11-17 15:19:12,558 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-11-17 15:19:12,558 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 54 flow [2023-11-17 15:19:12,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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:19:12,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:19:12,559 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:19:12,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 15:19:12,559 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:19:12,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:19:12,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1495616971, now seen corresponding path program 1 times [2023-11-17 15:19:12,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:19:12,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586620719] [2023-11-17 15:19:12,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:19:12,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:19:12,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:19:12,751 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:19:12,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:19:12,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586620719] [2023-11-17 15:19:12,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586620719] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:19:12,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:19:12,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:19:12,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861185795] [2023-11-17 15:19:12,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:19:12,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:19:12,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:19:12,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:19:12,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:19:12,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 212 [2023-11-17 15:19:12,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 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:19:12,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:19:12,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 212 [2023-11-17 15:19:12,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:19:13,102 INFO L124 PetriNetUnfolderBase]: 1918/2949 cut-off events. [2023-11-17 15:19:13,102 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2023-11-17 15:19:13,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6070 conditions, 2949 events. 1918/2949 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 15735 event pairs, 566 based on Foata normal form. 157/3106 useless extension candidates. Maximal degree in co-relation 6060. Up to 1664 conditions per place. [2023-11-17 15:19:13,111 INFO L140 encePairwiseOnDemand]: 205/212 looper letters, 32 selfloop transitions, 5 changer transitions 23/61 dead transitions. [2023-11-17 15:19:13,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 61 transitions, 260 flow [2023-11-17 15:19:13,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:19:13,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:19:13,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 502 transitions. [2023-11-17 15:19:13,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47358490566037736 [2023-11-17 15:19:13,114 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 502 transitions. [2023-11-17 15:19:13,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 502 transitions. [2023-11-17 15:19:13,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:19:13,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 502 transitions. [2023-11-17 15:19:13,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 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:19:13,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 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:19:13,118 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 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:19:13,118 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 54 flow. Second operand 5 states and 502 transitions. [2023-11-17 15:19:13,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 61 transitions, 260 flow [2023-11-17 15:19:13,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 61 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:19:13,120 INFO L231 Difference]: Finished difference. Result has 37 places, 26 transitions, 100 flow [2023-11-17 15:19:13,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=100, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2023-11-17 15:19:13,120 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2023-11-17 15:19:13,121 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 100 flow [2023-11-17 15:19:13,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 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:19:13,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:19:13,121 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:19:13,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 15:19:13,121 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:19:13,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:19:13,122 INFO L85 PathProgramCache]: Analyzing trace with hash 880469562, now seen corresponding path program 1 times [2023-11-17 15:19:13,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:19:13,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168433776] [2023-11-17 15:19:13,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:19:13,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:19:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:19:13,222 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:19:13,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:19:13,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168433776] [2023-11-17 15:19:13,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168433776] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:19:13,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:19:13,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:19:13,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859288691] [2023-11-17 15:19:13,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:19:13,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:19:13,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:19:13,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:19:13,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:19:13,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 212 [2023-11-17 15:19:13,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 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:19:13,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:19:13,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 212 [2023-11-17 15:19:13,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:19:13,545 INFO L124 PetriNetUnfolderBase]: 1707/2626 cut-off events. [2023-11-17 15:19:13,546 INFO L125 PetriNetUnfolderBase]: For 1611/1611 co-relation queries the response was YES. [2023-11-17 15:19:13,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6872 conditions, 2626 events. 1707/2626 cut-off events. For 1611/1611 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 13500 event pairs, 315 based on Foata normal form. 120/2742 useless extension candidates. Maximal degree in co-relation 6858. Up to 1368 conditions per place. [2023-11-17 15:19:13,556 INFO L140 encePairwiseOnDemand]: 205/212 looper letters, 37 selfloop transitions, 6 changer transitions 25/69 dead transitions. [2023-11-17 15:19:13,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 69 transitions, 360 flow [2023-11-17 15:19:13,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:19:13,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:19:13,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 684 transitions. [2023-11-17 15:19:13,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4609164420485175 [2023-11-17 15:19:13,559 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 684 transitions. [2023-11-17 15:19:13,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 684 transitions. [2023-11-17 15:19:13,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:19:13,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 684 transitions. [2023-11-17 15:19:13,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.71428571428571) internal successors, (684), 7 states have internal predecessors, (684), 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:19:13,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 212.0) internal successors, (1696), 8 states have internal predecessors, (1696), 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:19:13,563 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 212.0) internal successors, (1696), 8 states have internal predecessors, (1696), 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:19:13,563 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 100 flow. Second operand 7 states and 684 transitions. [2023-11-17 15:19:13,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 69 transitions, 360 flow [2023-11-17 15:19:13,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 69 transitions, 330 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-17 15:19:13,569 INFO L231 Difference]: Finished difference. Result has 45 places, 28 transitions, 132 flow [2023-11-17 15:19:13,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=132, PETRI_PLACES=45, PETRI_TRANSITIONS=28} [2023-11-17 15:19:13,570 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2023-11-17 15:19:13,570 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 28 transitions, 132 flow [2023-11-17 15:19:13,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 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:19:13,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:19:13,570 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:19:13,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 15:19:13,571 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:19:13,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:19:13,571 INFO L85 PathProgramCache]: Analyzing trace with hash 880499353, now seen corresponding path program 1 times [2023-11-17 15:19:13,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:19:13,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427029108] [2023-11-17 15:19:13,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:19:13,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:19:13,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:19:13,703 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:19:13,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:19:13,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427029108] [2023-11-17 15:19:13,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427029108] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:19:13,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:19:13,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:19:13,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822394743] [2023-11-17 15:19:13,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:19:13,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:19:13,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:19:13,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:19:13,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:19:13,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 212 [2023-11-17 15:19:13,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 28 transitions, 132 flow. Second operand has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 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:19:13,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:19:13,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 212 [2023-11-17 15:19:13,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:19:14,011 INFO L124 PetriNetUnfolderBase]: 1619/2545 cut-off events. [2023-11-17 15:19:14,011 INFO L125 PetriNetUnfolderBase]: For 3924/3924 co-relation queries the response was YES. [2023-11-17 15:19:14,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7125 conditions, 2545 events. 1619/2545 cut-off events. For 3924/3924 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 13456 event pairs, 342 based on Foata normal form. 125/2670 useless extension candidates. Maximal degree in co-relation 7105. Up to 1414 conditions per place. [2023-11-17 15:19:14,024 INFO L140 encePairwiseOnDemand]: 205/212 looper letters, 41 selfloop transitions, 11 changer transitions 25/78 dead transitions. [2023-11-17 15:19:14,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 78 transitions, 468 flow [2023-11-17 15:19:14,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:19:14,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:19:14,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 692 transitions. [2023-11-17 15:19:14,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46630727762803237 [2023-11-17 15:19:14,026 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 692 transitions. [2023-11-17 15:19:14,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 692 transitions. [2023-11-17 15:19:14,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:19:14,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 692 transitions. [2023-11-17 15:19:14,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 98.85714285714286) internal successors, (692), 7 states have internal predecessors, (692), 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:19:14,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 212.0) internal successors, (1696), 8 states have internal predecessors, (1696), 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:19:14,030 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 212.0) internal successors, (1696), 8 states have internal predecessors, (1696), 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:19:14,030 INFO L175 Difference]: Start difference. First operand has 45 places, 28 transitions, 132 flow. Second operand 7 states and 692 transitions. [2023-11-17 15:19:14,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 78 transitions, 468 flow [2023-11-17 15:19:14,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 78 transitions, 450 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-11-17 15:19:14,041 INFO L231 Difference]: Finished difference. Result has 49 places, 32 transitions, 197 flow [2023-11-17 15:19:14,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=197, PETRI_PLACES=49, PETRI_TRANSITIONS=32} [2023-11-17 15:19:14,041 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2023-11-17 15:19:14,042 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 32 transitions, 197 flow [2023-11-17 15:19:14,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 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:19:14,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:19:14,042 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:19:14,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 15:19:14,042 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:19:14,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:19:14,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1524737844, now seen corresponding path program 1 times [2023-11-17 15:19:14,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:19:14,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289885484] [2023-11-17 15:19:14,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:19:14,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:19:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:19:14,121 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:19:14,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:19:14,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289885484] [2023-11-17 15:19:14,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289885484] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:19:14,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:19:14,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:19:14,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792447910] [2023-11-17 15:19:14,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:19:14,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:19:14,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:19:14,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:19:14,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:19:14,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 212 [2023-11-17 15:19:14,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 32 transitions, 197 flow. Second operand has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 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:19:14,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:19:14,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 212 [2023-11-17 15:19:14,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:19:14,553 INFO L124 PetriNetUnfolderBase]: 2232/3394 cut-off events. [2023-11-17 15:19:14,553 INFO L125 PetriNetUnfolderBase]: For 6931/6931 co-relation queries the response was YES. [2023-11-17 15:19:14,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10262 conditions, 3394 events. 2232/3394 cut-off events. For 6931/6931 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 17134 event pairs, 204 based on Foata normal form. 152/3546 useless extension candidates. Maximal degree in co-relation 10239. Up to 1288 conditions per place. [2023-11-17 15:19:14,571 INFO L140 encePairwiseOnDemand]: 204/212 looper letters, 60 selfloop transitions, 19 changer transitions 40/119 dead transitions. [2023-11-17 15:19:14,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 119 transitions, 838 flow [2023-11-17 15:19:14,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 15:19:14,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-17 15:19:14,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 882 transitions. [2023-11-17 15:19:14,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46226415094339623 [2023-11-17 15:19:14,574 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 882 transitions. [2023-11-17 15:19:14,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 882 transitions. [2023-11-17 15:19:14,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:19:14,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 882 transitions. [2023-11-17 15:19:14,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.0) internal successors, (882), 9 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:19:14,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 212.0) internal successors, (2120), 10 states have internal predecessors, (2120), 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:19:14,578 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 212.0) internal successors, (2120), 10 states have internal predecessors, (2120), 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:19:14,578 INFO L175 Difference]: Start difference. First operand has 49 places, 32 transitions, 197 flow. Second operand 9 states and 882 transitions. [2023-11-17 15:19:14,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 119 transitions, 838 flow [2023-11-17 15:19:14,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 119 transitions, 800 flow, removed 19 selfloop flow, removed 4 redundant places. [2023-11-17 15:19:14,594 INFO L231 Difference]: Finished difference. Result has 58 places, 44 transitions, 403 flow [2023-11-17 15:19:14,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=403, PETRI_PLACES=58, PETRI_TRANSITIONS=44} [2023-11-17 15:19:14,595 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 24 predicate places. [2023-11-17 15:19:14,595 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 44 transitions, 403 flow [2023-11-17 15:19:14,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 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:19:14,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:19:14,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:19:14,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 15:19:14,595 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:19:14,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:19:14,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1495244754, now seen corresponding path program 2 times [2023-11-17 15:19:14,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:19:14,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701942975] [2023-11-17 15:19:14,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:19:14,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:19:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:19:14,672 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:19:14,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:19:14,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701942975] [2023-11-17 15:19:14,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701942975] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:19:14,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:19:14,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:19:14,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935071770] [2023-11-17 15:19:14,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:19:14,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:19:14,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:19:14,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:19:14,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:19:14,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 212 [2023-11-17 15:19:14,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 44 transitions, 403 flow. Second operand has 5 states, 5 states have (on average 92.4) internal successors, (462), 5 states have internal predecessors, (462), 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:19:14,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:19:14,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 212 [2023-11-17 15:19:14,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:19:15,110 INFO L124 PetriNetUnfolderBase]: 2374/3638 cut-off events. [2023-11-17 15:19:15,111 INFO L125 PetriNetUnfolderBase]: For 12277/12381 co-relation queries the response was YES. [2023-11-17 15:19:15,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12608 conditions, 3638 events. 2374/3638 cut-off events. For 12277/12381 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 19222 event pairs, 462 based on Foata normal form. 171/3766 useless extension candidates. Maximal degree in co-relation 12579. Up to 1295 conditions per place. [2023-11-17 15:19:15,128 INFO L140 encePairwiseOnDemand]: 207/212 looper letters, 34 selfloop transitions, 5 changer transitions 43/86 dead transitions. [2023-11-17 15:19:15,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 86 transitions, 770 flow [2023-11-17 15:19:15,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:19:15,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:19:15,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 602 transitions. [2023-11-17 15:19:15,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47327044025157233 [2023-11-17 15:19:15,131 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 602 transitions. [2023-11-17 15:19:15,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 602 transitions. [2023-11-17 15:19:15,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:19:15,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 602 transitions. [2023-11-17 15:19:15,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 100.33333333333333) internal successors, (602), 6 states have internal predecessors, (602), 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:19:15,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 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:19:15,134 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 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:19:15,134 INFO L175 Difference]: Start difference. First operand has 58 places, 44 transitions, 403 flow. Second operand 6 states and 602 transitions. [2023-11-17 15:19:15,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 86 transitions, 770 flow [2023-11-17 15:19:15,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 86 transitions, 730 flow, removed 20 selfloop flow, removed 3 redundant places. [2023-11-17 15:19:15,186 INFO L231 Difference]: Finished difference. Result has 60 places, 29 transitions, 222 flow [2023-11-17 15:19:15,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=222, PETRI_PLACES=60, PETRI_TRANSITIONS=29} [2023-11-17 15:19:15,188 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 26 predicate places. [2023-11-17 15:19:15,188 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 29 transitions, 222 flow [2023-11-17 15:19:15,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.4) internal successors, (462), 5 states have internal predecessors, (462), 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:19:15,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:19:15,188 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:19:15,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 15:19:15,188 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:19:15,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:19:15,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1548590780, now seen corresponding path program 1 times [2023-11-17 15:19:15,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:19:15,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74549733] [2023-11-17 15:19:15,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:19:15,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:19:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:19:15,277 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:19:15,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:19:15,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74549733] [2023-11-17 15:19:15,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74549733] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:19:15,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:19:15,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:19:15,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512973335] [2023-11-17 15:19:15,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:19:15,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:19:15,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:19:15,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:19:15,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:19:15,279 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 212 [2023-11-17 15:19:15,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 29 transitions, 222 flow. Second operand has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 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:19:15,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:19:15,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 212 [2023-11-17 15:19:15,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:19:15,445 INFO L124 PetriNetUnfolderBase]: 766/1301 cut-off events. [2023-11-17 15:19:15,445 INFO L125 PetriNetUnfolderBase]: For 3537/3575 co-relation queries the response was YES. [2023-11-17 15:19:15,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4281 conditions, 1301 events. 766/1301 cut-off events. For 3537/3575 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6425 event pairs, 158 based on Foata normal form. 111/1404 useless extension candidates. Maximal degree in co-relation 4261. Up to 831 conditions per place. [2023-11-17 15:19:15,452 INFO L140 encePairwiseOnDemand]: 206/212 looper letters, 38 selfloop transitions, 6 changer transitions 21/71 dead transitions. [2023-11-17 15:19:15,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 71 transitions, 620 flow [2023-11-17 15:19:15,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:19:15,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:19:15,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 507 transitions. [2023-11-17 15:19:15,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47830188679245284 [2023-11-17 15:19:15,454 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 507 transitions. [2023-11-17 15:19:15,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 507 transitions. [2023-11-17 15:19:15,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:19:15,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 507 transitions. [2023-11-17 15:19:15,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 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:19:15,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 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:19:15,457 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 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:19:15,457 INFO L175 Difference]: Start difference. First operand has 60 places, 29 transitions, 222 flow. Second operand 5 states and 507 transitions. [2023-11-17 15:19:15,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 71 transitions, 620 flow [2023-11-17 15:19:15,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 71 transitions, 444 flow, removed 25 selfloop flow, removed 15 redundant places. [2023-11-17 15:19:15,461 INFO L231 Difference]: Finished difference. Result has 50 places, 34 transitions, 181 flow [2023-11-17 15:19:15,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=181, PETRI_PLACES=50, PETRI_TRANSITIONS=34} [2023-11-17 15:19:15,462 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 16 predicate places. [2023-11-17 15:19:15,462 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 34 transitions, 181 flow [2023-11-17 15:19:15,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 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:19:15,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:19:15,462 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:19:15,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 15:19:15,463 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:19:15,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:19:15,463 INFO L85 PathProgramCache]: Analyzing trace with hash -264447144, now seen corresponding path program 1 times [2023-11-17 15:19:15,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:19:15,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795249433] [2023-11-17 15:19:15,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:19:15,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:19:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:19:15,588 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:19:15,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:19:15,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795249433] [2023-11-17 15:19:15,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795249433] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:19:15,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:19:15,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:19:15,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854615782] [2023-11-17 15:19:15,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:19:15,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:19:15,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:19:15,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:19:15,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:19:15,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 212 [2023-11-17 15:19:15,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 34 transitions, 181 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 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:19:15,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:19:15,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 212 [2023-11-17 15:19:15,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:19:15,746 INFO L124 PetriNetUnfolderBase]: 481/875 cut-off events. [2023-11-17 15:19:15,746 INFO L125 PetriNetUnfolderBase]: For 1142/1158 co-relation queries the response was YES. [2023-11-17 15:19:15,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2850 conditions, 875 events. 481/875 cut-off events. For 1142/1158 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4331 event pairs, 82 based on Foata normal form. 67/934 useless extension candidates. Maximal degree in co-relation 2838. Up to 268 conditions per place. [2023-11-17 15:19:15,749 INFO L140 encePairwiseOnDemand]: 206/212 looper letters, 48 selfloop transitions, 10 changer transitions 30/94 dead transitions. [2023-11-17 15:19:15,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 94 transitions, 656 flow [2023-11-17 15:19:15,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:19:15,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:19:15,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 706 transitions. [2023-11-17 15:19:15,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4757412398921833 [2023-11-17 15:19:15,751 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 706 transitions. [2023-11-17 15:19:15,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 706 transitions. [2023-11-17 15:19:15,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:19:15,752 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 706 transitions. [2023-11-17 15:19:15,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.85714285714286) internal successors, (706), 7 states have internal predecessors, (706), 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:19:15,755 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 212.0) internal successors, (1696), 8 states have internal predecessors, (1696), 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:19:15,755 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 212.0) internal successors, (1696), 8 states have internal predecessors, (1696), 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:19:15,756 INFO L175 Difference]: Start difference. First operand has 50 places, 34 transitions, 181 flow. Second operand 7 states and 706 transitions. [2023-11-17 15:19:15,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 94 transitions, 656 flow [2023-11-17 15:19:15,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 94 transitions, 656 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 15:19:15,759 INFO L231 Difference]: Finished difference. Result has 59 places, 38 transitions, 248 flow [2023-11-17 15:19:15,760 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=248, PETRI_PLACES=59, PETRI_TRANSITIONS=38} [2023-11-17 15:19:15,761 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 25 predicate places. [2023-11-17 15:19:15,761 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 38 transitions, 248 flow [2023-11-17 15:19:15,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 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:19:15,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:19:15,762 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:19:15,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 15:19:15,762 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:19:15,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:19:15,765 INFO L85 PathProgramCache]: Analyzing trace with hash 406189171, now seen corresponding path program 1 times [2023-11-17 15:19:15,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:19:15,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725529582] [2023-11-17 15:19:15,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:19:15,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:19:15,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:19:15,921 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:19:15,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:19:15,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725529582] [2023-11-17 15:19:15,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725529582] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:19:15,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:19:15,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:19:15,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444062069] [2023-11-17 15:19:15,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:19:15,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:19:15,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:19:15,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:19:15,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:19:15,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 212 [2023-11-17 15:19:15,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 38 transitions, 248 flow. Second operand has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 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:19:15,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:19:15,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 212 [2023-11-17 15:19:15,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:19:16,085 INFO L124 PetriNetUnfolderBase]: 402/725 cut-off events. [2023-11-17 15:19:16,086 INFO L125 PetriNetUnfolderBase]: For 1530/1546 co-relation queries the response was YES. [2023-11-17 15:19:16,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2690 conditions, 725 events. 402/725 cut-off events. For 1530/1546 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3523 event pairs, 74 based on Foata normal form. 19/736 useless extension candidates. Maximal degree in co-relation 2674. Up to 218 conditions per place. [2023-11-17 15:19:16,088 INFO L140 encePairwiseOnDemand]: 206/212 looper letters, 44 selfloop transitions, 13 changer transitions 29/92 dead transitions. [2023-11-17 15:19:16,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 92 transitions, 701 flow [2023-11-17 15:19:16,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 15:19:16,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-17 15:19:16,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 884 transitions. [2023-11-17 15:19:16,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46331236897274636 [2023-11-17 15:19:16,090 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 884 transitions. [2023-11-17 15:19:16,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 884 transitions. [2023-11-17 15:19:16,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:19:16,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 884 transitions. [2023-11-17 15:19:16,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.22222222222223) internal successors, (884), 9 states have internal predecessors, (884), 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:19:16,094 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 212.0) internal successors, (2120), 10 states have internal predecessors, (2120), 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:19:16,095 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 212.0) internal successors, (2120), 10 states have internal predecessors, (2120), 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:19:16,095 INFO L175 Difference]: Start difference. First operand has 59 places, 38 transitions, 248 flow. Second operand 9 states and 884 transitions. [2023-11-17 15:19:16,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 92 transitions, 701 flow [2023-11-17 15:19:16,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 92 transitions, 644 flow, removed 16 selfloop flow, removed 7 redundant places. [2023-11-17 15:19:16,099 INFO L231 Difference]: Finished difference. Result has 62 places, 38 transitions, 249 flow [2023-11-17 15:19:16,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=249, PETRI_PLACES=62, PETRI_TRANSITIONS=38} [2023-11-17 15:19:16,099 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 28 predicate places. [2023-11-17 15:19:16,100 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 38 transitions, 249 flow [2023-11-17 15:19:16,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 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:19:16,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:19:16,100 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] [2023-11-17 15:19:16,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 15:19:16,100 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:19:16,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:19:16,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1871078073, now seen corresponding path program 1 times [2023-11-17 15:19:16,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:19:16,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487446801] [2023-11-17 15:19:16,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:19:16,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:19:16,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:19:16,588 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:19:16,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:19:16,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487446801] [2023-11-17 15:19:16,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487446801] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:19:16,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:19:16,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:19:16,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91620432] [2023-11-17 15:19:16,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:19:16,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 15:19:16,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:19:16,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 15:19:16,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-17 15:19:16,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 212 [2023-11-17 15:19:16,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 38 transitions, 249 flow. Second operand has 8 states, 8 states have (on average 87.5) internal successors, (700), 8 states have internal predecessors, (700), 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:19:16,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:19:16,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 212 [2023-11-17 15:19:16,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:19:16,847 INFO L124 PetriNetUnfolderBase]: 419/796 cut-off events. [2023-11-17 15:19:16,848 INFO L125 PetriNetUnfolderBase]: For 1781/1781 co-relation queries the response was YES. [2023-11-17 15:19:16,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2929 conditions, 796 events. 419/796 cut-off events. For 1781/1781 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4142 event pairs, 42 based on Foata normal form. 1/796 useless extension candidates. Maximal degree in co-relation 2914. Up to 389 conditions per place. [2023-11-17 15:19:16,851 INFO L140 encePairwiseOnDemand]: 205/212 looper letters, 45 selfloop transitions, 4 changer transitions 32/87 dead transitions. [2023-11-17 15:19:16,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 87 transitions, 727 flow [2023-11-17 15:19:16,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 15:19:16,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 15:19:16,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 733 transitions. [2023-11-17 15:19:16,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4321933962264151 [2023-11-17 15:19:16,853 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 733 transitions. [2023-11-17 15:19:16,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 733 transitions. [2023-11-17 15:19:16,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:19:16,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 733 transitions. [2023-11-17 15:19:16,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 91.625) internal successors, (733), 8 states have internal predecessors, (733), 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:19:16,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 212.0) internal successors, (1908), 9 states have internal predecessors, (1908), 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:19:16,857 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 212.0) internal successors, (1908), 9 states have internal predecessors, (1908), 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:19:16,857 INFO L175 Difference]: Start difference. First operand has 62 places, 38 transitions, 249 flow. Second operand 8 states and 733 transitions. [2023-11-17 15:19:16,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 87 transitions, 727 flow [2023-11-17 15:19:16,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 87 transitions, 612 flow, removed 26 selfloop flow, removed 7 redundant places. [2023-11-17 15:19:16,862 INFO L231 Difference]: Finished difference. Result has 63 places, 37 transitions, 211 flow [2023-11-17 15:19:16,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=211, PETRI_PLACES=63, PETRI_TRANSITIONS=37} [2023-11-17 15:19:16,862 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 29 predicate places. [2023-11-17 15:19:16,862 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 37 transitions, 211 flow [2023-11-17 15:19:16,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 87.5) internal successors, (700), 8 states have internal predecessors, (700), 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:19:16,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:19:16,863 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] [2023-11-17 15:19:16,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 15:19:16,863 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:19:16,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:19:16,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1889479625, now seen corresponding path program 2 times [2023-11-17 15:19:16,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:19:16,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609752649] [2023-11-17 15:19:16,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:19:16,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:19:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:19:16,896 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 15:19:16,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:19:16,940 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 15:19:16,940 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 15:19:16,940 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-17 15:19:16,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-17 15:19:16,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-17 15:19:16,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-17 15:19:16,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-17 15:19:16,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-17 15:19:16,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 15:19:16,942 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:19:16,945 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 15:19:16,946 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 15:19:16,973 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-17 15:19:16,974 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 15:19:16,975 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-17 15:19:16,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:19:16 BasicIcfg [2023-11-17 15:19:16,993 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 15:19:16,994 INFO L158 Benchmark]: Toolchain (without parser) took 9344.23ms. Allocated memory was 203.4MB in the beginning and 364.9MB in the end (delta: 161.5MB). Free memory was 164.7MB in the beginning and 178.5MB in the end (delta: -13.9MB). Peak memory consumption was 149.2MB. Max. memory is 8.0GB. [2023-11-17 15:19:16,994 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 203.4MB. Free memory is still 160.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 15:19:16,994 INFO L158 Benchmark]: CACSL2BoogieTranslator took 368.06ms. Allocated memory is still 203.4MB. Free memory was 164.2MB in the beginning and 141.0MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-11-17 15:19:16,994 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.58ms. Allocated memory is still 203.4MB. Free memory was 141.0MB in the beginning and 138.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:19:16,994 INFO L158 Benchmark]: Boogie Preprocessor took 26.15ms. Allocated memory is still 203.4MB. Free memory was 138.6MB in the beginning and 136.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:19:16,995 INFO L158 Benchmark]: RCFGBuilder took 562.40ms. Allocated memory is still 203.4MB. Free memory was 136.5MB in the beginning and 100.2MB in the end (delta: 36.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2023-11-17 15:19:16,995 INFO L158 Benchmark]: TraceAbstraction took 8332.85ms. Allocated memory was 203.4MB in the beginning and 364.9MB in the end (delta: 161.5MB). Free memory was 176.1MB in the beginning and 178.5MB in the end (delta: -2.5MB). Peak memory consumption was 159.5MB. Max. memory is 8.0GB. [2023-11-17 15:19:16,996 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.11ms. Allocated memory is still 203.4MB. Free memory is still 160.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 368.06ms. Allocated memory is still 203.4MB. Free memory was 164.2MB in the beginning and 141.0MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.58ms. Allocated memory is still 203.4MB. Free memory was 141.0MB in the beginning and 138.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.15ms. Allocated memory is still 203.4MB. Free memory was 138.6MB in the beginning and 136.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 562.40ms. Allocated memory is still 203.4MB. Free memory was 136.5MB in the beginning and 100.2MB in the end (delta: 36.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 8332.85ms. Allocated memory was 203.4MB in the beginning and 364.9MB in the end (delta: 161.5MB). Free memory was 176.1MB in the beginning and 178.5MB in the end (delta: -2.5MB). Peak memory consumption was 159.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 116 PlacesBefore, 34 PlacesAfterwards, 109 TransitionsBefore, 26 TransitionsAfterwards, 2218 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 1 ChoiceCompositions, 100 TotalNumberOfCompositions, 5662 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2673, independent: 2504, independent conditional: 0, independent unconditional: 2504, dependent: 169, dependent conditional: 0, dependent unconditional: 169, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1618, independent: 1566, independent conditional: 0, independent unconditional: 1566, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1618, independent: 1530, independent conditional: 0, independent unconditional: 1530, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 88, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 371, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 326, dependent conditional: 0, dependent unconditional: 326, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2673, independent: 938, independent conditional: 0, independent unconditional: 938, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 1618, unknown conditional: 0, unknown unconditional: 1618] , Statistics on independence cache: Total cache size (in pairs): 142, Positive cache size: 121, Positive conditional cache size: 0, Positive unconditional cache size: 121, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L721] 0 int z = 0; [L722] 0 _Bool z$flush_delayed; [L723] 0 int z$mem_tmp; [L724] 0 _Bool z$r_buff0_thd0; [L725] 0 _Bool z$r_buff0_thd1; [L726] 0 _Bool z$r_buff0_thd2; [L727] 0 _Bool z$r_buff0_thd3; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L833] 0 pthread_t t2281; [L834] FCALL, FORK 0 pthread_create(&t2281, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2281={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L835] 0 pthread_t t2282; [L836] FCALL, FORK 0 pthread_create(&t2282, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2281={5:0}, t2282={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L837] 0 pthread_t t2283; [L838] FCALL, FORK 0 pthread_create(&t2283, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2281={5:0}, t2282={6:0}, t2283={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 1 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L792] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L795] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L796] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L797] 3 z$flush_delayed = weak$$choice2 [L798] 3 z$mem_tmp = z [L799] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L800] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L801] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L802] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L803] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L805] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] 3 __unbuffered_p2_EBX = z [L807] 3 z = z$flush_delayed ? z$mem_tmp : z [L808] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L811] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L812] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L813] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L814] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L815] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L845] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L846] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L847] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L848] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2281={5:0}, t2282={6:0}, t2283={3:0}, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L851] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] 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}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 836]: 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: 838]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 138 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.2s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 411 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 411 mSDsluCounter, 27 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1090 IncrementalHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 13 mSDtfsCounter, 1090 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=403occurred in iteration=5, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 149 NumberOfCodeBlocks, 149 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 699 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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:19:17,021 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...