/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true -i ../../../trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 15:27:28,015 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 15:27:28,076 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:27:28,102 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 15:27:28,103 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 15:27:28,103 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 15:27:28,104 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 15:27:28,106 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 15:27:28,107 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 15:27:28,110 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 15:27:28,110 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 15:27:28,110 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 15:27:28,111 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 15:27:28,112 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 15:27:28,112 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 15:27:28,112 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 15:27:28,112 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 15:27:28,112 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 15:27:28,112 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 15:27:28,112 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 15:27:28,113 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 15:27:28,113 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 15:27:28,113 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 15:27:28,113 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 15:27:28,114 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 15:27:28,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:27:28,114 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 15:27:28,114 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 15:27:28,114 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 15:27:28,114 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 15:27:28,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 15:27:28,115 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 15:27:28,115 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 15:27:28,115 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:27:28,284 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 15:27:28,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 15:27:28,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 15:27:28,308 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 15:27:28,311 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 15:27:28,311 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c [2023-12-09 15:27:29,438 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 15:27:29,582 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 15:27:29,583 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c [2023-12-09 15:27:29,591 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c3ff60c8/2585c3394ede4b4394709b0488b7c5c5/FLAGbde2fa04f [2023-12-09 15:27:29,604 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c3ff60c8/2585c3394ede4b4394709b0488b7c5c5 [2023-12-09 15:27:29,606 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 15:27:29,607 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 15:27:29,609 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 15:27:29,609 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 15:27:29,612 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 15:27:29,613 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:27:29" (1/1) ... [2023-12-09 15:27:29,614 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f80c020 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:29, skipping insertion in model container [2023-12-09 15:27:29,614 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:27:29" (1/1) ... [2023-12-09 15:27:29,635 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 15:27:29,751 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c[2592,2605] [2023-12-09 15:27:29,770 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:27:29,782 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 15:27:29,796 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c[2592,2605] [2023-12-09 15:27:29,798 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:27:29,804 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-09 15:27:29,804 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-09 15:27:29,809 INFO L206 MainTranslator]: Completed translation [2023-12-09 15:27:29,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:29 WrapperNode [2023-12-09 15:27:29,809 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 15:27:29,810 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 15:27:29,810 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 15:27:29,810 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 15:27:29,815 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:27:29" (1/1) ... [2023-12-09 15:27:29,821 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:27:29" (1/1) ... [2023-12-09 15:27:29,841 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 104 [2023-12-09 15:27:29,841 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 15:27:29,842 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 15:27:29,842 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 15:27:29,842 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 15:27:29,848 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:29" (1/1) ... [2023-12-09 15:27:29,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:29" (1/1) ... [2023-12-09 15:27:29,851 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:29" (1/1) ... [2023-12-09 15:27:29,851 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:29" (1/1) ... [2023-12-09 15:27:29,856 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:29" (1/1) ... [2023-12-09 15:27:29,859 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:29" (1/1) ... [2023-12-09 15:27:29,860 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:29" (1/1) ... [2023-12-09 15:27:29,861 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:29" (1/1) ... [2023-12-09 15:27:29,863 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 15:27:29,864 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 15:27:29,864 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 15:27:29,864 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 15:27:29,865 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:29" (1/1) ... [2023-12-09 15:27:29,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:27:29,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:27:29,909 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:27:29,912 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:27:29,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 15:27:29,931 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-09 15:27:29,932 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-09 15:27:29,932 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-09 15:27:29,932 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-09 15:27:29,932 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-12-09 15:27:29,932 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-12-09 15:27:29,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 15:27:29,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 15:27:29,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 15:27:29,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-09 15:27:29,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-09 15:27:29,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-09 15:27:29,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 15:27:29,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 15:27:29,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-09 15:27:29,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 15:27:29,934 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:27:30,096 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 15:27:30,098 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 15:27:30,384 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 15:27:30,431 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 15:27:30,431 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-09 15:27:30,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:27:30 BoogieIcfgContainer [2023-12-09 15:27:30,433 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 15:27:30,434 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 15:27:30,435 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 15:27:30,437 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 15:27:30,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:27:29" (1/3) ... [2023-12-09 15:27:30,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b04195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:27:30, skipping insertion in model container [2023-12-09 15:27:30,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:29" (2/3) ... [2023-12-09 15:27:30,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b04195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:27:30, skipping insertion in model container [2023-12-09 15:27:30,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:27:30" (3/3) ... [2023-12-09 15:27:30,440 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array.wvr.c [2023-12-09 15:27:30,458 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 15:27:30,459 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-09 15:27:30,459 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 15:27:30,513 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-09 15:27:30,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 159 transitions, 339 flow [2023-12-09 15:27:30,597 INFO L124 PetriNetUnfolderBase]: 12/156 cut-off events. [2023-12-09 15:27:30,597 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-09 15:27:30,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 156 events. 12/156 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 102 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 116. Up to 2 conditions per place. [2023-12-09 15:27:30,602 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 159 transitions, 339 flow [2023-12-09 15:27:30,605 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 145 transitions, 308 flow [2023-12-09 15:27:30,611 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:27:30,619 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;@4082b6c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:27:30,619 INFO L363 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-12-09 15:27:30,660 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:27:30,660 INFO L124 PetriNetUnfolderBase]: 12/144 cut-off events. [2023-12-09 15:27:30,660 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-09 15:27:30,660 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:27:30,661 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] [2023-12-09 15:27:30,662 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:27:30,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:27:30,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1904712022, now seen corresponding path program 1 times [2023-12-09 15:27:30,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:27:30,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877148467] [2023-12-09 15:27:30,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:27:30,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:27:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:31,409 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:27:31,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:27:31,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877148467] [2023-12-09 15:27:31,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877148467] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:27:31,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:27:31,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-09 15:27:31,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95840582] [2023-12-09 15:27:31,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:27:31,420 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-09 15:27:31,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:27:31,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-09 15:27:31,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-09 15:27:31,450 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 159 [2023-12-09 15:27:31,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 145 transitions, 308 flow. Second operand has 6 states, 6 states have (on average 104.66666666666667) internal successors, (628), 6 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:31,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:27:31,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 159 [2023-12-09 15:27:31,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:27:31,743 INFO L124 PetriNetUnfolderBase]: 445/932 cut-off events. [2023-12-09 15:27:31,743 INFO L125 PetriNetUnfolderBase]: For 144/144 co-relation queries the response was YES. [2023-12-09 15:27:31,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1684 conditions, 932 events. 445/932 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4360 event pairs, 135 based on Foata normal form. 5/733 useless extension candidates. Maximal degree in co-relation 1477. Up to 336 conditions per place. [2023-12-09 15:27:31,756 INFO L140 encePairwiseOnDemand]: 142/159 looper letters, 51 selfloop transitions, 6 changer transitions 4/146 dead transitions. [2023-12-09 15:27:31,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 146 transitions, 438 flow [2023-12-09 15:27:31,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-09 15:27:31,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-09 15:27:31,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 759 transitions. [2023-12-09 15:27:31,772 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6819407008086253 [2023-12-09 15:27:31,773 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 759 transitions. [2023-12-09 15:27:31,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 759 transitions. [2023-12-09 15:27:31,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:27:31,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 759 transitions. [2023-12-09 15:27:31,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 108.42857142857143) internal successors, (759), 7 states have internal predecessors, (759), 0 states have call successors, (0), 0 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:27:31,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 159.0) internal successors, (1272), 8 states have internal predecessors, (1272), 0 states have call successors, (0), 0 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:27:31,790 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 159.0) internal successors, (1272), 8 states have internal predecessors, (1272), 0 states have call successors, (0), 0 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:27:31,793 INFO L308 CegarLoopForPetriNet]: 143 programPoint places, 6 predicate places. [2023-12-09 15:27:31,794 INFO L500 AbstractCegarLoop]: Abstraction has has 149 places, 146 transitions, 438 flow [2023-12-09 15:27:31,794 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.66666666666667) internal successors, (628), 6 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:31,795 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:27:31,795 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] [2023-12-09 15:27:31,796 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 15:27:31,796 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:27:31,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:27:31,797 INFO L85 PathProgramCache]: Analyzing trace with hash 834101045, now seen corresponding path program 1 times [2023-12-09 15:27:31,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:27:31,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490352943] [2023-12-09 15:27:31,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:27:31,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:27:31,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:32,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:27:32,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:27:32,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490352943] [2023-12-09 15:27:32,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490352943] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:27:32,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:27:32,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-09 15:27:32,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993745894] [2023-12-09 15:27:32,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:27:32,258 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-09 15:27:32,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:27:32,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-09 15:27:32,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-09 15:27:32,261 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 159 [2023-12-09 15:27:32,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 146 transitions, 438 flow. Second operand has 9 states, 9 states have (on average 91.77777777777777) internal successors, (826), 9 states have internal predecessors, (826), 0 states have call successors, (0), 0 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:27:32,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:27:32,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 159 [2023-12-09 15:27:32,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:27:32,527 INFO L124 PetriNetUnfolderBase]: 445/950 cut-off events. [2023-12-09 15:27:32,528 INFO L125 PetriNetUnfolderBase]: For 250/338 co-relation queries the response was YES. [2023-12-09 15:27:32,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2395 conditions, 950 events. 445/950 cut-off events. For 250/338 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4361 event pairs, 135 based on Foata normal form. 0/745 useless extension candidates. Maximal degree in co-relation 2083. Up to 650 conditions per place. [2023-12-09 15:27:32,536 INFO L140 encePairwiseOnDemand]: 147/159 looper letters, 65 selfloop transitions, 8 changer transitions 12/158 dead transitions. [2023-12-09 15:27:32,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 158 transitions, 640 flow [2023-12-09 15:27:32,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-09 15:27:32,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-09 15:27:32,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 765 transitions. [2023-12-09 15:27:32,538 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6014150943396226 [2023-12-09 15:27:32,538 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 765 transitions. [2023-12-09 15:27:32,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 765 transitions. [2023-12-09 15:27:32,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:27:32,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 765 transitions. [2023-12-09 15:27:32,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 95.625) internal successors, (765), 8 states have internal predecessors, (765), 0 states have call successors, (0), 0 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:27:32,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 159.0) internal successors, (1431), 9 states have internal predecessors, (1431), 0 states have call successors, (0), 0 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:27:32,542 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 159.0) internal successors, (1431), 9 states have internal predecessors, (1431), 0 states have call successors, (0), 0 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:27:32,543 INFO L308 CegarLoopForPetriNet]: 143 programPoint places, 13 predicate places. [2023-12-09 15:27:32,543 INFO L500 AbstractCegarLoop]: Abstraction has has 156 places, 158 transitions, 640 flow [2023-12-09 15:27:32,544 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 91.77777777777777) internal successors, (826), 9 states have internal predecessors, (826), 0 states have call successors, (0), 0 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:27:32,544 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:27:32,544 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] [2023-12-09 15:27:32,544 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-09 15:27:32,544 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:27:32,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:27:32,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1419050402, now seen corresponding path program 1 times [2023-12-09 15:27:32,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:27:32,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740785820] [2023-12-09 15:27:32,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:27:32,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:27:32,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:32,707 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:27:32,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:27:32,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740785820] [2023-12-09 15:27:32,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740785820] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:27:32,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774745248] [2023-12-09 15:27:32,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:27:32,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:27:32,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:27:32,712 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:27:32,743 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:27:32,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:32,814 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-09 15:27:32,820 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:27:32,945 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:27:32,945 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:27:33,074 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:27:33,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774745248] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-09 15:27:33,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-09 15:27:33,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2023-12-09 15:27:33,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398936139] [2023-12-09 15:27:33,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:27:33,075 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-09 15:27:33,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:27:33,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-09 15:27:33,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-12-09 15:27:33,077 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 159 [2023-12-09 15:27:33,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 158 transitions, 640 flow. Second operand has 7 states, 7 states have (on average 119.28571428571429) internal successors, (835), 7 states have internal predecessors, (835), 0 states have call successors, (0), 0 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:27:33,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:27:33,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 159 [2023-12-09 15:27:33,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:27:33,256 INFO L124 PetriNetUnfolderBase]: 656/1352 cut-off events. [2023-12-09 15:27:33,256 INFO L125 PetriNetUnfolderBase]: For 1057/1294 co-relation queries the response was YES. [2023-12-09 15:27:33,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4047 conditions, 1352 events. 656/1352 cut-off events. For 1057/1294 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6970 event pairs, 174 based on Foata normal form. 25/1109 useless extension candidates. Maximal degree in co-relation 3652. Up to 919 conditions per place. [2023-12-09 15:27:33,270 INFO L140 encePairwiseOnDemand]: 148/159 looper letters, 48 selfloop transitions, 8 changer transitions 12/168 dead transitions. [2023-12-09 15:27:33,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 168 transitions, 828 flow [2023-12-09 15:27:33,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-09 15:27:33,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-09 15:27:33,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 854 transitions. [2023-12-09 15:27:33,272 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7672955974842768 [2023-12-09 15:27:33,272 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 854 transitions. [2023-12-09 15:27:33,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 854 transitions. [2023-12-09 15:27:33,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:27:33,272 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 854 transitions. [2023-12-09 15:27:33,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 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:27:33,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 159.0) internal successors, (1272), 8 states have internal predecessors, (1272), 0 states have call successors, (0), 0 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:27:33,276 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 159.0) internal successors, (1272), 8 states have internal predecessors, (1272), 0 states have call successors, (0), 0 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:27:33,276 INFO L308 CegarLoopForPetriNet]: 143 programPoint places, 19 predicate places. [2023-12-09 15:27:33,276 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 168 transitions, 828 flow [2023-12-09 15:27:33,277 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 119.28571428571429) internal successors, (835), 7 states have internal predecessors, (835), 0 states have call successors, (0), 0 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:27:33,277 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:27:33,277 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] [2023-12-09 15:27:33,285 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:27:33,482 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:27:33,483 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:27:33,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:27:33,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1619949401, now seen corresponding path program 1 times [2023-12-09 15:27:33,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:27:33,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027457107] [2023-12-09 15:27:33,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:27:33,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:27:33,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:34,813 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:27:34,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:27:34,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027457107] [2023-12-09 15:27:34,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027457107] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:27:34,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262908622] [2023-12-09 15:27:34,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:27:34,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:27:34,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:27:34,816 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:27:34,861 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:27:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:34,957 INFO L262 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-09 15:27:34,961 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:27:35,767 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 59 treesize of output 35 [2023-12-09 15:27:35,962 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:27:35,964 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:27:36,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:27:36,133 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 77 treesize of output 49 [2023-12-09 15:27:36,763 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:27:36,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262908622] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:27:36,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:27:36,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 19, 18] total 52 [2023-12-09 15:27:36,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108667706] [2023-12-09 15:27:36,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:27:36,766 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-12-09 15:27:36,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:27:36,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-12-09 15:27:36,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=2384, Unknown=0, NotChecked=0, Total=2652 [2023-12-09 15:27:36,771 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 159 [2023-12-09 15:27:36,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 168 transitions, 828 flow. Second operand has 52 states, 52 states have (on average 64.09615384615384) internal successors, (3333), 52 states have internal predecessors, (3333), 0 states have call successors, (0), 0 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:27:36,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:27:36,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 159 [2023-12-09 15:27:36,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:27:39,893 INFO L124 PetriNetUnfolderBase]: 3476/5729 cut-off events. [2023-12-09 15:27:39,894 INFO L125 PetriNetUnfolderBase]: For 4709/4885 co-relation queries the response was YES. [2023-12-09 15:27:39,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20408 conditions, 5729 events. 3476/5729 cut-off events. For 4709/4885 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 36335 event pairs, 490 based on Foata normal form. 0/4838 useless extension candidates. Maximal degree in co-relation 17033. Up to 3521 conditions per place. [2023-12-09 15:27:39,945 INFO L140 encePairwiseOnDemand]: 116/159 looper letters, 233 selfloop transitions, 84 changer transitions 22/387 dead transitions. [2023-12-09 15:27:39,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 387 transitions, 2884 flow [2023-12-09 15:27:39,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-12-09 15:27:39,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2023-12-09 15:27:39,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 3458 transitions. [2023-12-09 15:27:39,953 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.41034769194256554 [2023-12-09 15:27:39,953 INFO L72 ComplementDD]: Start complementDD. Operand 53 states and 3458 transitions. [2023-12-09 15:27:39,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 3458 transitions. [2023-12-09 15:27:39,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:27:39,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 53 states and 3458 transitions. [2023-12-09 15:27:39,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 54 states, 53 states have (on average 65.24528301886792) internal successors, (3458), 53 states have internal predecessors, (3458), 0 states have call successors, (0), 0 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:27:40,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 54 states, 54 states have (on average 159.0) internal successors, (8586), 54 states have internal predecessors, (8586), 0 states have call successors, (0), 0 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:27:40,063 INFO L81 ComplementDD]: Finished complementDD. Result has 54 states, 54 states have (on average 159.0) internal successors, (8586), 54 states have internal predecessors, (8586), 0 states have call successors, (0), 0 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:27:40,064 INFO L308 CegarLoopForPetriNet]: 143 programPoint places, 71 predicate places. [2023-12-09 15:27:40,064 INFO L500 AbstractCegarLoop]: Abstraction has has 214 places, 387 transitions, 2884 flow [2023-12-09 15:27:40,065 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 64.09615384615384) internal successors, (3333), 52 states have internal predecessors, (3333), 0 states have call successors, (0), 0 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:27:40,065 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:27:40,065 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] [2023-12-09 15:27:40,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-09 15:27:40,266 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-12-09 15:27:40,266 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:27:40,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:27:40,267 INFO L85 PathProgramCache]: Analyzing trace with hash 235475249, now seen corresponding path program 2 times [2023-12-09 15:27:40,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:27:40,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346085425] [2023-12-09 15:27:40,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:27:40,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:27:40,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:41,266 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:27:41,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:27:41,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346085425] [2023-12-09 15:27:41,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346085425] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:27:41,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055305763] [2023-12-09 15:27:41,267 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 15:27:41,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:27:41,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:27:41,294 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:27:41,322 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:27:41,388 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 15:27:41,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:27:41,393 INFO L262 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-09 15:27:41,402 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:27:41,857 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:27:41,859 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 71 treesize of output 43 [2023-12-09 15:27:42,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:27:42,226 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:27:42,418 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:27:42,418 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 89 treesize of output 49 [2023-12-09 15:27:42,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:27:42,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055305763] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:27:42,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:27:42,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 16, 15] total 43 [2023-12-09 15:27:42,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930976866] [2023-12-09 15:27:42,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:27:42,735 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-12-09 15:27:42,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:27:42,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-12-09 15:27:42,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=1552, Unknown=0, NotChecked=0, Total=1806 [2023-12-09 15:27:42,738 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 159 [2023-12-09 15:27:42,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 387 transitions, 2884 flow. Second operand has 43 states, 43 states have (on average 61.02325581395349) internal successors, (2624), 43 states have internal predecessors, (2624), 0 states have call successors, (0), 0 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:27:42,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:27:42,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 159 [2023-12-09 15:27:42,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:27:47,897 INFO L124 PetriNetUnfolderBase]: 10597/16975 cut-off events. [2023-12-09 15:27:47,897 INFO L125 PetriNetUnfolderBase]: For 16892/17490 co-relation queries the response was YES. [2023-12-09 15:27:48,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70499 conditions, 16975 events. 10597/16975 cut-off events. For 16892/17490 co-relation queries the response was YES. Maximal size of possible extension queue 865. Compared 122457 event pairs, 1008 based on Foata normal form. 51/15440 useless extension candidates. Maximal degree in co-relation 58106. Up to 8708 conditions per place. [2023-12-09 15:27:48,127 INFO L140 encePairwiseOnDemand]: 112/159 looper letters, 666 selfloop transitions, 302 changer transitions 35/1047 dead transitions. [2023-12-09 15:27:48,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 1047 transitions, 9822 flow [2023-12-09 15:27:48,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2023-12-09 15:27:48,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2023-12-09 15:27:48,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 5151 transitions. [2023-12-09 15:27:48,139 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.410078815380941 [2023-12-09 15:27:48,139 INFO L72 ComplementDD]: Start complementDD. Operand 79 states and 5151 transitions. [2023-12-09 15:27:48,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 5151 transitions. [2023-12-09 15:27:48,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:27:48,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 79 states and 5151 transitions. [2023-12-09 15:27:48,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 80 states, 79 states have (on average 65.20253164556962) internal successors, (5151), 79 states have internal predecessors, (5151), 0 states have call successors, (0), 0 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:27:48,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 80 states, 80 states have (on average 159.0) internal successors, (12720), 80 states have internal predecessors, (12720), 0 states have call successors, (0), 0 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:27:48,169 INFO L81 ComplementDD]: Finished complementDD. Result has 80 states, 80 states have (on average 159.0) internal successors, (12720), 80 states have internal predecessors, (12720), 0 states have call successors, (0), 0 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:27:48,171 INFO L308 CegarLoopForPetriNet]: 143 programPoint places, 149 predicate places. [2023-12-09 15:27:48,171 INFO L500 AbstractCegarLoop]: Abstraction has has 292 places, 1047 transitions, 9822 flow [2023-12-09 15:27:48,172 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 61.02325581395349) internal successors, (2624), 43 states have internal predecessors, (2624), 0 states have call successors, (0), 0 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:27:48,172 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:27:48,172 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] [2023-12-09 15:27:48,182 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:27:48,376 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:27:48,380 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:27:48,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:27:48,380 INFO L85 PathProgramCache]: Analyzing trace with hash -2074062639, now seen corresponding path program 3 times [2023-12-09 15:27:48,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:27:48,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077834267] [2023-12-09 15:27:48,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:27:48,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:27:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:49,428 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:27:49,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:27:49,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077834267] [2023-12-09 15:27:49,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077834267] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:27:49,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478313881] [2023-12-09 15:27:49,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-09 15:27:49,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:27:49,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:27:49,430 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:27:49,431 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:27:49,560 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-09 15:27:49,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:27:49,562 INFO L262 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-09 15:27:49,565 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:27:50,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 15:27:50,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2023-12-09 15:27:50,546 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:27:50,546 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 71 treesize of output 43 [2023-12-09 15:27:51,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:27:51,012 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:27:51,239 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~A~0.offset (* c_~N~0 4) (- 4)))) (and (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_157 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_157) c_~A~0.base) .cse0) c_~min2~0))) (forall ((v_ArrVal_157 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_157) c_~A~0.base) .cse0))) (or (< c_~min2~0 (+ .cse1 1)) (= c_~min1~0 .cse1)))))) is different from false [2023-12-09 15:27:51,535 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:27:51,535 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 151 treesize of output 110 [2023-12-09 15:27:51,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 76 treesize of output 69 [2023-12-09 15:27:51,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 69 treesize of output 55 [2023-12-09 15:27:51,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:27:51,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478313881] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:27:51,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:27:51,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 24, 23] total 60 [2023-12-09 15:27:51,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026062739] [2023-12-09 15:27:51,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:27:51,993 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2023-12-09 15:27:51,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:27:51,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2023-12-09 15:27:51,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=3047, Unknown=1, NotChecked=114, Total=3540 [2023-12-09 15:27:51,996 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 159 [2023-12-09 15:27:51,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 1047 transitions, 9822 flow. Second operand has 60 states, 60 states have (on average 55.7) internal successors, (3342), 60 states have internal predecessors, (3342), 0 states have call successors, (0), 0 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:27:51,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:27:51,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 159 [2023-12-09 15:27:51,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:28:00,855 INFO L124 PetriNetUnfolderBase]: 19483/30738 cut-off events. [2023-12-09 15:28:00,855 INFO L125 PetriNetUnfolderBase]: For 44043/45449 co-relation queries the response was YES. [2023-12-09 15:28:00,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148668 conditions, 30738 events. 19483/30738 cut-off events. For 44043/45449 co-relation queries the response was YES. Maximal size of possible extension queue 1520. Compared 236852 event pairs, 2376 based on Foata normal form. 174/28204 useless extension candidates. Maximal degree in co-relation 112135. Up to 18137 conditions per place. [2023-12-09 15:28:01,137 INFO L140 encePairwiseOnDemand]: 113/159 looper letters, 890 selfloop transitions, 714 changer transitions 69/1929 dead transitions. [2023-12-09 15:28:01,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 1929 transitions, 22024 flow [2023-12-09 15:28:01,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2023-12-09 15:28:01,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2023-12-09 15:28:01,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 5181 transitions. [2023-12-09 15:28:01,147 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.37028301886792453 [2023-12-09 15:28:01,147 INFO L72 ComplementDD]: Start complementDD. Operand 88 states and 5181 transitions. [2023-12-09 15:28:01,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 5181 transitions. [2023-12-09 15:28:01,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:28:01,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 88 states and 5181 transitions. [2023-12-09 15:28:01,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 89 states, 88 states have (on average 58.875) internal successors, (5181), 88 states have internal predecessors, (5181), 0 states have call successors, (0), 0 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:28:01,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 89 states, 89 states have (on average 159.0) internal successors, (14151), 89 states have internal predecessors, (14151), 0 states have call successors, (0), 0 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:28:01,178 INFO L81 ComplementDD]: Finished complementDD. Result has 89 states, 89 states have (on average 159.0) internal successors, (14151), 89 states have internal predecessors, (14151), 0 states have call successors, (0), 0 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:28:01,180 INFO L308 CegarLoopForPetriNet]: 143 programPoint places, 236 predicate places. [2023-12-09 15:28:01,180 INFO L500 AbstractCegarLoop]: Abstraction has has 379 places, 1929 transitions, 22024 flow [2023-12-09 15:28:01,181 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 55.7) internal successors, (3342), 60 states have internal predecessors, (3342), 0 states have call successors, (0), 0 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:28:01,181 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:28:01,181 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] [2023-12-09 15:28:01,189 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:28:01,387 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:28:01,387 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:28:01,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:28:01,388 INFO L85 PathProgramCache]: Analyzing trace with hash 149771109, now seen corresponding path program 4 times [2023-12-09 15:28:01,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:28:01,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060089715] [2023-12-09 15:28:01,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:28:01,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:28:01,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:28:02,601 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:28:02,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:28:02,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060089715] [2023-12-09 15:28:02,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060089715] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:28:02,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828987965] [2023-12-09 15:28:02,602 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-09 15:28:02,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:28:02,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:28:02,603 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:28:02,604 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:28:02,772 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-09 15:28:02,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:28:02,774 INFO L262 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 56 conjunts are in the unsatisfiable core [2023-12-09 15:28:02,777 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:28:03,451 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:28:03,947 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:28:04,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 15:28:04,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2023-12-09 15:28:04,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 15:28:04,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2023-12-09 15:28:04,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:28:04,671 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 65 treesize of output 43 [2023-12-09 15:28:05,007 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:28:05,007 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:28:05,213 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* c_~N~0 4) (- 4)))) (and (forall ((v_ArrVal_193 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base) .cse1))) (or (= c_~min1~0 .cse0) (< c_~min2~0 (+ .cse0 1))))) (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_193 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base) .cse1) c_~min2~0))))) is different from false [2023-12-09 15:28:05,295 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~A~0.offset (* c_~N~0 4) (- 4)))) (and (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base) .cse0) c_~min2~0))) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base) .cse0))) (or (= c_~min1~0 .cse1) (< c_~min2~0 (+ .cse1 1))))))) is different from false [2023-12-09 15:28:05,771 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~A~0.offset (* c_~N~0 4) (- 4)))) (and (forall ((v_ArrVal_191 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191))) (let ((.cse0 (select (select .cse2 c_~A~0.base) c_~A~0.offset))) (or (< c_~min1~0 (+ .cse0 1)) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int))) (let ((.cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base) .cse3))) (or (= .cse1 .cse0) (< c_~min2~0 (+ .cse1 1))))))))) (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191))) (or (< (select (select .cse4 c_~A~0.base) c_~A~0.offset) c_~min1~0) (< (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base) .cse3) c_~min2~0))))) (forall ((v_ArrVal_191 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191))) (or (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int))) (let ((.cse5 (select (select (store (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base) .cse3))) (or (< c_~min2~0 (+ .cse5 1)) (= c_~min1~0 .cse5)))) (< (select (select .cse6 c_~A~0.base) c_~A~0.offset) c_~min1~0)))) (forall ((v_ArrVal_191 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191))) (let ((.cse8 (select (select .cse7 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int))) (< (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base) .cse3) c_~min2~0)) (< c_~min1~0 (+ .cse8 1)) (= c_~min2~0 .cse8))))))) is different from false [2023-12-09 15:28:06,168 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* c_~N~0 4) |c_ULTIMATE.start_main_#t~ret12#1.offset| (- 4)))) (and (forall ((v_ArrVal_191 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int))) (let ((.cse1 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_main_#t~ret12#1.base|) .cse2))) (or (< c_~min2~0 (+ .cse1 1)) (= .cse1 c_~min1~0))))))) (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191))) (or (< (select (select .cse3 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0) (< (select (select (store (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_main_#t~ret12#1.base|) .cse2) c_~min2~0))))) (forall ((v_ArrVal_191 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int))) (< (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_main_#t~ret12#1.base|) .cse2) c_~min2~0)) (= c_~min2~0 .cse5) (< c_~min1~0 (+ .cse5 1)))))) (forall ((v_ArrVal_191 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int))) (let ((.cse6 (select (select (store (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_main_#t~ret12#1.base|) .cse2))) (or (< c_~min2~0 (+ .cse6 1)) (= .cse6 .cse7)))) (< c_~min1~0 (+ .cse7 1)))))))) is different from false [2023-12-09 15:28:06,271 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* c_~N~0 4) (- 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_191 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191))) (or (< (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int))) (let ((.cse1 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse2))) (or (= c_~min1~0 .cse1) (< c_~min2~0 (+ .cse1 1)))))))) (forall ((v_ArrVal_191 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< c_~min1~0 (+ .cse3 1)) (= c_~min2~0 .cse3) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int))) (< (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse2) c_~min2~0)))))) (forall ((v_ArrVal_191 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< c_~min1~0 (+ .cse5 1)) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int))) (let ((.cse6 (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse2))) (or (= .cse5 .cse6) (< c_~min2~0 (+ .cse6 1))))))))) (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191))) (or (< (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (< (select (select (store (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse2) c_~min2~0))))))) is different from false [2023-12-09 15:28:06,307 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* c_~N~0 4) (- 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (or (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) c_~min2~0) (< (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0)))) (= c_~min2~0 c_~min1~0)) (forall ((v_ArrVal_191 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< c_~min1~0 (+ .cse2 1)) (= c_~min2~0 .cse2) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int))) (< (select (select (store (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) c_~min2~0)))))) (forall ((v_ArrVal_191 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191))) (or (< (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int))) (let ((.cse5 (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1))) (or (= c_~min1~0 .cse5) (< c_~min2~0 (+ .cse5 1)))))))) (forall ((v_ArrVal_191 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< c_~min1~0 (+ .cse6 1)) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int))) (let ((.cse7 (select (select (store (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1))) (or (= .cse7 .cse6) (< c_~min2~0 (+ .cse7 1))))))))))) is different from false [2023-12-09 15:28:06,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:28:06,973 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 112 treesize of output 76 [2023-12-09 15:28:06,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:28:06,981 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 554 treesize of output 499 [2023-12-09 15:28:06,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:28:06,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 166 treesize of output 150 [2023-12-09 15:28:07,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 271 treesize of output 243 [2023-12-09 15:28:07,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 243 treesize of output 187 [2023-12-09 15:28:07,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:28:07,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 57 [2023-12-09 15:28:07,240 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-09 15:28:07,241 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-09 15:28:07,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 56 [2023-12-09 15:28:07,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 30 treesize of output 24 [2023-12-09 15:28:07,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:28:07,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 39 [2023-12-09 15:28:07,259 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-09 15:28:07,259 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-09 15:28:07,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2023-12-09 15:28:07,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 treesize of output 19 [2023-12-09 15:28:07,274 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-09 15:28:07,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 1 [2023-12-09 15:28:07,778 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:28:07,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828987965] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:28:07,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:28:07,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31, 31] total 77 [2023-12-09 15:28:07,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553475787] [2023-12-09 15:28:07,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:28:07,779 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2023-12-09 15:28:07,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:28:07,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2023-12-09 15:28:07,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=565, Invalid=4412, Unknown=17, NotChecked=858, Total=5852 [2023-12-09 15:28:07,784 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 159 [2023-12-09 15:28:07,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 1929 transitions, 22024 flow. Second operand has 77 states, 77 states have (on average 56.83116883116883) internal successors, (4376), 77 states have internal predecessors, (4376), 0 states have call successors, (0), 0 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:28:07,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:28:07,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 159 [2023-12-09 15:28:07,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:28:18,861 INFO L124 PetriNetUnfolderBase]: 23699/37427 cut-off events. [2023-12-09 15:28:18,861 INFO L125 PetriNetUnfolderBase]: For 74055/75737 co-relation queries the response was YES. [2023-12-09 15:28:18,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206737 conditions, 37427 events. 23699/37427 cut-off events. For 74055/75737 co-relation queries the response was YES. Maximal size of possible extension queue 1796. Compared 296539 event pairs, 3169 based on Foata normal form. 259/34318 useless extension candidates. Maximal degree in co-relation 154309. Up to 23321 conditions per place. [2023-12-09 15:28:19,337 INFO L140 encePairwiseOnDemand]: 117/159 looper letters, 1283 selfloop transitions, 621 changer transitions 106/2282 dead transitions. [2023-12-09 15:28:19,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 2282 transitions, 30365 flow [2023-12-09 15:28:19,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-12-09 15:28:19,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2023-12-09 15:28:19,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 3211 transitions. [2023-12-09 15:28:19,356 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3810371425180966 [2023-12-09 15:28:19,356 INFO L72 ComplementDD]: Start complementDD. Operand 53 states and 3211 transitions. [2023-12-09 15:28:19,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 3211 transitions. [2023-12-09 15:28:19,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:28:19,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 53 states and 3211 transitions. [2023-12-09 15:28:19,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 54 states, 53 states have (on average 60.58490566037736) internal successors, (3211), 53 states have internal predecessors, (3211), 0 states have call successors, (0), 0 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:28:19,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 54 states, 54 states have (on average 159.0) internal successors, (8586), 54 states have internal predecessors, (8586), 0 states have call successors, (0), 0 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:28:19,375 INFO L81 ComplementDD]: Finished complementDD. Result has 54 states, 54 states have (on average 159.0) internal successors, (8586), 54 states have internal predecessors, (8586), 0 states have call successors, (0), 0 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:28:19,375 INFO L308 CegarLoopForPetriNet]: 143 programPoint places, 288 predicate places. [2023-12-09 15:28:19,376 INFO L500 AbstractCegarLoop]: Abstraction has has 431 places, 2282 transitions, 30365 flow [2023-12-09 15:28:19,376 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 56.83116883116883) internal successors, (4376), 77 states have internal predecessors, (4376), 0 states have call successors, (0), 0 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:28:19,376 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:28:19,377 INFO L233 CegarLoopForPetriNet]: trace histogram [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] [2023-12-09 15:28:19,383 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:28:19,582 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:28:19,585 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:28:19,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:28:19,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1667970164, now seen corresponding path program 5 times [2023-12-09 15:28:19,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:28:19,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486691583] [2023-12-09 15:28:19,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:28:19,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:28:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:28:19,719 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:28:19,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:28:19,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486691583] [2023-12-09 15:28:19,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486691583] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:28:19,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240095072] [2023-12-09 15:28:19,719 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-09 15:28:19,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:28:19,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:28:19,721 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:28:19,740 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:28:19,823 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-12-09 15:28:19,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:28:19,825 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-09 15:28:19,827 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:28:19,956 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:28:19,956 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:28:20,068 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:28:20,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240095072] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:28:20,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:28:20,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2023-12-09 15:28:20,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757628618] [2023-12-09 15:28:20,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:28:20,071 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-09 15:28:20,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:28:20,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-09 15:28:20,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2023-12-09 15:28:20,076 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 159 [2023-12-09 15:28:20,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 2282 transitions, 30365 flow. Second operand has 27 states, 27 states have (on average 103.88888888888889) internal successors, (2805), 27 states have internal predecessors, (2805), 0 states have call successors, (0), 0 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:28:20,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:28:20,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 159 [2023-12-09 15:28:20,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:28:36,838 INFO L124 PetriNetUnfolderBase]: 37961/59172 cut-off events. [2023-12-09 15:28:36,839 INFO L125 PetriNetUnfolderBase]: For 130300/132201 co-relation queries the response was YES. [2023-12-09 15:28:37,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 362855 conditions, 59172 events. 37961/59172 cut-off events. For 130300/132201 co-relation queries the response was YES. Maximal size of possible extension queue 2319. Compared 479810 event pairs, 3352 based on Foata normal form. 66/54369 useless extension candidates. Maximal degree in co-relation 179363. Up to 36543 conditions per place. [2023-12-09 15:28:37,450 INFO L140 encePairwiseOnDemand]: 130/159 looper letters, 3325 selfloop transitions, 1209 changer transitions 158/5185 dead transitions. [2023-12-09 15:28:37,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 531 places, 5185 transitions, 74832 flow [2023-12-09 15:28:37,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2023-12-09 15:28:37,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2023-12-09 15:28:37,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 10970 transitions. [2023-12-09 15:28:37,458 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.683106046453702 [2023-12-09 15:28:37,458 INFO L72 ComplementDD]: Start complementDD. Operand 101 states and 10970 transitions. [2023-12-09 15:28:37,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 10970 transitions. [2023-12-09 15:28:37,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:28:37,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 101 states and 10970 transitions. [2023-12-09 15:28:37,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 102 states, 101 states have (on average 108.61386138613861) internal successors, (10970), 101 states have internal predecessors, (10970), 0 states have call successors, (0), 0 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:28:37,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 102 states, 102 states have (on average 159.0) internal successors, (16218), 102 states have internal predecessors, (16218), 0 states have call successors, (0), 0 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:28:37,486 INFO L81 ComplementDD]: Finished complementDD. Result has 102 states, 102 states have (on average 159.0) internal successors, (16218), 102 states have internal predecessors, (16218), 0 states have call successors, (0), 0 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:28:37,487 INFO L308 CegarLoopForPetriNet]: 143 programPoint places, 388 predicate places. [2023-12-09 15:28:37,487 INFO L500 AbstractCegarLoop]: Abstraction has has 531 places, 5185 transitions, 74832 flow [2023-12-09 15:28:37,487 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 103.88888888888889) internal successors, (2805), 27 states have internal predecessors, (2805), 0 states have call successors, (0), 0 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:28:37,487 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:28:37,487 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] [2023-12-09 15:28:37,492 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:28:37,692 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:28:37,693 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:28:37,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:28:37,693 INFO L85 PathProgramCache]: Analyzing trace with hash -720444724, now seen corresponding path program 1 times [2023-12-09 15:28:37,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:28:37,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004508890] [2023-12-09 15:28:37,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:28:37,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:28:37,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:28:37,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:28:37,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:28:37,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004508890] [2023-12-09 15:28:37,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004508890] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:28:37,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677833081] [2023-12-09 15:28:37,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:28:37,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:28:37,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:28:37,850 INFO L229 MonitoredProcess]: Starting monitored process 8 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:28:37,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-09 15:28:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:28:37,955 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-09 15:28:37,957 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:28:38,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:28:38,133 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:28:38,326 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:28:38,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677833081] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:28:38,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:28:38,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 24 [2023-12-09 15:28:38,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234949289] [2023-12-09 15:28:38,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:28:38,327 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-09 15:28:38,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:28:38,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-09 15:28:38,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2023-12-09 15:28:38,329 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 159 [2023-12-09 15:28:38,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 531 places, 5185 transitions, 74832 flow. Second operand has 24 states, 24 states have (on average 109.66666666666667) internal successors, (2632), 24 states have internal predecessors, (2632), 0 states have call successors, (0), 0 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:28:38,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:28:38,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 159 [2023-12-09 15:28:38,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:29:07,466 INFO L124 PetriNetUnfolderBase]: 40948/63618 cut-off events. [2023-12-09 15:29:07,466 INFO L125 PetriNetUnfolderBase]: For 181963/184301 co-relation queries the response was YES. [2023-12-09 15:29:07,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 430814 conditions, 63618 events. 40948/63618 cut-off events. For 181963/184301 co-relation queries the response was YES. Maximal size of possible extension queue 2546. Compared 520762 event pairs, 2694 based on Foata normal form. 394/58970 useless extension candidates. Maximal degree in co-relation 225732. Up to 39113 conditions per place. [2023-12-09 15:29:08,303 INFO L140 encePairwiseOnDemand]: 137/159 looper letters, 4503 selfloop transitions, 1105 changer transitions 517/7262 dead transitions. [2023-12-09 15:29:08,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 7262 transitions, 120135 flow [2023-12-09 15:29:08,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-09 15:29:08,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-12-09 15:29:08,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 3073 transitions. [2023-12-09 15:29:08,321 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7158164453761938 [2023-12-09 15:29:08,321 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 3073 transitions. [2023-12-09 15:29:08,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 3073 transitions. [2023-12-09 15:29:08,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:29:08,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 3073 transitions. [2023-12-09 15:29:08,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 113.81481481481481) internal successors, (3073), 27 states have internal predecessors, (3073), 0 states have call successors, (0), 0 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:29:08,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 159.0) internal successors, (4452), 28 states have internal predecessors, (4452), 0 states have call successors, (0), 0 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:29:08,342 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 159.0) internal successors, (4452), 28 states have internal predecessors, (4452), 0 states have call successors, (0), 0 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:29:08,342 INFO L308 CegarLoopForPetriNet]: 143 programPoint places, 414 predicate places. [2023-12-09 15:29:08,342 INFO L500 AbstractCegarLoop]: Abstraction has has 557 places, 7262 transitions, 120135 flow [2023-12-09 15:29:08,343 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 109.66666666666667) internal successors, (2632), 24 states have internal predecessors, (2632), 0 states have call successors, (0), 0 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:29:08,343 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:29:08,343 INFO L233 CegarLoopForPetriNet]: trace histogram [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] [2023-12-09 15:29:08,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-09 15:29:08,547 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:29:08,547 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:29:08,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:29:08,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1478285242, now seen corresponding path program 6 times [2023-12-09 15:29:08,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:29:08,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342160195] [2023-12-09 15:29:08,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:29:08,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:29:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:29:09,014 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:29:09,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:29:09,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342160195] [2023-12-09 15:29:09,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342160195] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:29:09,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068434869] [2023-12-09 15:29:09,015 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-09 15:29:09,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:29:09,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:29:09,016 INFO L229 MonitoredProcess]: Starting monitored process 9 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:29:09,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-09 15:29:09,170 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-12-09 15:29:09,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:29:09,172 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-09 15:29:09,173 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:29:09,662 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:29:09,662 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:29:09,917 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:29:09,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068434869] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:29:09,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:29:09,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 34 [2023-12-09 15:29:09,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498167026] [2023-12-09 15:29:09,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:29:09,918 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-09 15:29:09,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:29:09,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-09 15:29:09,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=960, Unknown=0, NotChecked=0, Total=1122 [2023-12-09 15:29:09,921 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 159 [2023-12-09 15:29:09,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 557 places, 7262 transitions, 120135 flow. Second operand has 34 states, 34 states have (on average 88.41176470588235) internal successors, (3006), 34 states have internal predecessors, (3006), 0 states have call successors, (0), 0 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:29:09,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:29:09,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 159 [2023-12-09 15:29:09,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:29:50,680 INFO L124 PetriNetUnfolderBase]: 35830/56301 cut-off events. [2023-12-09 15:29:50,681 INFO L125 PetriNetUnfolderBase]: For 213110/215699 co-relation queries the response was YES. [2023-12-09 15:29:50,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 405343 conditions, 56301 events. 35830/56301 cut-off events. For 213110/215699 co-relation queries the response was YES. Maximal size of possible extension queue 2159. Compared 459806 event pairs, 2601 based on Foata normal form. 78/52563 useless extension candidates. Maximal degree in co-relation 189749. Up to 34622 conditions per place. [2023-12-09 15:29:51,469 INFO L140 encePairwiseOnDemand]: 129/159 looper letters, 3522 selfloop transitions, 817 changer transitions 1071/6914 dead transitions. [2023-12-09 15:29:51,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 6914 transitions, 123420 flow [2023-12-09 15:29:51,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-09 15:29:51,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-12-09 15:29:51,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 2593 transitions. [2023-12-09 15:29:51,471 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5623509000216873 [2023-12-09 15:29:51,471 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 2593 transitions. [2023-12-09 15:29:51,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 2593 transitions. [2023-12-09 15:29:51,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:29:51,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 2593 transitions. [2023-12-09 15:29:51,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 89.41379310344827) internal successors, (2593), 29 states have internal predecessors, (2593), 0 states have call successors, (0), 0 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:29:51,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 159.0) internal successors, (4770), 30 states have internal predecessors, (4770), 0 states have call successors, (0), 0 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:29:51,477 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 159.0) internal successors, (4770), 30 states have internal predecessors, (4770), 0 states have call successors, (0), 0 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:29:51,478 INFO L308 CegarLoopForPetriNet]: 143 programPoint places, 442 predicate places. [2023-12-09 15:29:51,478 INFO L500 AbstractCegarLoop]: Abstraction has has 585 places, 6914 transitions, 123420 flow [2023-12-09 15:29:51,478 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 88.41176470588235) internal successors, (3006), 34 states have internal predecessors, (3006), 0 states have call successors, (0), 0 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:29:51,478 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:29:51,478 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] [2023-12-09 15:29:51,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-09 15:29:51,685 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-09 15:29:51,685 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:29:51,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:29:51,685 INFO L85 PathProgramCache]: Analyzing trace with hash 89201304, now seen corresponding path program 2 times [2023-12-09 15:29:51,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:29:51,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830975142] [2023-12-09 15:29:51,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:29:51,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:29:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:29:51,856 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:29:51,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:29:51,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830975142] [2023-12-09 15:29:51,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830975142] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:29:51,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798620785] [2023-12-09 15:29:51,857 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 15:29:51,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:29:51,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:29:51,873 INFO L229 MonitoredProcess]: Starting monitored process 10 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:29:51,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-09 15:29:52,047 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 15:29:52,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:29:52,049 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-09 15:29:52,050 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:29:52,170 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:29:52,170 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:29:52,281 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:29:52,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798620785] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:29:52,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:29:52,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 20 [2023-12-09 15:29:52,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453494202] [2023-12-09 15:29:52,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:29:52,282 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-09 15:29:52,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:29:52,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-09 15:29:52,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2023-12-09 15:29:52,284 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 159 [2023-12-09 15:29:52,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 585 places, 6914 transitions, 123420 flow. Second operand has 20 states, 20 states have (on average 105.55) internal successors, (2111), 20 states have internal predecessors, (2111), 0 states have call successors, (0), 0 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:29:52,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:29:52,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 159 [2023-12-09 15:29:52,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:31:09,503 INFO L124 PetriNetUnfolderBase]: 62123/96452 cut-off events. [2023-12-09 15:31:09,503 INFO L125 PetriNetUnfolderBase]: For 435478/439250 co-relation queries the response was YES. [2023-12-09 15:31:09,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 766003 conditions, 96452 events. 62123/96452 cut-off events. For 435478/439250 co-relation queries the response was YES. Maximal size of possible extension queue 3221. Compared 823805 event pairs, 4754 based on Foata normal form. 555/90669 useless extension candidates. Maximal degree in co-relation 370679. Up to 61541 conditions per place. [2023-12-09 15:31:10,655 INFO L140 encePairwiseOnDemand]: 129/159 looper letters, 6882 selfloop transitions, 3286 changer transitions 2547/13251 dead transitions. [2023-12-09 15:31:10,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 681 places, 13251 transitions, 257706 flow [2023-12-09 15:31:10,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2023-12-09 15:31:10,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2023-12-09 15:31:10,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 10635 transitions. [2023-12-09 15:31:10,662 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6895545613693834 [2023-12-09 15:31:10,662 INFO L72 ComplementDD]: Start complementDD. Operand 97 states and 10635 transitions. [2023-12-09 15:31:10,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 10635 transitions. [2023-12-09 15:31:10,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:31:10,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 97 states and 10635 transitions. [2023-12-09 15:31:10,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 98 states, 97 states have (on average 109.63917525773196) internal successors, (10635), 97 states have internal predecessors, (10635), 0 states have call successors, (0), 0 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:31:10,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 98 states, 98 states have (on average 159.0) internal successors, (15582), 98 states have internal predecessors, (15582), 0 states have call successors, (0), 0 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:31:10,684 INFO L81 ComplementDD]: Finished complementDD. Result has 98 states, 98 states have (on average 159.0) internal successors, (15582), 98 states have internal predecessors, (15582), 0 states have call successors, (0), 0 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:31:10,684 INFO L308 CegarLoopForPetriNet]: 143 programPoint places, 538 predicate places. [2023-12-09 15:31:10,684 INFO L500 AbstractCegarLoop]: Abstraction has has 681 places, 13251 transitions, 257706 flow [2023-12-09 15:31:10,685 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 105.55) internal successors, (2111), 20 states have internal predecessors, (2111), 0 states have call successors, (0), 0 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:31:10,685 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:31:10,685 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] [2023-12-09 15:31:10,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-09 15:31:10,889 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:31:10,890 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:31:10,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:31:10,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1759418692, now seen corresponding path program 3 times [2023-12-09 15:31:10,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:31:10,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202294128] [2023-12-09 15:31:10,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:31:10,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:31:10,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:31:11,087 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:31:11,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:31:11,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202294128] [2023-12-09 15:31:11,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202294128] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:31:11,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828620706] [2023-12-09 15:31:11,088 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-09 15:31:11,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:31:11,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:31:11,089 INFO L229 MonitoredProcess]: Starting monitored process 11 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:31:11,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-09 15:31:11,191 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-09 15:31:11,191 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:31:11,192 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-09 15:31:11,194 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:31:11,340 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:31:11,340 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:31:11,521 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:31:11,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828620706] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:31:11,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:31:11,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2023-12-09 15:31:11,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346178910] [2023-12-09 15:31:11,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:31:11,522 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-09 15:31:11,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:31:11,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-09 15:31:11,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2023-12-09 15:31:11,524 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 159 [2023-12-09 15:31:11,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 681 places, 13251 transitions, 257706 flow. Second operand has 25 states, 25 states have (on average 109.04) internal successors, (2726), 25 states have internal predecessors, (2726), 0 states have call successors, (0), 0 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:31:11,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:31:11,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 159 [2023-12-09 15:31:11,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-12-09 15:31:38,355 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-09 15:31:38,356 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:31:38,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-09 15:31:38,392 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-12-09 15:31:38,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-09 15:31:38,598 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-09 15:31:38,598 WARN L624 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (25states, 106/159 universal loopers) in iteration 12,while PetriNetUnfolder was constructing finite prefix that currently has 118951 conditions, 13831 events (8622/13830 cut-off events. For 80114/81459 co-relation queries the response was YES. Maximal size of possible extension queue 2684. Compared 119151 event pairs, 379 based on Foata normal form. 6/15659 useless extension candidates. Maximal degree in co-relation 110128. Up to 7152 conditions per place.). [2023-12-09 15:31:38,601 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-12-09 15:31:38,601 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-12-09 15:31:38,602 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-12-09 15:31:38,603 INFO L457 BasicCegarLoop]: Path program histogram: [6, 3, 1, 1, 1] [2023-12-09 15:31:38,610 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-09 15:31:38,611 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-09 15:31:38,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 03:31:38 BasicIcfg [2023-12-09 15:31:38,625 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-09 15:31:38,626 INFO L158 Benchmark]: Toolchain (without parser) took 249018.08ms. Allocated memory was 282.1MB in the beginning and 3.8GB in the end (delta: 3.5GB). Free memory was 229.5MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. [2023-12-09 15:31:38,626 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 208.7MB. Free memory is still 156.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-09 15:31:38,626 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.65ms. Allocated memory is still 282.1MB. Free memory was 229.5MB in the beginning and 217.4MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-09 15:31:38,626 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.03ms. Allocated memory is still 282.1MB. Free memory was 217.4MB in the beginning and 215.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-09 15:31:38,627 INFO L158 Benchmark]: Boogie Preprocessor took 21.38ms. Allocated memory is still 282.1MB. Free memory was 215.8MB in the beginning and 213.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-09 15:31:38,627 INFO L158 Benchmark]: RCFGBuilder took 569.24ms. Allocated memory is still 282.1MB. Free memory was 213.8MB in the beginning and 191.2MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-12-09 15:31:38,631 INFO L158 Benchmark]: TraceAbstraction took 248190.48ms. Allocated memory was 282.1MB in the beginning and 3.8GB in the end (delta: 3.5GB). Free memory was 190.6MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. [2023-12-09 15:31:38,632 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.12ms. Allocated memory is still 208.7MB. Free memory is still 156.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 200.65ms. Allocated memory is still 282.1MB. Free memory was 229.5MB in the beginning and 217.4MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.03ms. Allocated memory is still 282.1MB. Free memory was 217.4MB in the beginning and 215.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.38ms. Allocated memory is still 282.1MB. Free memory was 215.8MB in the beginning and 213.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 569.24ms. Allocated memory is still 282.1MB. Free memory was 213.8MB in the beginning and 191.2MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 248190.48ms. Allocated memory was 282.1MB in the beginning and 3.8GB in the end (delta: 3.5GB). Free memory was 190.6MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (25states, 106/159 universal loopers) in iteration 12,while PetriNetUnfolder was constructing finite prefix that currently has 118951 conditions, 13831 events (8622/13830 cut-off events. For 80114/81459 co-relation queries the response was YES. Maximal size of possible extension queue 2684. Compared 119151 event pairs, 379 based on Foata normal form. 6/15659 useless extension candidates. Maximal degree in co-relation 110128. Up to 7152 conditions per place.). - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (25states, 106/159 universal loopers) in iteration 12,while PetriNetUnfolder was constructing finite prefix that currently has 118951 conditions, 13831 events (8622/13830 cut-off events. For 80114/81459 co-relation queries the response was YES. Maximal size of possible extension queue 2684. Compared 119151 event pairs, 379 based on Foata normal form. 6/15659 useless extension candidates. Maximal degree in co-relation 110128. Up to 7152 conditions per place.). - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (25states, 106/159 universal loopers) in iteration 12,while PetriNetUnfolder was constructing finite prefix that currently has 118951 conditions, 13831 events (8622/13830 cut-off events. For 80114/81459 co-relation queries the response was YES. Maximal size of possible extension queue 2684. Compared 119151 event pairs, 379 based on Foata normal form. 6/15659 useless extension candidates. Maximal degree in co-relation 110128. Up to 7152 conditions per place.). - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (25states, 106/159 universal loopers) in iteration 12,while PetriNetUnfolder was constructing finite prefix that currently has 118951 conditions, 13831 events (8622/13830 cut-off events. For 80114/81459 co-relation queries the response was YES. Maximal size of possible extension queue 2684. Compared 119151 event pairs, 379 based on Foata normal form. 6/15659 useless extension candidates. Maximal degree in co-relation 110128. Up to 7152 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 184 locations, 4 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: 248.1s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 224.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 20 mSolverCounterUnknown, 4847 SdHoareTripleChecker+Valid, 10.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4847 mSDsluCounter, 13621 SdHoareTripleChecker+Invalid, 8.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2550 IncrementalHoareTripleChecker+Unchecked, 12769 mSDsCounter, 271 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22888 IncrementalHoareTripleChecker+Invalid, 25729 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 271 mSolverCounterUnsat, 852 mSDtfsCounter, 22888 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3262 GetRequests, 2406 SyntacticMatches, 26 SemanticMatches, 830 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 26698 ImplicationChecksByTransitivity, 17.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=257706occurred in iteration=11, InterpolantAutomatonStates: 549, 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.9s SatisfiabilityAnalysisTime, 19.3s InterpolantComputationTime, 2825 NumberOfCodeBlocks, 2825 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 4093 ConstructedInterpolants, 51 QuantifiedInterpolants, 36815 SizeOfPredicates, 170 NumberOfNonLiveVariables, 3108 ConjunctsInSsa, 215 ConjunctsInUnsatCore, 32 InterpolantComputations, 3 PerfectInterpolantSequences, 75/133 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