/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/bench-exp3x3-opt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 11:45:41,872 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 11:45:41,930 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2023-11-17 11:45:41,957 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 11:45:41,957 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 11:45:41,958 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 11:45:41,958 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 11:45:41,958 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 11:45:41,959 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 11:45:41,962 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 11:45:41,963 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 11:45:41,963 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 11:45:41,963 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 11:45:41,964 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 11:45:41,965 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 11:45:41,965 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 11:45:41,965 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 11:45:41,965 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 11:45:41,965 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 11:45:41,965 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 11:45:41,966 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 11:45:41,966 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 11:45:41,967 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 11:45:41,967 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 11:45:41,967 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 11:45:41,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:45:41,967 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 11:45:41,968 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 11:45:41,968 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 11:45:41,968 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 11:45:41,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 11:45:41,969 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 11:45:41,969 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true [2023-11-17 11:45:42,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 11:45:42,170 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 11:45:42,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 11:45:42,173 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 11:45:42,173 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 11:45:42,174 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c [2023-11-17 11:45:43,285 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 11:45:43,430 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 11:45:43,431 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c [2023-11-17 11:45:43,437 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4c90add8/24f17a1fb49a4b55a6623af0137501d3/FLAG6a12922fd [2023-11-17 11:45:43,456 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4c90add8/24f17a1fb49a4b55a6623af0137501d3 [2023-11-17 11:45:43,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 11:45:43,459 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 11:45:43,461 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 11:45:43,461 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 11:45:43,464 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 11:45:43,464 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:45:43" (1/1) ... [2023-11-17 11:45:43,465 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66417884 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:45:43, skipping insertion in model container [2023-11-17 11:45:43,466 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:45:43" (1/1) ... [2023-11-17 11:45:43,487 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 11:45:43,647 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/bench-exp3x3-opt.wvr.c[2904,2917] [2023-11-17 11:45:43,653 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:45:43,662 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 11:45:43,690 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/bench-exp3x3-opt.wvr.c[2904,2917] [2023-11-17 11:45:43,691 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:45:43,704 INFO L206 MainTranslator]: Completed translation [2023-11-17 11:45:43,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:45:43 WrapperNode [2023-11-17 11:45:43,705 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 11:45:43,706 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 11:45:43,706 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 11:45:43,706 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 11:45:43,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:45:43" (1/1) ... [2023-11-17 11:45:43,728 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:45:43" (1/1) ... [2023-11-17 11:45:43,751 INFO L138 Inliner]: procedures = 25, calls = 44, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 131 [2023-11-17 11:45:43,752 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 11:45:43,752 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 11:45:43,752 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 11:45:43,752 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 11:45:43,759 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:45:43" (1/1) ... [2023-11-17 11:45:43,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:45:43" (1/1) ... [2023-11-17 11:45:43,763 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:45:43" (1/1) ... [2023-11-17 11:45:43,763 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:45:43" (1/1) ... [2023-11-17 11:45:43,767 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:45:43" (1/1) ... [2023-11-17 11:45:43,777 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:45:43" (1/1) ... [2023-11-17 11:45:43,778 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:45:43" (1/1) ... [2023-11-17 11:45:43,779 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:45:43" (1/1) ... [2023-11-17 11:45:43,781 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 11:45:43,782 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 11:45:43,782 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 11:45:43,782 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 11:45:43,783 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:45:43" (1/1) ... [2023-11-17 11:45:43,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:45:43,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:45:43,807 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 11:45:43,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 11:45:43,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 11:45:43,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 11:45:43,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 11:45:43,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 11:45:43,834 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-17 11:45:43,834 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-17 11:45:43,834 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-17 11:45:43,834 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-17 11:45:43,834 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-17 11:45:43,834 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-17 11:45:43,835 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-11-17 11:45:43,835 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-11-17 11:45:43,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 11:45:43,835 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-11-17 11:45:43,835 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-11-17 11:45:43,835 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-11-17 11:45:43,835 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-11-17 11:45:43,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 11:45:43,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 11:45:43,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 11:45:43,842 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 11:45:43,943 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 11:45:43,944 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 11:45:44,247 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 11:45:44,408 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 11:45:44,408 INFO L307 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-17 11:45:44,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:45:44 BoogieIcfgContainer [2023-11-17 11:45:44,409 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 11:45:44,411 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 11:45:44,411 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 11:45:44,413 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 11:45:44,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 11:45:43" (1/3) ... [2023-11-17 11:45:44,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2087075a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:45:44, skipping insertion in model container [2023-11-17 11:45:44,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:45:43" (2/3) ... [2023-11-17 11:45:44,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2087075a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:45:44, skipping insertion in model container [2023-11-17 11:45:44,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:45:44" (3/3) ... [2023-11-17 11:45:44,415 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp3x3-opt.wvr.c [2023-11-17 11:45:44,427 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 11:45:44,428 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 11:45:44,428 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 11:45:44,488 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2023-11-17 11:45:44,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 51 transitions, 144 flow [2023-11-17 11:45:44,563 INFO L124 PetriNetUnfolderBase]: 6/45 cut-off events. [2023-11-17 11:45:44,563 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-17 11:45:44,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 45 events. 6/45 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 33 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2023-11-17 11:45:44,568 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 51 transitions, 144 flow [2023-11-17 11:45:44,572 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 44 transitions, 124 flow [2023-11-17 11:45:44,575 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:45:44,587 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 44 transitions, 124 flow [2023-11-17 11:45:44,594 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 44 transitions, 124 flow [2023-11-17 11:45:44,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 44 transitions, 124 flow [2023-11-17 11:45:44,614 INFO L124 PetriNetUnfolderBase]: 6/44 cut-off events. [2023-11-17 11:45:44,615 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-17 11:45:44,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 44 events. 6/44 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 32 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2023-11-17 11:45:44,617 INFO L119 LiptonReduction]: Number of co-enabled transitions 666 [2023-11-17 11:45:44,676 INFO L134 LiptonReduction]: Checked pairs total: 528 [2023-11-17 11:45:44,676 INFO L136 LiptonReduction]: Total number of compositions: 1 [2023-11-17 11:45:44,690 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:45:44,695 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;@5e92f140, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:45:44,696 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-17 11:45:44,710 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:45:44,710 INFO L124 PetriNetUnfolderBase]: 6/42 cut-off events. [2023-11-17 11:45:44,710 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-17 11:45:44,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:45:44,711 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, 1] [2023-11-17 11:45:44,711 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 4 more)] === [2023-11-17 11:45:44,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:45:44,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1020269081, now seen corresponding path program 1 times [2023-11-17 11:45:44,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:45:44,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301244750] [2023-11-17 11:45:44,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:45:44,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:45:44,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:45:45,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:45:45,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:45:45,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301244750] [2023-11-17 11:45:45,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301244750] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:45:45,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:45:45,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:45:45,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516134980] [2023-11-17 11:45:45,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:45:45,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:45:45,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:45:45,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:45:45,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:45:45,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2023-11-17 11:45:45,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:45:45,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:45:45,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2023-11-17 11:45:45,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:45:46,934 INFO L124 PetriNetUnfolderBase]: 24533/28582 cut-off events. [2023-11-17 11:45:46,935 INFO L125 PetriNetUnfolderBase]: For 1331/1331 co-relation queries the response was YES. [2023-11-17 11:45:46,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58275 conditions, 28582 events. 24533/28582 cut-off events. For 1331/1331 co-relation queries the response was YES. Maximal size of possible extension queue 933. Compared 100607 event pairs, 4426 based on Foata normal form. 1/15579 useless extension candidates. Maximal degree in co-relation 44796. Up to 18741 conditions per place. [2023-11-17 11:45:47,081 INFO L140 encePairwiseOnDemand]: 48/52 looper letters, 59 selfloop transitions, 3 changer transitions 1/69 dead transitions. [2023-11-17 11:45:47,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 69 transitions, 321 flow [2023-11-17 11:45:47,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:45:47,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:45:47,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2023-11-17 11:45:47,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6602564102564102 [2023-11-17 11:45:47,091 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 103 transitions. [2023-11-17 11:45:47,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 103 transitions. [2023-11-17 11:45:47,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:45:47,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 103 transitions. [2023-11-17 11:45:47,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:45:47,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:45:47,099 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:45:47,100 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 122 flow. Second operand 3 states and 103 transitions. [2023-11-17 11:45:47,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 69 transitions, 321 flow [2023-11-17 11:45:47,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 69 transitions, 283 flow, removed 0 selfloop flow, removed 12 redundant places. [2023-11-17 11:45:47,131 INFO L231 Difference]: Finished difference. Result has 47 places, 45 transitions, 117 flow [2023-11-17 11:45:47,133 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=47, PETRI_TRANSITIONS=45} [2023-11-17 11:45:47,135 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, -9 predicate places. [2023-11-17 11:45:47,135 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 45 transitions, 117 flow [2023-11-17 11:45:47,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:45:47,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:45:47,136 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, 1, 1] [2023-11-17 11:45:47,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 11:45:47,137 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 4 more)] === [2023-11-17 11:45:47,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:45:47,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1855481480, now seen corresponding path program 1 times [2023-11-17 11:45:47,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:45:47,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401552486] [2023-11-17 11:45:47,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:45:47,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:45:47,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:45:47,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 11:45:47,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:45:47,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401552486] [2023-11-17 11:45:47,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401552486] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:45:47,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:45:47,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:45:47,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765659461] [2023-11-17 11:45:47,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:45:47,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:45:47,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:45:47,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:45:47,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:45:47,333 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2023-11-17 11:45:47,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 45 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:45:47,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:45:47,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2023-11-17 11:45:47,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:45:49,298 INFO L124 PetriNetUnfolderBase]: 33457/39074 cut-off events. [2023-11-17 11:45:49,298 INFO L125 PetriNetUnfolderBase]: For 5168/5168 co-relation queries the response was YES. [2023-11-17 11:45:49,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85624 conditions, 39074 events. 33457/39074 cut-off events. For 5168/5168 co-relation queries the response was YES. Maximal size of possible extension queue 1237. Compared 147517 event pairs, 5731 based on Foata normal form. 1/26719 useless extension candidates. Maximal degree in co-relation 26650. Up to 27052 conditions per place. [2023-11-17 11:45:49,431 INFO L140 encePairwiseOnDemand]: 48/52 looper letters, 63 selfloop transitions, 3 changer transitions 9/81 dead transitions. [2023-11-17 11:45:49,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 81 transitions, 360 flow [2023-11-17 11:45:49,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:45:49,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:45:49,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2023-11-17 11:45:49,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7115384615384616 [2023-11-17 11:45:49,433 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 111 transitions. [2023-11-17 11:45:49,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 111 transitions. [2023-11-17 11:45:49,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:45:49,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 111 transitions. [2023-11-17 11:45:49,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:45:49,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:45:49,435 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:45:49,435 INFO L175 Difference]: Start difference. First operand has 47 places, 45 transitions, 117 flow. Second operand 3 states and 111 transitions. [2023-11-17 11:45:49,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 81 transitions, 360 flow [2023-11-17 11:45:49,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 81 transitions, 355 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:45:49,437 INFO L231 Difference]: Finished difference. Result has 49 places, 47 transitions, 133 flow [2023-11-17 11:45:49,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=49, PETRI_TRANSITIONS=47} [2023-11-17 11:45:49,438 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, -7 predicate places. [2023-11-17 11:45:49,438 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 47 transitions, 133 flow [2023-11-17 11:45:49,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:45:49,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:45:49,438 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, 1, 1, 1] [2023-11-17 11:45:49,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 11:45:49,439 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 4 more)] === [2023-11-17 11:45:49,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:45:49,439 INFO L85 PathProgramCache]: Analyzing trace with hash -187641961, now seen corresponding path program 1 times [2023-11-17 11:45:49,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:45:49,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281119725] [2023-11-17 11:45:49,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:45:49,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:45:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:45:49,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 11:45:49,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:45:49,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281119725] [2023-11-17 11:45:49,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281119725] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:45:49,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:45:49,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:45:49,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561284921] [2023-11-17 11:45:49,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:45:49,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:45:49,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:45:49,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:45:49,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:45:49,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2023-11-17 11:45:49,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 47 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:45:49,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:45:49,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2023-11-17 11:45:49,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:45:51,876 INFO L124 PetriNetUnfolderBase]: 42571/50179 cut-off events. [2023-11-17 11:45:51,876 INFO L125 PetriNetUnfolderBase]: For 14213/14213 co-relation queries the response was YES. [2023-11-17 11:45:51,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116807 conditions, 50179 events. 42571/50179 cut-off events. For 14213/14213 co-relation queries the response was YES. Maximal size of possible extension queue 1681. Compared 201601 event pairs, 6874 based on Foata normal form. 1/41481 useless extension candidates. Maximal degree in co-relation 48425. Up to 36442 conditions per place. [2023-11-17 11:45:52,058 INFO L140 encePairwiseOnDemand]: 48/52 looper letters, 67 selfloop transitions, 3 changer transitions 5/81 dead transitions. [2023-11-17 11:45:52,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 81 transitions, 378 flow [2023-11-17 11:45:52,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:45:52,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:45:52,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2023-11-17 11:45:52,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6858974358974359 [2023-11-17 11:45:52,059 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 107 transitions. [2023-11-17 11:45:52,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 107 transitions. [2023-11-17 11:45:52,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:45:52,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 107 transitions. [2023-11-17 11:45:52,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 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 11:45:52,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:45:52,061 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:45:52,061 INFO L175 Difference]: Start difference. First operand has 49 places, 47 transitions, 133 flow. Second operand 3 states and 107 transitions. [2023-11-17 11:45:52,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 81 transitions, 378 flow [2023-11-17 11:45:52,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 81 transitions, 373 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:45:52,065 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 149 flow [2023-11-17 11:45:52,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=149, PETRI_PLACES=51, PETRI_TRANSITIONS=49} [2023-11-17 11:45:52,066 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, -5 predicate places. [2023-11-17 11:45:52,066 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 149 flow [2023-11-17 11:45:52,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:45:52,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:45:52,066 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, 1, 1, 1, 1] [2023-11-17 11:45:52,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 11:45:52,066 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 4 more)] === [2023-11-17 11:45:52,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:45:52,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1356141985, now seen corresponding path program 1 times [2023-11-17 11:45:52,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:45:52,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965783843] [2023-11-17 11:45:52,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:45:52,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:45:52,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:45:52,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 11:45:52,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:45:52,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965783843] [2023-11-17 11:45:52,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965783843] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:45:52,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967793066] [2023-11-17 11:45:52,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:45:52,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:45:52,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:45:52,195 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 11:45:52,200 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 11:45:52,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:45:52,306 INFO L262 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-17 11:45:52,311 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:45:52,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 11:45:52,391 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:45:52,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 11:45:52,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967793066] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:45:52,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:45:52,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-11-17 11:45:52,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006470300] [2023-11-17 11:45:52,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:45:52,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:45:52,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:45:52,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:45:52,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:45:52,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2023-11-17 11:45:52,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 49 transitions, 149 flow. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:45:52,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:45:52,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2023-11-17 11:45:52,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:45:55,393 INFO L124 PetriNetUnfolderBase]: 48377/57562 cut-off events. [2023-11-17 11:45:55,394 INFO L125 PetriNetUnfolderBase]: For 22080/22080 co-relation queries the response was YES. [2023-11-17 11:45:55,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144390 conditions, 57562 events. 48377/57562 cut-off events. For 22080/22080 co-relation queries the response was YES. Maximal size of possible extension queue 1926. Compared 247964 event pairs, 7315 based on Foata normal form. 1125/58287 useless extension candidates. Maximal degree in co-relation 46330. Up to 26288 conditions per place. [2023-11-17 11:45:55,611 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 113 selfloop transitions, 6 changer transitions 19/144 dead transitions. [2023-11-17 11:45:55,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 144 transitions, 701 flow [2023-11-17 11:45:55,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:45:55,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:45:55,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 190 transitions. [2023-11-17 11:45:55,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7307692307692307 [2023-11-17 11:45:55,613 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 190 transitions. [2023-11-17 11:45:55,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 190 transitions. [2023-11-17 11:45:55,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:45:55,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 190 transitions. [2023-11-17 11:45:55,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:45:55,615 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:45:55,615 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:45:55,615 INFO L175 Difference]: Start difference. First operand has 51 places, 49 transitions, 149 flow. Second operand 5 states and 190 transitions. [2023-11-17 11:45:55,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 144 transitions, 701 flow [2023-11-17 11:45:55,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 144 transitions, 692 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:45:55,619 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 183 flow [2023-11-17 11:45:55,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=183, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2023-11-17 11:45:55,620 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 0 predicate places. [2023-11-17 11:45:55,620 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 183 flow [2023-11-17 11:45:55,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:45:55,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:45:55,621 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, 1, 1, 1, 1] [2023-11-17 11:45:55,636 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 11:45:55,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:45:55,826 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 4 more)] === [2023-11-17 11:45:55,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:45:55,827 INFO L85 PathProgramCache]: Analyzing trace with hash -480911829, now seen corresponding path program 1 times [2023-11-17 11:45:55,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:45:55,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127566937] [2023-11-17 11:45:55,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:45:55,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:45:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:45:55,922 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 11:45:55,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:45:55,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127566937] [2023-11-17 11:45:55,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127566937] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:45:55,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:45:55,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:45:55,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184104753] [2023-11-17 11:45:55,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:45:55,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:45:55,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:45:55,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:45:55,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:45:55,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2023-11-17 11:45:55,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 183 flow. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 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 11:45:55,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:45:55,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2023-11-17 11:45:55,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:45:58,983 INFO L124 PetriNetUnfolderBase]: 48167/57237 cut-off events. [2023-11-17 11:45:58,983 INFO L125 PetriNetUnfolderBase]: For 35731/35731 co-relation queries the response was YES. [2023-11-17 11:45:59,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155079 conditions, 57237 events. 48167/57237 cut-off events. For 35731/35731 co-relation queries the response was YES. Maximal size of possible extension queue 1888. Compared 244410 event pairs, 1126 based on Foata normal form. 706/57843 useless extension candidates. Maximal degree in co-relation 56050. Up to 22511 conditions per place. [2023-11-17 11:45:59,207 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 90 selfloop transitions, 4 changer transitions 40/140 dead transitions. [2023-11-17 11:45:59,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 140 transitions, 721 flow [2023-11-17 11:45:59,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:45:59,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:45:59,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 180 transitions. [2023-11-17 11:45:59,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6923076923076923 [2023-11-17 11:45:59,209 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 180 transitions. [2023-11-17 11:45:59,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 180 transitions. [2023-11-17 11:45:59,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:45:59,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 180 transitions. [2023-11-17 11:45:59,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:45:59,210 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:45:59,211 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:45:59,211 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 183 flow. Second operand 5 states and 180 transitions. [2023-11-17 11:45:59,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 140 transitions, 721 flow [2023-11-17 11:45:59,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 140 transitions, 715 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-17 11:45:59,512 INFO L231 Difference]: Finished difference. Result has 60 places, 52 transitions, 191 flow [2023-11-17 11:45:59,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=60, PETRI_TRANSITIONS=52} [2023-11-17 11:45:59,512 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 4 predicate places. [2023-11-17 11:45:59,513 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 191 flow [2023-11-17 11:45:59,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 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 11:45:59,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:45:59,513 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, 1, 1, 1, 1] [2023-11-17 11:45:59,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 11:45:59,513 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 4 more)] === [2023-11-17 11:45:59,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:45:59,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1258569511, now seen corresponding path program 2 times [2023-11-17 11:45:59,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:45:59,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076401494] [2023-11-17 11:45:59,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:45:59,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:45:59,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:45:59,623 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 11:45:59,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:45:59,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076401494] [2023-11-17 11:45:59,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076401494] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:45:59,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:45:59,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:45:59,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625155698] [2023-11-17 11:45:59,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:45:59,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:45:59,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:45:59,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:45:59,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:45:59,626 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2023-11-17 11:45:59,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 191 flow. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 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 11:45:59,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:45:59,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2023-11-17 11:45:59,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:46:01,613 INFO L124 PetriNetUnfolderBase]: 32115/38227 cut-off events. [2023-11-17 11:46:01,613 INFO L125 PetriNetUnfolderBase]: For 41160/41164 co-relation queries the response was YES. [2023-11-17 11:46:01,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111973 conditions, 38227 events. 32115/38227 cut-off events. For 41160/41164 co-relation queries the response was YES. Maximal size of possible extension queue 1292. Compared 156262 event pairs, 4379 based on Foata normal form. 830/38683 useless extension candidates. Maximal degree in co-relation 54571. Up to 18656 conditions per place. [2023-11-17 11:46:01,780 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 125 selfloop transitions, 6 changer transitions 11/148 dead transitions. [2023-11-17 11:46:01,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 148 transitions, 842 flow [2023-11-17 11:46:01,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:46:01,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:46:01,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2023-11-17 11:46:01,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7 [2023-11-17 11:46:01,781 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 182 transitions. [2023-11-17 11:46:01,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 182 transitions. [2023-11-17 11:46:01,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:46:01,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 182 transitions. [2023-11-17 11:46:01,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:46:01,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:46:01,783 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:46:01,783 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 191 flow. Second operand 5 states and 182 transitions. [2023-11-17 11:46:01,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 148 transitions, 842 flow [2023-11-17 11:46:01,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 148 transitions, 829 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-17 11:46:01,796 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 221 flow [2023-11-17 11:46:01,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=221, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2023-11-17 11:46:01,796 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 8 predicate places. [2023-11-17 11:46:01,797 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 221 flow [2023-11-17 11:46:01,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 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 11:46:01,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:46:01,797 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, 1, 1, 1, 1] [2023-11-17 11:46:01,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 11:46:01,797 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 4 more)] === [2023-11-17 11:46:01,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:46:01,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1637758436, now seen corresponding path program 1 times [2023-11-17 11:46:01,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:46:01,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557330143] [2023-11-17 11:46:01,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:46:01,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:46:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:46:01,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 11:46:01,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:46:01,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557330143] [2023-11-17 11:46:01,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557330143] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:46:01,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599703255] [2023-11-17 11:46:01,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:46:01,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:46:01,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:46:01,884 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 11:46:01,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-17 11:46:01,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:46:02,000 INFO L262 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-17 11:46:02,003 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:46:02,041 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 11:46:02,041 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-17 11:46:02,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599703255] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:46:02,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-17 11:46:02,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-11-17 11:46:02,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231401515] [2023-11-17 11:46:02,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:46:02,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:46:02,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:46:02,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:46:02,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:46:02,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2023-11-17 11:46:02,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 221 flow. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 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 11:46:02,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:46:02,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2023-11-17 11:46:02,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:46:04,244 INFO L124 PetriNetUnfolderBase]: 31327/37353 cut-off events. [2023-11-17 11:46:04,245 INFO L125 PetriNetUnfolderBase]: For 43074/43074 co-relation queries the response was YES. [2023-11-17 11:46:04,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121211 conditions, 37353 events. 31327/37353 cut-off events. For 43074/43074 co-relation queries the response was YES. Maximal size of possible extension queue 1234. Compared 154646 event pairs, 1613 based on Foata normal form. 972/38183 useless extension candidates. Maximal degree in co-relation 53281. Up to 29420 conditions per place. [2023-11-17 11:46:04,538 INFO L140 encePairwiseOnDemand]: 48/52 looper letters, 98 selfloop transitions, 4 changer transitions 0/108 dead transitions. [2023-11-17 11:46:04,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 108 transitions, 638 flow [2023-11-17 11:46:04,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:46:04,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:46:04,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2023-11-17 11:46:04,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6298076923076923 [2023-11-17 11:46:04,540 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 131 transitions. [2023-11-17 11:46:04,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 131 transitions. [2023-11-17 11:46:04,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:46:04,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 131 transitions. [2023-11-17 11:46:04,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:46:04,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 52.0) internal successors, (260), 5 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:46:04,541 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 52.0) internal successors, (260), 5 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:46:04,541 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 221 flow. Second operand 4 states and 131 transitions. [2023-11-17 11:46:04,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 108 transitions, 638 flow [2023-11-17 11:46:04,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 108 transitions, 625 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-17 11:46:04,687 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 234 flow [2023-11-17 11:46:04,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=234, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2023-11-17 11:46:04,688 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 11 predicate places. [2023-11-17 11:46:04,688 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 234 flow [2023-11-17 11:46:04,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 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 11:46:04,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:46:04,688 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, 1, 1, 1, 1, 1] [2023-11-17 11:46:04,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-17 11:46:04,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-17 11:46:04,895 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 4 more)] === [2023-11-17 11:46:04,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:46:04,896 INFO L85 PathProgramCache]: Analyzing trace with hash 383251749, now seen corresponding path program 1 times [2023-11-17 11:46:04,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:46:04,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82259281] [2023-11-17 11:46:04,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:46:04,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:46:04,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:46:05,010 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 11:46:05,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:46:05,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82259281] [2023-11-17 11:46:05,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82259281] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:46:05,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:46:05,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:46:05,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136544226] [2023-11-17 11:46:05,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:46:05,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:46:05,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:46:05,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:46:05,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:46:05,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2023-11-17 11:46:05,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 234 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:46:05,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:46:05,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2023-11-17 11:46:05,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:46:07,039 INFO L124 PetriNetUnfolderBase]: 30923/36945 cut-off events. [2023-11-17 11:46:07,040 INFO L125 PetriNetUnfolderBase]: For 53194/53198 co-relation queries the response was YES. [2023-11-17 11:46:07,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124533 conditions, 36945 events. 30923/36945 cut-off events. For 53194/53198 co-relation queries the response was YES. Maximal size of possible extension queue 1236. Compared 150104 event pairs, 736 based on Foata normal form. 427/37268 useless extension candidates. Maximal degree in co-relation 89716. Up to 14469 conditions per place. [2023-11-17 11:46:07,210 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 102 selfloop transitions, 4 changer transitions 40/152 dead transitions. [2023-11-17 11:46:07,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 152 transitions, 944 flow [2023-11-17 11:46:07,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:46:07,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:46:07,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2023-11-17 11:46:07,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.676923076923077 [2023-11-17 11:46:07,213 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 176 transitions. [2023-11-17 11:46:07,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 176 transitions. [2023-11-17 11:46:07,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:46:07,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 176 transitions. [2023-11-17 11:46:07,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:46:07,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:46:07,214 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:46:07,214 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 234 flow. Second operand 5 states and 176 transitions. [2023-11-17 11:46:07,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 152 transitions, 944 flow [2023-11-17 11:46:07,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 152 transitions, 926 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:46:07,428 INFO L231 Difference]: Finished difference. Result has 70 places, 56 transitions, 241 flow [2023-11-17 11:46:07,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=241, PETRI_PLACES=70, PETRI_TRANSITIONS=56} [2023-11-17 11:46:07,451 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 14 predicate places. [2023-11-17 11:46:07,451 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 56 transitions, 241 flow [2023-11-17 11:46:07,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:46:07,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:46:07,452 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, 1, 1, 1, 1, 1] [2023-11-17 11:46:07,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 11:46:07,453 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:46:07,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:46:07,454 INFO L85 PathProgramCache]: Analyzing trace with hash 731405003, now seen corresponding path program 2 times [2023-11-17 11:46:07,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:46:07,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111017564] [2023-11-17 11:46:07,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:46:07,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:46:07,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:46:07,552 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 11:46:07,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:46:07,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111017564] [2023-11-17 11:46:07,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111017564] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:46:07,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:46:07,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:46:07,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401756500] [2023-11-17 11:46:07,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:46:07,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:46:07,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:46:07,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:46:07,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:46:07,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2023-11-17 11:46:07,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 56 transitions, 241 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:46:07,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:46:07,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2023-11-17 11:46:07,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:46:09,151 INFO L124 PetriNetUnfolderBase]: 22581/27107 cut-off events. [2023-11-17 11:46:09,151 INFO L125 PetriNetUnfolderBase]: For 55380/55384 co-relation queries the response was YES. [2023-11-17 11:46:09,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96483 conditions, 27107 events. 22581/27107 cut-off events. For 55380/55384 co-relation queries the response was YES. Maximal size of possible extension queue 890. Compared 106919 event pairs, 3495 based on Foata normal form. 488/27138 useless extension candidates. Maximal degree in co-relation 70038. Up to 10761 conditions per place. [2023-11-17 11:46:09,282 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 141 selfloop transitions, 6 changer transitions 3/156 dead transitions. [2023-11-17 11:46:09,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 156 transitions, 1035 flow [2023-11-17 11:46:09,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:46:09,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:46:09,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 174 transitions. [2023-11-17 11:46:09,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6692307692307692 [2023-11-17 11:46:09,283 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 174 transitions. [2023-11-17 11:46:09,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 174 transitions. [2023-11-17 11:46:09,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:46:09,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 174 transitions. [2023-11-17 11:46:09,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:46:09,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:46:09,284 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:46:09,284 INFO L175 Difference]: Start difference. First operand has 70 places, 56 transitions, 241 flow. Second operand 5 states and 174 transitions. [2023-11-17 11:46:09,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 156 transitions, 1035 flow [2023-11-17 11:46:09,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 156 transitions, 1022 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-17 11:46:09,299 INFO L231 Difference]: Finished difference. Result has 74 places, 59 transitions, 271 flow [2023-11-17 11:46:09,300 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=271, PETRI_PLACES=74, PETRI_TRANSITIONS=59} [2023-11-17 11:46:09,301 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 18 predicate places. [2023-11-17 11:46:09,301 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 59 transitions, 271 flow [2023-11-17 11:46:09,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:46:09,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:46:09,301 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, 1, 1, 1, 1, 1] [2023-11-17 11:46:09,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 11:46:09,301 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:46:09,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:46:09,302 INFO L85 PathProgramCache]: Analyzing trace with hash 381208858, now seen corresponding path program 1 times [2023-11-17 11:46:09,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:46:09,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136366530] [2023-11-17 11:46:09,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:46:09,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:46:09,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:46:09,389 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 11:46:09,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:46:09,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136366530] [2023-11-17 11:46:09,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136366530] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:46:09,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704432656] [2023-11-17 11:46:09,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:46:09,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:46:09,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:46:09,402 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 11:46:09,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-17 11:46:09,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:46:09,504 INFO L262 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-17 11:46:09,506 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:46:09,562 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 11:46:09,563 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-17 11:46:09,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704432656] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:46:09,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-17 11:46:09,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-11-17 11:46:09,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98837888] [2023-11-17 11:46:09,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:46:09,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:46:09,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:46:09,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:46:09,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:46:09,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2023-11-17 11:46:09,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 59 transitions, 271 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:46:09,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:46:09,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2023-11-17 11:46:09,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:46:11,260 INFO L124 PetriNetUnfolderBase]: 21673/26019 cut-off events. [2023-11-17 11:46:11,260 INFO L125 PetriNetUnfolderBase]: For 50080/50084 co-relation queries the response was YES. [2023-11-17 11:46:11,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100839 conditions, 26019 events. 21673/26019 cut-off events. For 50080/50084 co-relation queries the response was YES. Maximal size of possible extension queue 836. Compared 104698 event pairs, 797 based on Foata normal form. 909/26858 useless extension candidates. Maximal degree in co-relation 73779. Up to 18795 conditions per place. [2023-11-17 11:46:11,402 INFO L140 encePairwiseOnDemand]: 48/52 looper letters, 110 selfloop transitions, 4 changer transitions 0/120 dead transitions. [2023-11-17 11:46:11,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 120 transitions, 810 flow [2023-11-17 11:46:11,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:46:11,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:46:11,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2023-11-17 11:46:11,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6298076923076923 [2023-11-17 11:46:11,404 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 131 transitions. [2023-11-17 11:46:11,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 131 transitions. [2023-11-17 11:46:11,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:46:11,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 131 transitions. [2023-11-17 11:46:11,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:46:11,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 52.0) internal successors, (260), 5 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:46:11,405 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 52.0) internal successors, (260), 5 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:46:11,405 INFO L175 Difference]: Start difference. First operand has 74 places, 59 transitions, 271 flow. Second operand 4 states and 131 transitions. [2023-11-17 11:46:11,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 120 transitions, 810 flow [2023-11-17 11:46:11,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 120 transitions, 797 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-17 11:46:11,557 INFO L231 Difference]: Finished difference. Result has 77 places, 60 transitions, 284 flow [2023-11-17 11:46:11,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=284, PETRI_PLACES=77, PETRI_TRANSITIONS=60} [2023-11-17 11:46:11,558 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 21 predicate places. [2023-11-17 11:46:11,558 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 60 transitions, 284 flow [2023-11-17 11:46:11,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:46:11,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:46:11,558 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, 1, 1, 1, 1, 1, 1] [2023-11-17 11:46:11,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-17 11:46:11,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:46:11,766 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:46:11,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:46:11,766 INFO L85 PathProgramCache]: Analyzing trace with hash -2034678177, now seen corresponding path program 1 times [2023-11-17 11:46:11,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:46:11,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706603823] [2023-11-17 11:46:11,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:46:11,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:46:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:46:11,856 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-17 11:46:11,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:46:11,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706603823] [2023-11-17 11:46:11,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706603823] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:46:11,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:46:11,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:46:11,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799919490] [2023-11-17 11:46:11,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:46:11,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:46:11,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:46:11,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:46:11,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:46:11,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2023-11-17 11:46:11,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 60 transitions, 284 flow. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:46:11,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:46:11,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2023-11-17 11:46:11,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:46:13,390 INFO L124 PetriNetUnfolderBase]: 21429/25874 cut-off events. [2023-11-17 11:46:13,391 INFO L125 PetriNetUnfolderBase]: For 64696/64700 co-relation queries the response was YES. [2023-11-17 11:46:13,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104750 conditions, 25874 events. 21429/25874 cut-off events. For 64696/64700 co-relation queries the response was YES. Maximal size of possible extension queue 840. Compared 101091 event pairs, 994 based on Foata normal form. 245/25824 useless extension candidates. Maximal degree in co-relation 77002. Up to 10326 conditions per place. [2023-11-17 11:46:13,542 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 114 selfloop transitions, 4 changer transitions 40/164 dead transitions. [2023-11-17 11:46:13,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 164 transitions, 1155 flow [2023-11-17 11:46:13,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:46:13,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:46:13,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 172 transitions. [2023-11-17 11:46:13,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6615384615384615 [2023-11-17 11:46:13,543 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 172 transitions. [2023-11-17 11:46:13,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 172 transitions. [2023-11-17 11:46:13,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:46:13,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 172 transitions. [2023-11-17 11:46:13,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:46:13,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:46:13,545 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:46:13,545 INFO L175 Difference]: Start difference. First operand has 77 places, 60 transitions, 284 flow. Second operand 5 states and 172 transitions. [2023-11-17 11:46:13,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 164 transitions, 1155 flow [2023-11-17 11:46:13,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 164 transitions, 1137 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:46:13,701 INFO L231 Difference]: Finished difference. Result has 80 places, 60 transitions, 291 flow [2023-11-17 11:46:13,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=291, PETRI_PLACES=80, PETRI_TRANSITIONS=60} [2023-11-17 11:46:13,702 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 24 predicate places. [2023-11-17 11:46:13,702 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 60 transitions, 291 flow [2023-11-17 11:46:13,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:46:13,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:46:13,702 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, 1, 1, 1, 1, 1, 1] [2023-11-17 11:46:13,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 11:46:13,703 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:46:13,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:46:13,703 INFO L85 PathProgramCache]: Analyzing trace with hash -355444345, now seen corresponding path program 2 times [2023-11-17 11:46:13,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:46:13,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646463722] [2023-11-17 11:46:13,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:46:13,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:46:13,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:46:13,772 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-17 11:46:13,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:46:13,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646463722] [2023-11-17 11:46:13,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646463722] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:46:13,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:46:13,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:46:13,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403074460] [2023-11-17 11:46:13,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:46:13,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:46:13,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:46:13,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:46:13,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:46:13,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2023-11-17 11:46:13,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 60 transitions, 291 flow. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:46:13,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:46:13,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2023-11-17 11:46:13,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:46:15,024 INFO L124 PetriNetUnfolderBase]: 14584/17649 cut-off events. [2023-11-17 11:46:15,024 INFO L125 PetriNetUnfolderBase]: For 43646/43650 co-relation queries the response was YES. [2023-11-17 11:46:15,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73300 conditions, 17649 events. 14584/17649 cut-off events. For 43646/43650 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 65687 event pairs, 996 based on Foata normal form. 485/17983 useless extension candidates. Maximal degree in co-relation 53841. Up to 11829 conditions per place. [2023-11-17 11:46:15,133 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 141 selfloop transitions, 6 changer transitions 0/153 dead transitions. [2023-11-17 11:46:15,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 153 transitions, 1092 flow [2023-11-17 11:46:15,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:46:15,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:46:15,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 163 transitions. [2023-11-17 11:46:15,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6269230769230769 [2023-11-17 11:46:15,134 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 163 transitions. [2023-11-17 11:46:15,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 163 transitions. [2023-11-17 11:46:15,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:46:15,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 163 transitions. [2023-11-17 11:46:15,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:46:15,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:46:15,135 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:46:15,135 INFO L175 Difference]: Start difference. First operand has 80 places, 60 transitions, 291 flow. Second operand 5 states and 163 transitions. [2023-11-17 11:46:15,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 153 transitions, 1092 flow [2023-11-17 11:46:15,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 153 transitions, 1085 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-17 11:46:15,222 INFO L231 Difference]: Finished difference. Result has 84 places, 63 transitions, 325 flow [2023-11-17 11:46:15,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=325, PETRI_PLACES=84, PETRI_TRANSITIONS=63} [2023-11-17 11:46:15,222 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 28 predicate places. [2023-11-17 11:46:15,222 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 63 transitions, 325 flow [2023-11-17 11:46:15,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:46:15,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:46:15,223 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:46:15,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-17 11:46:15,223 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:46:15,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:46:15,223 INFO L85 PathProgramCache]: Analyzing trace with hash -921029028, now seen corresponding path program 1 times [2023-11-17 11:46:15,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:46:15,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339550168] [2023-11-17 11:46:15,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:46:15,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:46:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:46:15,678 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 11:46:15,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:46:15,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339550168] [2023-11-17 11:46:15,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339550168] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:46:15,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34938689] [2023-11-17 11:46:15,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:46:15,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:46:15,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:46:15,703 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 11:46:15,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-17 11:46:16,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:46:16,399 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-17 11:46:16,404 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:46:37,984 WARN L293 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-17 11:48:11,707 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-17 11:48:11,707 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:48:27,059 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-17 11:48:27,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34938689] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:48:27,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:48:27,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 3] total 13 [2023-11-17 11:48:27,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633726853] [2023-11-17 11:48:27,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:48:27,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-17 11:48:27,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:48:27,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-17 11:48:27,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=157, Unknown=15, NotChecked=0, Total=210 [2023-11-17 11:48:27,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2023-11-17 11:48:27,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 63 transitions, 325 flow. Second operand has 15 states, 15 states have (on average 20.4) internal successors, (306), 15 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:48:27,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:48:27,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2023-11-17 11:48:27,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:48:35,516 WARN L293 SmtUtils]: Spent 7.59s on a formula simplification. DAG size of input: 38 DAG size of output: 30 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-17 11:48:45,726 WARN L293 SmtUtils]: Spent 10.09s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-17 11:48:58,390 WARN L293 SmtUtils]: Spent 8.58s on a formula simplification. DAG size of input: 29 DAG size of output: 28 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-17 11:49:01,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:49:16,937 WARN L293 SmtUtils]: Spent 9.36s on a formula simplification. DAG size of input: 55 DAG size of output: 54 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-17 11:49:39,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:49:41,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:50:17,321 WARN L293 SmtUtils]: Spent 10.06s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-17 11:50:25,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:50:28,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:50:30,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:50:32,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:50:34,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:50:36,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:45,344 WARN L293 SmtUtils]: Spent 19.14s on a formula simplification. DAG size of input: 42 DAG size of output: 41 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-17 11:52:10,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:52:12,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:52:14,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:52:17,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:52:19,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:52:22,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:52:23,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:52:26,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:52:28,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:52:44,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:52:46,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:52:48,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:52:50,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:52:59,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:53:01,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:53:03,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:53:05,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:53:50,922 WARN L293 SmtUtils]: Spent 16.66s on a formula simplification. DAG size of input: 33 DAG size of output: 32 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-17 11:53:52,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:54:01,760 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 [] [2023-11-17 11:54:03,765 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 [] [2023-11-17 11:54:05,769 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 [] [2023-11-17 11:54:07,776 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 [] [2023-11-17 11:54:09,781 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 [] [2023-11-17 11:54:11,788 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 [] [2023-11-17 11:54:13,792 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 [] [2023-11-17 11:54:15,800 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 [] [2023-11-17 11:54:17,804 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 [] [2023-11-17 11:54:19,809 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 [] [2023-11-17 11:54:21,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:54:23,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:54:25,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:54:27,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:54:29,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:54:31,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:54:33,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:54:35,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:54:37,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:54:39,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:54:41,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:54:43,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:54:45,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:54:47,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:54:49,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:54:51,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:54:53,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:54:55,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:54:57,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:54:59,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:55:01,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:55:03,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:55:05,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:55:07,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:55:09,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:55:11,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:55:13,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:55:15,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:55:17,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:55:19,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2023-11-17 11:55:21,114 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 11:55:21,160 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 11:55:21,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:55:22,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-17 11:55:22,316 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-11-17 11:55:22,322 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-17 11:55:22,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-17 11:55:22,322 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-11-17 11:55:22,324 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 7 remaining) [2023-11-17 11:55:22,324 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-17 11:55:22,324 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-17 11:55:22,324 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-17 11:55:22,324 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-17 11:55:22,324 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2023-11-17 11:55:22,324 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:55:22,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-11-17 11:55:22,332 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 11:55:22,332 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 11:55:22,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 11:55:22 BasicIcfg [2023-11-17 11:55:22,342 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 11:55:22,342 INFO L158 Benchmark]: Toolchain (without parser) took 578883.19ms. Allocated memory was 198.2MB in the beginning and 7.5GB in the end (delta: 7.3GB). Free memory was 140.7MB in the beginning and 4.7GB in the end (delta: -4.6GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. [2023-11-17 11:55:22,342 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 198.2MB. Free memory is still 149.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 11:55:22,342 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.24ms. Allocated memory is still 198.2MB. Free memory was 140.7MB in the beginning and 128.7MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-11-17 11:55:22,343 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.18ms. Allocated memory is still 198.2MB. Free memory was 128.7MB in the beginning and 126.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:55:22,343 INFO L158 Benchmark]: Boogie Preprocessor took 28.99ms. Allocated memory is still 198.2MB. Free memory was 126.6MB in the beginning and 125.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-11-17 11:55:22,343 INFO L158 Benchmark]: RCFGBuilder took 627.70ms. Allocated memory was 198.2MB in the beginning and 342.9MB in the end (delta: 144.7MB). Free memory was 125.0MB in the beginning and 280.5MB in the end (delta: -155.5MB). Peak memory consumption was 21.5MB. Max. memory is 8.0GB. [2023-11-17 11:55:22,343 INFO L158 Benchmark]: TraceAbstraction took 577930.84ms. Allocated memory was 342.9MB in the beginning and 7.5GB in the end (delta: 7.1GB). Free memory was 279.4MB in the beginning and 4.7GB in the end (delta: -4.5GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. [2023-11-17 11:55:22,344 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.10ms. Allocated memory is still 198.2MB. Free memory is still 149.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 244.24ms. Allocated memory is still 198.2MB. Free memory was 140.7MB in the beginning and 128.7MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.18ms. Allocated memory is still 198.2MB. Free memory was 128.7MB in the beginning and 126.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.99ms. Allocated memory is still 198.2MB. Free memory was 126.6MB in the beginning and 125.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 627.70ms. Allocated memory was 198.2MB in the beginning and 342.9MB in the end (delta: 144.7MB). Free memory was 125.0MB in the beginning and 280.5MB in the end (delta: -155.5MB). Peak memory consumption was 21.5MB. Max. memory is 8.0GB. * TraceAbstraction took 577930.84ms. Allocated memory was 342.9MB in the beginning and 7.5GB in the end (delta: 7.1GB). Free memory was 279.4MB in the beginning and 4.7GB in the end (delta: -4.5GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 57 PlacesBefore, 56 PlacesAfterwards, 44 TransitionsBefore, 43 TransitionsAfterwards, 666 CoEnabledTransitionPairs, 1 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 528 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 528, independent: 528, independent conditional: 0, independent unconditional: 528, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 264, independent: 264, independent conditional: 0, independent unconditional: 264, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 264, independent: 264, independent conditional: 0, independent unconditional: 264, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 528, independent: 264, independent conditional: 0, independent unconditional: 264, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 264, unknown conditional: 0, unknown unconditional: 264] , Statistics on independence cache: Total cache size (in pairs): 264, Positive cache size: 264, Positive conditional cache size: 0, Positive unconditional cache size: 264, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 117]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 104]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 103]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 108]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 106]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 70 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 577.8s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 442.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 64 mSolverCounterUnknown, 746 SdHoareTripleChecker+Valid, 147.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 746 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 146.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2696 IncrementalHoareTripleChecker+Invalid, 2789 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 0 mSDtfsCounter, 2696 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 314 GetRequests, 234 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 307.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=325occurred in iteration=12, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 132.3s InterpolantComputationTime, 688 NumberOfCodeBlocks, 688 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 752 ConstructedInterpolants, 0 QuantifiedInterpolants, 9254 SizeOfPredicates, 24 NumberOfNonLiveVariables, 1356 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 19 InterpolantComputations, 11 PerfectInterpolantSequences, 56/68 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown