/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix053_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 15:16:24,716 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 15:16:24,788 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2023-11-17 15:16:24,818 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 15:16:24,818 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 15:16:24,819 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 15:16:24,819 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 15:16:24,820 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 15:16:24,820 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 15:16:24,820 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 15:16:24,821 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 15:16:24,821 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 15:16:24,821 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 15:16:24,821 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 15:16:24,822 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 15:16:24,822 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 15:16:24,822 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 15:16:24,823 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 15:16:24,823 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 15:16:24,823 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 15:16:24,823 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 15:16:24,824 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 15:16:24,824 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 15:16:24,824 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 15:16:24,825 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 15:16:24,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:16:24,825 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 15:16:24,825 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 15:16:24,826 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 15:16:24,826 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 15:16:24,826 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 15:16:24,826 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 15:16:24,826 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-11-17 15:16:25,036 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 15:16:25,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 15:16:25,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 15:16:25,067 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 15:16:25,067 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 15:16:25,068 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix053_tso.oepc.i [2023-11-17 15:16:26,313 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 15:16:26,563 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 15:16:26,569 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053_tso.oepc.i [2023-11-17 15:16:26,582 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/782928465/e0f82aba21574ff4b75abc34c40a7806/FLAG98c0be84e [2023-11-17 15:16:26,594 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/782928465/e0f82aba21574ff4b75abc34c40a7806 [2023-11-17 15:16:26,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 15:16:26,600 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 15:16:26,601 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 15:16:26,601 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 15:16:26,605 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 15:16:26,605 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:16:26" (1/1) ... [2023-11-17 15:16:26,606 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@225708f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:26, skipping insertion in model container [2023-11-17 15:16:26,606 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:16:26" (1/1) ... [2023-11-17 15:16:26,647 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 15:16:26,790 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/mix053_tso.oepc.i[949,962] [2023-11-17 15:16:27,027 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:16:27,042 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 15:16:27,053 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/mix053_tso.oepc.i[949,962] [2023-11-17 15:16:27,119 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:16:27,153 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:16:27,154 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:16:27,160 INFO L206 MainTranslator]: Completed translation [2023-11-17 15:16:27,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:27 WrapperNode [2023-11-17 15:16:27,161 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 15:16:27,162 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 15:16:27,162 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 15:16:27,162 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 15:16:27,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:27" (1/1) ... [2023-11-17 15:16:27,192 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:27" (1/1) ... [2023-11-17 15:16:27,217 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 159 [2023-11-17 15:16:27,218 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 15:16:27,218 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 15:16:27,218 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 15:16:27,218 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 15:16:27,227 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:27" (1/1) ... [2023-11-17 15:16:27,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:27" (1/1) ... [2023-11-17 15:16:27,231 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:27" (1/1) ... [2023-11-17 15:16:27,231 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:27" (1/1) ... [2023-11-17 15:16:27,239 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:27" (1/1) ... [2023-11-17 15:16:27,241 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:27" (1/1) ... [2023-11-17 15:16:27,243 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:27" (1/1) ... [2023-11-17 15:16:27,244 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:27" (1/1) ... [2023-11-17 15:16:27,248 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 15:16:27,249 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 15:16:27,249 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 15:16:27,249 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 15:16:27,250 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:27" (1/1) ... [2023-11-17 15:16:27,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:16:27,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:16:27,287 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 15:16:27,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 15:16:27,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 15:16:27,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 15:16:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 15:16:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 15:16:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 15:16:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 15:16:27,340 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 15:16:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 15:16:27,340 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 15:16:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 15:16:27,340 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 15:16:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-17 15:16:27,340 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-17 15:16:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 15:16:27,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 15:16:27,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 15:16:27,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 15:16:27,343 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 15:16:27,485 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 15:16:27,486 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 15:16:27,772 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 15:16:27,941 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 15:16:27,941 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 15:16:27,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:16:27 BoogieIcfgContainer [2023-11-17 15:16:27,943 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 15:16:27,945 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 15:16:27,945 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 15:16:27,948 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 15:16:27,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:16:26" (1/3) ... [2023-11-17 15:16:27,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c605c12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:16:27, skipping insertion in model container [2023-11-17 15:16:27,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:16:27" (2/3) ... [2023-11-17 15:16:27,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c605c12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:16:27, skipping insertion in model container [2023-11-17 15:16:27,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:16:27" (3/3) ... [2023-11-17 15:16:27,950 INFO L112 eAbstractionObserver]: Analyzing ICFG mix053_tso.oepc.i [2023-11-17 15:16:27,967 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 15:16:27,968 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 15:16:27,968 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 15:16:28,044 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 15:16:28,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 131 transitions, 278 flow [2023-11-17 15:16:28,161 INFO L124 PetriNetUnfolderBase]: 2/127 cut-off events. [2023-11-17 15:16:28,161 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:16:28,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2023-11-17 15:16:28,167 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 131 transitions, 278 flow [2023-11-17 15:16:28,171 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 127 transitions, 266 flow [2023-11-17 15:16:28,174 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:16:28,193 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 127 transitions, 266 flow [2023-11-17 15:16:28,195 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 127 transitions, 266 flow [2023-11-17 15:16:28,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 266 flow [2023-11-17 15:16:28,228 INFO L124 PetriNetUnfolderBase]: 2/127 cut-off events. [2023-11-17 15:16:28,228 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:16:28,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2023-11-17 15:16:28,231 INFO L119 LiptonReduction]: Number of co-enabled transitions 3262 [2023-11-17 15:16:33,217 INFO L134 LiptonReduction]: Checked pairs total: 8166 [2023-11-17 15:16:33,218 INFO L136 LiptonReduction]: Total number of compositions: 112 [2023-11-17 15:16:33,233 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:16:33,239 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;@5ad7cf95, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:16:33,239 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-17 15:16:33,243 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:16:33,243 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-11-17 15:16:33,243 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:16:33,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:16:33,244 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:16:33,245 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:16:33,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:16:33,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1438260119, now seen corresponding path program 1 times [2023-11-17 15:16:33,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:16:33,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938356684] [2023-11-17 15:16:33,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:16:33,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:16:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:16:33,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:16:33,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:16:33,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938356684] [2023-11-17 15:16:33,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938356684] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:16:33,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:16:33,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:16:33,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200039561] [2023-11-17 15:16:33,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:16:33,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:16:33,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:16:33,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:16:33,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:16:33,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 243 [2023-11-17 15:16:33,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:33,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:16:33,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 243 [2023-11-17 15:16:33,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:16:34,510 INFO L124 PetriNetUnfolderBase]: 2855/4235 cut-off events. [2023-11-17 15:16:34,510 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2023-11-17 15:16:34,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8311 conditions, 4235 events. 2855/4235 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 23388 event pairs, 545 based on Foata normal form. 0/4027 useless extension candidates. Maximal degree in co-relation 8299. Up to 3103 conditions per place. [2023-11-17 15:16:34,544 INFO L140 encePairwiseOnDemand]: 239/243 looper letters, 33 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2023-11-17 15:16:34,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 41 transitions, 171 flow [2023-11-17 15:16:34,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:16:34,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:16:34,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2023-11-17 15:16:34,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.532235939643347 [2023-11-17 15:16:34,563 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2023-11-17 15:16:34,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2023-11-17 15:16:34,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:16:34,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2023-11-17 15:16:34,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:34,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:34,581 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:34,583 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 388 transitions. [2023-11-17 15:16:34,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 41 transitions, 171 flow [2023-11-17 15:16:34,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 41 transitions, 166 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-17 15:16:34,591 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 64 flow [2023-11-17 15:16:34,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2023-11-17 15:16:34,597 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2023-11-17 15:16:34,597 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 64 flow [2023-11-17 15:16:34,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:34,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:16:34,598 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:16:34,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 15:16:34,599 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:16:34,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:16:34,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1888773053, now seen corresponding path program 1 times [2023-11-17 15:16:34,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:16:34,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570995149] [2023-11-17 15:16:34,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:16:34,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:16:34,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:16:34,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:16:34,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:16:34,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570995149] [2023-11-17 15:16:34,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570995149] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:16:34,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:16:34,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:16:34,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222359633] [2023-11-17 15:16:34,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:16:34,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:16:34,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:16:34,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:16:34,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:16:34,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 243 [2023-11-17 15:16:34,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:34,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:16:34,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 243 [2023-11-17 15:16:34,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:16:35,302 INFO L124 PetriNetUnfolderBase]: 3047/4342 cut-off events. [2023-11-17 15:16:35,302 INFO L125 PetriNetUnfolderBase]: For 278/278 co-relation queries the response was YES. [2023-11-17 15:16:35,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9004 conditions, 4342 events. 3047/4342 cut-off events. For 278/278 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 21617 event pairs, 1003 based on Foata normal form. 32/4357 useless extension candidates. Maximal degree in co-relation 8994. Up to 3903 conditions per place. [2023-11-17 15:16:35,336 INFO L140 encePairwiseOnDemand]: 239/243 looper letters, 37 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2023-11-17 15:16:35,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 43 transitions, 186 flow [2023-11-17 15:16:35,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:16:35,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:16:35,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2023-11-17 15:16:35,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5253772290809328 [2023-11-17 15:16:35,340 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 383 transitions. [2023-11-17 15:16:35,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 383 transitions. [2023-11-17 15:16:35,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:16:35,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 383 transitions. [2023-11-17 15:16:35,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:35,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:35,344 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:35,344 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 3 states and 383 transitions. [2023-11-17 15:16:35,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 43 transitions, 186 flow [2023-11-17 15:16:35,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 43 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:16:35,347 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 79 flow [2023-11-17 15:16:35,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=79, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2023-11-17 15:16:35,348 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2023-11-17 15:16:35,348 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 79 flow [2023-11-17 15:16:35,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:35,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:16:35,350 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:16:35,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 15:16:35,353 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:16:35,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:16:35,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1577579748, now seen corresponding path program 1 times [2023-11-17 15:16:35,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:16:35,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96898673] [2023-11-17 15:16:35,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:16:35,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:16:35,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:16:35,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:16:35,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:16:35,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96898673] [2023-11-17 15:16:35,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96898673] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:16:35,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:16:35,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:16:35,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859015398] [2023-11-17 15:16:35,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:16:35,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:16:35,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:16:35,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:16:35,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:16:35,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 243 [2023-11-17 15:16:35,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 79 flow. Second operand has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:35,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:16:35,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 243 [2023-11-17 15:16:35,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:16:36,773 INFO L124 PetriNetUnfolderBase]: 6156/8357 cut-off events. [2023-11-17 15:16:36,774 INFO L125 PetriNetUnfolderBase]: For 1226/1226 co-relation queries the response was YES. [2023-11-17 15:16:36,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18595 conditions, 8357 events. 6156/8357 cut-off events. For 1226/1226 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 37258 event pairs, 1432 based on Foata normal form. 30/8387 useless extension candidates. Maximal degree in co-relation 18584. Up to 7953 conditions per place. [2023-11-17 15:16:36,825 INFO L140 encePairwiseOnDemand]: 235/243 looper letters, 50 selfloop transitions, 9 changer transitions 0/59 dead transitions. [2023-11-17 15:16:36,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 59 transitions, 279 flow [2023-11-17 15:16:36,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:16:36,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:16:36,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 477 transitions. [2023-11-17 15:16:36,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49074074074074076 [2023-11-17 15:16:36,828 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 477 transitions. [2023-11-17 15:16:36,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 477 transitions. [2023-11-17 15:16:36,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:16:36,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 477 transitions. [2023-11-17 15:16:36,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:36,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:36,832 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:36,832 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 79 flow. Second operand 4 states and 477 transitions. [2023-11-17 15:16:36,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 59 transitions, 279 flow [2023-11-17 15:16:36,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 59 transitions, 274 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 15:16:36,835 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 136 flow [2023-11-17 15:16:36,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2023-11-17 15:16:36,836 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2023-11-17 15:16:36,837 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 136 flow [2023-11-17 15:16:36,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:36,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:16:36,837 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:16:36,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 15:16:36,838 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:16:36,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:16:36,838 INFO L85 PathProgramCache]: Analyzing trace with hash 2063969707, now seen corresponding path program 1 times [2023-11-17 15:16:36,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:16:36,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164001871] [2023-11-17 15:16:36,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:16:36,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:16:36,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:16:37,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:16:37,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:16:37,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164001871] [2023-11-17 15:16:37,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164001871] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:16:37,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:16:37,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:16:37,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332748326] [2023-11-17 15:16:37,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:16:37,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:16:37,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:16:37,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:16:37,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:16:37,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 243 [2023-11-17 15:16:37,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:37,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:16:37,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 243 [2023-11-17 15:16:37,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:16:37,942 INFO L124 PetriNetUnfolderBase]: 4124/5939 cut-off events. [2023-11-17 15:16:37,942 INFO L125 PetriNetUnfolderBase]: For 3709/3818 co-relation queries the response was YES. [2023-11-17 15:16:37,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15534 conditions, 5939 events. 4124/5939 cut-off events. For 3709/3818 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 30265 event pairs, 1143 based on Foata normal form. 80/5920 useless extension candidates. Maximal degree in co-relation 15520. Up to 4446 conditions per place. [2023-11-17 15:16:37,980 INFO L140 encePairwiseOnDemand]: 237/243 looper letters, 48 selfloop transitions, 11 changer transitions 0/64 dead transitions. [2023-11-17 15:16:37,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 64 transitions, 342 flow [2023-11-17 15:16:37,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:16:37,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:16:37,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 503 transitions. [2023-11-17 15:16:37,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5174897119341564 [2023-11-17 15:16:37,982 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 503 transitions. [2023-11-17 15:16:37,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 503 transitions. [2023-11-17 15:16:37,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:16:37,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 503 transitions. [2023-11-17 15:16:37,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:37,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:37,986 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:37,986 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 136 flow. Second operand 4 states and 503 transitions. [2023-11-17 15:16:37,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 64 transitions, 342 flow [2023-11-17 15:16:37,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 64 transitions, 342 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 15:16:37,992 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 199 flow [2023-11-17 15:16:37,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=199, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2023-11-17 15:16:37,993 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2023-11-17 15:16:37,994 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 199 flow [2023-11-17 15:16:37,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:37,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:16:37,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:16:37,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 15:16:37,995 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:16:37,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:16:37,995 INFO L85 PathProgramCache]: Analyzing trace with hash 2064087352, now seen corresponding path program 1 times [2023-11-17 15:16:37,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:16:37,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666106150] [2023-11-17 15:16:37,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:16:37,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:16:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:16:38,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:16:38,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:16:38,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666106150] [2023-11-17 15:16:38,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666106150] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:16:38,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:16:38,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:16:38,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462877599] [2023-11-17 15:16:38,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:16:38,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:16:38,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:16:38,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:16:38,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:16:38,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 243 [2023-11-17 15:16:38,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 199 flow. Second operand has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:38,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:16:38,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 243 [2023-11-17 15:16:38,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:16:39,234 INFO L124 PetriNetUnfolderBase]: 4076/5889 cut-off events. [2023-11-17 15:16:39,234 INFO L125 PetriNetUnfolderBase]: For 7312/7409 co-relation queries the response was YES. [2023-11-17 15:16:39,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17784 conditions, 5889 events. 4076/5889 cut-off events. For 7312/7409 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 30303 event pairs, 1045 based on Foata normal form. 84/5826 useless extension candidates. Maximal degree in co-relation 17766. Up to 5182 conditions per place. [2023-11-17 15:16:39,279 INFO L140 encePairwiseOnDemand]: 237/243 looper letters, 51 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2023-11-17 15:16:39,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 63 transitions, 387 flow [2023-11-17 15:16:39,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:16:39,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:16:39,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2023-11-17 15:16:39,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5061728395061729 [2023-11-17 15:16:39,282 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 492 transitions. [2023-11-17 15:16:39,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 492 transitions. [2023-11-17 15:16:39,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:16:39,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 492 transitions. [2023-11-17 15:16:39,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:39,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:39,286 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:39,286 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 199 flow. Second operand 4 states and 492 transitions. [2023-11-17 15:16:39,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 63 transitions, 387 flow [2023-11-17 15:16:39,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 63 transitions, 382 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 15:16:39,293 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 234 flow [2023-11-17 15:16:39,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=234, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2023-11-17 15:16:39,295 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2023-11-17 15:16:39,296 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 234 flow [2023-11-17 15:16:39,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:39,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:16:39,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:16:39,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 15:16:39,296 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:16:39,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:16:39,297 INFO L85 PathProgramCache]: Analyzing trace with hash -437876997, now seen corresponding path program 1 times [2023-11-17 15:16:39,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:16:39,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551384746] [2023-11-17 15:16:39,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:16:39,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:16:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:16:39,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:16:39,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:16:39,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551384746] [2023-11-17 15:16:39,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551384746] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:16:39,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:16:39,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:16:39,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414284207] [2023-11-17 15:16:39,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:16:39,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:16:39,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:16:39,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:16:39,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:16:39,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 243 [2023-11-17 15:16:39,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 234 flow. Second operand has 5 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:39,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:16:39,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 243 [2023-11-17 15:16:39,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:16:40,307 INFO L124 PetriNetUnfolderBase]: 3899/5664 cut-off events. [2023-11-17 15:16:40,307 INFO L125 PetriNetUnfolderBase]: For 9994/10151 co-relation queries the response was YES. [2023-11-17 15:16:40,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18003 conditions, 5664 events. 3899/5664 cut-off events. For 9994/10151 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 28996 event pairs, 917 based on Foata normal form. 168/5733 useless extension candidates. Maximal degree in co-relation 17983. Up to 4320 conditions per place. [2023-11-17 15:16:40,345 INFO L140 encePairwiseOnDemand]: 236/243 looper letters, 50 selfloop transitions, 14 changer transitions 0/69 dead transitions. [2023-11-17 15:16:40,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 69 transitions, 454 flow [2023-11-17 15:16:40,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:16:40,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:16:40,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 502 transitions. [2023-11-17 15:16:40,347 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5164609053497943 [2023-11-17 15:16:40,347 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 502 transitions. [2023-11-17 15:16:40,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 502 transitions. [2023-11-17 15:16:40,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:16:40,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 502 transitions. [2023-11-17 15:16:40,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:40,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:40,351 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:40,351 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 234 flow. Second operand 4 states and 502 transitions. [2023-11-17 15:16:40,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 69 transitions, 454 flow [2023-11-17 15:16:40,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 69 transitions, 436 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-17 15:16:40,360 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 300 flow [2023-11-17 15:16:40,361 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=300, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2023-11-17 15:16:40,362 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2023-11-17 15:16:40,363 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 300 flow [2023-11-17 15:16:40,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:40,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:16:40,364 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:16:40,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 15:16:40,364 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:16:40,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:16:40,364 INFO L85 PathProgramCache]: Analyzing trace with hash -437874703, now seen corresponding path program 1 times [2023-11-17 15:16:40,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:16:40,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131649878] [2023-11-17 15:16:40,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:16:40,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:16:40,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:16:40,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:16:40,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:16:40,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131649878] [2023-11-17 15:16:40,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131649878] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:16:40,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:16:40,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:16:40,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259952689] [2023-11-17 15:16:40,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:16:40,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:16:40,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:16:40,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:16:40,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:16:40,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 243 [2023-11-17 15:16:40,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 300 flow. Second operand has 5 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:40,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:16:40,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 243 [2023-11-17 15:16:40,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:16:41,452 INFO L124 PetriNetUnfolderBase]: 4545/6549 cut-off events. [2023-11-17 15:16:41,452 INFO L125 PetriNetUnfolderBase]: For 12827/12900 co-relation queries the response was YES. [2023-11-17 15:16:41,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22184 conditions, 6549 events. 4545/6549 cut-off events. For 12827/12900 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 34138 event pairs, 2781 based on Foata normal form. 60/6480 useless extension candidates. Maximal degree in co-relation 22162. Up to 5254 conditions per place. [2023-11-17 15:16:41,502 INFO L140 encePairwiseOnDemand]: 235/243 looper letters, 46 selfloop transitions, 22 changer transitions 0/73 dead transitions. [2023-11-17 15:16:41,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 73 transitions, 538 flow [2023-11-17 15:16:41,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:16:41,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:16:41,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 611 transitions. [2023-11-17 15:16:41,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.502880658436214 [2023-11-17 15:16:41,504 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 611 transitions. [2023-11-17 15:16:41,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 611 transitions. [2023-11-17 15:16:41,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:16:41,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 611 transitions. [2023-11-17 15:16:41,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.2) internal successors, (611), 5 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:41,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:41,508 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:41,508 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 300 flow. Second operand 5 states and 611 transitions. [2023-11-17 15:16:41,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 73 transitions, 538 flow [2023-11-17 15:16:41,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 73 transitions, 532 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 15:16:41,518 INFO L231 Difference]: Finished difference. Result has 58 places, 56 transitions, 435 flow [2023-11-17 15:16:41,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=435, PETRI_PLACES=58, PETRI_TRANSITIONS=56} [2023-11-17 15:16:41,520 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 17 predicate places. [2023-11-17 15:16:41,520 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 56 transitions, 435 flow [2023-11-17 15:16:41,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:41,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:16:41,521 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:16:41,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 15:16:41,521 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:16:41,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:16:41,521 INFO L85 PathProgramCache]: Analyzing trace with hash 171488485, now seen corresponding path program 2 times [2023-11-17 15:16:41,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:16:41,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915299404] [2023-11-17 15:16:41,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:16:41,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:16:41,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:16:41,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:16:41,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:16:41,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915299404] [2023-11-17 15:16:41,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915299404] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:16:41,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:16:41,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:16:41,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001703929] [2023-11-17 15:16:41,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:16:41,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:16:41,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:16:41,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:16:41,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:16:41,868 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 243 [2023-11-17 15:16:41,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 56 transitions, 435 flow. Second operand has 6 states, 6 states have (on average 114.33333333333333) internal successors, (686), 6 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:41,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:16:41,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 243 [2023-11-17 15:16:41,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:16:42,513 INFO L124 PetriNetUnfolderBase]: 4526/6566 cut-off events. [2023-11-17 15:16:42,514 INFO L125 PetriNetUnfolderBase]: For 22024/22161 co-relation queries the response was YES. [2023-11-17 15:16:42,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25111 conditions, 6566 events. 4526/6566 cut-off events. For 22024/22161 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 34635 event pairs, 2751 based on Foata normal form. 216/6661 useless extension candidates. Maximal degree in co-relation 25086. Up to 5068 conditions per place. [2023-11-17 15:16:42,562 INFO L140 encePairwiseOnDemand]: 237/243 looper letters, 43 selfloop transitions, 20 changer transitions 0/68 dead transitions. [2023-11-17 15:16:42,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 68 transitions, 592 flow [2023-11-17 15:16:42,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:16:42,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:16:42,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2023-11-17 15:16:42,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5010288065843621 [2023-11-17 15:16:42,564 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 487 transitions. [2023-11-17 15:16:42,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 487 transitions. [2023-11-17 15:16:42,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:16:42,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 487 transitions. [2023-11-17 15:16:42,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:42,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:42,567 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:42,567 INFO L175 Difference]: Start difference. First operand has 58 places, 56 transitions, 435 flow. Second operand 4 states and 487 transitions. [2023-11-17 15:16:42,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 68 transitions, 592 flow [2023-11-17 15:16:42,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 68 transitions, 575 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-11-17 15:16:42,600 INFO L231 Difference]: Finished difference. Result has 61 places, 58 transitions, 492 flow [2023-11-17 15:16:42,600 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=492, PETRI_PLACES=61, PETRI_TRANSITIONS=58} [2023-11-17 15:16:42,600 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 20 predicate places. [2023-11-17 15:16:42,601 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 58 transitions, 492 flow [2023-11-17 15:16:42,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.33333333333333) internal successors, (686), 6 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:42,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:16:42,601 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:16:42,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 15:16:42,601 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:16:42,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:16:42,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1972241099, now seen corresponding path program 1 times [2023-11-17 15:16:42,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:16:42,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690807177] [2023-11-17 15:16:42,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:16:42,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:16:42,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:16:43,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:16:43,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:16:43,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690807177] [2023-11-17 15:16:43,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690807177] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:16:43,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:16:43,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:16:43,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285773167] [2023-11-17 15:16:43,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:16:43,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:16:43,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:16:43,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:16:43,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:16:43,156 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 243 [2023-11-17 15:16:43,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 58 transitions, 492 flow. Second operand has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:43,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:16:43,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 243 [2023-11-17 15:16:43,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:16:44,067 INFO L124 PetriNetUnfolderBase]: 4975/7224 cut-off events. [2023-11-17 15:16:44,069 INFO L125 PetriNetUnfolderBase]: For 33642/33807 co-relation queries the response was YES. [2023-11-17 15:16:44,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30364 conditions, 7224 events. 4975/7224 cut-off events. For 33642/33807 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 38990 event pairs, 791 based on Foata normal form. 164/7225 useless extension candidates. Maximal degree in co-relation 30337. Up to 4858 conditions per place. [2023-11-17 15:16:44,114 INFO L140 encePairwiseOnDemand]: 235/243 looper letters, 83 selfloop transitions, 35 changer transitions 0/123 dead transitions. [2023-11-17 15:16:44,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 123 transitions, 1060 flow [2023-11-17 15:16:44,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 15:16:44,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 15:16:44,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 974 transitions. [2023-11-17 15:16:44,118 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5010288065843621 [2023-11-17 15:16:44,118 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 974 transitions. [2023-11-17 15:16:44,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 974 transitions. [2023-11-17 15:16:44,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:16:44,118 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 974 transitions. [2023-11-17 15:16:44,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 121.75) internal successors, (974), 8 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:44,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 243.0) internal successors, (2187), 9 states have internal predecessors, (2187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:44,124 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 243.0) internal successors, (2187), 9 states have internal predecessors, (2187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:44,124 INFO L175 Difference]: Start difference. First operand has 61 places, 58 transitions, 492 flow. Second operand 8 states and 974 transitions. [2023-11-17 15:16:44,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 123 transitions, 1060 flow [2023-11-17 15:16:44,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 123 transitions, 977 flow, removed 12 selfloop flow, removed 4 redundant places. [2023-11-17 15:16:44,191 INFO L231 Difference]: Finished difference. Result has 67 places, 74 transitions, 714 flow [2023-11-17 15:16:44,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=714, PETRI_PLACES=67, PETRI_TRANSITIONS=74} [2023-11-17 15:16:44,192 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 26 predicate places. [2023-11-17 15:16:44,192 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 74 transitions, 714 flow [2023-11-17 15:16:44,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:44,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:16:44,193 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:16:44,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 15:16:44,193 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:16:44,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:16:44,193 INFO L85 PathProgramCache]: Analyzing trace with hash -689217299, now seen corresponding path program 2 times [2023-11-17 15:16:44,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:16:44,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222086491] [2023-11-17 15:16:44,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:16:44,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:16:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:16:44,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:16:44,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:16:44,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222086491] [2023-11-17 15:16:44,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222086491] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:16:44,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:16:44,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:16:44,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842183454] [2023-11-17 15:16:44,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:16:44,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:16:44,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:16:44,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:16:44,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:16:44,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 243 [2023-11-17 15:16:44,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 74 transitions, 714 flow. Second operand has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:44,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:16:44,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 243 [2023-11-17 15:16:44,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:16:45,657 INFO L124 PetriNetUnfolderBase]: 5303/7740 cut-off events. [2023-11-17 15:16:45,657 INFO L125 PetriNetUnfolderBase]: For 31699/31986 co-relation queries the response was YES. [2023-11-17 15:16:45,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32396 conditions, 7740 events. 5303/7740 cut-off events. For 31699/31986 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 42615 event pairs, 1113 based on Foata normal form. 254/7823 useless extension candidates. Maximal degree in co-relation 32368. Up to 5660 conditions per place. [2023-11-17 15:16:45,717 INFO L140 encePairwiseOnDemand]: 235/243 looper letters, 78 selfloop transitions, 26 changer transitions 0/109 dead transitions. [2023-11-17 15:16:45,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 109 transitions, 1069 flow [2023-11-17 15:16:45,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:16:45,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:16:45,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2023-11-17 15:16:45,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49135802469135803 [2023-11-17 15:16:45,720 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 597 transitions. [2023-11-17 15:16:45,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 597 transitions. [2023-11-17 15:16:45,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:16:45,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 597 transitions. [2023-11-17 15:16:45,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:45,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:45,724 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:45,724 INFO L175 Difference]: Start difference. First operand has 67 places, 74 transitions, 714 flow. Second operand 5 states and 597 transitions. [2023-11-17 15:16:45,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 109 transitions, 1069 flow [2023-11-17 15:16:45,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 109 transitions, 1031 flow, removed 19 selfloop flow, removed 0 redundant places. [2023-11-17 15:16:45,864 INFO L231 Difference]: Finished difference. Result has 72 places, 78 transitions, 793 flow [2023-11-17 15:16:45,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=793, PETRI_PLACES=72, PETRI_TRANSITIONS=78} [2023-11-17 15:16:45,865 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 31 predicate places. [2023-11-17 15:16:45,865 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 78 transitions, 793 flow [2023-11-17 15:16:45,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:45,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:16:45,866 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:16:45,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 15:16:45,866 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:16:45,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:16:45,866 INFO L85 PathProgramCache]: Analyzing trace with hash -800039819, now seen corresponding path program 3 times [2023-11-17 15:16:45,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:16:45,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107328492] [2023-11-17 15:16:45,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:16:45,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:16:45,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:16:46,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:16:46,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:16:46,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107328492] [2023-11-17 15:16:46,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107328492] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:16:46,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:16:46,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:16:46,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872470122] [2023-11-17 15:16:46,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:16:46,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 15:16:46,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:16:46,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 15:16:46,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-17 15:16:46,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 243 [2023-11-17 15:16:46,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 78 transitions, 793 flow. Second operand has 7 states, 7 states have (on average 109.14285714285714) internal successors, (764), 7 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:46,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:16:46,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 243 [2023-11-17 15:16:46,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:16:47,457 INFO L124 PetriNetUnfolderBase]: 5583/8256 cut-off events. [2023-11-17 15:16:47,457 INFO L125 PetriNetUnfolderBase]: For 39373/39612 co-relation queries the response was YES. [2023-11-17 15:16:47,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35495 conditions, 8256 events. 5583/8256 cut-off events. For 39373/39612 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 47144 event pairs, 1047 based on Foata normal form. 274/8363 useless extension candidates. Maximal degree in co-relation 35464. Up to 4688 conditions per place. [2023-11-17 15:16:47,518 INFO L140 encePairwiseOnDemand]: 236/243 looper letters, 76 selfloop transitions, 38 changer transitions 0/119 dead transitions. [2023-11-17 15:16:47,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 119 transitions, 1213 flow [2023-11-17 15:16:47,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:16:47,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:16:47,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 599 transitions. [2023-11-17 15:16:47,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49300411522633747 [2023-11-17 15:16:47,521 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 599 transitions. [2023-11-17 15:16:47,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 599 transitions. [2023-11-17 15:16:47,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:16:47,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 599 transitions. [2023-11-17 15:16:47,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:47,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:47,525 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:47,525 INFO L175 Difference]: Start difference. First operand has 72 places, 78 transitions, 793 flow. Second operand 5 states and 599 transitions. [2023-11-17 15:16:47,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 119 transitions, 1213 flow [2023-11-17 15:16:47,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 119 transitions, 1164 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-17 15:16:47,624 INFO L231 Difference]: Finished difference. Result has 74 places, 82 transitions, 899 flow [2023-11-17 15:16:47,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=899, PETRI_PLACES=74, PETRI_TRANSITIONS=82} [2023-11-17 15:16:47,625 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 33 predicate places. [2023-11-17 15:16:47,625 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 82 transitions, 899 flow [2023-11-17 15:16:47,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.14285714285714) internal successors, (764), 7 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:47,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:16:47,626 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:16:47,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 15:16:47,626 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:16:47,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:16:47,626 INFO L85 PathProgramCache]: Analyzing trace with hash -687047113, now seen corresponding path program 1 times [2023-11-17 15:16:47,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:16:47,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500970032] [2023-11-17 15:16:47,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:16:47,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:16:47,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:16:47,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:16:47,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:16:47,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500970032] [2023-11-17 15:16:47,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500970032] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:16:47,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:16:47,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:16:47,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5603461] [2023-11-17 15:16:47,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:16:47,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:16:47,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:16:47,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:16:47,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:16:47,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 243 [2023-11-17 15:16:47,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 82 transitions, 899 flow. Second operand has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:47,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:16:47,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 243 [2023-11-17 15:16:47,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:16:48,526 INFO L124 PetriNetUnfolderBase]: 4647/6958 cut-off events. [2023-11-17 15:16:48,526 INFO L125 PetriNetUnfolderBase]: For 50408/51313 co-relation queries the response was YES. [2023-11-17 15:16:48,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31806 conditions, 6958 events. 4647/6958 cut-off events. For 50408/51313 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 41232 event pairs, 900 based on Foata normal form. 1274/8139 useless extension candidates. Maximal degree in co-relation 31774. Up to 4401 conditions per place. [2023-11-17 15:16:48,566 INFO L140 encePairwiseOnDemand]: 236/243 looper letters, 188 selfloop transitions, 10 changer transitions 11/218 dead transitions. [2023-11-17 15:16:48,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 218 transitions, 2876 flow [2023-11-17 15:16:48,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:16:48,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:16:48,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2023-11-17 15:16:48,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2023-11-17 15:16:48,568 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 594 transitions. [2023-11-17 15:16:48,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 594 transitions. [2023-11-17 15:16:48,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:16:48,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 594 transitions. [2023-11-17 15:16:48,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:48,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:48,572 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:48,572 INFO L175 Difference]: Start difference. First operand has 74 places, 82 transitions, 899 flow. Second operand 5 states and 594 transitions. [2023-11-17 15:16:48,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 218 transitions, 2876 flow [2023-11-17 15:16:48,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 218 transitions, 2711 flow, removed 13 selfloop flow, removed 3 redundant places. [2023-11-17 15:16:48,642 INFO L231 Difference]: Finished difference. Result has 78 places, 91 transitions, 937 flow [2023-11-17 15:16:48,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=937, PETRI_PLACES=78, PETRI_TRANSITIONS=91} [2023-11-17 15:16:48,643 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 37 predicate places. [2023-11-17 15:16:48,643 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 91 transitions, 937 flow [2023-11-17 15:16:48,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:48,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:16:48,643 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:16:48,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-17 15:16:48,644 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:16:48,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:16:48,644 INFO L85 PathProgramCache]: Analyzing trace with hash 366005070, now seen corresponding path program 1 times [2023-11-17 15:16:48,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:16:48,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519516867] [2023-11-17 15:16:48,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:16:48,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:16:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:16:48,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:16:48,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:16:48,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519516867] [2023-11-17 15:16:48,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519516867] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:16:48,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:16:48,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:16:48,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639744574] [2023-11-17 15:16:48,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:16:48,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:16:48,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:16:48,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:16:48,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:16:48,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 243 [2023-11-17 15:16:48,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 91 transitions, 937 flow. Second operand has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:48,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:16:48,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 243 [2023-11-17 15:16:48,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:16:49,523 INFO L124 PetriNetUnfolderBase]: 3691/5663 cut-off events. [2023-11-17 15:16:49,523 INFO L125 PetriNetUnfolderBase]: For 42174/43073 co-relation queries the response was YES. [2023-11-17 15:16:49,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28106 conditions, 5663 events. 3691/5663 cut-off events. For 42174/43073 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 34150 event pairs, 331 based on Foata normal form. 1098/6703 useless extension candidates. Maximal degree in co-relation 28071. Up to 1824 conditions per place. [2023-11-17 15:16:49,550 INFO L140 encePairwiseOnDemand]: 236/243 looper letters, 221 selfloop transitions, 19 changer transitions 25/274 dead transitions. [2023-11-17 15:16:49,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 274 transitions, 3413 flow [2023-11-17 15:16:49,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:16:49,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:16:49,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 833 transitions. [2023-11-17 15:16:49,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4897119341563786 [2023-11-17 15:16:49,553 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 833 transitions. [2023-11-17 15:16:49,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 833 transitions. [2023-11-17 15:16:49,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:16:49,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 833 transitions. [2023-11-17 15:16:49,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:49,558 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 243.0) internal successors, (1944), 8 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:49,558 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 243.0) internal successors, (1944), 8 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:49,558 INFO L175 Difference]: Start difference. First operand has 78 places, 91 transitions, 937 flow. Second operand 7 states and 833 transitions. [2023-11-17 15:16:49,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 274 transitions, 3413 flow [2023-11-17 15:16:49,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 274 transitions, 3279 flow, removed 1 selfloop flow, removed 5 redundant places. [2023-11-17 15:16:49,608 INFO L231 Difference]: Finished difference. Result has 82 places, 93 transitions, 937 flow [2023-11-17 15:16:49,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=793, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=937, PETRI_PLACES=82, PETRI_TRANSITIONS=93} [2023-11-17 15:16:49,609 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 41 predicate places. [2023-11-17 15:16:49,609 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 93 transitions, 937 flow [2023-11-17 15:16:49,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:49,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:16:49,609 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:16:49,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-17 15:16:49,610 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:16:49,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:16:49,610 INFO L85 PathProgramCache]: Analyzing trace with hash 554074385, now seen corresponding path program 1 times [2023-11-17 15:16:49,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:16:49,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134768978] [2023-11-17 15:16:49,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:16:49,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:16:49,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:16:49,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:16:49,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:16:49,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134768978] [2023-11-17 15:16:49,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134768978] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:16:49,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:16:49,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:16:49,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091245816] [2023-11-17 15:16:49,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:16:49,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:16:49,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:16:49,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:16:49,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:16:49,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 243 [2023-11-17 15:16:49,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 93 transitions, 937 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:49,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:16:49,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 243 [2023-11-17 15:16:49,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:16:50,738 INFO L124 PetriNetUnfolderBase]: 5691/8792 cut-off events. [2023-11-17 15:16:50,738 INFO L125 PetriNetUnfolderBase]: For 63996/65050 co-relation queries the response was YES. [2023-11-17 15:16:50,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47526 conditions, 8792 events. 5691/8792 cut-off events. For 63996/65050 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 57093 event pairs, 1701 based on Foata normal form. 871/9573 useless extension candidates. Maximal degree in co-relation 47490. Up to 5158 conditions per place. [2023-11-17 15:16:50,775 INFO L140 encePairwiseOnDemand]: 240/243 looper letters, 123 selfloop transitions, 3 changer transitions 38/171 dead transitions. [2023-11-17 15:16:50,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 171 transitions, 2082 flow [2023-11-17 15:16:50,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:16:50,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:16:50,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2023-11-17 15:16:50,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5267489711934157 [2023-11-17 15:16:50,777 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2023-11-17 15:16:50,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2023-11-17 15:16:50,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:16:50,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2023-11-17 15:16:50,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:50,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:50,780 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:50,780 INFO L175 Difference]: Start difference. First operand has 82 places, 93 transitions, 937 flow. Second operand 3 states and 384 transitions. [2023-11-17 15:16:50,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 171 transitions, 2082 flow [2023-11-17 15:16:51,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 171 transitions, 1993 flow, removed 34 selfloop flow, removed 2 redundant places. [2023-11-17 15:16:51,036 INFO L231 Difference]: Finished difference. Result has 83 places, 88 transitions, 865 flow [2023-11-17 15:16:51,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=865, PETRI_PLACES=83, PETRI_TRANSITIONS=88} [2023-11-17 15:16:51,037 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 42 predicate places. [2023-11-17 15:16:51,037 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 88 transitions, 865 flow [2023-11-17 15:16:51,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:51,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:16:51,037 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:16:51,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-17 15:16:51,037 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:16:51,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:16:51,038 INFO L85 PathProgramCache]: Analyzing trace with hash 360506122, now seen corresponding path program 1 times [2023-11-17 15:16:51,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:16:51,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749131127] [2023-11-17 15:16:51,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:16:51,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:16:51,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:16:51,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:16:51,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:16:51,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749131127] [2023-11-17 15:16:51,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749131127] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:16:51,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:16:51,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:16:51,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288695700] [2023-11-17 15:16:51,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:16:51,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:16:51,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:16:51,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:16:51,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:16:51,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 243 [2023-11-17 15:16:51,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 88 transitions, 865 flow. Second operand has 6 states, 6 states have (on average 108.83333333333333) internal successors, (653), 6 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:51,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:16:51,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 243 [2023-11-17 15:16:51,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:16:51,959 INFO L124 PetriNetUnfolderBase]: 3298/5097 cut-off events. [2023-11-17 15:16:51,959 INFO L125 PetriNetUnfolderBase]: For 39171/40025 co-relation queries the response was YES. [2023-11-17 15:16:51,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26160 conditions, 5097 events. 3298/5097 cut-off events. For 39171/40025 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 31170 event pairs, 258 based on Foata normal form. 912/5954 useless extension candidates. Maximal degree in co-relation 26123. Up to 1630 conditions per place. [2023-11-17 15:16:51,987 INFO L140 encePairwiseOnDemand]: 236/243 looper letters, 188 selfloop transitions, 22 changer transitions 75/294 dead transitions. [2023-11-17 15:16:51,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 294 transitions, 3565 flow [2023-11-17 15:16:51,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 15:16:51,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-17 15:16:51,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1065 transitions. [2023-11-17 15:16:51,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4869684499314129 [2023-11-17 15:16:51,990 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1065 transitions. [2023-11-17 15:16:51,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1065 transitions. [2023-11-17 15:16:51,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:16:51,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1065 transitions. [2023-11-17 15:16:51,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 118.33333333333333) internal successors, (1065), 9 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:51,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 243.0) internal successors, (2430), 10 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:51,997 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 243.0) internal successors, (2430), 10 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:51,997 INFO L175 Difference]: Start difference. First operand has 83 places, 88 transitions, 865 flow. Second operand 9 states and 1065 transitions. [2023-11-17 15:16:51,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 294 transitions, 3565 flow [2023-11-17 15:16:52,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 294 transitions, 3430 flow, removed 18 selfloop flow, removed 4 redundant places. [2023-11-17 15:16:52,064 INFO L231 Difference]: Finished difference. Result has 89 places, 86 transitions, 862 flow [2023-11-17 15:16:52,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=862, PETRI_PLACES=89, PETRI_TRANSITIONS=86} [2023-11-17 15:16:52,064 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 48 predicate places. [2023-11-17 15:16:52,065 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 86 transitions, 862 flow [2023-11-17 15:16:52,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.83333333333333) internal successors, (653), 6 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:52,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:16:52,065 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:16:52,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-17 15:16:52,065 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:16:52,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:16:52,066 INFO L85 PathProgramCache]: Analyzing trace with hash 117279201, now seen corresponding path program 1 times [2023-11-17 15:16:52,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:16:52,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399091921] [2023-11-17 15:16:52,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:16:52,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:16:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:16:52,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:16:52,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:16:52,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399091921] [2023-11-17 15:16:52,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399091921] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:16:52,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:16:52,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:16:52,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206091689] [2023-11-17 15:16:52,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:16:52,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 15:16:52,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:16:52,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 15:16:52,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-17 15:16:52,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 243 [2023-11-17 15:16:52,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 86 transitions, 862 flow. Second operand has 7 states, 7 states have (on average 108.71428571428571) internal successors, (761), 7 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:52,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:16:52,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 243 [2023-11-17 15:16:52,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:16:53,203 INFO L124 PetriNetUnfolderBase]: 3192/4952 cut-off events. [2023-11-17 15:16:53,203 INFO L125 PetriNetUnfolderBase]: For 34443/35128 co-relation queries the response was YES. [2023-11-17 15:16:53,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26928 conditions, 4952 events. 3192/4952 cut-off events. For 34443/35128 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 30596 event pairs, 250 based on Foata normal form. 593/5492 useless extension candidates. Maximal degree in co-relation 26889. Up to 1547 conditions per place. [2023-11-17 15:16:53,238 INFO L140 encePairwiseOnDemand]: 236/243 looper letters, 152 selfloop transitions, 23 changer transitions 109/292 dead transitions. [2023-11-17 15:16:53,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 292 transitions, 3489 flow [2023-11-17 15:16:53,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-17 15:16:53,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-17 15:16:53,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1277 transitions. [2023-11-17 15:16:53,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4777403666292555 [2023-11-17 15:16:53,242 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1277 transitions. [2023-11-17 15:16:53,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1277 transitions. [2023-11-17 15:16:53,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:16:53,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1277 transitions. [2023-11-17 15:16:53,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 116.0909090909091) internal successors, (1277), 11 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:53,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 243.0) internal successors, (2916), 12 states have internal predecessors, (2916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:53,251 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 243.0) internal successors, (2916), 12 states have internal predecessors, (2916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:53,251 INFO L175 Difference]: Start difference. First operand has 89 places, 86 transitions, 862 flow. Second operand 11 states and 1277 transitions. [2023-11-17 15:16:53,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 292 transitions, 3489 flow [2023-11-17 15:16:53,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 292 transitions, 3227 flow, removed 37 selfloop flow, removed 6 redundant places. [2023-11-17 15:16:53,450 INFO L231 Difference]: Finished difference. Result has 96 places, 79 transitions, 732 flow [2023-11-17 15:16:53,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=732, PETRI_PLACES=96, PETRI_TRANSITIONS=79} [2023-11-17 15:16:53,451 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 55 predicate places. [2023-11-17 15:16:53,451 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 79 transitions, 732 flow [2023-11-17 15:16:53,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.71428571428571) internal successors, (761), 7 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:53,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:16:53,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:16:53,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-17 15:16:53,452 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:16:53,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:16:53,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1456254424, now seen corresponding path program 1 times [2023-11-17 15:16:53,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:16:53,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623628902] [2023-11-17 15:16:53,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:16:53,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:16:53,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:16:53,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:16:53,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:16:53,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623628902] [2023-11-17 15:16:53,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623628902] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:16:53,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:16:53,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:16:53,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556891911] [2023-11-17 15:16:53,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:16:53,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:16:53,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:16:53,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:16:53,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:16:53,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 243 [2023-11-17 15:16:53,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 79 transitions, 732 flow. Second operand has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:53,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:16:53,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 243 [2023-11-17 15:16:53,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:16:54,122 INFO L124 PetriNetUnfolderBase]: 2115/3514 cut-off events. [2023-11-17 15:16:54,122 INFO L125 PetriNetUnfolderBase]: For 19787/19914 co-relation queries the response was YES. [2023-11-17 15:16:54,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18863 conditions, 3514 events. 2115/3514 cut-off events. For 19787/19914 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 21939 event pairs, 417 based on Foata normal form. 92/3571 useless extension candidates. Maximal degree in co-relation 18822. Up to 1988 conditions per place. [2023-11-17 15:16:54,140 INFO L140 encePairwiseOnDemand]: 240/243 looper letters, 74 selfloop transitions, 1 changer transitions 79/160 dead transitions. [2023-11-17 15:16:54,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 160 transitions, 1810 flow [2023-11-17 15:16:54,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:16:54,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:16:54,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 501 transitions. [2023-11-17 15:16:54,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5154320987654321 [2023-11-17 15:16:54,142 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 501 transitions. [2023-11-17 15:16:54,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 501 transitions. [2023-11-17 15:16:54,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:16:54,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 501 transitions. [2023-11-17 15:16:54,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.25) internal successors, (501), 4 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:54,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:54,145 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:54,145 INFO L175 Difference]: Start difference. First operand has 96 places, 79 transitions, 732 flow. Second operand 4 states and 501 transitions. [2023-11-17 15:16:54,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 160 transitions, 1810 flow [2023-11-17 15:16:54,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 160 transitions, 1521 flow, removed 69 selfloop flow, removed 16 redundant places. [2023-11-17 15:16:54,217 INFO L231 Difference]: Finished difference. Result has 82 places, 69 transitions, 512 flow [2023-11-17 15:16:54,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=512, PETRI_PLACES=82, PETRI_TRANSITIONS=69} [2023-11-17 15:16:54,217 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 41 predicate places. [2023-11-17 15:16:54,218 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 69 transitions, 512 flow [2023-11-17 15:16:54,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:54,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:16:54,218 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:16:54,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-17 15:16:54,218 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:16:54,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:16:54,219 INFO L85 PathProgramCache]: Analyzing trace with hash 845066318, now seen corresponding path program 2 times [2023-11-17 15:16:54,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:16:54,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596995967] [2023-11-17 15:16:54,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:16:54,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:16:54,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:16:55,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:16:55,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:16:55,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596995967] [2023-11-17 15:16:55,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596995967] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:16:55,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:16:55,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:16:55,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495917043] [2023-11-17 15:16:55,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:16:55,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 15:16:55,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:16:55,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 15:16:55,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-17 15:16:55,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 243 [2023-11-17 15:16:55,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 69 transitions, 512 flow. Second operand has 8 states, 8 states have (on average 110.875) internal successors, (887), 8 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:55,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:16:55,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 243 [2023-11-17 15:16:55,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:16:55,420 INFO L124 PetriNetUnfolderBase]: 939/1607 cut-off events. [2023-11-17 15:16:55,420 INFO L125 PetriNetUnfolderBase]: For 4695/4702 co-relation queries the response was YES. [2023-11-17 15:16:55,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6790 conditions, 1607 events. 939/1607 cut-off events. For 4695/4702 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8215 event pairs, 52 based on Foata normal form. 8/1612 useless extension candidates. Maximal degree in co-relation 6766. Up to 549 conditions per place. [2023-11-17 15:16:55,430 INFO L140 encePairwiseOnDemand]: 237/243 looper letters, 81 selfloop transitions, 28 changer transitions 35/147 dead transitions. [2023-11-17 15:16:55,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 147 transitions, 1236 flow [2023-11-17 15:16:55,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:16:55,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:16:55,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 829 transitions. [2023-11-17 15:16:55,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48736037624926515 [2023-11-17 15:16:55,433 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 829 transitions. [2023-11-17 15:16:55,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 829 transitions. [2023-11-17 15:16:55,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:16:55,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 829 transitions. [2023-11-17 15:16:55,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.42857142857143) internal successors, (829), 7 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:55,443 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 243.0) internal successors, (1944), 8 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:55,444 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 243.0) internal successors, (1944), 8 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:55,444 INFO L175 Difference]: Start difference. First operand has 82 places, 69 transitions, 512 flow. Second operand 7 states and 829 transitions. [2023-11-17 15:16:55,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 147 transitions, 1236 flow [2023-11-17 15:16:55,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 147 transitions, 1193 flow, removed 18 selfloop flow, removed 6 redundant places. [2023-11-17 15:16:55,463 INFO L231 Difference]: Finished difference. Result has 76 places, 69 transitions, 586 flow [2023-11-17 15:16:55,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=586, PETRI_PLACES=76, PETRI_TRANSITIONS=69} [2023-11-17 15:16:55,464 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 35 predicate places. [2023-11-17 15:16:55,464 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 69 transitions, 586 flow [2023-11-17 15:16:55,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 110.875) internal successors, (887), 8 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:55,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:16:55,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:16:55,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-17 15:16:55,464 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:16:55,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:16:55,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1473715992, now seen corresponding path program 3 times [2023-11-17 15:16:55,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:16:55,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461407295] [2023-11-17 15:16:55,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:16:55,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:16:55,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:16:55,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:16:55,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:16:55,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461407295] [2023-11-17 15:16:55,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461407295] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:16:55,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:16:55,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:16:55,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585899346] [2023-11-17 15:16:55,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:16:55,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:16:55,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:16:55,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:16:55,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:16:55,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 243 [2023-11-17 15:16:55,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 69 transitions, 586 flow. Second operand has 5 states, 5 states have (on average 105.2) internal successors, (526), 5 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:55,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:16:55,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 243 [2023-11-17 15:16:55,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:16:56,333 INFO L124 PetriNetUnfolderBase]: 1344/2174 cut-off events. [2023-11-17 15:16:56,333 INFO L125 PetriNetUnfolderBase]: For 8329/8329 co-relation queries the response was YES. [2023-11-17 15:16:56,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9616 conditions, 2174 events. 1344/2174 cut-off events. For 8329/8329 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10799 event pairs, 156 based on Foata normal form. 1/2175 useless extension candidates. Maximal degree in co-relation 9586. Up to 807 conditions per place. [2023-11-17 15:16:56,340 INFO L140 encePairwiseOnDemand]: 233/243 looper letters, 50 selfloop transitions, 6 changer transitions 113/169 dead transitions. [2023-11-17 15:16:56,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 169 transitions, 1696 flow [2023-11-17 15:16:56,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:16:56,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:16:56,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 674 transitions. [2023-11-17 15:16:56,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46227709190672156 [2023-11-17 15:16:56,342 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 674 transitions. [2023-11-17 15:16:56,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 674 transitions. [2023-11-17 15:16:56,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:16:56,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 674 transitions. [2023-11-17 15:16:56,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 112.33333333333333) internal successors, (674), 6 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:56,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 243.0) internal successors, (1701), 7 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:56,346 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 243.0) internal successors, (1701), 7 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:56,346 INFO L175 Difference]: Start difference. First operand has 76 places, 69 transitions, 586 flow. Second operand 6 states and 674 transitions. [2023-11-17 15:16:56,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 169 transitions, 1696 flow [2023-11-17 15:16:56,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 169 transitions, 1591 flow, removed 25 selfloop flow, removed 4 redundant places. [2023-11-17 15:16:56,374 INFO L231 Difference]: Finished difference. Result has 81 places, 50 transitions, 358 flow [2023-11-17 15:16:56,374 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=533, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=358, PETRI_PLACES=81, PETRI_TRANSITIONS=50} [2023-11-17 15:16:56,374 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 40 predicate places. [2023-11-17 15:16:56,375 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 50 transitions, 358 flow [2023-11-17 15:16:56,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.2) internal successors, (526), 5 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:16:56,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:16:56,375 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:16:56,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-17 15:16:56,375 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:16:56,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:16:56,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1830649164, now seen corresponding path program 4 times [2023-11-17 15:16:56,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:16:56,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598915561] [2023-11-17 15:16:56,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:16:56,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:16:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:16:56,415 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 15:16:56,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:16:56,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 15:16:56,501 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 15:16:56,502 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-17 15:16:56,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-17 15:16:56,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-17 15:16:56,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-17 15:16:56,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-17 15:16:56,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-17 15:16:56,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-17 15:16:56,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-17 15:16:56,505 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:16:56,511 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 15:16:56,511 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 15:16:56,570 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-17 15:16:56,572 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-17 15:16:56,574 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 15:16:56,579 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-17 15:16:56,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:16:56 BasicIcfg [2023-11-17 15:16:56,603 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 15:16:56,603 INFO L158 Benchmark]: Toolchain (without parser) took 30003.91ms. Allocated memory was 331.4MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 271.0MB in the beginning and 1.2GB in the end (delta: -915.0MB). Peak memory consumption was 593.4MB. Max. memory is 8.0GB. [2023-11-17 15:16:56,604 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 191.9MB. Free memory is still 145.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 15:16:56,604 INFO L158 Benchmark]: CACSL2BoogieTranslator took 560.34ms. Allocated memory is still 331.4MB. Free memory was 270.5MB in the beginning and 246.8MB in the end (delta: 23.7MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-11-17 15:16:56,604 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.67ms. Allocated memory is still 331.4MB. Free memory was 246.8MB in the beginning and 243.8MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 15:16:56,604 INFO L158 Benchmark]: Boogie Preprocessor took 30.01ms. Allocated memory is still 331.4MB. Free memory was 243.8MB in the beginning and 242.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-11-17 15:16:56,604 INFO L158 Benchmark]: RCFGBuilder took 693.86ms. Allocated memory is still 331.4MB. Free memory was 242.2MB in the beginning and 292.0MB in the end (delta: -49.8MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. [2023-11-17 15:16:56,605 INFO L158 Benchmark]: TraceAbstraction took 28658.02ms. Allocated memory was 331.4MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 291.0MB in the beginning and 1.2GB in the end (delta: -895.0MB). Peak memory consumption was 612.3MB. Max. memory is 8.0GB. [2023-11-17 15:16:56,606 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.17ms. Allocated memory is still 191.9MB. Free memory is still 145.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 560.34ms. Allocated memory is still 331.4MB. Free memory was 270.5MB in the beginning and 246.8MB in the end (delta: 23.7MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.67ms. Allocated memory is still 331.4MB. Free memory was 246.8MB in the beginning and 243.8MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.01ms. Allocated memory is still 331.4MB. Free memory was 243.8MB in the beginning and 242.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 693.86ms. Allocated memory is still 331.4MB. Free memory was 242.2MB in the beginning and 292.0MB in the end (delta: -49.8MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. * TraceAbstraction took 28658.02ms. Allocated memory was 331.4MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 291.0MB in the beginning and 1.2GB in the end (delta: -895.0MB). Peak memory consumption was 612.3MB. 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 Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.0s, 138 PlacesBefore, 41 PlacesAfterwards, 127 TransitionsBefore, 29 TransitionsAfterwards, 3262 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 63 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 112 TotalNumberOfCompositions, 8166 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3813, independent: 3596, independent conditional: 0, independent unconditional: 3596, dependent: 217, dependent conditional: 0, dependent unconditional: 217, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2319, independent: 2245, independent conditional: 0, independent unconditional: 2245, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2319, independent: 2214, independent conditional: 0, independent unconditional: 2214, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 105, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 478, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 438, dependent conditional: 0, dependent unconditional: 438, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3813, independent: 1351, independent conditional: 0, independent unconditional: 1351, dependent: 143, dependent conditional: 0, dependent unconditional: 143, unknown: 2319, unknown conditional: 0, unknown unconditional: 2319] , Statistics on independence cache: Total cache size (in pairs): 205, Positive cache size: 169, Positive conditional cache size: 0, Positive unconditional cache size: 169, Negative cache size: 36, Negative conditional cache size: 0, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff0_thd4; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$r_buff1_thd4; [L735] 0 _Bool y$read_delayed; [L736] 0 int *y$read_delayed_var; [L737] 0 int y$w_buff0; [L738] 0 _Bool y$w_buff0_used; [L739] 0 int y$w_buff1; [L740] 0 _Bool y$w_buff1_used; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L841] 0 pthread_t t1433; [L842] FCALL, FORK 0 pthread_create(&t1433, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1433={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L843] 0 pthread_t t1434; [L844] FCALL, FORK 0 pthread_create(&t1434, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1433={5:0}, t1434={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L845] 0 pthread_t t1435; [L846] FCALL, FORK 0 pthread_create(&t1435, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1433={5:0}, t1434={6:0}, t1435={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L847] 0 pthread_t t1436; [L848] FCALL, FORK 0 pthread_create(&t1436, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1433={5:0}, t1434={6:0}, t1435={7:0}, t1436={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L783] 3 y$w_buff1 = y$w_buff0 [L784] 3 y$w_buff0 = 2 [L785] 3 y$w_buff1_used = y$w_buff0_used [L786] 3 y$w_buff0_used = (_Bool)1 [L787] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L787] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L796] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L813] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L819] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L820] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L821] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L822] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L823] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L751] 1 x = 1 [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L826] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L828] 4 return 0; [L763] 2 x = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L766] 2 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L802] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L803] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 3 return 0; [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L778] 2 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L857] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1433={5:0}, t1434={6:0}, t1435={7:0}, t1436={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L861] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L862] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L863] 0 y$flush_delayed = weak$$choice2 [L864] 0 y$mem_tmp = y [L865] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L866] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L867] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L868] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L869] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L870] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L871] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L873] 0 y = y$flush_delayed ? y$mem_tmp : y [L874] 0 y$flush_delayed = (_Bool)0 [L876] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 844]: 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: 846]: 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: 842]: 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: 848]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 167 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 28.4s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 15.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 660 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 660 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18 mSDsCounter, 114 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1947 IncrementalHoareTripleChecker+Invalid, 2061 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 114 mSolverCounterUnsat, 28 mSDtfsCounter, 1947 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=937occurred in iteration=12, InterpolantAutomatonStates: 101, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 337 NumberOfCodeBlocks, 337 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 292 ConstructedInterpolants, 0 QuantifiedInterpolants, 2361 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-17 15:16:56,634 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...