/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/unroll-5.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 15:38:29,244 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 15:38:29,329 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:38:29,361 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 15:38:29,362 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 15:38:29,362 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 15:38:29,363 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 15:38:29,363 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 15:38:29,364 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 15:38:29,367 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 15:38:29,368 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 15:38:29,368 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 15:38:29,369 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 15:38:29,370 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 15:38:29,370 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 15:38:29,370 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 15:38:29,371 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 15:38:29,371 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 15:38:29,371 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 15:38:29,371 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 15:38:29,372 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 15:38:29,372 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 15:38:29,373 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 15:38:29,373 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 15:38:29,373 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 15:38:29,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:38:29,375 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 15:38:29,375 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 15:38:29,375 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 15:38:29,375 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 15:38:29,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 15:38:29,376 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 15:38:29,377 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 15:38:29,377 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:38:29,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 15:38:29,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 15:38:29,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 15:38:29,633 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 15:38:29,633 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 15:38:29,634 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-5.wvr.c [2023-12-09 15:38:30,743 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 15:38:30,911 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 15:38:30,911 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-5.wvr.c [2023-12-09 15:38:30,916 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8be5b6d2d/55b82bce6cf849cb86d9f856e63abf69/FLAG03ddf85fb [2023-12-09 15:38:30,926 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8be5b6d2d/55b82bce6cf849cb86d9f856e63abf69 [2023-12-09 15:38:30,927 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 15:38:30,928 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 15:38:30,929 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 15:38:30,929 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 15:38:30,939 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 15:38:30,939 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:38:30" (1/1) ... [2023-12-09 15:38:30,940 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76368248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:38:30, skipping insertion in model container [2023-12-09 15:38:30,940 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:38:30" (1/1) ... [2023-12-09 15:38:30,964 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 15:38:31,111 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/unroll-5.wvr.c[2670,2683] [2023-12-09 15:38:31,123 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:38:31,133 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 15:38:31,166 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/unroll-5.wvr.c[2670,2683] [2023-12-09 15:38:31,172 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:38:31,182 INFO L206 MainTranslator]: Completed translation [2023-12-09 15:38:31,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:38:31 WrapperNode [2023-12-09 15:38:31,183 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 15:38:31,183 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 15:38:31,184 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 15:38:31,184 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 15:38:31,189 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:38:31" (1/1) ... [2023-12-09 15:38:31,195 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:38:31" (1/1) ... [2023-12-09 15:38:31,218 INFO L138 Inliner]: procedures = 24, calls = 38, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 169 [2023-12-09 15:38:31,218 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 15:38:31,219 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 15:38:31,219 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 15:38:31,219 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 15:38:31,226 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:38:31" (1/1) ... [2023-12-09 15:38:31,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:38:31" (1/1) ... [2023-12-09 15:38:31,230 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:38:31" (1/1) ... [2023-12-09 15:38:31,230 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:38:31" (1/1) ... [2023-12-09 15:38:31,237 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:38:31" (1/1) ... [2023-12-09 15:38:31,239 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:38:31" (1/1) ... [2023-12-09 15:38:31,241 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:38:31" (1/1) ... [2023-12-09 15:38:31,242 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:38:31" (1/1) ... [2023-12-09 15:38:31,244 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 15:38:31,245 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 15:38:31,245 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 15:38:31,245 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 15:38:31,246 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:38:31" (1/1) ... [2023-12-09 15:38:31,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:38:31,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:38:31,278 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:38:31,280 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:38:31,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 15:38:31,301 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-09 15:38:31,301 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-09 15:38:31,301 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-09 15:38:31,302 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-09 15:38:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 15:38:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 15:38:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 15:38:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-09 15:38:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 15:38:31,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 15:38:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-09 15:38:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 15:38:31,304 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:38:31,412 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 15:38:31,414 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 15:38:31,765 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 15:38:31,777 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 15:38:31,778 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-09 15:38:31,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:38:31 BoogieIcfgContainer [2023-12-09 15:38:31,779 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 15:38:31,781 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 15:38:31,781 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 15:38:31,789 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 15:38:31,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:38:30" (1/3) ... [2023-12-09 15:38:31,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54dbd3bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:38:31, skipping insertion in model container [2023-12-09 15:38:31,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:38:31" (2/3) ... [2023-12-09 15:38:31,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54dbd3bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:38:31, skipping insertion in model container [2023-12-09 15:38:31,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:38:31" (3/3) ... [2023-12-09 15:38:31,791 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-5.wvr.c [2023-12-09 15:38:31,805 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 15:38:31,805 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-09 15:38:31,805 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 15:38:31,901 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-09 15:38:31,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 215 transitions, 444 flow [2023-12-09 15:38:32,024 INFO L124 PetriNetUnfolderBase]: 17/213 cut-off events. [2023-12-09 15:38:32,024 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-09 15:38:32,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 213 events. 17/213 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 185 event pairs, 0 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 111. Up to 2 conditions per place. [2023-12-09 15:38:32,030 INFO L82 GeneralOperation]: Start removeDead. Operand has 205 places, 215 transitions, 444 flow [2023-12-09 15:38:32,035 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 194 places, 204 transitions, 420 flow [2023-12-09 15:38:32,046 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:38:32,051 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;@3e1a85db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:38:32,051 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-09 15:38:32,080 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:38:32,080 INFO L124 PetriNetUnfolderBase]: 13/159 cut-off events. [2023-12-09 15:38:32,081 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-09 15:38:32,081 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:38:32,081 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, 1, 1, 1, 1, 1, 1] [2023-12-09 15:38:32,082 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:38:32,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:38:32,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1691187430, now seen corresponding path program 1 times [2023-12-09 15:38:32,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:38:32,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942990741] [2023-12-09 15:38:32,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:38:32,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:38:32,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:38:32,745 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:38:32,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:38:32,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942990741] [2023-12-09 15:38:32,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942990741] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:38:32,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:38:32,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-09 15:38:32,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331258852] [2023-12-09 15:38:32,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:38:32,754 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-09 15:38:32,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:38:32,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-09 15:38:32,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-09 15:38:32,786 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 215 [2023-12-09 15:38:32,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 204 transitions, 420 flow. Second operand has 8 states, 8 states have (on average 145.625) internal successors, (1165), 8 states have internal predecessors, (1165), 0 states have call successors, (0), 0 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:38:32,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:38:32,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 215 [2023-12-09 15:38:32,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:38:32,953 INFO L124 PetriNetUnfolderBase]: 26/337 cut-off events. [2023-12-09 15:38:32,953 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2023-12-09 15:38:32,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 458 conditions, 337 events. 26/337 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 783 event pairs, 11 based on Foata normal form. 43/345 useless extension candidates. Maximal degree in co-relation 273. Up to 62 conditions per place. [2023-12-09 15:38:32,957 INFO L140 encePairwiseOnDemand]: 191/215 looper letters, 50 selfloop transitions, 9 changer transitions 5/194 dead transitions. [2023-12-09 15:38:32,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 194 transitions, 528 flow [2023-12-09 15:38:32,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-09 15:38:32,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-09 15:38:32,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1200 transitions. [2023-12-09 15:38:32,974 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6976744186046512 [2023-12-09 15:38:32,975 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1200 transitions. [2023-12-09 15:38:32,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1200 transitions. [2023-12-09 15:38:32,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:38:32,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1200 transitions. [2023-12-09 15:38:32,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 150.0) internal successors, (1200), 8 states have internal predecessors, (1200), 0 states have call successors, (0), 0 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:38:32,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 215.0) internal successors, (1935), 9 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:38:32,995 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 215.0) internal successors, (1935), 9 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:38:33,000 INFO L308 CegarLoopForPetriNet]: 194 programPoint places, 7 predicate places. [2023-12-09 15:38:33,001 INFO L500 AbstractCegarLoop]: Abstraction has has 201 places, 194 transitions, 528 flow [2023-12-09 15:38:33,002 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 145.625) internal successors, (1165), 8 states have internal predecessors, (1165), 0 states have call successors, (0), 0 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:38:33,002 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:38:33,002 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:38:33,002 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 15:38:33,003 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:38:33,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:38:33,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1537413067, now seen corresponding path program 1 times [2023-12-09 15:38:33,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:38:33,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765877256] [2023-12-09 15:38:33,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:38:33,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:38:33,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:38:33,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:38:33,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:38:33,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765877256] [2023-12-09 15:38:33,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765877256] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:38:33,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:38:33,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-09 15:38:33,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651946394] [2023-12-09 15:38:33,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:38:33,389 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-09 15:38:33,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:38:33,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-09 15:38:33,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-09 15:38:33,393 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 215 [2023-12-09 15:38:33,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 194 transitions, 528 flow. Second operand has 6 states, 6 states have (on average 147.0) internal successors, (882), 6 states have internal predecessors, (882), 0 states have call successors, (0), 0 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:38:33,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:38:33,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 215 [2023-12-09 15:38:33,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:38:33,685 INFO L124 PetriNetUnfolderBase]: 145/922 cut-off events. [2023-12-09 15:38:33,686 INFO L125 PetriNetUnfolderBase]: For 294/299 co-relation queries the response was YES. [2023-12-09 15:38:33,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1510 conditions, 922 events. 145/922 cut-off events. For 294/299 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 5113 event pairs, 47 based on Foata normal form. 0/850 useless extension candidates. Maximal degree in co-relation 1195. Up to 162 conditions per place. [2023-12-09 15:38:33,696 INFO L140 encePairwiseOnDemand]: 203/215 looper letters, 83 selfloop transitions, 5 changer transitions 11/234 dead transitions. [2023-12-09 15:38:33,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 234 transitions, 869 flow [2023-12-09 15:38:33,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:38:33,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:38:33,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1369 transitions. [2023-12-09 15:38:33,700 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7074935400516796 [2023-12-09 15:38:33,701 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1369 transitions. [2023-12-09 15:38:33,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1369 transitions. [2023-12-09 15:38:33,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:38:33,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1369 transitions. [2023-12-09 15:38:33,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 152.11111111111111) internal successors, (1369), 9 states have internal predecessors, (1369), 0 states have call successors, (0), 0 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:38:33,708 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 215.0) internal successors, (2150), 10 states have internal predecessors, (2150), 0 states have call successors, (0), 0 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:38:33,709 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 215.0) internal successors, (2150), 10 states have internal predecessors, (2150), 0 states have call successors, (0), 0 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:38:33,710 INFO L308 CegarLoopForPetriNet]: 194 programPoint places, 15 predicate places. [2023-12-09 15:38:33,710 INFO L500 AbstractCegarLoop]: Abstraction has has 209 places, 234 transitions, 869 flow [2023-12-09 15:38:33,711 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 147.0) internal successors, (882), 6 states have internal predecessors, (882), 0 states have call successors, (0), 0 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:38:33,711 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:38:33,712 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, 1, 1, 1, 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:38:33,712 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-09 15:38:33,712 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:38:33,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:38:33,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1652916079, now seen corresponding path program 1 times [2023-12-09 15:38:33,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:38:33,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223878434] [2023-12-09 15:38:33,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:38:33,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:38:33,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:38:33,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:38:33,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:38:33,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223878434] [2023-12-09 15:38:33,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223878434] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:38:33,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:38:33,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-09 15:38:33,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356334211] [2023-12-09 15:38:33,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:38:33,846 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-09 15:38:33,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:38:33,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-09 15:38:33,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-09 15:38:33,848 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 215 [2023-12-09 15:38:33,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 234 transitions, 869 flow. Second operand has 4 states, 4 states have (on average 180.75) internal successors, (723), 4 states have internal predecessors, (723), 0 states have call successors, (0), 0 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:38:33,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:38:33,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 215 [2023-12-09 15:38:33,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:38:34,076 INFO L124 PetriNetUnfolderBase]: 274/1440 cut-off events. [2023-12-09 15:38:34,080 INFO L125 PetriNetUnfolderBase]: For 925/953 co-relation queries the response was YES. [2023-12-09 15:38:34,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2632 conditions, 1440 events. 274/1440 cut-off events. For 925/953 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 8970 event pairs, 118 based on Foata normal form. 0/1280 useless extension candidates. Maximal degree in co-relation 2247. Up to 282 conditions per place. [2023-12-09 15:38:34,091 INFO L140 encePairwiseOnDemand]: 209/215 looper letters, 33 selfloop transitions, 5 changer transitions 12/247 dead transitions. [2023-12-09 15:38:34,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 247 transitions, 1017 flow [2023-12-09 15:38:34,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-09 15:38:34,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-09 15:38:34,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 923 transitions. [2023-12-09 15:38:34,094 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8586046511627907 [2023-12-09 15:38:34,094 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 923 transitions. [2023-12-09 15:38:34,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 923 transitions. [2023-12-09 15:38:34,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:38:34,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 923 transitions. [2023-12-09 15:38:34,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 184.6) internal successors, (923), 5 states have internal predecessors, (923), 0 states have call successors, (0), 0 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:38:34,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 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:38:34,100 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 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:38:34,101 INFO L308 CegarLoopForPetriNet]: 194 programPoint places, 19 predicate places. [2023-12-09 15:38:34,102 INFO L500 AbstractCegarLoop]: Abstraction has has 213 places, 247 transitions, 1017 flow [2023-12-09 15:38:34,102 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 180.75) internal successors, (723), 4 states have internal predecessors, (723), 0 states have call successors, (0), 0 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:38:34,102 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:38:34,103 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, 1, 1, 1, 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:38:34,103 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-09 15:38:34,103 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:38:34,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:38:34,104 INFO L85 PathProgramCache]: Analyzing trace with hash 940049583, now seen corresponding path program 2 times [2023-12-09 15:38:34,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:38:34,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185567811] [2023-12-09 15:38:34,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:38:34,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:38:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:38:34,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:38:34,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:38:34,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185567811] [2023-12-09 15:38:34,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185567811] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:38:34,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157466136] [2023-12-09 15:38:34,402 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 15:38:34,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:38:34,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:38:34,408 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:38:34,432 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:38:34,537 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 15:38:34,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:38:34,552 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-09 15:38:34,558 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:38:34,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:38:34,687 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:38:34,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:38:34,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157466136] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-09 15:38:34,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-09 15:38:34,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 7 [2023-12-09 15:38:34,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410711039] [2023-12-09 15:38:34,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:38:34,792 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-09 15:38:34,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:38:34,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-09 15:38:34,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-12-09 15:38:34,795 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 215 [2023-12-09 15:38:34,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 247 transitions, 1017 flow. Second operand has 4 states, 4 states have (on average 180.75) internal successors, (723), 4 states have internal predecessors, (723), 0 states have call successors, (0), 0 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:38:34,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:38:34,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 215 [2023-12-09 15:38:34,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:38:35,046 INFO L124 PetriNetUnfolderBase]: 273/1501 cut-off events. [2023-12-09 15:38:35,046 INFO L125 PetriNetUnfolderBase]: For 1236/1266 co-relation queries the response was YES. [2023-12-09 15:38:35,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3086 conditions, 1501 events. 273/1501 cut-off events. For 1236/1266 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 9518 event pairs, 67 based on Foata normal form. 2/1352 useless extension candidates. Maximal degree in co-relation 2077. Up to 284 conditions per place. [2023-12-09 15:38:35,057 INFO L140 encePairwiseOnDemand]: 210/215 looper letters, 46 selfloop transitions, 8 changer transitions 14/265 dead transitions. [2023-12-09 15:38:35,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 265 transitions, 1240 flow [2023-12-09 15:38:35,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-09 15:38:35,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-09 15:38:35,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 747 transitions. [2023-12-09 15:38:35,061 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8686046511627907 [2023-12-09 15:38:35,061 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 747 transitions. [2023-12-09 15:38:35,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 747 transitions. [2023-12-09 15:38:35,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:38:35,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 747 transitions. [2023-12-09 15:38:35,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 186.75) internal successors, (747), 4 states have internal predecessors, (747), 0 states have call successors, (0), 0 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:38:35,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 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:38:35,065 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 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:38:35,068 INFO L308 CegarLoopForPetriNet]: 194 programPoint places, 22 predicate places. [2023-12-09 15:38:35,068 INFO L500 AbstractCegarLoop]: Abstraction has has 216 places, 265 transitions, 1240 flow [2023-12-09 15:38:35,068 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 180.75) internal successors, (723), 4 states have internal predecessors, (723), 0 states have call successors, (0), 0 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:38:35,068 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:38:35,069 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, 1, 1, 1, 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:38:35,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-09 15:38:35,275 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:38:35,275 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:38:35,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:38:35,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1676877739, now seen corresponding path program 3 times [2023-12-09 15:38:35,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:38:35,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594857792] [2023-12-09 15:38:35,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:38:35,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:38:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:38:35,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:38:35,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:38:35,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594857792] [2023-12-09 15:38:35,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594857792] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:38:35,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53118152] [2023-12-09 15:38:35,506 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-09 15:38:35,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:38:35,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:38:35,507 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:38:35,535 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:38:35,650 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-09 15:38:35,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:38:35,652 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-09 15:38:35,654 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:38:35,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:38:35,792 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-09 15:38:35,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53118152] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:38:35,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-09 15:38:35,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2023-12-09 15:38:35,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548488145] [2023-12-09 15:38:35,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:38:35,793 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-09 15:38:35,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:38:35,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-09 15:38:35,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-09 15:38:35,795 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 215 [2023-12-09 15:38:35,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 265 transitions, 1240 flow. Second operand has 4 states, 4 states have (on average 180.75) internal successors, (723), 4 states have internal predecessors, (723), 0 states have call successors, (0), 0 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:38:35,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:38:35,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 215 [2023-12-09 15:38:35,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:38:36,031 INFO L124 PetriNetUnfolderBase]: 270/1492 cut-off events. [2023-12-09 15:38:36,032 INFO L125 PetriNetUnfolderBase]: For 1706/1748 co-relation queries the response was YES. [2023-12-09 15:38:36,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3414 conditions, 1492 events. 270/1492 cut-off events. For 1706/1748 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 9393 event pairs, 62 based on Foata normal form. 9/1357 useless extension candidates. Maximal degree in co-relation 3013. Up to 285 conditions per place. [2023-12-09 15:38:36,042 INFO L140 encePairwiseOnDemand]: 210/215 looper letters, 47 selfloop transitions, 7 changer transitions 14/265 dead transitions. [2023-12-09 15:38:36,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 265 transitions, 1349 flow [2023-12-09 15:38:36,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-09 15:38:36,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-09 15:38:36,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 747 transitions. [2023-12-09 15:38:36,052 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8686046511627907 [2023-12-09 15:38:36,052 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 747 transitions. [2023-12-09 15:38:36,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 747 transitions. [2023-12-09 15:38:36,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:38:36,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 747 transitions. [2023-12-09 15:38:36,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 186.75) internal successors, (747), 4 states have internal predecessors, (747), 0 states have call successors, (0), 0 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:38:36,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 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:38:36,057 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 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:38:36,058 INFO L308 CegarLoopForPetriNet]: 194 programPoint places, 25 predicate places. [2023-12-09 15:38:36,058 INFO L500 AbstractCegarLoop]: Abstraction has has 219 places, 265 transitions, 1349 flow [2023-12-09 15:38:36,059 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 180.75) internal successors, (723), 4 states have internal predecessors, (723), 0 states have call successors, (0), 0 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:38:36,059 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:38:36,059 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:36,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-09 15:38:36,264 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:38:36,265 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:38:36,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:38:36,266 INFO L85 PathProgramCache]: Analyzing trace with hash 554499434, now seen corresponding path program 1 times [2023-12-09 15:38:36,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:38:36,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891864156] [2023-12-09 15:38:36,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:38:36,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:38:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:38:36,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:38:36,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:38:36,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891864156] [2023-12-09 15:38:36,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891864156] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:38:36,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:38:36,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-09 15:38:36,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695408763] [2023-12-09 15:38:36,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:38:36,422 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-09 15:38:36,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:38:36,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-09 15:38:36,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-09 15:38:36,424 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 215 [2023-12-09 15:38:36,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 265 transitions, 1349 flow. Second operand has 4 states, 4 states have (on average 188.75) internal successors, (755), 4 states have internal predecessors, (755), 0 states have call successors, (0), 0 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:38:36,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:38:36,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 215 [2023-12-09 15:38:36,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:38:36,668 INFO L124 PetriNetUnfolderBase]: 325/1737 cut-off events. [2023-12-09 15:38:36,668 INFO L125 PetriNetUnfolderBase]: For 3091/3474 co-relation queries the response was YES. [2023-12-09 15:38:36,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4224 conditions, 1737 events. 325/1737 cut-off events. For 3091/3474 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 11230 event pairs, 111 based on Foata normal form. 28/1579 useless extension candidates. Maximal degree in co-relation 3567. Up to 343 conditions per place. [2023-12-09 15:38:36,680 INFO L140 encePairwiseOnDemand]: 209/215 looper letters, 48 selfloop transitions, 7 changer transitions 21/284 dead transitions. [2023-12-09 15:38:36,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 284 transitions, 1642 flow [2023-12-09 15:38:36,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-09 15:38:36,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-09 15:38:36,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 956 transitions. [2023-12-09 15:38:36,683 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8893023255813953 [2023-12-09 15:38:36,683 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 956 transitions. [2023-12-09 15:38:36,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 956 transitions. [2023-12-09 15:38:36,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:38:36,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 956 transitions. [2023-12-09 15:38:36,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 191.2) internal successors, (956), 5 states have internal predecessors, (956), 0 states have call successors, (0), 0 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:38:36,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 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:38:36,688 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 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:38:36,688 INFO L308 CegarLoopForPetriNet]: 194 programPoint places, 29 predicate places. [2023-12-09 15:38:36,688 INFO L500 AbstractCegarLoop]: Abstraction has has 223 places, 284 transitions, 1642 flow [2023-12-09 15:38:36,689 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 188.75) internal successors, (755), 4 states have internal predecessors, (755), 0 states have call successors, (0), 0 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:38:36,689 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:38:36,689 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:36,689 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-09 15:38:36,689 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:38:36,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:38:36,690 INFO L85 PathProgramCache]: Analyzing trace with hash -7673596, now seen corresponding path program 2 times [2023-12-09 15:38:36,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:38:36,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408302264] [2023-12-09 15:38:36,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:38:36,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:38:36,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:38:36,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:38:36,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:38:36,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408302264] [2023-12-09 15:38:36,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408302264] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:38:36,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:38:36,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-09 15:38:36,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378244253] [2023-12-09 15:38:36,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:38:36,877 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-09 15:38:36,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:38:36,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-09 15:38:36,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-09 15:38:36,879 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 215 [2023-12-09 15:38:36,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 284 transitions, 1642 flow. Second operand has 5 states, 5 states have (on average 179.4) internal successors, (897), 5 states have internal predecessors, (897), 0 states have call successors, (0), 0 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:38:36,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:38:36,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 215 [2023-12-09 15:38:36,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:38:37,194 INFO L124 PetriNetUnfolderBase]: 387/2030 cut-off events. [2023-12-09 15:38:37,194 INFO L125 PetriNetUnfolderBase]: For 4139/4482 co-relation queries the response was YES. [2023-12-09 15:38:37,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5363 conditions, 2030 events. 387/2030 cut-off events. For 4139/4482 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 13617 event pairs, 163 based on Foata normal form. 18/1856 useless extension candidates. Maximal degree in co-relation 4225. Up to 359 conditions per place. [2023-12-09 15:38:37,210 INFO L140 encePairwiseOnDemand]: 208/215 looper letters, 83 selfloop transitions, 10 changer transitions 28/315 dead transitions. [2023-12-09 15:38:37,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 315 transitions, 2139 flow [2023-12-09 15:38:37,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-09 15:38:37,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-09 15:38:37,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 935 transitions. [2023-12-09 15:38:37,213 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8697674418604651 [2023-12-09 15:38:37,213 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 935 transitions. [2023-12-09 15:38:37,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 935 transitions. [2023-12-09 15:38:37,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:38:37,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 935 transitions. [2023-12-09 15:38:37,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 0 states have call successors, (0), 0 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:38:37,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 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:38:37,218 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 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:38:37,218 INFO L308 CegarLoopForPetriNet]: 194 programPoint places, 33 predicate places. [2023-12-09 15:38:37,219 INFO L500 AbstractCegarLoop]: Abstraction has has 227 places, 315 transitions, 2139 flow [2023-12-09 15:38:37,219 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 179.4) internal successors, (897), 5 states have internal predecessors, (897), 0 states have call successors, (0), 0 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:38:37,219 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:38:37,219 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:37,219 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-09 15:38:37,220 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:38:37,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:38:37,220 INFO L85 PathProgramCache]: Analyzing trace with hash -920711194, now seen corresponding path program 3 times [2023-12-09 15:38:37,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:38:37,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543709354] [2023-12-09 15:38:37,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:38:37,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:38:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:38:37,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:38:37,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:38:37,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543709354] [2023-12-09 15:38:37,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543709354] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:38:37,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792281673] [2023-12-09 15:38:37,455 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-09 15:38:37,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:38:37,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:38:37,457 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:38:37,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-09 15:38:37,603 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-09 15:38:37,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:38:37,605 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-09 15:38:37,609 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:38:37,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:38:37,873 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-09 15:38:37,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792281673] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:38:37,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-09 15:38:37,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-12-09 15:38:37,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828213543] [2023-12-09 15:38:37,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:38:37,874 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-09 15:38:37,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:38:37,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-09 15:38:37,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-09 15:38:37,876 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 215 [2023-12-09 15:38:37,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 315 transitions, 2139 flow. Second operand has 4 states, 4 states have (on average 188.75) internal successors, (755), 4 states have internal predecessors, (755), 0 states have call successors, (0), 0 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:38:37,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:38:37,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 215 [2023-12-09 15:38:37,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:38:38,156 INFO L124 PetriNetUnfolderBase]: 401/2082 cut-off events. [2023-12-09 15:38:38,157 INFO L125 PetriNetUnfolderBase]: For 5222/5513 co-relation queries the response was YES. [2023-12-09 15:38:38,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5923 conditions, 2082 events. 401/2082 cut-off events. For 5222/5513 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 14066 event pairs, 131 based on Foata normal form. 17/1907 useless extension candidates. Maximal degree in co-relation 5359. Up to 384 conditions per place. [2023-12-09 15:38:38,172 INFO L140 encePairwiseOnDemand]: 210/215 looper letters, 55 selfloop transitions, 13 changer transitions 28/320 dead transitions. [2023-12-09 15:38:38,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 320 transitions, 2371 flow [2023-12-09 15:38:38,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-09 15:38:38,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-09 15:38:38,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 772 transitions. [2023-12-09 15:38:38,175 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8976744186046511 [2023-12-09 15:38:38,175 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 772 transitions. [2023-12-09 15:38:38,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 772 transitions. [2023-12-09 15:38:38,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:38:38,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 772 transitions. [2023-12-09 15:38:38,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:38:38,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 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:38:38,179 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 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:38:38,179 INFO L308 CegarLoopForPetriNet]: 194 programPoint places, 36 predicate places. [2023-12-09 15:38:38,179 INFO L500 AbstractCegarLoop]: Abstraction has has 230 places, 320 transitions, 2371 flow [2023-12-09 15:38:38,180 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 188.75) internal successors, (755), 4 states have internal predecessors, (755), 0 states have call successors, (0), 0 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:38:38,180 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:38:38,180 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:38,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-09 15:38:38,386 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:38:38,387 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:38:38,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:38:38,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1390922564, now seen corresponding path program 4 times [2023-12-09 15:38:38,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:38:38,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822338046] [2023-12-09 15:38:38,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:38:38,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:38:38,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:38:38,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:38:38,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:38:38,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822338046] [2023-12-09 15:38:38,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822338046] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:38:38,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:38:38,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-09 15:38:38,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703688375] [2023-12-09 15:38:38,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:38:38,576 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-09 15:38:38,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:38:38,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-09 15:38:38,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-09 15:38:38,578 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 215 [2023-12-09 15:38:38,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 320 transitions, 2371 flow. Second operand has 5 states, 5 states have (on average 179.4) internal successors, (897), 5 states have internal predecessors, (897), 0 states have call successors, (0), 0 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:38:38,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:38:38,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 215 [2023-12-09 15:38:38,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:38:38,893 INFO L124 PetriNetUnfolderBase]: 413/2111 cut-off events. [2023-12-09 15:38:38,893 INFO L125 PetriNetUnfolderBase]: For 6772/7265 co-relation queries the response was YES. [2023-12-09 15:38:38,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6571 conditions, 2111 events. 413/2111 cut-off events. For 6772/7265 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 14318 event pairs, 154 based on Foata normal form. 15/1929 useless extension candidates. Maximal degree in co-relation 5097. Up to 457 conditions per place. [2023-12-09 15:38:38,913 INFO L140 encePairwiseOnDemand]: 208/215 looper letters, 89 selfloop transitions, 18 changer transitions 28/329 dead transitions. [2023-12-09 15:38:38,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 329 transitions, 2665 flow [2023-12-09 15:38:38,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-09 15:38:38,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-09 15:38:38,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 924 transitions. [2023-12-09 15:38:38,916 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8595348837209302 [2023-12-09 15:38:38,916 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 924 transitions. [2023-12-09 15:38:38,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 924 transitions. [2023-12-09 15:38:38,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:38:38,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 924 transitions. [2023-12-09 15:38:38,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 184.8) internal successors, (924), 5 states have internal predecessors, (924), 0 states have call successors, (0), 0 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:38:38,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 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:38:38,920 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 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:38:38,921 INFO L308 CegarLoopForPetriNet]: 194 programPoint places, 40 predicate places. [2023-12-09 15:38:38,921 INFO L500 AbstractCegarLoop]: Abstraction has has 234 places, 329 transitions, 2665 flow [2023-12-09 15:38:38,922 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 179.4) internal successors, (897), 5 states have internal predecessors, (897), 0 states have call successors, (0), 0 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:38:38,922 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:38:38,922 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:38,922 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-09 15:38:38,922 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:38:38,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:38:38,923 INFO L85 PathProgramCache]: Analyzing trace with hash 68237290, now seen corresponding path program 5 times [2023-12-09 15:38:38,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:38:38,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494226635] [2023-12-09 15:38:38,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:38:38,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:38:38,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:38:39,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:38:39,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:38:39,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494226635] [2023-12-09 15:38:39,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494226635] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:38:39,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514187226] [2023-12-09 15:38:39,181 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-09 15:38:39,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:38:39,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:38:39,185 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:38:39,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-09 15:38:39,299 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 15:38:39,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:38:39,301 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-09 15:38:39,305 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:38:39,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:38:39,505 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:38:39,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:38:39,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514187226] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-09 15:38:39,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-09 15:38:39,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 7 [2023-12-09 15:38:39,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621216772] [2023-12-09 15:38:39,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:38:39,645 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-09 15:38:39,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:38:39,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-09 15:38:39,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-12-09 15:38:39,646 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 215 [2023-12-09 15:38:39,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 329 transitions, 2665 flow. Second operand has 4 states, 4 states have (on average 188.75) internal successors, (755), 4 states have internal predecessors, (755), 0 states have call successors, (0), 0 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:38:39,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:38:39,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 215 [2023-12-09 15:38:39,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:38:39,921 INFO L124 PetriNetUnfolderBase]: 391/2054 cut-off events. [2023-12-09 15:38:39,921 INFO L125 PetriNetUnfolderBase]: For 6439/7040 co-relation queries the response was YES. [2023-12-09 15:38:39,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6523 conditions, 2054 events. 391/2054 cut-off events. For 6439/7040 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 13124 event pairs, 129 based on Foata normal form. 21/1895 useless extension candidates. Maximal degree in co-relation 5480. Up to 419 conditions per place. [2023-12-09 15:38:39,939 INFO L140 encePairwiseOnDemand]: 210/215 looper letters, 55 selfloop transitions, 25 changer transitions 27/327 dead transitions. [2023-12-09 15:38:39,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 327 transitions, 2879 flow [2023-12-09 15:38:39,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-09 15:38:39,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-09 15:38:39,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 771 transitions. [2023-12-09 15:38:39,942 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8965116279069767 [2023-12-09 15:38:39,942 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 771 transitions. [2023-12-09 15:38:39,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 771 transitions. [2023-12-09 15:38:39,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:38:39,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 771 transitions. [2023-12-09 15:38:39,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 192.75) internal successors, (771), 4 states have internal predecessors, (771), 0 states have call successors, (0), 0 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:38:39,947 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 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:38:39,947 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 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:38:39,948 INFO L308 CegarLoopForPetriNet]: 194 programPoint places, 42 predicate places. [2023-12-09 15:38:39,948 INFO L500 AbstractCegarLoop]: Abstraction has has 236 places, 327 transitions, 2879 flow [2023-12-09 15:38:39,948 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 188.75) internal successors, (755), 4 states have internal predecessors, (755), 0 states have call successors, (0), 0 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:38:39,948 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:38:39,949 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:39,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-09 15:38:40,154 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:38:40,155 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:38:40,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:38:40,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1869088246, now seen corresponding path program 1 times [2023-12-09 15:38:40,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:38:40,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617101459] [2023-12-09 15:38:40,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:38:40,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:38:40,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:38:40,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:38:40,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:38:40,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617101459] [2023-12-09 15:38:40,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617101459] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:38:40,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334941080] [2023-12-09 15:38:40,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:38:40,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:38:40,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:38:40,682 INFO L229 MonitoredProcess]: Starting monitored process 6 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:38:40,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-09 15:38:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:38:40,800 INFO L262 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-09 15:38:40,803 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:38:41,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-09 15:38:41,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:38:41,920 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:38:42,636 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-09 15:38:42,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2023-12-09 15:38:43,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:38:43,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334941080] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:38:43,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:38:43,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 23, 18] total 41 [2023-12-09 15:38:43,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495373359] [2023-12-09 15:38:43,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:38:43,464 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-09 15:38:43,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:38:43,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-09 15:38:43,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1485, Unknown=0, NotChecked=0, Total=1640 [2023-12-09 15:38:43,469 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 215 [2023-12-09 15:38:43,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 327 transitions, 2879 flow. Second operand has 41 states, 41 states have (on average 75.17073170731707) internal successors, (3082), 41 states have internal predecessors, (3082), 0 states have call successors, (0), 0 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:38:43,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:38:43,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 215 [2023-12-09 15:38:43,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:39:00,900 INFO L124 PetriNetUnfolderBase]: 14269/29803 cut-off events. [2023-12-09 15:39:00,901 INFO L125 PetriNetUnfolderBase]: For 111301/112016 co-relation queries the response was YES. [2023-12-09 15:39:00,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104460 conditions, 29803 events. 14269/29803 cut-off events. For 111301/112016 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 251302 event pairs, 673 based on Foata normal form. 68/27883 useless extension candidates. Maximal degree in co-relation 86586. Up to 5573 conditions per place. [2023-12-09 15:39:01,212 INFO L140 encePairwiseOnDemand]: 132/215 looper letters, 1194 selfloop transitions, 398 changer transitions 883/2554 dead transitions. [2023-12-09 15:39:01,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 2554 transitions, 19551 flow [2023-12-09 15:39:01,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2023-12-09 15:39:01,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2023-12-09 15:39:01,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 15533 transitions. [2023-12-09 15:39:01,248 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.36488137185811603 [2023-12-09 15:39:01,248 INFO L72 ComplementDD]: Start complementDD. Operand 198 states and 15533 transitions. [2023-12-09 15:39:01,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 198 states and 15533 transitions. [2023-12-09 15:39:01,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:39:01,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 198 states and 15533 transitions. [2023-12-09 15:39:01,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 199 states, 198 states have (on average 78.44949494949495) internal successors, (15533), 198 states have internal predecessors, (15533), 0 states have call successors, (0), 0 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:39:01,357 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 199 states, 199 states have (on average 215.0) internal successors, (42785), 199 states have internal predecessors, (42785), 0 states have call successors, (0), 0 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:39:01,371 INFO L81 ComplementDD]: Finished complementDD. Result has 199 states, 199 states have (on average 215.0) internal successors, (42785), 199 states have internal predecessors, (42785), 0 states have call successors, (0), 0 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:39:01,372 INFO L308 CegarLoopForPetriNet]: 194 programPoint places, 239 predicate places. [2023-12-09 15:39:01,373 INFO L500 AbstractCegarLoop]: Abstraction has has 433 places, 2554 transitions, 19551 flow [2023-12-09 15:39:01,373 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 75.17073170731707) internal successors, (3082), 41 states have internal predecessors, (3082), 0 states have call successors, (0), 0 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:39:01,374 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:39:01,374 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:01,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-09 15:39:01,585 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-09 15:39:01,585 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:39:01,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:39:01,586 INFO L85 PathProgramCache]: Analyzing trace with hash 325197408, now seen corresponding path program 2 times [2023-12-09 15:39:01,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:39:01,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838380989] [2023-12-09 15:39:01,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:39:01,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:39:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:39:12,819 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:39:12,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:39:12,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838380989] [2023-12-09 15:39:12,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838380989] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:39:12,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059784317] [2023-12-09 15:39:12,820 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 15:39:12,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:39:12,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:39:12,824 INFO L229 MonitoredProcess]: Starting monitored process 7 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:39:12,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-09 15:39:12,995 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 15:39:12,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:39:12,997 INFO L262 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 63 conjunts are in the unsatisfiable core [2023-12-09 15:39:13,002 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:39:14,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-09 15:39:14,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-09 15:39:14,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-09 15:39:16,554 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:39:16,554 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:39:18,900 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_216 (Array Int Int)) (v_ArrVal_217 (Array Int Int)) (v_~x2~0_33 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_216) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_217) c_~f~0.base))) (let ((.cse0 (select .cse1 (+ (* c_~x2~0 4) c_~f~0.offset)))) (or (< c_~size~0 (+ .cse0 1)) (= (select .cse1 (+ (* 4 (select .cse1 (+ (* c_~x1~0 4) c_~f~0.offset))) c_~f~0.offset)) (select .cse1 (+ c_~f~0.offset (* v_~x2~0_33 4)))) (< .cse0 0) (< v_~x2~0_33 0) (< c_~size~0 (+ v_~x2~0_33 1)))))) is different from false [2023-12-09 15:39:20,121 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:39:20,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 94 [2023-12-09 15:39:20,159 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:39:20,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 556 treesize of output 544 [2023-12-09 15:39:20,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:39:20,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 152 [2023-12-09 15:39:20,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:39:20,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 155 treesize of output 149 [2023-12-09 15:39:22,313 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-12-09 15:39:22,891 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:39:22,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059784317] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:39:22,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:39:22,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 33, 31] total 81 [2023-12-09 15:39:22,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183701500] [2023-12-09 15:39:22,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:39:22,893 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2023-12-09 15:39:22,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:39:22,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2023-12-09 15:39:22,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=477, Invalid=5792, Unknown=55, NotChecked=156, Total=6480 [2023-12-09 15:39:22,900 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 215 [2023-12-09 15:39:22,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 2554 transitions, 19551 flow. Second operand has 81 states, 81 states have (on average 48.358024691358025) internal successors, (3917), 81 states have internal predecessors, (3917), 0 states have call successors, (0), 0 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:39:22,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:39:22,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 215 [2023-12-09 15:39:22,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:39:28,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-09 15:39:53,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:39:58,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:40:13,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:40:17,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-09 15:40:37,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:40:44,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:40:52,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-09 15:41:08,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-09 15:41:25,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:41:43,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-09 15:41:47,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-09 15:41:49,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-09 15:41:54,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-09 15:42:02,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:42:06,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:42:22,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-09 15:42:24,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-09 15:42:35,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:42:39,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:42:41,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:42:42,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2023-12-09 15:42:47,984 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-09 15:42:47,984 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:42:48,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 281 states. [2023-12-09 15:42:48,269 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-12-09 15:42:48,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-09 15:42:48,469 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:42:48,469 WARN L624 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 352 known predicates. [2023-12-09 15:42:48,471 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-12-09 15:42:48,471 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-12-09 15:42:48,472 INFO L457 BasicCegarLoop]: Path program histogram: [5, 3, 2, 1, 1] [2023-12-09 15:42:48,474 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-09 15:42:48,475 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-09 15:42:48,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 03:42:48 BasicIcfg [2023-12-09 15:42:48,477 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-09 15:42:48,478 INFO L158 Benchmark]: Toolchain (without parser) took 257549.28ms. Allocated memory was 194.0MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 148.2MB in the beginning and 687.7MB in the end (delta: -539.4MB). Peak memory consumption was 628.6MB. Max. memory is 8.0GB. [2023-12-09 15:42:48,478 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 194.0MB. Free memory is still 151.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-09 15:42:48,478 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.52ms. Allocated memory is still 194.0MB. Free memory was 147.8MB in the beginning and 136.1MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-09 15:42:48,478 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.85ms. Allocated memory is still 194.0MB. Free memory was 136.1MB in the beginning and 134.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-09 15:42:48,479 INFO L158 Benchmark]: Boogie Preprocessor took 25.53ms. Allocated memory is still 194.0MB. Free memory was 134.0MB in the beginning and 132.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-09 15:42:48,479 INFO L158 Benchmark]: RCFGBuilder took 534.33ms. Allocated memory is still 194.0MB. Free memory was 132.0MB in the beginning and 113.0MB in the end (delta: 19.0MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-09 15:42:48,479 INFO L158 Benchmark]: TraceAbstraction took 256696.26ms. Allocated memory was 194.0MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 112.1MB in the beginning and 687.7MB in the end (delta: -575.5MB). Peak memory consumption was 593.0MB. Max. memory is 8.0GB. [2023-12-09 15:42:48,480 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.14ms. Allocated memory is still 194.0MB. Free memory is still 151.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 253.52ms. Allocated memory is still 194.0MB. Free memory was 147.8MB in the beginning and 136.1MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.85ms. Allocated memory is still 194.0MB. Free memory was 136.1MB in the beginning and 134.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.53ms. Allocated memory is still 194.0MB. Free memory was 134.0MB in the beginning and 132.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 534.33ms. Allocated memory is still 194.0MB. Free memory was 132.0MB in the beginning and 113.0MB in the end (delta: 19.0MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 256696.26ms. Allocated memory was 194.0MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 112.1MB in the beginning and 687.7MB in the end (delta: -575.5MB). Peak memory consumption was 593.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 352 known predicates. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 352 known predicates. - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 352 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 291 locations, 3 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: 256.5s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 226.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 69 mSolverCounterUnknown, 8443 SdHoareTripleChecker+Valid, 68.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8443 mSDsluCounter, 12304 SdHoareTripleChecker+Invalid, 66.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1321 IncrementalHoareTripleChecker+Unchecked, 11631 mSDsCounter, 354 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16667 IncrementalHoareTripleChecker+Invalid, 18411 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 354 mSolverCounterUnsat, 673 mSDtfsCounter, 16667 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2157 GetRequests, 1514 SyntacticMatches, 9 SemanticMatches, 633 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 64873 ImplicationChecksByTransitivity, 158.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19551occurred in iteration=11, InterpolantAutomatonStates: 251, 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.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 27.3s InterpolantComputationTime, 2696 NumberOfCodeBlocks, 2696 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 3329 ConstructedInterpolants, 153 QuantifiedInterpolants, 29345 SizeOfPredicates, 81 NumberOfNonLiveVariables, 1899 ConjunctsInSsa, 120 ConjunctsInUnsatCore, 22 InterpolantComputations, 10 PerfectInterpolantSequences, 28/89 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