/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_power.opt_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 11:28:41,854 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 11:28:41,909 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2023-11-17 11:28:41,934 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 11:28:41,935 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 11:28:41,936 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 11:28:41,936 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 11:28:41,937 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 11:28:41,937 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 11:28:41,941 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 11:28:41,941 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 11:28:41,941 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 11:28:41,942 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 11:28:41,943 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 11:28:41,943 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 11:28:41,943 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 11:28:41,943 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 11:28:41,944 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 11:28:41,944 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 11:28:41,944 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 11:28:41,944 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 11:28:41,945 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 11:28:41,945 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 11:28:41,945 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 11:28:41,946 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 11:28:41,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:28:41,946 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 11:28:41,946 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 11:28:41,946 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 11:28:41,947 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 11:28:41,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 11:28:41,948 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 11:28:41,948 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true [2023-11-17 11:28:42,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 11:28:42,179 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 11:28:42,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 11:28:42,183 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 11:28:42,183 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 11:28:42,184 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.opt_pso.opt.i [2023-11-17 11:28:43,470 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 11:28:43,761 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 11:28:43,764 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.opt_pso.opt.i [2023-11-17 11:28:43,778 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/505401200/7eebf424d485479c841cabc64e3daf67/FLAG2643e6dd6 [2023-11-17 11:28:43,791 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/505401200/7eebf424d485479c841cabc64e3daf67 [2023-11-17 11:28:43,793 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 11:28:43,795 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 11:28:43,796 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 11:28:43,796 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 11:28:43,800 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 11:28:43,800 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:28:43" (1/1) ... [2023-11-17 11:28:43,801 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d551e5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:28:43, skipping insertion in model container [2023-11-17 11:28:43,802 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:28:43" (1/1) ... [2023-11-17 11:28:43,858 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 11:28:44,017 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/safe011_power.opt_pso.opt.i[959,972] [2023-11-17 11:28:44,250 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:28:44,267 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 11:28:44,280 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/safe011_power.opt_pso.opt.i[959,972] [2023-11-17 11:28:44,327 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:28:44,370 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:28:44,371 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:28:44,377 INFO L206 MainTranslator]: Completed translation [2023-11-17 11:28:44,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:28:44 WrapperNode [2023-11-17 11:28:44,379 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 11:28:44,381 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 11:28:44,381 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 11:28:44,381 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 11:28:44,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:28:44" (1/1) ... [2023-11-17 11:28:44,409 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:28:44" (1/1) ... [2023-11-17 11:28:44,443 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2023-11-17 11:28:44,443 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 11:28:44,444 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 11:28:44,444 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 11:28:44,444 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 11:28:44,452 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:28:44" (1/1) ... [2023-11-17 11:28:44,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:28:44" (1/1) ... [2023-11-17 11:28:44,470 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:28:44" (1/1) ... [2023-11-17 11:28:44,470 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:28:44" (1/1) ... [2023-11-17 11:28:44,477 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:28:44" (1/1) ... [2023-11-17 11:28:44,479 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:28:44" (1/1) ... [2023-11-17 11:28:44,481 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:28:44" (1/1) ... [2023-11-17 11:28:44,482 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:28:44" (1/1) ... [2023-11-17 11:28:44,504 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 11:28:44,505 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 11:28:44,505 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 11:28:44,505 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 11:28:44,506 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:28:44" (1/1) ... [2023-11-17 11:28:44,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:28:44,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:28:44,538 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 11:28:44,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 11:28:44,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 11:28:44,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 11:28:44,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 11:28:44,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 11:28:44,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 11:28:44,570 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 11:28:44,570 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 11:28:44,570 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 11:28:44,570 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 11:28:44,570 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 11:28:44,570 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 11:28:44,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 11:28:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 11:28:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 11:28:44,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 11:28:44,573 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 11:28:44,733 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 11:28:44,735 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 11:28:45,010 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 11:28:45,222 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 11:28:45,223 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 11:28:45,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:28:45 BoogieIcfgContainer [2023-11-17 11:28:45,224 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 11:28:45,228 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 11:28:45,228 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 11:28:45,231 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 11:28:45,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 11:28:43" (1/3) ... [2023-11-17 11:28:45,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37ea8708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:28:45, skipping insertion in model container [2023-11-17 11:28:45,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:28:44" (2/3) ... [2023-11-17 11:28:45,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37ea8708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:28:45, skipping insertion in model container [2023-11-17 11:28:45,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:28:45" (3/3) ... [2023-11-17 11:28:45,234 INFO L112 eAbstractionObserver]: Analyzing ICFG safe011_power.opt_pso.opt.i [2023-11-17 11:28:45,248 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 11:28:45,248 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 11:28:45,248 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 11:28:45,286 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 11:28:45,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 40 transitions, 92 flow [2023-11-17 11:28:45,349 INFO L124 PetriNetUnfolderBase]: 2/37 cut-off events. [2023-11-17 11:28:45,350 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:28:45,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 2/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 71 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2023-11-17 11:28:45,357 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 40 transitions, 92 flow [2023-11-17 11:28:45,361 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 37 transitions, 83 flow [2023-11-17 11:28:45,367 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:28:45,383 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 37 transitions, 83 flow [2023-11-17 11:28:45,385 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 37 transitions, 83 flow [2023-11-17 11:28:45,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 37 transitions, 83 flow [2023-11-17 11:28:45,397 INFO L124 PetriNetUnfolderBase]: 2/37 cut-off events. [2023-11-17 11:28:45,397 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:28:45,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 2/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 71 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2023-11-17 11:28:45,399 INFO L119 LiptonReduction]: Number of co-enabled transitions 784 [2023-11-17 11:28:47,008 INFO L134 LiptonReduction]: Checked pairs total: 2563 [2023-11-17 11:28:47,009 INFO L136 LiptonReduction]: Total number of compositions: 22 [2023-11-17 11:28:47,023 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:28:47,029 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;@239fcb6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:28:47,030 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-17 11:28:47,033 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:28:47,033 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-11-17 11:28:47,034 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:28:47,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:28:47,034 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-17 11:28:47,035 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:28:47,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:28:47,039 INFO L85 PathProgramCache]: Analyzing trace with hash 346271238, now seen corresponding path program 1 times [2023-11-17 11:28:47,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:28:47,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253584155] [2023-11-17 11:28:47,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:28:47,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:28:47,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:28:47,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:28:47,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:28:47,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253584155] [2023-11-17 11:28:47,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253584155] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:28:47,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:28:47,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:28:47,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758915339] [2023-11-17 11:28:47,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:28:47,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:28:47,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:28:47,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:28:47,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:28:47,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2023-11-17 11:28:47,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:47,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:28:47,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2023-11-17 11:28:47,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:28:47,843 INFO L124 PetriNetUnfolderBase]: 711/1125 cut-off events. [2023-11-17 11:28:47,843 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-17 11:28:47,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2244 conditions, 1125 events. 711/1125 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5238 event pairs, 197 based on Foata normal form. 0/1056 useless extension candidates. Maximal degree in co-relation 2233. Up to 859 conditions per place. [2023-11-17 11:28:47,853 INFO L140 encePairwiseOnDemand]: 58/62 looper letters, 27 selfloop transitions, 2 changer transitions 2/34 dead transitions. [2023-11-17 11:28:47,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 34 transitions, 142 flow [2023-11-17 11:28:47,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:28:47,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:28:47,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2023-11-17 11:28:47,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46774193548387094 [2023-11-17 11:28:47,865 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 87 transitions. [2023-11-17 11:28:47,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 87 transitions. [2023-11-17 11:28:47,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:28:47,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 87 transitions. [2023-11-17 11:28:47,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:47,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:47,875 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:47,876 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 57 flow. Second operand 3 states and 87 transitions. [2023-11-17 11:28:47,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 34 transitions, 142 flow [2023-11-17 11:28:47,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 34 transitions, 138 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-17 11:28:47,881 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 52 flow [2023-11-17 11:28:47,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-11-17 11:28:47,885 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2023-11-17 11:28:47,886 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 52 flow [2023-11-17 11:28:47,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:47,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:28:47,886 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:28:47,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 11:28:47,887 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:28:47,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:28:47,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1674515412, now seen corresponding path program 1 times [2023-11-17 11:28:47,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:28:47,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586956442] [2023-11-17 11:28:47,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:28:47,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:28:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:28:48,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:28:48,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:28:48,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586956442] [2023-11-17 11:28:48,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586956442] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:28:48,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:28:48,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:28:48,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715177787] [2023-11-17 11:28:48,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:28:48,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:28:48,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:28:48,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:28:48,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:28:48,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2023-11-17 11:28:48,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:48,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:28:48,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2023-11-17 11:28:48,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:28:48,851 INFO L124 PetriNetUnfolderBase]: 1040/1569 cut-off events. [2023-11-17 11:28:48,851 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2023-11-17 11:28:48,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3307 conditions, 1569 events. 1040/1569 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7056 event pairs, 227 based on Foata normal form. 28/1596 useless extension candidates. Maximal degree in co-relation 3297. Up to 1347 conditions per place. [2023-11-17 11:28:48,861 INFO L140 encePairwiseOnDemand]: 53/62 looper letters, 32 selfloop transitions, 10 changer transitions 0/43 dead transitions. [2023-11-17 11:28:48,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 43 transitions, 188 flow [2023-11-17 11:28:48,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:28:48,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:28:48,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2023-11-17 11:28:48,865 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2023-11-17 11:28:48,865 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 100 transitions. [2023-11-17 11:28:48,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 100 transitions. [2023-11-17 11:28:48,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:28:48,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 100 transitions. [2023-11-17 11:28:48,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:48,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:48,870 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:48,871 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 52 flow. Second operand 4 states and 100 transitions. [2023-11-17 11:28:48,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 43 transitions, 188 flow [2023-11-17 11:28:48,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 43 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:28:48,873 INFO L231 Difference]: Finished difference. Result has 33 places, 29 transitions, 111 flow [2023-11-17 11:28:48,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=33, PETRI_TRANSITIONS=29} [2023-11-17 11:28:48,874 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 0 predicate places. [2023-11-17 11:28:48,874 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 29 transitions, 111 flow [2023-11-17 11:28:48,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:48,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:28:48,875 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:28:48,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 11:28:48,877 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:28:48,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:28:48,881 INFO L85 PathProgramCache]: Analyzing trace with hash -370369967, now seen corresponding path program 1 times [2023-11-17 11:28:48,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:28:48,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044914224] [2023-11-17 11:28:48,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:28:48,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:28:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:28:49,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:28:49,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:28:49,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044914224] [2023-11-17 11:28:49,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044914224] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:28:49,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:28:49,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:28:49,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074993123] [2023-11-17 11:28:49,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:28:49,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:28:49,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:28:49,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:28:49,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:28:49,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2023-11-17 11:28:49,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 29 transitions, 111 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:49,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:28:49,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2023-11-17 11:28:49,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:28:49,538 INFO L124 PetriNetUnfolderBase]: 1000/1513 cut-off events. [2023-11-17 11:28:49,539 INFO L125 PetriNetUnfolderBase]: For 490/495 co-relation queries the response was YES. [2023-11-17 11:28:49,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4219 conditions, 1513 events. 1000/1513 cut-off events. For 490/495 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6531 event pairs, 180 based on Foata normal form. 16/1524 useless extension candidates. Maximal degree in co-relation 4207. Up to 1100 conditions per place. [2023-11-17 11:28:49,549 INFO L140 encePairwiseOnDemand]: 52/62 looper letters, 31 selfloop transitions, 10 changer transitions 0/42 dead transitions. [2023-11-17 11:28:49,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 230 flow [2023-11-17 11:28:49,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:28:49,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:28:49,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2023-11-17 11:28:49,551 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2023-11-17 11:28:49,551 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 96 transitions. [2023-11-17 11:28:49,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 96 transitions. [2023-11-17 11:28:49,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:28:49,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 96 transitions. [2023-11-17 11:28:49,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:49,553 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:49,553 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:49,553 INFO L175 Difference]: Start difference. First operand has 33 places, 29 transitions, 111 flow. Second operand 4 states and 96 transitions. [2023-11-17 11:28:49,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 230 flow [2023-11-17 11:28:49,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 42 transitions, 230 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 11:28:49,556 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 135 flow [2023-11-17 11:28:49,556 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2023-11-17 11:28:49,557 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 4 predicate places. [2023-11-17 11:28:49,557 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 135 flow [2023-11-17 11:28:49,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:49,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:28:49,558 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:28:49,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 11:28:49,558 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:28:49,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:28:49,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1677534901, now seen corresponding path program 1 times [2023-11-17 11:28:49,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:28:49,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213892255] [2023-11-17 11:28:49,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:28:49,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:28:49,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:28:49,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:28:49,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:28:49,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213892255] [2023-11-17 11:28:49,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213892255] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:28:49,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:28:49,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:28:49,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331399118] [2023-11-17 11:28:49,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:28:49,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:28:49,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:28:49,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:28:49,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:28:49,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 62 [2023-11-17 11:28:49,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:49,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:28:49,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 62 [2023-11-17 11:28:49,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:28:49,973 INFO L124 PetriNetUnfolderBase]: 1144/1765 cut-off events. [2023-11-17 11:28:49,973 INFO L125 PetriNetUnfolderBase]: For 1153/1169 co-relation queries the response was YES. [2023-11-17 11:28:49,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5377 conditions, 1765 events. 1144/1765 cut-off events. For 1153/1169 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 8526 event pairs, 215 based on Foata normal form. 91/1840 useless extension candidates. Maximal degree in co-relation 5362. Up to 853 conditions per place. [2023-11-17 11:28:49,982 INFO L140 encePairwiseOnDemand]: 58/62 looper letters, 36 selfloop transitions, 3 changer transitions 17/59 dead transitions. [2023-11-17 11:28:49,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 59 transitions, 381 flow [2023-11-17 11:28:49,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:28:49,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:28:49,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2023-11-17 11:28:49,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2023-11-17 11:28:49,986 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 104 transitions. [2023-11-17 11:28:49,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 104 transitions. [2023-11-17 11:28:49,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:28:49,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 104 transitions. [2023-11-17 11:28:49,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:49,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:49,989 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:49,989 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 135 flow. Second operand 4 states and 104 transitions. [2023-11-17 11:28:49,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 59 transitions, 381 flow [2023-11-17 11:28:49,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 59 transitions, 341 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-17 11:28:49,995 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 124 flow [2023-11-17 11:28:49,996 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2023-11-17 11:28:49,997 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 6 predicate places. [2023-11-17 11:28:49,997 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 124 flow [2023-11-17 11:28:49,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:49,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:28:49,997 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:28:49,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 11:28:49,998 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:28:49,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:28:49,998 INFO L85 PathProgramCache]: Analyzing trace with hash -417353859, now seen corresponding path program 1 times [2023-11-17 11:28:49,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:28:49,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530353426] [2023-11-17 11:28:49,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:28:49,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:28:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:28:50,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:28:50,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:28:50,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530353426] [2023-11-17 11:28:50,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530353426] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:28:50,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:28:50,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:28:50,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905644647] [2023-11-17 11:28:50,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:28:50,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:28:50,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:28:50,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:28:50,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:28:50,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 62 [2023-11-17 11:28:50,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:50,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:28:50,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 62 [2023-11-17 11:28:50,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:28:50,633 INFO L124 PetriNetUnfolderBase]: 692/1110 cut-off events. [2023-11-17 11:28:50,633 INFO L125 PetriNetUnfolderBase]: For 1017/1017 co-relation queries the response was YES. [2023-11-17 11:28:50,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3363 conditions, 1110 events. 692/1110 cut-off events. For 1017/1017 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4617 event pairs, 251 based on Foata normal form. 3/1102 useless extension candidates. Maximal degree in co-relation 3346. Up to 971 conditions per place. [2023-11-17 11:28:50,641 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 40 selfloop transitions, 8 changer transitions 0/51 dead transitions. [2023-11-17 11:28:50,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 306 flow [2023-11-17 11:28:50,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:28:50,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:28:50,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2023-11-17 11:28:50,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4274193548387097 [2023-11-17 11:28:50,643 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 106 transitions. [2023-11-17 11:28:50,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 106 transitions. [2023-11-17 11:28:50,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:28:50,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 106 transitions. [2023-11-17 11:28:50,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:50,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:50,645 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:50,645 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 124 flow. Second operand 4 states and 106 transitions. [2023-11-17 11:28:50,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 306 flow [2023-11-17 11:28:50,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 51 transitions, 292 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-17 11:28:50,648 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 177 flow [2023-11-17 11:28:50,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=177, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2023-11-17 11:28:50,649 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 7 predicate places. [2023-11-17 11:28:50,650 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 177 flow [2023-11-17 11:28:50,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:50,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:28:50,650 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:28:50,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 11:28:50,650 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:28:50,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:28:50,651 INFO L85 PathProgramCache]: Analyzing trace with hash 763155476, now seen corresponding path program 1 times [2023-11-17 11:28:50,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:28:50,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641823353] [2023-11-17 11:28:50,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:28:50,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:28:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:28:50,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:28:50,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:28:50,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641823353] [2023-11-17 11:28:50,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641823353] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:28:50,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:28:50,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:28:50,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673288367] [2023-11-17 11:28:50,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:28:50,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:28:50,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:28:50,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:28:50,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:28:50,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 62 [2023-11-17 11:28:50,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 177 flow. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:50,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:28:50,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 62 [2023-11-17 11:28:50,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:28:51,209 INFO L124 PetriNetUnfolderBase]: 841/1306 cut-off events. [2023-11-17 11:28:51,209 INFO L125 PetriNetUnfolderBase]: For 1313/1338 co-relation queries the response was YES. [2023-11-17 11:28:51,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4249 conditions, 1306 events. 841/1306 cut-off events. For 1313/1338 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5575 event pairs, 389 based on Foata normal form. 24/1307 useless extension candidates. Maximal degree in co-relation 4232. Up to 1098 conditions per place. [2023-11-17 11:28:51,219 INFO L140 encePairwiseOnDemand]: 54/62 looper letters, 40 selfloop transitions, 21 changer transitions 0/64 dead transitions. [2023-11-17 11:28:51,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 64 transitions, 431 flow [2023-11-17 11:28:51,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:28:51,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:28:51,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2023-11-17 11:28:51,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4096774193548387 [2023-11-17 11:28:51,221 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 127 transitions. [2023-11-17 11:28:51,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 127 transitions. [2023-11-17 11:28:51,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:28:51,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 127 transitions. [2023-11-17 11:28:51,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:51,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 62.0) internal successors, (372), 6 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 11:28:51,223 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 62.0) internal successors, (372), 6 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 11:28:51,223 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 177 flow. Second operand 5 states and 127 transitions. [2023-11-17 11:28:51,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 64 transitions, 431 flow [2023-11-17 11:28:51,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 64 transitions, 431 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 11:28:51,226 INFO L231 Difference]: Finished difference. Result has 46 places, 52 transitions, 360 flow [2023-11-17 11:28:51,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=360, PETRI_PLACES=46, PETRI_TRANSITIONS=52} [2023-11-17 11:28:51,227 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 13 predicate places. [2023-11-17 11:28:51,227 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 52 transitions, 360 flow [2023-11-17 11:28:51,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:51,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:28:51,227 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:28:51,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 11:28:51,228 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:28:51,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:28:51,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1812285504, now seen corresponding path program 2 times [2023-11-17 11:28:51,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:28:51,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390030194] [2023-11-17 11:28:51,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:28:51,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:28:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:28:51,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:28:51,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:28:51,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390030194] [2023-11-17 11:28:51,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390030194] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:28:51,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:28:51,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:28:51,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144198576] [2023-11-17 11:28:51,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:28:51,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:28:51,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:28:51,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:28:51,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:28:51,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 62 [2023-11-17 11:28:51,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 52 transitions, 360 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:51,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:28:51,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 62 [2023-11-17 11:28:51,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:28:51,776 INFO L124 PetriNetUnfolderBase]: 829/1310 cut-off events. [2023-11-17 11:28:51,776 INFO L125 PetriNetUnfolderBase]: For 2715/2794 co-relation queries the response was YES. [2023-11-17 11:28:51,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5086 conditions, 1310 events. 829/1310 cut-off events. For 2715/2794 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5694 event pairs, 143 based on Foata normal form. 91/1393 useless extension candidates. Maximal degree in co-relation 5065. Up to 1037 conditions per place. [2023-11-17 11:28:51,788 INFO L140 encePairwiseOnDemand]: 54/62 looper letters, 44 selfloop transitions, 24 changer transitions 0/71 dead transitions. [2023-11-17 11:28:51,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 71 transitions, 554 flow [2023-11-17 11:28:51,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 11:28:51,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 11:28:51,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2023-11-17 11:28:51,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3978494623655914 [2023-11-17 11:28:51,789 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 148 transitions. [2023-11-17 11:28:51,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 148 transitions. [2023-11-17 11:28:51,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:28:51,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 148 transitions. [2023-11-17 11:28:51,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:51,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 62.0) internal successors, (434), 7 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:51,791 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 62.0) internal successors, (434), 7 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:51,791 INFO L175 Difference]: Start difference. First operand has 46 places, 52 transitions, 360 flow. Second operand 6 states and 148 transitions. [2023-11-17 11:28:51,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 71 transitions, 554 flow [2023-11-17 11:28:51,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 71 transitions, 537 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-11-17 11:28:51,798 INFO L231 Difference]: Finished difference. Result has 50 places, 53 transitions, 392 flow [2023-11-17 11:28:51,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=392, PETRI_PLACES=50, PETRI_TRANSITIONS=53} [2023-11-17 11:28:51,799 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 17 predicate places. [2023-11-17 11:28:51,799 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 53 transitions, 392 flow [2023-11-17 11:28:51,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:51,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:28:51,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:28:51,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 11:28:51,800 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:28:51,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:28:51,800 INFO L85 PathProgramCache]: Analyzing trace with hash -66225964, now seen corresponding path program 3 times [2023-11-17 11:28:51,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:28:51,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825792044] [2023-11-17 11:28:51,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:28:51,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:28:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:28:52,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:28:52,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:28:52,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825792044] [2023-11-17 11:28:52,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825792044] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:28:52,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:28:52,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:28:52,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795992167] [2023-11-17 11:28:52,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:28:52,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:28:52,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:28:52,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:28:52,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:28:52,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 62 [2023-11-17 11:28:52,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 53 transitions, 392 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:52,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:28:52,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 62 [2023-11-17 11:28:52,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:28:52,541 INFO L124 PetriNetUnfolderBase]: 837/1329 cut-off events. [2023-11-17 11:28:52,541 INFO L125 PetriNetUnfolderBase]: For 3104/3149 co-relation queries the response was YES. [2023-11-17 11:28:52,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5356 conditions, 1329 events. 837/1329 cut-off events. For 3104/3149 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5744 event pairs, 186 based on Foata normal form. 13/1334 useless extension candidates. Maximal degree in co-relation 5334. Up to 1169 conditions per place. [2023-11-17 11:28:52,553 INFO L140 encePairwiseOnDemand]: 54/62 looper letters, 54 selfloop transitions, 18 changer transitions 0/75 dead transitions. [2023-11-17 11:28:52,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 75 transitions, 636 flow [2023-11-17 11:28:52,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:28:52,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:28:52,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2023-11-17 11:28:52,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4161290322580645 [2023-11-17 11:28:52,555 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 129 transitions. [2023-11-17 11:28:52,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 129 transitions. [2023-11-17 11:28:52,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:28:52,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 129 transitions. [2023-11-17 11:28:52,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:52,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 62.0) internal successors, (372), 6 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 11:28:52,556 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 62.0) internal successors, (372), 6 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 11:28:52,556 INFO L175 Difference]: Start difference. First operand has 50 places, 53 transitions, 392 flow. Second operand 5 states and 129 transitions. [2023-11-17 11:28:52,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 75 transitions, 636 flow [2023-11-17 11:28:52,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 75 transitions, 627 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-11-17 11:28:52,565 INFO L231 Difference]: Finished difference. Result has 54 places, 59 transitions, 492 flow [2023-11-17 11:28:52,565 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=492, PETRI_PLACES=54, PETRI_TRANSITIONS=59} [2023-11-17 11:28:52,567 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 21 predicate places. [2023-11-17 11:28:52,567 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 59 transitions, 492 flow [2023-11-17 11:28:52,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:52,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:28:52,567 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:28:52,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 11:28:52,567 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:28:52,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:28:52,568 INFO L85 PathProgramCache]: Analyzing trace with hash -68013424, now seen corresponding path program 4 times [2023-11-17 11:28:52,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:28:52,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770644326] [2023-11-17 11:28:52,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:28:52,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:28:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:28:53,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:28:53,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:28:53,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770644326] [2023-11-17 11:28:53,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770644326] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:28:53,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:28:53,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:28:53,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468288608] [2023-11-17 11:28:53,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:28:53,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:28:53,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:28:53,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:28:53,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:28:53,076 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 62 [2023-11-17 11:28:53,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 59 transitions, 492 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:53,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:28:53,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 62 [2023-11-17 11:28:53,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:28:53,350 INFO L124 PetriNetUnfolderBase]: 872/1367 cut-off events. [2023-11-17 11:28:53,351 INFO L125 PetriNetUnfolderBase]: For 4364/4439 co-relation queries the response was YES. [2023-11-17 11:28:53,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5935 conditions, 1367 events. 872/1367 cut-off events. For 4364/4439 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6069 event pairs, 130 based on Foata normal form. 23/1357 useless extension candidates. Maximal degree in co-relation 5911. Up to 1112 conditions per place. [2023-11-17 11:28:53,363 INFO L140 encePairwiseOnDemand]: 54/62 looper letters, 57 selfloop transitions, 34 changer transitions 0/94 dead transitions. [2023-11-17 11:28:53,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 94 transitions, 883 flow [2023-11-17 11:28:53,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:28:53,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:28:53,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2023-11-17 11:28:53,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4258064516129032 [2023-11-17 11:28:53,365 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 132 transitions. [2023-11-17 11:28:53,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 132 transitions. [2023-11-17 11:28:53,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:28:53,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 132 transitions. [2023-11-17 11:28:53,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:53,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 62.0) internal successors, (372), 6 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 11:28:53,367 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 62.0) internal successors, (372), 6 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 11:28:53,367 INFO L175 Difference]: Start difference. First operand has 54 places, 59 transitions, 492 flow. Second operand 5 states and 132 transitions. [2023-11-17 11:28:53,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 94 transitions, 883 flow [2023-11-17 11:28:53,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 94 transitions, 839 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-11-17 11:28:53,376 INFO L231 Difference]: Finished difference. Result has 55 places, 70 transitions, 676 flow [2023-11-17 11:28:53,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=676, PETRI_PLACES=55, PETRI_TRANSITIONS=70} [2023-11-17 11:28:53,376 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 22 predicate places. [2023-11-17 11:28:53,376 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 70 transitions, 676 flow [2023-11-17 11:28:53,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:53,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:28:53,377 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:28:53,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 11:28:53,377 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:28:53,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:28:53,378 INFO L85 PathProgramCache]: Analyzing trace with hash 792020165, now seen corresponding path program 1 times [2023-11-17 11:28:53,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:28:53,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432102418] [2023-11-17 11:28:53,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:28:53,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:28:53,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:28:53,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:28:53,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:28:53,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432102418] [2023-11-17 11:28:53,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432102418] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:28:53,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:28:53,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:28:53,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981439936] [2023-11-17 11:28:53,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:28:53,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:28:53,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:28:53,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:28:53,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:28:53,507 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2023-11-17 11:28:53,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 70 transitions, 676 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:53,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:28:53,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2023-11-17 11:28:53,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:28:53,718 INFO L124 PetriNetUnfolderBase]: 624/1034 cut-off events. [2023-11-17 11:28:53,718 INFO L125 PetriNetUnfolderBase]: For 5166/5226 co-relation queries the response was YES. [2023-11-17 11:28:53,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4922 conditions, 1034 events. 624/1034 cut-off events. For 5166/5226 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4866 event pairs, 84 based on Foata normal form. 172/1197 useless extension candidates. Maximal degree in co-relation 4898. Up to 509 conditions per place. [2023-11-17 11:28:53,729 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 96 selfloop transitions, 5 changer transitions 1/108 dead transitions. [2023-11-17 11:28:53,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 108 transitions, 1186 flow [2023-11-17 11:28:53,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:28:53,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:28:53,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2023-11-17 11:28:53,730 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39919354838709675 [2023-11-17 11:28:53,731 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 99 transitions. [2023-11-17 11:28:53,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 99 transitions. [2023-11-17 11:28:53,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:28:53,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 99 transitions. [2023-11-17 11:28:53,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:53,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:53,732 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:53,732 INFO L175 Difference]: Start difference. First operand has 55 places, 70 transitions, 676 flow. Second operand 4 states and 99 transitions. [2023-11-17 11:28:53,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 108 transitions, 1186 flow [2023-11-17 11:28:53,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 108 transitions, 1078 flow, removed 33 selfloop flow, removed 4 redundant places. [2023-11-17 11:28:53,742 INFO L231 Difference]: Finished difference. Result has 56 places, 62 transitions, 546 flow [2023-11-17 11:28:53,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=546, PETRI_PLACES=56, PETRI_TRANSITIONS=62} [2023-11-17 11:28:53,744 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 23 predicate places. [2023-11-17 11:28:53,744 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 62 transitions, 546 flow [2023-11-17 11:28:53,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:53,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:28:53,745 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:28:53,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 11:28:53,745 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:28:53,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:28:53,745 INFO L85 PathProgramCache]: Analyzing trace with hash 809572669, now seen corresponding path program 1 times [2023-11-17 11:28:53,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:28:53,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518993302] [2023-11-17 11:28:53,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:28:53,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:28:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:28:53,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:28:53,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:28:53,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518993302] [2023-11-17 11:28:53,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518993302] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:28:53,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:28:53,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:28:53,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531805618] [2023-11-17 11:28:53,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:28:53,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:28:53,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:28:53,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:28:53,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:28:53,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2023-11-17 11:28:53,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 62 transitions, 546 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:53,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:28:53,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2023-11-17 11:28:53,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:28:54,072 INFO L124 PetriNetUnfolderBase]: 311/549 cut-off events. [2023-11-17 11:28:54,072 INFO L125 PetriNetUnfolderBase]: For 2197/2236 co-relation queries the response was YES. [2023-11-17 11:28:54,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2551 conditions, 549 events. 311/549 cut-off events. For 2197/2236 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2336 event pairs, 39 based on Foata normal form. 100/642 useless extension candidates. Maximal degree in co-relation 2525. Up to 236 conditions per place. [2023-11-17 11:28:54,084 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 91 selfloop transitions, 8 changer transitions 1/106 dead transitions. [2023-11-17 11:28:54,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 106 transitions, 1045 flow [2023-11-17 11:28:54,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:28:54,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:28:54,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2023-11-17 11:28:54,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3935483870967742 [2023-11-17 11:28:54,086 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 122 transitions. [2023-11-17 11:28:54,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 122 transitions. [2023-11-17 11:28:54,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:28:54,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 122 transitions. [2023-11-17 11:28:54,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:54,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 62.0) internal successors, (372), 6 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 11:28:54,089 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 62.0) internal successors, (372), 6 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 11:28:54,089 INFO L175 Difference]: Start difference. First operand has 56 places, 62 transitions, 546 flow. Second operand 5 states and 122 transitions. [2023-11-17 11:28:54,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 106 transitions, 1045 flow [2023-11-17 11:28:54,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 106 transitions, 1003 flow, removed 12 selfloop flow, removed 4 redundant places. [2023-11-17 11:28:54,097 INFO L231 Difference]: Finished difference. Result has 58 places, 63 transitions, 545 flow [2023-11-17 11:28:54,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=545, PETRI_PLACES=58, PETRI_TRANSITIONS=63} [2023-11-17 11:28:54,098 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 25 predicate places. [2023-11-17 11:28:54,098 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 63 transitions, 545 flow [2023-11-17 11:28:54,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:54,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:28:54,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:28:54,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 11:28:54,099 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:28:54,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:28:54,099 INFO L85 PathProgramCache]: Analyzing trace with hash -326381180, now seen corresponding path program 1 times [2023-11-17 11:28:54,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:28:54,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655338287] [2023-11-17 11:28:54,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:28:54,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:28:54,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:28:54,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:28:54,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:28:54,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655338287] [2023-11-17 11:28:54,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655338287] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:28:54,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:28:54,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:28:54,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077663371] [2023-11-17 11:28:54,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:28:54,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:28:54,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:28:54,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:28:54,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:28:54,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 62 [2023-11-17 11:28:54,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 63 transitions, 545 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:54,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:28:54,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 62 [2023-11-17 11:28:54,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:28:54,399 INFO L124 PetriNetUnfolderBase]: 297/559 cut-off events. [2023-11-17 11:28:54,399 INFO L125 PetriNetUnfolderBase]: For 2015/2040 co-relation queries the response was YES. [2023-11-17 11:28:54,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2742 conditions, 559 events. 297/559 cut-off events. For 2015/2040 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2405 event pairs, 102 based on Foata normal form. 33/585 useless extension candidates. Maximal degree in co-relation 2716. Up to 348 conditions per place. [2023-11-17 11:28:54,403 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 51 selfloop transitions, 4 changer transitions 22/81 dead transitions. [2023-11-17 11:28:54,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 81 transitions, 855 flow [2023-11-17 11:28:54,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:28:54,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:28:54,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2023-11-17 11:28:54,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41397849462365593 [2023-11-17 11:28:54,405 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 77 transitions. [2023-11-17 11:28:54,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 77 transitions. [2023-11-17 11:28:54,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:28:54,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 77 transitions. [2023-11-17 11:28:54,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:54,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:54,406 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:54,406 INFO L175 Difference]: Start difference. First operand has 58 places, 63 transitions, 545 flow. Second operand 3 states and 77 transitions. [2023-11-17 11:28:54,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 81 transitions, 855 flow [2023-11-17 11:28:54,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 81 transitions, 807 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-11-17 11:28:54,412 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 389 flow [2023-11-17 11:28:54,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=389, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2023-11-17 11:28:54,413 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 24 predicate places. [2023-11-17 11:28:54,413 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 389 flow [2023-11-17 11:28:54,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:54,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:28:54,413 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 11:28:54,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-17 11:28:54,413 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:28:54,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:28:54,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1938535174, now seen corresponding path program 1 times [2023-11-17 11:28:54,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:28:54,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761494674] [2023-11-17 11:28:54,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:28:54,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:28:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:28:54,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:28:54,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:28:54,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761494674] [2023-11-17 11:28:54,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761494674] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:28:54,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:28:54,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 11:28:54,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742257508] [2023-11-17 11:28:54,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:28:54,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:28:54,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:28:54,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:28:54,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:28:54,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 62 [2023-11-17 11:28:54,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 389 flow. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:54,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:28:54,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 62 [2023-11-17 11:28:54,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:28:54,719 INFO L124 PetriNetUnfolderBase]: 231/443 cut-off events. [2023-11-17 11:28:54,720 INFO L125 PetriNetUnfolderBase]: For 1518/1540 co-relation queries the response was YES. [2023-11-17 11:28:54,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1993 conditions, 443 events. 231/443 cut-off events. For 1518/1540 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1903 event pairs, 41 based on Foata normal form. 42/478 useless extension candidates. Maximal degree in co-relation 1968. Up to 165 conditions per place. [2023-11-17 11:28:54,722 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 42 selfloop transitions, 11 changer transitions 19/76 dead transitions. [2023-11-17 11:28:54,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 76 transitions, 699 flow [2023-11-17 11:28:54,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 11:28:54,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 11:28:54,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 128 transitions. [2023-11-17 11:28:54,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34408602150537637 [2023-11-17 11:28:54,723 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 128 transitions. [2023-11-17 11:28:54,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 128 transitions. [2023-11-17 11:28:54,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:28:54,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 128 transitions. [2023-11-17 11:28:54,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:54,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 62.0) internal successors, (434), 7 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:54,725 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 62.0) internal successors, (434), 7 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:54,725 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 389 flow. Second operand 6 states and 128 transitions. [2023-11-17 11:28:54,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 76 transitions, 699 flow [2023-11-17 11:28:54,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 76 transitions, 680 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-17 11:28:54,729 INFO L231 Difference]: Finished difference. Result has 62 places, 40 transitions, 323 flow [2023-11-17 11:28:54,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=323, PETRI_PLACES=62, PETRI_TRANSITIONS=40} [2023-11-17 11:28:54,730 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 29 predicate places. [2023-11-17 11:28:54,730 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 40 transitions, 323 flow [2023-11-17 11:28:54,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:28:54,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:28:54,730 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] [2023-11-17 11:28:54,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-17 11:28:54,730 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:28:54,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:28:54,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1347403796, now seen corresponding path program 1 times [2023-11-17 11:28:54,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:28:54,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382973040] [2023-11-17 11:28:54,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:28:54,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:28:54,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:28:54,778 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 11:28:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:28:54,862 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 11:28:54,862 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 11:28:54,863 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-17 11:28:54,864 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-17 11:28:54,864 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-17 11:28:54,864 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-17 11:28:54,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-17 11:28:54,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-17 11:28:54,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-17 11:28:54,865 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:28:54,871 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 11:28:54,872 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 11:28:54,921 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-17 11:28:54,923 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-17 11:28:54,929 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 11:28:54,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 11:28:54 BasicIcfg [2023-11-17 11:28:54,950 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 11:28:54,950 INFO L158 Benchmark]: Toolchain (without parser) took 11155.69ms. Allocated memory was 249.6MB in the beginning and 419.4MB in the end (delta: 169.9MB). Free memory was 200.6MB in the beginning and 187.9MB in the end (delta: 12.7MB). Peak memory consumption was 184.1MB. Max. memory is 8.0GB. [2023-11-17 11:28:54,950 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 194.0MB. Free memory is still 142.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 11:28:54,951 INFO L158 Benchmark]: CACSL2BoogieTranslator took 583.98ms. Allocated memory is still 249.6MB. Free memory was 200.6MB in the beginning and 177.0MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-11-17 11:28:54,951 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.73ms. Allocated memory is still 249.6MB. Free memory was 177.0MB in the beginning and 174.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:28:54,951 INFO L158 Benchmark]: Boogie Preprocessor took 60.53ms. Allocated memory is still 249.6MB. Free memory was 174.4MB in the beginning and 172.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:28:54,951 INFO L158 Benchmark]: RCFGBuilder took 719.07ms. Allocated memory is still 249.6MB. Free memory was 172.3MB in the beginning and 125.6MB in the end (delta: 46.7MB). Peak memory consumption was 47.2MB. Max. memory is 8.0GB. [2023-11-17 11:28:54,952 INFO L158 Benchmark]: TraceAbstraction took 9721.70ms. Allocated memory was 249.6MB in the beginning and 419.4MB in the end (delta: 169.9MB). Free memory was 124.6MB in the beginning and 187.9MB in the end (delta: -63.3MB). Peak memory consumption was 107.6MB. Max. memory is 8.0GB. [2023-11-17 11:28:54,954 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.15ms. Allocated memory is still 194.0MB. Free memory is still 142.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 583.98ms. Allocated memory is still 249.6MB. Free memory was 200.6MB in the beginning and 177.0MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.73ms. Allocated memory is still 249.6MB. Free memory was 177.0MB in the beginning and 174.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 60.53ms. Allocated memory is still 249.6MB. Free memory was 174.4MB in the beginning and 172.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 719.07ms. Allocated memory is still 249.6MB. Free memory was 172.3MB in the beginning and 125.6MB in the end (delta: 46.7MB). Peak memory consumption was 47.2MB. Max. memory is 8.0GB. * TraceAbstraction took 9721.70ms. Allocated memory was 249.6MB in the beginning and 419.4MB in the end (delta: 169.9MB). Free memory was 124.6MB in the beginning and 187.9MB in the end (delta: -63.3MB). Peak memory consumption was 107.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.6s, 45 PlacesBefore, 33 PlacesAfterwards, 37 TransitionsBefore, 24 TransitionsAfterwards, 784 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 16 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 22 TotalNumberOfCompositions, 2563 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1058, independent: 943, independent conditional: 0, independent unconditional: 943, dependent: 115, dependent conditional: 0, dependent unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 536, independent: 497, independent conditional: 0, independent unconditional: 497, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 536, independent: 481, independent conditional: 0, independent unconditional: 481, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 55, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 308, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 289, dependent conditional: 0, dependent unconditional: 289, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1058, independent: 446, independent conditional: 0, independent unconditional: 446, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 536, unknown conditional: 0, unknown unconditional: 536] , Statistics on independence cache: Total cache size (in pairs): 109, Positive cache size: 91, Positive conditional cache size: 0, Positive unconditional cache size: 91, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, 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; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L716] 0 _Bool x$flush_delayed; [L717] 0 int x$mem_tmp; [L718] 0 _Bool x$r_buff0_thd0; [L719] 0 _Bool x$r_buff0_thd1; [L720] 0 _Bool x$r_buff0_thd2; [L721] 0 _Bool x$r_buff0_thd3; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$r_buff1_thd3; [L726] 0 _Bool x$read_delayed; [L727] 0 int *x$read_delayed_var; [L728] 0 int x$w_buff0; [L729] 0 _Bool x$w_buff0_used; [L730] 0 int x$w_buff1; [L731] 0 _Bool x$w_buff1_used; [L733] 0 int y = 0; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2028; [L819] FCALL, FORK 0 pthread_create(&t2028, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2028={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L820] 0 pthread_t t2029; [L821] FCALL, FORK 0 pthread_create(&t2029, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2028={5:0}, t2029={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L822] 0 pthread_t t2030; [L823] FCALL, FORK 0 pthread_create(&t2030, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2028={5:0}, t2029={6:0}, t2030={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L741] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, 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$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2028={5:0}, t2029={6:0}, t2030={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2028={5:0}, t2029={6:0}, t2030={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 [L851] 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] - 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: 821]: 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: 823]: 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: 819]: 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, 64 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: 9.6s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 317 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 317 mSDsluCounter, 19 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 832 IncrementalHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 12 mSDtfsCounter, 832 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=676occurred in iteration=9, InterpolantAutomatonStates: 58, 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, 3.7s InterpolantComputationTime, 189 NumberOfCodeBlocks, 189 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 155 ConstructedInterpolants, 0 QuantifiedInterpolants, 1152 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-17 11:28:54,979 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...