/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-prod-cons3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 12:29:11,224 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 12:29:11,311 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 12:29:11,342 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 12:29:11,343 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 12:29:11,344 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 12:29:11,345 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 12:29:11,345 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 12:29:11,345 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 12:29:11,349 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 12:29:11,350 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 12:29:11,350 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 12:29:11,350 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 12:29:11,351 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 12:29:11,351 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 12:29:11,352 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 12:29:11,352 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 12:29:11,352 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 12:29:11,352 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 12:29:11,352 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 12:29:11,352 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 12:29:11,353 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 12:29:11,353 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 12:29:11,354 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 12:29:11,354 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 12:29:11,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 12:29:11,354 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 12:29:11,354 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 12:29:11,355 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 12:29:11,355 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 12:29:11,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 12:29:11,356 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 12:29:11,356 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true [2023-11-17 12:29:11,592 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 12:29:11,614 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 12:29:11,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 12:29:11,617 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 12:29:11,618 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 12:29:11,619 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-prod-cons3.wvr.c [2023-11-17 12:29:12,781 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 12:29:12,992 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 12:29:12,993 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons3.wvr.c [2023-11-17 12:29:13,003 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5507de5d/59dd972a339646eca40ec5319a731ede/FLAG330e7fe8e [2023-11-17 12:29:13,020 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5507de5d/59dd972a339646eca40ec5319a731ede [2023-11-17 12:29:13,023 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 12:29:13,024 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 12:29:13,028 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 12:29:13,028 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 12:29:13,032 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 12:29:13,033 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:29:13" (1/1) ... [2023-11-17 12:29:13,034 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6594faea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:29:13, skipping insertion in model container [2023-11-17 12:29:13,034 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:29:13" (1/1) ... [2023-11-17 12:29:13,069 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 12:29:13,229 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons3.wvr.c[4059,4072] [2023-11-17 12:29:13,237 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 12:29:13,245 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 12:29:13,281 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons3.wvr.c[4059,4072] [2023-11-17 12:29:13,284 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 12:29:13,295 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 12:29:13,296 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 12:29:13,301 INFO L206 MainTranslator]: Completed translation [2023-11-17 12:29:13,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:29:13 WrapperNode [2023-11-17 12:29:13,302 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 12:29:13,303 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 12:29:13,303 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 12:29:13,303 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 12:29:13,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:29:13" (1/1) ... [2023-11-17 12:29:13,316 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:29:13" (1/1) ... [2023-11-17 12:29:13,341 INFO L138 Inliner]: procedures = 26, calls = 73, calls flagged for inlining = 15, calls inlined = 17, statements flattened = 279 [2023-11-17 12:29:13,342 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 12:29:13,343 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 12:29:13,343 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 12:29:13,343 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 12:29:13,350 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:29:13" (1/1) ... [2023-11-17 12:29:13,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:29:13" (1/1) ... [2023-11-17 12:29:13,354 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:29:13" (1/1) ... [2023-11-17 12:29:13,355 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:29:13" (1/1) ... [2023-11-17 12:29:13,363 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:29:13" (1/1) ... [2023-11-17 12:29:13,382 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:29:13" (1/1) ... [2023-11-17 12:29:13,384 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:29:13" (1/1) ... [2023-11-17 12:29:13,386 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:29:13" (1/1) ... [2023-11-17 12:29:13,389 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 12:29:13,390 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 12:29:13,390 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 12:29:13,390 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 12:29:13,391 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:29:13" (1/1) ... [2023-11-17 12:29:13,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 12:29:13,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:29:13,442 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 12:29:13,455 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 12:29:13,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 12:29:13,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 12:29:13,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 12:29:13,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 12:29:13,476 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-17 12:29:13,477 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-17 12:29:13,477 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-17 12:29:13,477 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-17 12:29:13,477 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-17 12:29:13,477 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-17 12:29:13,477 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-11-17 12:29:13,478 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-11-17 12:29:13,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 12:29:13,478 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 12:29:13,478 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 12:29:13,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-17 12:29:13,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 12:29:13,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 12:29:13,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 12:29:13,481 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 12:29:13,604 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 12:29:13,606 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 12:29:14,021 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 12:29:14,352 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 12:29:14,353 INFO L307 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-17 12:29:14,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:29:14 BoogieIcfgContainer [2023-11-17 12:29:14,354 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 12:29:14,356 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 12:29:14,356 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 12:29:14,359 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 12:29:14,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:29:13" (1/3) ... [2023-11-17 12:29:14,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34286df9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:29:14, skipping insertion in model container [2023-11-17 12:29:14,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:29:13" (2/3) ... [2023-11-17 12:29:14,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34286df9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:29:14, skipping insertion in model container [2023-11-17 12:29:14,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:29:14" (3/3) ... [2023-11-17 12:29:14,362 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons3.wvr.c [2023-11-17 12:29:14,378 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 12:29:14,379 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 12:29:14,379 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 12:29:14,436 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-17 12:29:14,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 54 transitions, 136 flow [2023-11-17 12:29:14,513 INFO L124 PetriNetUnfolderBase]: 6/50 cut-off events. [2023-11-17 12:29:14,513 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-17 12:29:14,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 50 events. 6/50 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 88 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2023-11-17 12:29:14,518 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 54 transitions, 136 flow [2023-11-17 12:29:14,525 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 49 transitions, 122 flow [2023-11-17 12:29:14,528 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 12:29:14,542 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 49 transitions, 122 flow [2023-11-17 12:29:14,544 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 49 transitions, 122 flow [2023-11-17 12:29:14,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 49 transitions, 122 flow [2023-11-17 12:29:14,566 INFO L124 PetriNetUnfolderBase]: 6/49 cut-off events. [2023-11-17 12:29:14,566 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-17 12:29:14,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 49 events. 6/49 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 87 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2023-11-17 12:29:14,569 INFO L119 LiptonReduction]: Number of co-enabled transitions 904 [2023-11-17 12:29:15,288 INFO L134 LiptonReduction]: Checked pairs total: 1332 [2023-11-17 12:29:15,289 INFO L136 LiptonReduction]: Total number of compositions: 15 [2023-11-17 12:29:15,308 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 12:29:15,315 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;@718203b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 12:29:15,315 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-17 12:29:15,332 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 12:29:15,332 INFO L124 PetriNetUnfolderBase]: 5/35 cut-off events. [2023-11-17 12:29:15,332 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-17 12:29:15,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:29:15,333 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 12:29:15,334 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 12:29:15,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:29:15,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1084440605, now seen corresponding path program 1 times [2023-11-17 12:29:15,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:29:15,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213488576] [2023-11-17 12:29:15,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:29:15,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:29:15,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:29:15,757 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 12:29:15,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:29:15,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213488576] [2023-11-17 12:29:15,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213488576] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:29:15,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:29:15,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 12:29:15,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169178715] [2023-11-17 12:29:15,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:29:15,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 12:29:15,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:29:15,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 12:29:15,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 12:29:15,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 69 [2023-11-17 12:29:15,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:29:15,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:29:15,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 69 [2023-11-17 12:29:15,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:29:16,251 INFO L124 PetriNetUnfolderBase]: 1705/2492 cut-off events. [2023-11-17 12:29:16,252 INFO L125 PetriNetUnfolderBase]: For 206/206 co-relation queries the response was YES. [2023-11-17 12:29:16,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5072 conditions, 2492 events. 1705/2492 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 10789 event pairs, 181 based on Foata normal form. 0/2184 useless extension candidates. Maximal degree in co-relation 4280. Up to 805 conditions per place. [2023-11-17 12:29:16,279 INFO L140 encePairwiseOnDemand]: 64/69 looper letters, 80 selfloop transitions, 5 changer transitions 0/86 dead transitions. [2023-11-17 12:29:16,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 86 transitions, 387 flow [2023-11-17 12:29:16,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 12:29:16,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 12:29:16,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 147 transitions. [2023-11-17 12:29:16,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4260869565217391 [2023-11-17 12:29:16,292 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 147 transitions. [2023-11-17 12:29:16,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 147 transitions. [2023-11-17 12:29:16,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:29:16,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 147 transitions. [2023-11-17 12:29:16,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:29:16,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 69.0) internal successors, (414), 6 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:29:16,301 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 69.0) internal successors, (414), 6 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:29:16,302 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 96 flow. Second operand 5 states and 147 transitions. [2023-11-17 12:29:16,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 86 transitions, 387 flow [2023-11-17 12:29:16,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 86 transitions, 354 flow, removed 0 selfloop flow, removed 9 redundant places. [2023-11-17 12:29:16,310 INFO L231 Difference]: Finished difference. Result has 42 places, 39 transitions, 108 flow [2023-11-17 12:29:16,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=42, PETRI_TRANSITIONS=39} [2023-11-17 12:29:16,315 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -2 predicate places. [2023-11-17 12:29:16,315 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 39 transitions, 108 flow [2023-11-17 12:29:16,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:29:16,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:29:16,316 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 12:29:16,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 12:29:16,316 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 12:29:16,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:29:16,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1261938331, now seen corresponding path program 2 times [2023-11-17 12:29:16,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:29:16,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391667359] [2023-11-17 12:29:16,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:29:16,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:29:16,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:29:16,444 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 12:29:16,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:29:16,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391667359] [2023-11-17 12:29:16,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391667359] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:29:16,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:29:16,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 12:29:16,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561863180] [2023-11-17 12:29:16,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:29:16,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 12:29:16,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:29:16,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 12:29:16,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 12:29:16,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 69 [2023-11-17 12:29:16,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:29:16,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:29:16,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 69 [2023-11-17 12:29:16,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:29:16,783 INFO L124 PetriNetUnfolderBase]: 1935/2748 cut-off events. [2023-11-17 12:29:16,784 INFO L125 PetriNetUnfolderBase]: For 929/929 co-relation queries the response was YES. [2023-11-17 12:29:16,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6342 conditions, 2748 events. 1935/2748 cut-off events. For 929/929 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 11592 event pairs, 199 based on Foata normal form. 0/2528 useless extension candidates. Maximal degree in co-relation 3642. Up to 1139 conditions per place. [2023-11-17 12:29:16,800 INFO L140 encePairwiseOnDemand]: 64/69 looper letters, 75 selfloop transitions, 7 changer transitions 0/83 dead transitions. [2023-11-17 12:29:16,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 83 transitions, 389 flow [2023-11-17 12:29:16,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 12:29:16,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 12:29:16,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 140 transitions. [2023-11-17 12:29:16,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4057971014492754 [2023-11-17 12:29:16,806 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 140 transitions. [2023-11-17 12:29:16,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 140 transitions. [2023-11-17 12:29:16,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:29:16,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 140 transitions. [2023-11-17 12:29:16,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:29:16,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 69.0) internal successors, (414), 6 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:29:16,812 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 69.0) internal successors, (414), 6 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:29:16,812 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 108 flow. Second operand 5 states and 140 transitions. [2023-11-17 12:29:16,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 83 transitions, 389 flow [2023-11-17 12:29:16,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 83 transitions, 384 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 12:29:16,817 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 149 flow [2023-11-17 12:29:16,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=149, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2023-11-17 12:29:16,818 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 4 predicate places. [2023-11-17 12:29:16,819 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 149 flow [2023-11-17 12:29:16,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:29:16,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:29:16,823 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 12:29:16,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 12:29:16,828 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 12:29:16,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:29:16,828 INFO L85 PathProgramCache]: Analyzing trace with hash 134898123, now seen corresponding path program 3 times [2023-11-17 12:29:16,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:29:16,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817297058] [2023-11-17 12:29:16,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:29:16,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:29:16,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:29:17,098 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 12:29:17,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:29:17,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817297058] [2023-11-17 12:29:17,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817297058] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:29:17,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:29:17,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 12:29:17,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879465123] [2023-11-17 12:29:17,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:29:17,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 12:29:17,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:29:17,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 12:29:17,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-17 12:29:17,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 69 [2023-11-17 12:29:17,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 149 flow. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:29:17,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:29:17,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 69 [2023-11-17 12:29:17,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:29:17,778 INFO L124 PetriNetUnfolderBase]: 4571/6362 cut-off events. [2023-11-17 12:29:17,778 INFO L125 PetriNetUnfolderBase]: For 3308/3308 co-relation queries the response was YES. [2023-11-17 12:29:17,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15630 conditions, 6362 events. 4571/6362 cut-off events. For 3308/3308 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 29416 event pairs, 339 based on Foata normal form. 164/6162 useless extension candidates. Maximal degree in co-relation 8501. Up to 2132 conditions per place. [2023-11-17 12:29:17,804 INFO L140 encePairwiseOnDemand]: 62/69 looper letters, 91 selfloop transitions, 7 changer transitions 21/119 dead transitions. [2023-11-17 12:29:17,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 119 transitions, 618 flow [2023-11-17 12:29:17,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 12:29:17,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 12:29:17,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 185 transitions. [2023-11-17 12:29:17,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3830227743271222 [2023-11-17 12:29:17,806 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 185 transitions. [2023-11-17 12:29:17,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 185 transitions. [2023-11-17 12:29:17,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:29:17,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 185 transitions. [2023-11-17 12:29:17,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 26.428571428571427) internal successors, (185), 7 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:29:17,808 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 69.0) internal successors, (552), 8 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:29:17,808 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 69.0) internal successors, (552), 8 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:29:17,809 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 149 flow. Second operand 7 states and 185 transitions. [2023-11-17 12:29:17,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 119 transitions, 618 flow [2023-11-17 12:29:17,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 119 transitions, 609 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 12:29:17,820 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 156 flow [2023-11-17 12:29:17,820 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=156, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2023-11-17 12:29:17,821 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 11 predicate places. [2023-11-17 12:29:17,821 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 156 flow [2023-11-17 12:29:17,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:29:17,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:29:17,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:29:17,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 12:29:17,821 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 12:29:17,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:29:17,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1644462474, now seen corresponding path program 1 times [2023-11-17 12:29:17,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:29:17,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509046943] [2023-11-17 12:29:17,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:29:17,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:29:17,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:29:17,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:29:17,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:29:17,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509046943] [2023-11-17 12:29:17,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509046943] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:29:17,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:29:17,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 12:29:17,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84816431] [2023-11-17 12:29:17,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:29:17,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 12:29:17,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:29:17,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 12:29:17,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 12:29:17,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 69 [2023-11-17 12:29:17,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:29:17,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:29:17,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 69 [2023-11-17 12:29:17,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:29:18,203 INFO L124 PetriNetUnfolderBase]: 1455/2318 cut-off events. [2023-11-17 12:29:18,203 INFO L125 PetriNetUnfolderBase]: For 2947/2947 co-relation queries the response was YES. [2023-11-17 12:29:18,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6034 conditions, 2318 events. 1455/2318 cut-off events. For 2947/2947 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 10775 event pairs, 427 based on Foata normal form. 54/2213 useless extension candidates. Maximal degree in co-relation 2319. Up to 1585 conditions per place. [2023-11-17 12:29:18,219 INFO L140 encePairwiseOnDemand]: 66/69 looper letters, 45 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-11-17 12:29:18,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 53 transitions, 274 flow [2023-11-17 12:29:18,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 12:29:18,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 12:29:18,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2023-11-17 12:29:18,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5072463768115942 [2023-11-17 12:29:18,221 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 105 transitions. [2023-11-17 12:29:18,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 105 transitions. [2023-11-17 12:29:18,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:29:18,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 105 transitions. [2023-11-17 12:29:18,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:29:18,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:29:18,222 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:29:18,222 INFO L175 Difference]: Start difference. First operand has 55 places, 41 transitions, 156 flow. Second operand 3 states and 105 transitions. [2023-11-17 12:29:18,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 53 transitions, 274 flow [2023-11-17 12:29:18,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 246 flow, removed 1 selfloop flow, removed 11 redundant places. [2023-11-17 12:29:18,229 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 130 flow [2023-11-17 12:29:18,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2023-11-17 12:29:18,230 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places. [2023-11-17 12:29:18,230 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 130 flow [2023-11-17 12:29:18,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:29:18,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:29:18,231 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:29:18,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 12:29:18,231 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 12:29:18,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:29:18,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1990363991, now seen corresponding path program 1 times [2023-11-17 12:29:18,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:29:18,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850534418] [2023-11-17 12:29:18,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:29:18,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:29:18,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:29:18,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:29:18,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:29:18,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850534418] [2023-11-17 12:29:18,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850534418] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:29:18,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:29:18,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 12:29:18,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624072959] [2023-11-17 12:29:18,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:29:18,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 12:29:18,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:29:18,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 12:29:18,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 12:29:18,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 69 [2023-11-17 12:29:18,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:29:18,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:29:18,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 69 [2023-11-17 12:29:18,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:29:18,534 INFO L124 PetriNetUnfolderBase]: 1275/2018 cut-off events. [2023-11-17 12:29:18,534 INFO L125 PetriNetUnfolderBase]: For 1346/1346 co-relation queries the response was YES. [2023-11-17 12:29:18,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5141 conditions, 2018 events. 1275/2018 cut-off events. For 1346/1346 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 8966 event pairs, 593 based on Foata normal form. 44/1858 useless extension candidates. Maximal degree in co-relation 2262. Up to 1567 conditions per place. [2023-11-17 12:29:18,546 INFO L140 encePairwiseOnDemand]: 66/69 looper letters, 43 selfloop transitions, 2 changer transitions 3/54 dead transitions. [2023-11-17 12:29:18,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 54 transitions, 262 flow [2023-11-17 12:29:18,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 12:29:18,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 12:29:18,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2023-11-17 12:29:18,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5072463768115942 [2023-11-17 12:29:18,547 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 105 transitions. [2023-11-17 12:29:18,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 105 transitions. [2023-11-17 12:29:18,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:29:18,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 105 transitions. [2023-11-17 12:29:18,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:29:18,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:29:18,549 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:29:18,549 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 130 flow. Second operand 3 states and 105 transitions. [2023-11-17 12:29:18,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 54 transitions, 262 flow [2023-11-17 12:29:18,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 54 transitions, 260 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 12:29:18,552 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 140 flow [2023-11-17 12:29:18,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2023-11-17 12:29:18,553 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 5 predicate places. [2023-11-17 12:29:18,553 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 140 flow [2023-11-17 12:29:18,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:29:18,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:29:18,554 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:29:18,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 12:29:18,554 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 12:29:18,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:29:18,555 INFO L85 PathProgramCache]: Analyzing trace with hash -458375065, now seen corresponding path program 1 times [2023-11-17 12:29:18,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:29:18,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728552310] [2023-11-17 12:29:18,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:29:18,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:29:18,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:29:18,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 12:29:18,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:29:18,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728552310] [2023-11-17 12:29:18,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728552310] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:29:18,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:29:18,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 12:29:18,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598056546] [2023-11-17 12:29:18,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:29:18,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 12:29:18,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:29:18,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 12:29:18,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 12:29:18,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 69 [2023-11-17 12:29:18,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:29:18,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:29:18,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 69 [2023-11-17 12:29:18,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:29:18,987 INFO L124 PetriNetUnfolderBase]: 1421/2295 cut-off events. [2023-11-17 12:29:18,987 INFO L125 PetriNetUnfolderBase]: For 1752/1752 co-relation queries the response was YES. [2023-11-17 12:29:18,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6080 conditions, 2295 events. 1421/2295 cut-off events. For 1752/1752 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 10249 event pairs, 1080 based on Foata normal form. 22/2117 useless extension candidates. Maximal degree in co-relation 4895. Up to 1799 conditions per place. [2023-11-17 12:29:19,002 INFO L140 encePairwiseOnDemand]: 65/69 looper letters, 34 selfloop transitions, 2 changer transitions 18/60 dead transitions. [2023-11-17 12:29:19,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 60 transitions, 295 flow [2023-11-17 12:29:19,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 12:29:19,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 12:29:19,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2023-11-17 12:29:19,004 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4673913043478261 [2023-11-17 12:29:19,004 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 129 transitions. [2023-11-17 12:29:19,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 129 transitions. [2023-11-17 12:29:19,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:29:19,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 129 transitions. [2023-11-17 12:29:19,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:29:19,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 69.0) internal successors, (345), 5 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:29:19,006 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 69.0) internal successors, (345), 5 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:29:19,006 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 140 flow. Second operand 4 states and 129 transitions. [2023-11-17 12:29:19,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 60 transitions, 295 flow [2023-11-17 12:29:19,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 60 transitions, 293 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 12:29:19,011 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 152 flow [2023-11-17 12:29:19,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2023-11-17 12:29:19,012 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 9 predicate places. [2023-11-17 12:29:19,012 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 152 flow [2023-11-17 12:29:19,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:29:19,012 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:29:19,013 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:29:19,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 12:29:19,013 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 12:29:19,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:29:19,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1149626360, now seen corresponding path program 1 times [2023-11-17 12:29:19,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:29:19,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691601807] [2023-11-17 12:29:19,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:29:19,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:29:19,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:29:19,199 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:29:19,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:29:19,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691601807] [2023-11-17 12:29:19,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691601807] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:29:19,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:29:19,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 12:29:19,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149946843] [2023-11-17 12:29:19,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:29:19,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 12:29:19,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:29:19,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 12:29:19,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 12:29:19,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 69 [2023-11-17 12:29:19,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:29:19,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:29:19,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 69 [2023-11-17 12:29:19,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:29:19,513 INFO L124 PetriNetUnfolderBase]: 1630/2612 cut-off events. [2023-11-17 12:29:19,514 INFO L125 PetriNetUnfolderBase]: For 2043/2043 co-relation queries the response was YES. [2023-11-17 12:29:19,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6903 conditions, 2612 events. 1630/2612 cut-off events. For 2043/2043 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 11719 event pairs, 1258 based on Foata normal form. 34/2415 useless extension candidates. Maximal degree in co-relation 6882. Up to 1800 conditions per place. [2023-11-17 12:29:19,531 INFO L140 encePairwiseOnDemand]: 65/69 looper letters, 35 selfloop transitions, 2 changer transitions 19/62 dead transitions. [2023-11-17 12:29:19,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 62 transitions, 321 flow [2023-11-17 12:29:19,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 12:29:19,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 12:29:19,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2023-11-17 12:29:19,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4673913043478261 [2023-11-17 12:29:19,532 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 129 transitions. [2023-11-17 12:29:19,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 129 transitions. [2023-11-17 12:29:19,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:29:19,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 129 transitions. [2023-11-17 12:29:19,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:29:19,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 69.0) internal successors, (345), 5 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:29:19,534 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 69.0) internal successors, (345), 5 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:29:19,534 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 152 flow. Second operand 4 states and 129 transitions. [2023-11-17 12:29:19,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 62 transitions, 321 flow [2023-11-17 12:29:19,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 62 transitions, 313 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-17 12:29:19,540 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 160 flow [2023-11-17 12:29:19,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=160, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2023-11-17 12:29:19,542 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 11 predicate places. [2023-11-17 12:29:19,542 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 160 flow [2023-11-17 12:29:19,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:29:19,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:29:19,542 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:29:19,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 12:29:19,543 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 12:29:19,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:29:19,543 INFO L85 PathProgramCache]: Analyzing trace with hash -910432112, now seen corresponding path program 1 times [2023-11-17 12:29:19,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:29:19,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990270396] [2023-11-17 12:29:19,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:29:19,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:29:19,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:29:21,921 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:29:21,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:29:21,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990270396] [2023-11-17 12:29:21,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990270396] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:29:21,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195652686] [2023-11-17 12:29:21,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:29:21,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:29:21,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:29:21,929 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:29:21,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-17 12:29:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:29:22,099 INFO L262 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 70 conjunts are in the unsatisfiable core [2023-11-17 12:29:22,107 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:29:22,163 WARN L561 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2023-11-17 12:29:22,172 WARN L561 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2023-11-17 12:29:22,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:29:22,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:29:22,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:29:22,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:29:22,214 INFO L349 Elim1Store]: treesize reduction 33, result has 13.2 percent of original size [2023-11-17 12:29:22,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 18 [2023-11-17 12:29:22,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:29:22,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:29:22,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:29:22,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:29:22,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:29:22,270 INFO L349 Elim1Store]: treesize reduction 50, result has 15.3 percent of original size [2023-11-17 12:29:22,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 22 [2023-11-17 12:29:22,292 WARN L561 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2023-11-17 12:29:22,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:29:22,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:29:22,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:29:22,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:29:22,323 INFO L349 Elim1Store]: treesize reduction 37, result has 2.6 percent of original size [2023-11-17 12:29:22,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 1 [2023-11-17 12:29:22,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:29:22,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:29:22,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:29:22,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:29:22,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:29:22,363 INFO L349 Elim1Store]: treesize reduction 50, result has 15.3 percent of original size [2023-11-17 12:29:22,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 22 [2023-11-17 12:29:22,395 WARN L561 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2023-11-17 12:29:22,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:29:22,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:29:22,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:29:22,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:29:22,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:29:22,439 INFO L349 Elim1Store]: treesize reduction 50, result has 15.3 percent of original size [2023-11-17 12:29:22,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 22 [2023-11-17 12:29:22,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:29:22,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:29:22,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:29:22,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:29:22,487 INFO L349 Elim1Store]: treesize reduction 33, result has 13.2 percent of original size [2023-11-17 12:29:22,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 18 [2023-11-17 12:29:22,505 WARN L561 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2023-11-17 12:29:22,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:29:22,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:29:22,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:29:22,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:29:22,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:29:22,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:29:22,533 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-17 12:29:22,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 14 [2023-11-17 12:29:22,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:29:22,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:29:22,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:29:22,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:29:22,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:29:22,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:29:22,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:29:22,578 INFO L349 Elim1Store]: treesize reduction 33, result has 13.2 percent of original size [2023-11-17 12:29:22,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 14 [2023-11-17 12:29:22,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:29:22,889 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2023-11-17 12:29:22,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 35 [2023-11-17 12:29:23,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-17 12:29:23,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 12:29:23,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 12:29:23,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:29:23,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 12:29:24,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:29:24,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 12:29:24,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:29:24,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2023-11-17 12:29:24,538 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:29:24,538 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:29:26,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:29:26,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 101 [2023-11-17 12:29:26,086 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:29:26,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 28713 treesize of output 27749 [2023-11-17 12:29:26,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:29:26,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 7029 treesize of output 6277 [2023-11-17 12:29:27,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:29:27,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 6237 treesize of output 4693 [2023-11-17 12:29:27,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:29:27,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4596 treesize of output 4268 [2023-11-17 12:29:27,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:29:27,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4195 treesize of output 4071 [2023-11-17 12:33:57,545 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:33:57,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195652686] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:33:57,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:33:57,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 18] total 49 [2023-11-17 12:33:57,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790914170] [2023-11-17 12:33:57,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:33:57,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-17 12:33:57,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:33:57,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-17 12:33:57,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2239, Unknown=11, NotChecked=0, Total=2450 [2023-11-17 12:33:57,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 69 [2023-11-17 12:33:57,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 160 flow. Second operand has 50 states, 50 states have (on average 7.92) internal successors, (396), 50 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:33:57,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:33:57,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 69 [2023-11-17 12:33:57,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:34:27,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-17 12:35:32,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-17 12:35:39,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-17 12:35:49,187 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-11-17 12:35:49,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2023-11-17 12:35:49,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 243 states. [2023-11-17 12:35:49,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-17 12:35:49,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:35:49,393 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:950) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:789) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:377) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:247) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.NestedWordAutomataUtils.getSuccessorState(NestedWordAutomataUtils.java:482) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getOrConstructTransition(DifferencePetriNet.java:279) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getTransitions(DifferencePetriNet.java:261) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.addFullyInstantiatedCandidate(PossibleExtensions.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:195) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.update(PossibleExtensions.java:135) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.computeUnfoldingHelper(PetriNetUnfolderBase.java:226) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.computeUnfolding(PetriNetUnfolderBase.java:183) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.(PetriNetUnfolderBase.java:123) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.(PetriNetUnfolder.java:72) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:76) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:64) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePairwiseOnDemand.(DifferencePairwiseOnDemand.java:128) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.enhanceAnddeterminizeInterpolantAutomaton(CegarLoopForPetriNet.java:481) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 51 more [2023-11-17 12:35:49,397 INFO L158 Benchmark]: Toolchain (without parser) took 396372.33ms. Allocated memory was 188.7MB in the beginning and 940.6MB in the end (delta: 751.8MB). Free memory was 143.2MB in the beginning and 373.1MB in the end (delta: -230.0MB). Peak memory consumption was 521.5MB. Max. memory is 8.0GB. [2023-11-17 12:35:49,397 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 188.7MB. Free memory is still 147.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 12:35:49,397 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.62ms. Allocated memory is still 188.7MB. Free memory was 143.0MB in the beginning and 130.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-11-17 12:35:49,397 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.10ms. Allocated memory is still 188.7MB. Free memory was 130.3MB in the beginning and 127.9MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 12:35:49,398 INFO L158 Benchmark]: Boogie Preprocessor took 46.47ms. Allocated memory is still 188.7MB. Free memory was 127.9MB in the beginning and 125.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 12:35:49,398 INFO L158 Benchmark]: RCFGBuilder took 964.77ms. Allocated memory is still 188.7MB. Free memory was 125.8MB in the beginning and 113.3MB in the end (delta: 12.5MB). Peak memory consumption was 31.6MB. Max. memory is 8.0GB. [2023-11-17 12:35:49,398 INFO L158 Benchmark]: TraceAbstraction took 395039.98ms. Allocated memory was 188.7MB in the beginning and 940.6MB in the end (delta: 751.8MB). Free memory was 112.3MB in the beginning and 373.1MB in the end (delta: -260.9MB). Peak memory consumption was 491.0MB. Max. memory is 8.0GB. [2023-11-17 12:35:49,399 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.13ms. Allocated memory is still 188.7MB. Free memory is still 147.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 274.62ms. Allocated memory is still 188.7MB. Free memory was 143.0MB in the beginning and 130.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.10ms. Allocated memory is still 188.7MB. Free memory was 130.3MB in the beginning and 127.9MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.47ms. Allocated memory is still 188.7MB. Free memory was 127.9MB in the beginning and 125.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 964.77ms. Allocated memory is still 188.7MB. Free memory was 125.8MB in the beginning and 113.3MB in the end (delta: 12.5MB). Peak memory consumption was 31.6MB. Max. memory is 8.0GB. * TraceAbstraction took 395039.98ms. Allocated memory was 188.7MB in the beginning and 940.6MB in the end (delta: 751.8MB). Free memory was 112.3MB in the beginning and 373.1MB in the end (delta: -260.9MB). Peak memory consumption was 491.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 56 PlacesBefore, 44 PlacesAfterwards, 49 TransitionsBefore, 36 TransitionsAfterwards, 904 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 11 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 1 ChoiceCompositions, 15 TotalNumberOfCompositions, 1332 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 937, independent: 902, independent conditional: 0, independent unconditional: 902, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 594, independent: 565, independent conditional: 0, independent unconditional: 565, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 594, independent: 563, independent conditional: 0, independent unconditional: 563, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 31, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 72, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 937, independent: 337, independent conditional: 0, independent unconditional: 337, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 594, unknown conditional: 0, unknown unconditional: 594] , Statistics on independence cache: Total cache size (in pairs): 194, Positive cache size: 180, Positive conditional cache size: 0, Positive unconditional cache size: 180, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...