/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true -i ../../../trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 15:23:08,043 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 15:23:08,101 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-NoLbe.epf [2023-12-09 15:23:08,123 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 15:23:08,123 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 15:23:08,126 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 15:23:08,126 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 15:23:08,127 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 15:23:08,127 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 15:23:08,130 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 15:23:08,130 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 15:23:08,130 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 15:23:08,131 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 15:23:08,132 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 15:23:08,132 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 15:23:08,132 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 15:23:08,132 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 15:23:08,132 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 15:23:08,132 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 15:23:08,132 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 15:23:08,133 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 15:23:08,133 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 15:23:08,133 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 15:23:08,133 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 15:23:08,134 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 15:23:08,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:23:08,134 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 15:23:08,134 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 15:23:08,134 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 15:23:08,134 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 15:23:08,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 15:23:08,135 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 15:23:08,135 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 15:23:08,135 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.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true [2023-12-09 15:23:08,333 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 15:23:08,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 15:23:08,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 15:23:08,363 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 15:23:08,364 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 15:23:08,365 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c [2023-12-09 15:23:09,445 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 15:23:09,584 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 15:23:09,584 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c [2023-12-09 15:23:09,590 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07b1eb83e/93ae57e1a7a841bca0654d661616e3ed/FLAG07ceccd4e [2023-12-09 15:23:09,604 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07b1eb83e/93ae57e1a7a841bca0654d661616e3ed [2023-12-09 15:23:09,606 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 15:23:09,607 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 15:23:09,610 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 15:23:09,610 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 15:23:09,613 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 15:23:09,614 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:23:09" (1/1) ... [2023-12-09 15:23:09,615 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@596b6213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:09, skipping insertion in model container [2023-12-09 15:23:09,616 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:23:09" (1/1) ... [2023-12-09 15:23:09,635 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 15:23:09,769 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c[2528,2541] [2023-12-09 15:23:09,772 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:23:09,778 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 15:23:09,793 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c[2528,2541] [2023-12-09 15:23:09,794 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:23:09,799 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-09 15:23:09,799 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-09 15:23:09,804 INFO L206 MainTranslator]: Completed translation [2023-12-09 15:23:09,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:09 WrapperNode [2023-12-09 15:23:09,804 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 15:23:09,805 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 15:23:09,805 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 15:23:09,805 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 15:23:09,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:09" (1/1) ... [2023-12-09 15:23:09,816 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:09" (1/1) ... [2023-12-09 15:23:09,831 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 120 [2023-12-09 15:23:09,832 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 15:23:09,832 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 15:23:09,832 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 15:23:09,832 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 15:23:09,839 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:09" (1/1) ... [2023-12-09 15:23:09,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:09" (1/1) ... [2023-12-09 15:23:09,843 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:09" (1/1) ... [2023-12-09 15:23:09,843 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:09" (1/1) ... [2023-12-09 15:23:09,847 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:09" (1/1) ... [2023-12-09 15:23:09,849 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:09" (1/1) ... [2023-12-09 15:23:09,852 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:09" (1/1) ... [2023-12-09 15:23:09,853 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:09" (1/1) ... [2023-12-09 15:23:09,855 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 15:23:09,868 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 15:23:09,868 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 15:23:09,868 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 15:23:09,869 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:09" (1/1) ... [2023-12-09 15:23:09,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:23:09,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:23:09,889 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-12-09 15:23:09,925 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-12-09 15:23:09,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 15:23:09,932 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-09 15:23:09,932 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-09 15:23:09,932 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-09 15:23:09,933 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-09 15:23:09,933 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-12-09 15:23:09,933 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-12-09 15:23:09,933 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-12-09 15:23:09,933 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-12-09 15:23:09,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 15:23:09,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 15:23:09,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 15:23:09,933 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-09 15:23:09,933 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-09 15:23:09,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 15:23:09,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 15:23:09,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-09 15:23:09,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 15:23:09,936 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-09 15:23:10,040 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 15:23:10,042 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 15:23:10,233 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 15:23:10,265 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 15:23:10,265 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-09 15:23:10,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:23:10 BoogieIcfgContainer [2023-12-09 15:23:10,267 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 15:23:10,268 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 15:23:10,268 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 15:23:10,270 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 15:23:10,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:23:09" (1/3) ... [2023-12-09 15:23:10,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10821039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:23:10, skipping insertion in model container [2023-12-09 15:23:10,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:23:09" (2/3) ... [2023-12-09 15:23:10,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10821039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:23:10, skipping insertion in model container [2023-12-09 15:23:10,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:23:10" (3/3) ... [2023-12-09 15:23:10,272 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-counter-determinism.wvr.c [2023-12-09 15:23:10,284 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 15:23:10,285 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-09 15:23:10,285 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 15:23:10,360 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-12-09 15:23:10,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 129 transitions, 286 flow [2023-12-09 15:23:10,425 INFO L124 PetriNetUnfolderBase]: 9/125 cut-off events. [2023-12-09 15:23:10,425 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-12-09 15:23:10,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 125 events. 9/125 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 113 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2023-12-09 15:23:10,430 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 129 transitions, 286 flow [2023-12-09 15:23:10,433 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 112 transitions, 248 flow [2023-12-09 15:23:10,440 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:23:10,458 INFO L362 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=true, 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;@7663ef5c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:23:10,458 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-09 15:23:10,495 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:23:10,496 INFO L124 PetriNetUnfolderBase]: 9/111 cut-off events. [2023-12-09 15:23:10,496 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-12-09 15:23:10,496 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:23:10,496 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:23:10,497 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-12-09 15:23:10,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:23:10,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1047961809, now seen corresponding path program 1 times [2023-12-09 15:23:10,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:23:10,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248813960] [2023-12-09 15:23:10,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:23:10,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:23:10,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:23:11,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:23:11,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:23:11,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248813960] [2023-12-09 15:23:11,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248813960] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:23:11,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:23:11,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-09 15:23:11,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389611107] [2023-12-09 15:23:11,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:23:11,103 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-09 15:23:11,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:23:11,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-09 15:23:11,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-09 15:23:11,131 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 129 [2023-12-09 15:23:11,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 112 transitions, 248 flow. Second operand has 6 states, 6 states have (on average 104.66666666666667) internal successors, (628), 6 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:23:11,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:23:11,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 129 [2023-12-09 15:23:11,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:23:11,377 INFO L124 PetriNetUnfolderBase]: 103/520 cut-off events. [2023-12-09 15:23:11,377 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2023-12-09 15:23:11,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 752 conditions, 520 events. 103/520 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2444 event pairs, 28 based on Foata normal form. 131/607 useless extension candidates. Maximal degree in co-relation 395. Up to 119 conditions per place. [2023-12-09 15:23:11,386 INFO L140 encePairwiseOnDemand]: 114/129 looper letters, 36 selfloop transitions, 5 changer transitions 8/135 dead transitions. [2023-12-09 15:23:11,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 135 transitions, 428 flow [2023-12-09 15:23:11,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-09 15:23:11,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-09 15:23:11,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 884 transitions. [2023-12-09 15:23:11,403 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8565891472868217 [2023-12-09 15:23:11,404 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 884 transitions. [2023-12-09 15:23:11,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 884 transitions. [2023-12-09 15:23:11,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:23:11,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 884 transitions. [2023-12-09 15:23:11,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 110.5) internal successors, (884), 8 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:23:11,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 129.0) internal successors, (1161), 9 states have internal predecessors, (1161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:23:11,419 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 129.0) internal successors, (1161), 9 states have internal predecessors, (1161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:23:11,421 INFO L308 CegarLoopForPetriNet]: 116 programPoint places, 7 predicate places. [2023-12-09 15:23:11,422 INFO L500 AbstractCegarLoop]: Abstraction has has 123 places, 135 transitions, 428 flow [2023-12-09 15:23:11,422 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.66666666666667) internal successors, (628), 6 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:23:11,422 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:23:11,422 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:23:11,423 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 15:23:11,423 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-12-09 15:23:11,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:23:11,423 INFO L85 PathProgramCache]: Analyzing trace with hash -508195913, now seen corresponding path program 1 times [2023-12-09 15:23:11,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:23:11,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330528601] [2023-12-09 15:23:11,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:23:11,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:23:11,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:23:11,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:23:11,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:23:11,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330528601] [2023-12-09 15:23:11,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330528601] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:23:11,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:23:11,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-09 15:23:11,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016490055] [2023-12-09 15:23:11,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:23:11,573 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-09 15:23:11,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:23:11,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-09 15:23:11,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-09 15:23:11,576 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 129 [2023-12-09 15:23:11,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 135 transitions, 428 flow. Second operand has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:23:11,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:23:11,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 129 [2023-12-09 15:23:11,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:23:12,760 INFO L124 PetriNetUnfolderBase]: 8069/13418 cut-off events. [2023-12-09 15:23:12,760 INFO L125 PetriNetUnfolderBase]: For 3921/4132 co-relation queries the response was YES. [2023-12-09 15:23:12,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27857 conditions, 13418 events. 8069/13418 cut-off events. For 3921/4132 co-relation queries the response was YES. Maximal size of possible extension queue 743. Compared 103498 event pairs, 3643 based on Foata normal form. 5/10450 useless extension candidates. Maximal degree in co-relation 24021. Up to 6677 conditions per place. [2023-12-09 15:23:12,878 INFO L140 encePairwiseOnDemand]: 122/129 looper letters, 102 selfloop transitions, 7 changer transitions 8/199 dead transitions. [2023-12-09 15:23:12,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 199 transitions, 880 flow [2023-12-09 15:23:12,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-09 15:23:12,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-09 15:23:12,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 547 transitions. [2023-12-09 15:23:12,880 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8480620155038759 [2023-12-09 15:23:12,880 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 547 transitions. [2023-12-09 15:23:12,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 547 transitions. [2023-12-09 15:23:12,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:23:12,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 547 transitions. [2023-12-09 15:23:12,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:23:12,883 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 129.0) internal successors, (774), 6 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:23:12,884 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 129.0) internal successors, (774), 6 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:23:12,884 INFO L308 CegarLoopForPetriNet]: 116 programPoint places, 11 predicate places. [2023-12-09 15:23:12,884 INFO L500 AbstractCegarLoop]: Abstraction has has 127 places, 199 transitions, 880 flow [2023-12-09 15:23:12,885 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:23:12,885 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:23:12,886 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:23:12,886 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-09 15:23:12,886 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-12-09 15:23:12,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:23:12,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1611952049, now seen corresponding path program 1 times [2023-12-09 15:23:12,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:23:12,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155519006] [2023-12-09 15:23:12,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:23:12,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:23:12,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:23:13,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:23:13,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:23:13,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155519006] [2023-12-09 15:23:13,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155519006] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:23:13,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:23:13,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-09 15:23:13,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012554920] [2023-12-09 15:23:13,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:23:13,070 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-09 15:23:13,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:23:13,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-09 15:23:13,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-09 15:23:13,072 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 129 [2023-12-09 15:23:13,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 199 transitions, 880 flow. Second operand has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:23:13,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:23:13,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 129 [2023-12-09 15:23:13,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:23:14,864 INFO L124 PetriNetUnfolderBase]: 12809/20570 cut-off events. [2023-12-09 15:23:14,864 INFO L125 PetriNetUnfolderBase]: For 8198/12879 co-relation queries the response was YES. [2023-12-09 15:23:14,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60181 conditions, 20570 events. 12809/20570 cut-off events. For 8198/12879 co-relation queries the response was YES. Maximal size of possible extension queue 1075. Compared 159689 event pairs, 3386 based on Foata normal form. 104/15991 useless extension candidates. Maximal degree in co-relation 52484. Up to 10319 conditions per place. [2023-12-09 15:23:15,010 INFO L140 encePairwiseOnDemand]: 119/129 looper letters, 247 selfloop transitions, 27 changer transitions 13/369 dead transitions. [2023-12-09 15:23:15,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 369 transitions, 2365 flow [2023-12-09 15:23:15,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-09 15:23:15,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-09 15:23:15,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 667 transitions. [2023-12-09 15:23:15,012 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8617571059431525 [2023-12-09 15:23:15,012 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 667 transitions. [2023-12-09 15:23:15,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 667 transitions. [2023-12-09 15:23:15,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:23:15,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 667 transitions. [2023-12-09 15:23:15,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 111.16666666666667) internal successors, (667), 6 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:23:15,015 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:23:15,015 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:23:15,017 INFO L308 CegarLoopForPetriNet]: 116 programPoint places, 16 predicate places. [2023-12-09 15:23:15,017 INFO L500 AbstractCegarLoop]: Abstraction has has 132 places, 369 transitions, 2365 flow [2023-12-09 15:23:15,017 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:23:15,017 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:23:15,017 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:23:15,017 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-09 15:23:15,018 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-12-09 15:23:15,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:23:15,018 INFO L85 PathProgramCache]: Analyzing trace with hash 18705809, now seen corresponding path program 2 times [2023-12-09 15:23:15,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:23:15,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696276102] [2023-12-09 15:23:15,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:23:15,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:23:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:23:15,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:23:15,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:23:15,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696276102] [2023-12-09 15:23:15,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696276102] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:23:15,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:23:15,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-09 15:23:15,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126904384] [2023-12-09 15:23:15,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:23:15,105 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-09 15:23:15,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:23:15,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-09 15:23:15,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-09 15:23:15,107 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 129 [2023-12-09 15:23:15,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 369 transitions, 2365 flow. Second operand has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:23:15,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:23:15,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 129 [2023-12-09 15:23:15,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:23:16,888 INFO L124 PetriNetUnfolderBase]: 12996/21298 cut-off events. [2023-12-09 15:23:16,888 INFO L125 PetriNetUnfolderBase]: For 13344/33002 co-relation queries the response was YES. [2023-12-09 15:23:17,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78617 conditions, 21298 events. 12996/21298 cut-off events. For 13344/33002 co-relation queries the response was YES. Maximal size of possible extension queue 1087. Compared 169797 event pairs, 2601 based on Foata normal form. 415/17100 useless extension candidates. Maximal degree in co-relation 68392. Up to 10521 conditions per place. [2023-12-09 15:23:17,163 INFO L140 encePairwiseOnDemand]: 120/129 looper letters, 305 selfloop transitions, 17 changer transitions 69/473 dead transitions. [2023-12-09 15:23:17,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 473 transitions, 3890 flow [2023-12-09 15:23:17,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-09 15:23:17,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-09 15:23:17,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 756 transitions. [2023-12-09 15:23:17,165 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8372093023255814 [2023-12-09 15:23:17,165 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 756 transitions. [2023-12-09 15:23:17,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 756 transitions. [2023-12-09 15:23:17,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:23:17,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 756 transitions. [2023-12-09 15:23:17,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:23:17,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 129.0) internal successors, (1032), 8 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:23:17,168 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 129.0) internal successors, (1032), 8 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:23:17,169 INFO L308 CegarLoopForPetriNet]: 116 programPoint places, 22 predicate places. [2023-12-09 15:23:17,169 INFO L500 AbstractCegarLoop]: Abstraction has has 138 places, 473 transitions, 3890 flow [2023-12-09 15:23:17,169 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:23:17,169 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:23:17,169 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:23:17,169 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-09 15:23:17,169 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-12-09 15:23:17,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:23:17,170 INFO L85 PathProgramCache]: Analyzing trace with hash 470407425, now seen corresponding path program 3 times [2023-12-09 15:23:17,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:23:17,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79275011] [2023-12-09 15:23:17,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:23:17,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:23:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:23:17,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:23:17,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:23:17,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79275011] [2023-12-09 15:23:17,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79275011] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:23:17,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:23:17,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-09 15:23:17,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415436854] [2023-12-09 15:23:17,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:23:17,246 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-09 15:23:17,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:23:17,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-09 15:23:17,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-09 15:23:17,247 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 129 [2023-12-09 15:23:17,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 473 transitions, 3890 flow. Second operand has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:23:17,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:23:17,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 129 [2023-12-09 15:23:17,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:23:20,124 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L72-5-->L73: Formula: (< |v_thread4Thread1of1ForFork3_~i~3#1_3| v_~N~0_8) InVars {thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_3|, ~N~0=v_~N~0_8} OutVars{thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[][839], [thread4Thread1of1ForFork3InUse, thread2Thread1of1ForFork0InUse, 20#L47true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 157#true, 151#true, 36#L51-5true, 87#L63true, 25#L73true, 138#(= ~counter1~0 0), 7#L91-4true, 168#(<= ~N~0 0), 178#(= |thread2Thread1of1ForFork0_~i~1#1| 0)]) [2023-12-09 15:23:20,124 INFO L294 olderBase$Statistics]: this new event has 63 ancestors and is cut-off event [2023-12-09 15:23:20,125 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-12-09 15:23:20,125 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-12-09 15:23:20,125 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-12-09 15:23:20,125 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-5-->L72-6: Formula: (<= v_~N~0_7 |v_thread4Thread1of1ForFork3_~i~3#1_5|) InVars {thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_5|, ~N~0=v_~N~0_7} OutVars{thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_5|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[][840], [thread4Thread1of1ForFork3InUse, thread2Thread1of1ForFork0InUse, 20#L47true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 14#L72-6true, 157#true, 36#L51-5true, 151#true, 87#L63true, 138#(= ~counter1~0 0), 7#L91-4true, 168#(<= ~N~0 0), 178#(= |thread2Thread1of1ForFork0_~i~1#1| 0)]) [2023-12-09 15:23:20,125 INFO L294 olderBase$Statistics]: this new event has 63 ancestors and is cut-off event [2023-12-09 15:23:20,125 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-12-09 15:23:20,125 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-12-09 15:23:20,125 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-12-09 15:23:20,125 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L72-5-->L73: Formula: (< |v_thread4Thread1of1ForFork3_~i~3#1_3| v_~N~0_8) InVars {thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_3|, ~N~0=v_~N~0_8} OutVars{thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[][839], [thread4Thread1of1ForFork3InUse, thread2Thread1of1ForFork0InUse, 20#L47true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 157#true, 151#true, 36#L51-5true, 25#L73true, 138#(= ~counter1~0 0), 7#L91-4true, 168#(<= ~N~0 0), 45#L62-6true, 178#(= |thread2Thread1of1ForFork0_~i~1#1| 0)]) [2023-12-09 15:23:20,126 INFO L294 olderBase$Statistics]: this new event has 63 ancestors and is cut-off event [2023-12-09 15:23:20,126 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-12-09 15:23:20,126 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-12-09 15:23:20,126 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-12-09 15:23:20,126 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-5-->L72-6: Formula: (<= v_~N~0_7 |v_thread4Thread1of1ForFork3_~i~3#1_5|) InVars {thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_5|, ~N~0=v_~N~0_7} OutVars{thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_5|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[][840], [thread4Thread1of1ForFork3InUse, thread2Thread1of1ForFork0InUse, 20#L47true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 14#L72-6true, 157#true, 36#L51-5true, 151#true, 138#(= ~counter1~0 0), 7#L91-4true, 168#(<= ~N~0 0), 45#L62-6true, 178#(= |thread2Thread1of1ForFork0_~i~1#1| 0)]) [2023-12-09 15:23:20,126 INFO L294 olderBase$Statistics]: this new event has 63 ancestors and is cut-off event [2023-12-09 15:23:20,126 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-12-09 15:23:20,126 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-12-09 15:23:20,126 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-12-09 15:23:20,466 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L72-5-->L73: Formula: (< |v_thread4Thread1of1ForFork3_~i~3#1_3| v_~N~0_8) InVars {thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_3|, ~N~0=v_~N~0_8} OutVars{thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[][839], [thread4Thread1of1ForFork3InUse, thread2Thread1of1ForFork0InUse, 20#L47true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 157#true, 151#true, 36#L51-5true, 25#L73true, 138#(= ~counter1~0 0), 7#L91-4true, 168#(<= ~N~0 0), 13#L65true, 178#(= |thread2Thread1of1ForFork0_~i~1#1| 0)]) [2023-12-09 15:23:20,466 INFO L294 olderBase$Statistics]: this new event has 64 ancestors and is cut-off event [2023-12-09 15:23:20,467 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-12-09 15:23:20,467 INFO L297 olderBase$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-12-09 15:23:20,467 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-12-09 15:23:20,467 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-5-->L72-6: Formula: (<= v_~N~0_7 |v_thread4Thread1of1ForFork3_~i~3#1_5|) InVars {thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_5|, ~N~0=v_~N~0_7} OutVars{thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_5|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[][840], [thread4Thread1of1ForFork3InUse, thread2Thread1of1ForFork0InUse, 20#L47true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 14#L72-6true, 157#true, 151#true, 36#L51-5true, 138#(= ~counter1~0 0), 7#L91-4true, 13#L65true, 168#(<= ~N~0 0), 178#(= |thread2Thread1of1ForFork0_~i~1#1| 0)]) [2023-12-09 15:23:20,467 INFO L294 olderBase$Statistics]: this new event has 64 ancestors and is cut-off event [2023-12-09 15:23:20,467 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-12-09 15:23:20,467 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-12-09 15:23:20,467 INFO L297 olderBase$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-12-09 15:23:20,468 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L72-5-->L73: Formula: (< |v_thread4Thread1of1ForFork3_~i~3#1_3| v_~N~0_8) InVars {thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_3|, ~N~0=v_~N~0_8} OutVars{thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[][839], [thread4Thread1of1ForFork3InUse, thread2Thread1of1ForFork0InUse, 20#L47true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 157#true, 36#L51-5true, 151#true, 10#L68true, 25#L73true, 138#(= ~counter1~0 0), 7#L91-4true, 168#(<= ~N~0 0), 178#(= |thread2Thread1of1ForFork0_~i~1#1| 0)]) [2023-12-09 15:23:20,468 INFO L294 olderBase$Statistics]: this new event has 64 ancestors and is cut-off event [2023-12-09 15:23:20,468 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-12-09 15:23:20,468 INFO L297 olderBase$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-12-09 15:23:20,468 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-12-09 15:23:20,468 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-5-->L72-6: Formula: (<= v_~N~0_7 |v_thread4Thread1of1ForFork3_~i~3#1_5|) InVars {thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_5|, ~N~0=v_~N~0_7} OutVars{thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_5|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[][840], [thread4Thread1of1ForFork3InUse, thread2Thread1of1ForFork0InUse, 20#L47true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 14#L72-6true, 157#true, 151#true, 36#L51-5true, 10#L68true, 138#(= ~counter1~0 0), 7#L91-4true, 168#(<= ~N~0 0), 178#(= |thread2Thread1of1ForFork0_~i~1#1| 0)]) [2023-12-09 15:23:20,468 INFO L294 olderBase$Statistics]: this new event has 64 ancestors and is cut-off event [2023-12-09 15:23:20,468 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-12-09 15:23:20,468 INFO L297 olderBase$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-12-09 15:23:20,468 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-12-09 15:23:20,655 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L72-5-->L73: Formula: (< |v_thread4Thread1of1ForFork3_~i~3#1_3| v_~N~0_8) InVars {thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_3|, ~N~0=v_~N~0_8} OutVars{thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[][839], [thread4Thread1of1ForFork3InUse, 9#L62-3true, thread2Thread1of1ForFork0InUse, 20#L47true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 157#true, 151#true, 36#L51-5true, 25#L73true, 138#(= ~counter1~0 0), 7#L91-4true, 168#(<= ~N~0 0), 178#(= |thread2Thread1of1ForFork0_~i~1#1| 0)]) [2023-12-09 15:23:20,655 INFO L294 olderBase$Statistics]: this new event has 65 ancestors and is cut-off event [2023-12-09 15:23:20,655 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-12-09 15:23:20,656 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-12-09 15:23:20,656 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-12-09 15:23:20,656 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-5-->L72-6: Formula: (<= v_~N~0_7 |v_thread4Thread1of1ForFork3_~i~3#1_5|) InVars {thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_5|, ~N~0=v_~N~0_7} OutVars{thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_5|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[][840], [thread4Thread1of1ForFork3InUse, 9#L62-3true, thread2Thread1of1ForFork0InUse, 20#L47true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 14#L72-6true, 157#true, 36#L51-5true, 151#true, 138#(= ~counter1~0 0), 7#L91-4true, 168#(<= ~N~0 0), 178#(= |thread2Thread1of1ForFork0_~i~1#1| 0)]) [2023-12-09 15:23:20,656 INFO L294 olderBase$Statistics]: this new event has 65 ancestors and is cut-off event [2023-12-09 15:23:20,656 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-12-09 15:23:20,656 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-12-09 15:23:20,656 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-12-09 15:23:22,051 INFO L124 PetriNetUnfolderBase]: 33868/53070 cut-off events. [2023-12-09 15:23:22,052 INFO L125 PetriNetUnfolderBase]: For 90175/128941 co-relation queries the response was YES. [2023-12-09 15:23:22,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228846 conditions, 53070 events. 33868/53070 cut-off events. For 90175/128941 co-relation queries the response was YES. Maximal size of possible extension queue 2388. Compared 449620 event pairs, 6197 based on Foata normal form. 662/44129 useless extension candidates. Maximal degree in co-relation 201875. Up to 25420 conditions per place. [2023-12-09 15:23:22,677 INFO L140 encePairwiseOnDemand]: 120/129 looper letters, 1140 selfloop transitions, 42 changer transitions 273/1560 dead transitions. [2023-12-09 15:23:22,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 1560 transitions, 17266 flow [2023-12-09 15:23:22,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-09 15:23:22,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-09 15:23:22,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 762 transitions. [2023-12-09 15:23:22,679 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8438538205980066 [2023-12-09 15:23:22,679 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 762 transitions. [2023-12-09 15:23:22,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 762 transitions. [2023-12-09 15:23:22,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:23:22,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 762 transitions. [2023-12-09 15:23:22,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 108.85714285714286) internal successors, (762), 7 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:23:22,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 129.0) internal successors, (1032), 8 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:23:22,682 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 129.0) internal successors, (1032), 8 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:23:22,683 INFO L308 CegarLoopForPetriNet]: 116 programPoint places, 28 predicate places. [2023-12-09 15:23:22,683 INFO L500 AbstractCegarLoop]: Abstraction has has 144 places, 1560 transitions, 17266 flow [2023-12-09 15:23:22,683 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:23:22,683 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:23:22,683 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:23:22,683 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-09 15:23:22,684 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-12-09 15:23:22,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:23:22,684 INFO L85 PathProgramCache]: Analyzing trace with hash 247327351, now seen corresponding path program 4 times [2023-12-09 15:23:22,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:23:22,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329469430] [2023-12-09 15:23:22,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:23:22,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:23:22,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:23:22,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:23:22,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:23:22,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329469430] [2023-12-09 15:23:22,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329469430] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:23:22,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:23:22,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-09 15:23:22,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337979921] [2023-12-09 15:23:22,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:23:22,747 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-09 15:23:22,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:23:22,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-09 15:23:22,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-09 15:23:22,748 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 129 [2023-12-09 15:23:22,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 1560 transitions, 17266 flow. Second operand has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:23:22,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:23:22,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 129 [2023-12-09 15:23:22,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:23:37,858 INFO L124 PetriNetUnfolderBase]: 72118/109791 cut-off events. [2023-12-09 15:23:37,858 INFO L125 PetriNetUnfolderBase]: For 309486/497891 co-relation queries the response was YES. [2023-12-09 15:23:38,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528023 conditions, 109791 events. 72118/109791 cut-off events. For 309486/497891 co-relation queries the response was YES. Maximal size of possible extension queue 4364. Compared 950595 event pairs, 14124 based on Foata normal form. 1885/95012 useless extension candidates. Maximal degree in co-relation 454430. Up to 49232 conditions per place. [2023-12-09 15:23:39,338 INFO L140 encePairwiseOnDemand]: 119/129 looper letters, 2079 selfloop transitions, 349 changer transitions 614/3151 dead transitions. [2023-12-09 15:23:39,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 3151 transitions, 40740 flow [2023-12-09 15:23:39,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-09 15:23:39,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-09 15:23:39,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 669 transitions. [2023-12-09 15:23:39,340 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8643410852713178 [2023-12-09 15:23:39,340 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 669 transitions. [2023-12-09 15:23:39,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 669 transitions. [2023-12-09 15:23:39,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:23:39,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 669 transitions. [2023-12-09 15:23:39,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 111.5) internal successors, (669), 6 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:23:39,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:23:39,343 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:23:39,343 INFO L308 CegarLoopForPetriNet]: 116 programPoint places, 33 predicate places. [2023-12-09 15:23:39,344 INFO L500 AbstractCegarLoop]: Abstraction has has 149 places, 3151 transitions, 40740 flow [2023-12-09 15:23:39,344 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:23:39,344 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:23:39,344 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:23:39,344 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-09 15:23:39,344 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-12-09 15:23:39,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:23:39,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1798699185, now seen corresponding path program 5 times [2023-12-09 15:23:39,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:23:39,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22971551] [2023-12-09 15:23:39,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:23:39,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:23:39,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:23:39,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:23:39,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:23:39,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22971551] [2023-12-09 15:23:39,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22971551] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:23:39,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822287874] [2023-12-09 15:23:39,501 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-09 15:23:39,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:23:39,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:23:39,504 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-12-09 15:23:39,532 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-12-09 15:23:39,622 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 15:23:39,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:23:39,624 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-09 15:23:39,630 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:23:39,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:23:39,707 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:23:39,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:23:39,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822287874] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:23:39,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:23:39,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2023-12-09 15:23:39,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564860972] [2023-12-09 15:23:39,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:23:39,746 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-09 15:23:39,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:23:39,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-09 15:23:39,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-09 15:23:39,747 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 129 [2023-12-09 15:23:39,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 3151 transitions, 40740 flow. Second operand has 9 states, 9 states have (on average 96.44444444444444) internal successors, (868), 9 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:23:39,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:23:39,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 129 [2023-12-09 15:23:39,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:24:10,456 INFO L124 PetriNetUnfolderBase]: 89889/136347 cut-off events. [2023-12-09 15:24:10,457 INFO L125 PetriNetUnfolderBase]: For 404195/511414 co-relation queries the response was YES. [2023-12-09 15:24:11,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 755816 conditions, 136347 events. 89889/136347 cut-off events. For 404195/511414 co-relation queries the response was YES. Maximal size of possible extension queue 5114. Compared 1191922 event pairs, 9666 based on Foata normal form. 1657/119052 useless extension candidates. Maximal degree in co-relation 650967. Up to 62095 conditions per place. [2023-12-09 15:24:12,469 INFO L140 encePairwiseOnDemand]: 120/129 looper letters, 4215 selfloop transitions, 937 changer transitions 1064/6325 dead transitions. [2023-12-09 15:24:12,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 6325 transitions, 94849 flow [2023-12-09 15:24:12,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-09 15:24:12,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-12-09 15:24:12,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1508 transitions. [2023-12-09 15:24:12,473 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8349944629014396 [2023-12-09 15:24:12,473 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1508 transitions. [2023-12-09 15:24:12,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1508 transitions. [2023-12-09 15:24:12,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:24:12,473 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1508 transitions. [2023-12-09 15:24:12,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 107.71428571428571) internal successors, (1508), 14 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:24:12,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 129.0) internal successors, (1935), 15 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:24:12,479 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 129.0) internal successors, (1935), 15 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:24:12,480 INFO L308 CegarLoopForPetriNet]: 116 programPoint places, 46 predicate places. [2023-12-09 15:24:12,480 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 6325 transitions, 94849 flow [2023-12-09 15:24:12,480 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 96.44444444444444) internal successors, (868), 9 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:24:12,480 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:24:12,480 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:24:12,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-09 15:24:12,684 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:24:12,685 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-12-09 15:24:12,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:24:12,685 INFO L85 PathProgramCache]: Analyzing trace with hash -2107255297, now seen corresponding path program 2 times [2023-12-09 15:24:12,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:24:12,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290398086] [2023-12-09 15:24:12,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:24:12,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:24:12,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:24:12,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:24:12,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:24:12,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290398086] [2023-12-09 15:24:12,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290398086] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:24:12,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222693304] [2023-12-09 15:24:12,771 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 15:24:12,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:24:12,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:24:12,772 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-12-09 15:24:12,774 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-12-09 15:24:12,872 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 15:24:12,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:24:12,873 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-09 15:24:12,877 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:24:12,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:24:12,927 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:24:12,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:24:12,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222693304] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:24:12,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:24:12,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2023-12-09 15:24:12,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127900555] [2023-12-09 15:24:12,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:24:12,973 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-09 15:24:12,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:24:12,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-09 15:24:12,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-09 15:24:12,975 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 129 [2023-12-09 15:24:12,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 6325 transitions, 94849 flow. Second operand has 9 states, 9 states have (on average 96.44444444444444) internal successors, (868), 9 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:24:12,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:24:12,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 129 [2023-12-09 15:24:12,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:25:18,598 INFO L124 PetriNetUnfolderBase]: 111478/167989 cut-off events. [2023-12-09 15:25:18,598 INFO L125 PetriNetUnfolderBase]: For 733194/980864 co-relation queries the response was YES. [2023-12-09 15:25:19,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1060359 conditions, 167989 events. 111478/167989 cut-off events. For 733194/980864 co-relation queries the response was YES. Maximal size of possible extension queue 6350. Compared 1488408 event pairs, 7515 based on Foata normal form. 6281/149740 useless extension candidates. Maximal degree in co-relation 928250. Up to 86082 conditions per place. [2023-12-09 15:25:21,322 INFO L140 encePairwiseOnDemand]: 120/129 looper letters, 5929 selfloop transitions, 1117 changer transitions 1259/8425 dead transitions. [2023-12-09 15:25:21,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 8425 transitions, 142741 flow [2023-12-09 15:25:21,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-09 15:25:21,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-12-09 15:25:21,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1500 transitions. [2023-12-09 15:25:21,325 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8305647840531561 [2023-12-09 15:25:21,325 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1500 transitions. [2023-12-09 15:25:21,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1500 transitions. [2023-12-09 15:25:21,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:25:21,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1500 transitions. [2023-12-09 15:25:21,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 107.14285714285714) internal successors, (1500), 14 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:25:21,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 129.0) internal successors, (1935), 15 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:25:21,330 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 129.0) internal successors, (1935), 15 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:25:21,331 INFO L308 CegarLoopForPetriNet]: 116 programPoint places, 59 predicate places. [2023-12-09 15:25:21,331 INFO L500 AbstractCegarLoop]: Abstraction has has 175 places, 8425 transitions, 142741 flow [2023-12-09 15:25:21,331 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 96.44444444444444) internal successors, (868), 9 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:25:21,331 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:25:21,331 INFO L233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:25:21,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-09 15:25:21,536 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-12-09 15:25:21,536 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-12-09 15:25:21,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:25:21,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1538369063, now seen corresponding path program 3 times [2023-12-09 15:25:21,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:25:21,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647021326] [2023-12-09 15:25:21,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:25:21,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:25:21,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:25:21,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:25:21,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:25:21,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647021326] [2023-12-09 15:25:21,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647021326] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:25:21,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:25:21,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-09 15:25:21,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124081590] [2023-12-09 15:25:21,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:25:21,602 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-09 15:25:21,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:25:21,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-09 15:25:21,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-09 15:25:21,604 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 129 [2023-12-09 15:25:21,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 8425 transitions, 142741 flow. Second operand has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:25:21,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:25:21,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 129 [2023-12-09 15:25:21,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:25:36,640 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([362] L51-5-->L52: Formula: (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~N~0_3) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~N~0=v_~N~0_3} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][82], [thread4Thread1of1ForFork3InUse, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 80#L41-4true, 157#true, 151#true, 10#L68true, 136#true, 74#L52true, 165#true, 21#L72-5true, 764#(<= 1 ~N~0), 7#L91-4true, 1324#true, 196#true, 188#true, 178#(= |thread2Thread1of1ForFork0_~i~1#1| 0)]) [2023-12-09 15:25:36,640 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-12-09 15:25:36,640 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-12-09 15:25:36,640 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-12-09 15:25:36,640 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-12-09 15:25:36,640 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([363] L51-5-->L51-6: Formula: (<= v_~N~0_4 |v_thread2Thread1of1ForFork0_~i~1#1_5|) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_5|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][83], [thread4Thread1of1ForFork3InUse, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 157#true, 80#L41-4true, 151#true, 95#L51-6true, 10#L68true, 136#true, 182#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 0)), 165#true, 21#L72-5true, 764#(<= 1 ~N~0), 7#L91-4true, 1324#true, 196#true, 188#true]) [2023-12-09 15:25:36,640 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-12-09 15:25:36,640 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-12-09 15:25:36,640 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-12-09 15:25:36,640 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-12-09 15:25:36,641 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L72-5-->L73: Formula: (< |v_thread4Thread1of1ForFork3_~i~3#1_3| v_~N~0_8) InVars {thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_3|, ~N~0=v_~N~0_8} OutVars{thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_3|, ~N~0=v_~N~0_8} AuxVars[] AssignedVars[][1837], [thread4Thread1of1ForFork3InUse, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 157#true, 80#L41-4true, 151#true, 36#L51-5true, 10#L68true, 136#true, 25#L73true, 585#(< |thread4Thread1of1ForFork3_~i~3#1| ~N~0), 165#true, 7#L91-4true, 764#(<= 1 ~N~0), 1324#true, 188#true, 178#(= |thread2Thread1of1ForFork0_~i~1#1| 0)]) [2023-12-09 15:25:36,641 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-12-09 15:25:36,641 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-12-09 15:25:36,641 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-12-09 15:25:36,641 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-12-09 15:25:36,641 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-5-->L72-6: Formula: (<= v_~N~0_7 |v_thread4Thread1of1ForFork3_~i~3#1_5|) InVars {thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_5|, ~N~0=v_~N~0_7} OutVars{thread4Thread1of1ForFork3_~i~3#1=|v_thread4Thread1of1ForFork3_~i~3#1_5|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[][1838], [thread4Thread1of1ForFork3InUse, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 14#L72-6true, 157#true, 80#L41-4true, 151#true, 36#L51-5true, 10#L68true, 136#true, 165#true, 7#L91-4true, 764#(<= 1 ~N~0), 1324#true, 196#true, 188#true, 178#(= |thread2Thread1of1ForFork0_~i~1#1| 0)]) [2023-12-09 15:25:36,641 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-12-09 15:25:36,641 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-12-09 15:25:36,641 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-12-09 15:25:36,641 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-12-09 15:25:43,310 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([351] L41-5-->L41-6: Formula: (<= v_~N~0_1 v_thread1Thread1of1ForFork2_~i~0_5) InVars {thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][89], [thread4Thread1of1ForFork3InUse, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 70#L41-6true, 157#true, 151#true, 36#L51-5true, 10#L68true, 136#true, 1310#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (<= 1 ~N~0)), 165#true, 7#L91-4true, 21#L72-5true, 1324#true, 196#true, 188#true, 178#(= |thread2Thread1of1ForFork0_~i~1#1| 0)]) [2023-12-09 15:25:43,310 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is not cut-off event [2023-12-09 15:25:43,310 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is not cut-off event [2023-12-09 15:25:43,310 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is not cut-off event [2023-12-09 15:25:43,310 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is not cut-off event [2023-12-09 15:25:43,313 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([350] L41-5-->L42: Formula: (< v_thread1Thread1of1ForFork2_~i~0_3 v_~N~0_2) InVars {thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][90], [thread4Thread1of1ForFork3InUse, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 157#true, 84#L42true, 36#L51-5true, 151#true, 10#L68true, 136#true, 165#true, 764#(<= 1 ~N~0), 7#L91-4true, 21#L72-5true, 1324#true, 196#true, 188#true, 178#(= |thread2Thread1of1ForFork0_~i~1#1| 0)]) [2023-12-09 15:25:43,313 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is not cut-off event [2023-12-09 15:25:43,313 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is not cut-off event [2023-12-09 15:25:43,313 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is not cut-off event [2023-12-09 15:25:43,313 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is not cut-off event Received shutdown request... [2023-12-09 15:26:47,851 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-12-09 15:26:48,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-09 15:26:48,747 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-12-09 15:26:48,747 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-09 15:26:48,747 WARN L624 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (5states, 93/129 universal loopers) in iteration 9,while PetriNetUnfolder was constructing finite prefix that currently has 1052663 conditions, 149978 events (99776/149977 cut-off events. For 790397/925651 co-relation queries the response was YES. Maximal size of possible extension queue 6353. Compared 1350493 event pairs, 6726 based on Foata normal form. 3890/134895 useless extension candidates. Maximal degree in co-relation 957683. Up to 73733 conditions per place.). [2023-12-09 15:26:48,749 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2023-12-09 15:26:48,749 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-12-09 15:26:48,749 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-12-09 15:26:48,749 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2023-12-09 15:26:48,749 INFO L457 BasicCegarLoop]: Path program histogram: [5, 3, 1] [2023-12-09 15:26:48,752 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-09 15:26:48,752 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-09 15:26:48,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 03:26:48 BasicIcfg [2023-12-09 15:26:48,755 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-09 15:26:48,755 INFO L158 Benchmark]: Toolchain (without parser) took 219148.90ms. Allocated memory was 190.8MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 139.8MB in the beginning and 4.5GB in the end (delta: -4.3GB). Peak memory consumption was 4.3GB. Max. memory is 8.0GB. [2023-12-09 15:26:48,756 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 190.8MB. Free memory is still 138.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-09 15:26:48,756 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.39ms. Allocated memory is still 190.8MB. Free memory was 139.8MB in the beginning and 128.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-09 15:26:48,756 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.82ms. Allocated memory is still 190.8MB. Free memory was 128.3MB in the beginning and 126.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-09 15:26:48,756 INFO L158 Benchmark]: Boogie Preprocessor took 22.84ms. Allocated memory is still 190.8MB. Free memory was 126.2MB in the beginning and 124.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-09 15:26:48,756 INFO L158 Benchmark]: RCFGBuilder took 398.73ms. Allocated memory is still 190.8MB. Free memory was 124.8MB in the beginning and 105.9MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-09 15:26:48,757 INFO L158 Benchmark]: TraceAbstraction took 218487.03ms. Allocated memory was 190.8MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 105.2MB in the beginning and 4.5GB in the end (delta: -4.3GB). Peak memory consumption was 4.3GB. Max. memory is 8.0GB. [2023-12-09 15:26:48,757 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 190.8MB. Free memory is still 138.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 194.39ms. Allocated memory is still 190.8MB. Free memory was 139.8MB in the beginning and 128.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.82ms. Allocated memory is still 190.8MB. Free memory was 128.3MB in the beginning and 126.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.84ms. Allocated memory is still 190.8MB. Free memory was 126.2MB in the beginning and 124.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 398.73ms. Allocated memory is still 190.8MB. Free memory was 124.8MB in the beginning and 105.9MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 218487.03ms. Allocated memory was 190.8MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 105.2MB in the beginning and 4.5GB in the end (delta: -4.3GB). Peak memory consumption was 4.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (5states, 93/129 universal loopers) in iteration 9,while PetriNetUnfolder was constructing finite prefix that currently has 1052663 conditions, 149978 events (99776/149977 cut-off events. For 790397/925651 co-relation queries the response was YES. Maximal size of possible extension queue 6353. Compared 1350493 event pairs, 6726 based on Foata normal form. 3890/134895 useless extension candidates. Maximal degree in co-relation 957683. Up to 73733 conditions per place.). - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (5states, 93/129 universal loopers) in iteration 9,while PetriNetUnfolder was constructing finite prefix that currently has 1052663 conditions, 149978 events (99776/149977 cut-off events. For 790397/925651 co-relation queries the response was YES. Maximal size of possible extension queue 6353. Compared 1350493 event pairs, 6726 based on Foata normal form. 3890/134895 useless extension candidates. Maximal degree in co-relation 957683. Up to 73733 conditions per place.). - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (5states, 93/129 universal loopers) in iteration 9,while PetriNetUnfolder was constructing finite prefix that currently has 1052663 conditions, 149978 events (99776/149977 cut-off events. For 790397/925651 co-relation queries the response was YES. Maximal size of possible extension queue 6353. Compared 1350493 event pairs, 6726 based on Foata normal form. 3890/134895 useless extension candidates. Maximal degree in co-relation 957683. Up to 73733 conditions per place.). - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (5states, 93/129 universal loopers) in iteration 9,while PetriNetUnfolder was constructing finite prefix that currently has 1052663 conditions, 149978 events (99776/149977 cut-off events. For 790397/925651 co-relation queries the response was YES. Maximal size of possible extension queue 6353. Compared 1350493 event pairs, 6726 based on Foata normal form. 3890/134895 useless extension candidates. Maximal degree in co-relation 957683. Up to 73733 conditions per place.). - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (5states, 93/129 universal loopers) in iteration 9,while PetriNetUnfolder was constructing finite prefix that currently has 1052663 conditions, 149978 events (99776/149977 cut-off events. For 790397/925651 co-relation queries the response was YES. Maximal size of possible extension queue 6353. Compared 1350493 event pairs, 6726 based on Foata normal form. 3890/134895 useless extension candidates. Maximal degree in co-relation 957683. Up to 73733 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 169 locations, 5 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: 218.4s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 215.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 737 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 737 mSDsluCounter, 561 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 293 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1765 IncrementalHoareTripleChecker+Invalid, 1781 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 268 mSDtfsCounter, 1765 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 442 GetRequests, 377 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142741occurred in iteration=8, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 996 NumberOfCodeBlocks, 996 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1165 ConstructedInterpolants, 0 QuantifiedInterpolants, 1900 SizeOfPredicates, 8 NumberOfNonLiveVariables, 544 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 6/12 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