/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.fix-rcfgbuilder-lbe-0ccecc1-m [2023-11-10 12:24:59,079 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-10 12:24:59,140 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-11-10 12:24:59,166 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-10 12:24:59,167 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-10 12:24:59,167 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-10 12:24:59,167 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-10 12:24:59,168 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-10 12:24:59,168 INFO L153 SettingsManager]: * Use SBE=true [2023-11-10 12:24:59,171 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-10 12:24:59,171 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-10 12:24:59,171 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-10 12:24:59,172 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-10 12:24:59,173 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-10 12:24:59,173 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-10 12:24:59,173 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-10 12:24:59,173 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-10 12:24:59,173 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-10 12:24:59,173 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-10 12:24:59,173 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-10 12:24:59,173 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-10 12:24:59,174 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-10 12:24:59,174 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-10 12:24:59,174 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-10 12:24:59,174 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-10 12:24:59,175 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 12:24:59,176 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-10 12:24:59,176 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-10 12:24:59,176 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-10 12:24:59,176 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-10 12:24:59,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-10 12:24:59,177 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-10 12:24:59,177 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-10 12:24:59,177 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 [2023-11-10 12:24:59,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-10 12:24:59,391 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-10 12:24:59,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-10 12:24:59,394 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-10 12:24:59,394 INFO L274 PluginConnector]: CDTParser initialized [2023-11-10 12:24:59,395 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue2.wvr.c [2023-11-10 12:25:00,341 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-10 12:25:00,507 INFO L384 CDTParser]: Found 1 translation units. [2023-11-10 12:25:00,508 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue2.wvr.c [2023-11-10 12:25:00,515 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b904ecb31/f76dbf5a9b34481d83b593007db8aa22/FLAG505f9e6d0 [2023-11-10 12:25:00,525 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b904ecb31/f76dbf5a9b34481d83b593007db8aa22 [2023-11-10 12:25:00,529 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-10 12:25:00,531 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-10 12:25:00,533 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-10 12:25:00,533 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-10 12:25:00,536 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-10 12:25:00,537 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:25:00" (1/1) ... [2023-11-10 12:25:00,538 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f6f4ade and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:25:00, skipping insertion in model container [2023-11-10 12:25:00,539 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:25:00" (1/1) ... [2023-11-10 12:25:00,555 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-10 12:25:00,674 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-bad-counter-queue2.wvr.c[2271,2284] [2023-11-10 12:25:00,692 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 12:25:00,700 INFO L202 MainTranslator]: Completed pre-run [2023-11-10 12:25:00,727 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-bad-counter-queue2.wvr.c[2271,2284] [2023-11-10 12:25:00,736 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 12:25:00,743 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-10 12:25:00,743 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-10 12:25:00,748 INFO L206 MainTranslator]: Completed translation [2023-11-10 12:25:00,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:25:00 WrapperNode [2023-11-10 12:25:00,749 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-10 12:25:00,750 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-10 12:25:00,750 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-10 12:25:00,751 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-10 12:25:00,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:25:00" (1/1) ... [2023-11-10 12:25:00,767 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:25:00" (1/1) ... [2023-11-10 12:25:00,792 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 142 [2023-11-10 12:25:00,792 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-10 12:25:00,793 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-10 12:25:00,793 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-10 12:25:00,793 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-10 12:25:00,805 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:25:00" (1/1) ... [2023-11-10 12:25:00,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:25:00" (1/1) ... [2023-11-10 12:25:00,818 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:25:00" (1/1) ... [2023-11-10 12:25:00,818 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:25:00" (1/1) ... [2023-11-10 12:25:00,825 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:25:00" (1/1) ... [2023-11-10 12:25:00,827 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:25:00" (1/1) ... [2023-11-10 12:25:00,828 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:25:00" (1/1) ... [2023-11-10 12:25:00,829 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:25:00" (1/1) ... [2023-11-10 12:25:00,831 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-10 12:25:00,832 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-10 12:25:00,832 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-10 12:25:00,832 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-10 12:25:00,839 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:25:00" (1/1) ... [2023-11-10 12:25:00,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 12:25:00,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:25:00,865 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-10 12:25:00,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-10 12:25:00,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-10 12:25:00,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-10 12:25:00,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-10 12:25:00,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-10 12:25:00,895 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-10 12:25:00,895 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-10 12:25:00,895 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-10 12:25:00,895 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-10 12:25:00,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-10 12:25:00,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-10 12:25:00,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-10 12:25:00,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-10 12:25:00,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-10 12:25:00,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-10 12:25:00,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-10 12:25:00,897 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-10 12:25:00,971 INFO L236 CfgBuilder]: Building ICFG [2023-11-10 12:25:00,973 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-10 12:25:01,248 INFO L277 CfgBuilder]: Performing block encoding [2023-11-10 12:25:01,380 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-10 12:25:01,381 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-10 12:25:01,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:25:01 BoogieIcfgContainer [2023-11-10 12:25:01,387 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-10 12:25:01,389 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-10 12:25:01,389 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-10 12:25:01,391 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-10 12:25:01,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:25:00" (1/3) ... [2023-11-10 12:25:01,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ca4bae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:25:01, skipping insertion in model container [2023-11-10 12:25:01,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:25:00" (2/3) ... [2023-11-10 12:25:01,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ca4bae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:25:01, skipping insertion in model container [2023-11-10 12:25:01,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:25:01" (3/3) ... [2023-11-10 12:25:01,393 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue2.wvr.c [2023-11-10 12:25:01,406 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-10 12:25:01,407 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-10 12:25:01,407 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-10 12:25:01,464 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-10 12:25:01,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 118 transitions, 250 flow [2023-11-10 12:25:01,551 INFO L124 PetriNetUnfolderBase]: 9/116 cut-off events. [2023-11-10 12:25:01,552 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-10 12:25:01,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 116 events. 9/116 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2023-11-10 12:25:01,556 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 118 transitions, 250 flow [2023-11-10 12:25:01,560 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 107 transitions, 226 flow [2023-11-10 12:25:01,568 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-10 12:25:01,573 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@179ada41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-10 12:25:01,573 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-10 12:25:01,588 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-10 12:25:01,589 INFO L124 PetriNetUnfolderBase]: 9/106 cut-off events. [2023-11-10 12:25:01,589 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-10 12:25:01,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:25:01,589 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:25:01,590 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:25:01,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:25:01,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1759549425, now seen corresponding path program 1 times [2023-11-10 12:25:01,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:25:01,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148428474] [2023-11-10 12:25:01,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:25:01,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:25:01,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:25:02,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:25:02,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:25:02,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148428474] [2023-11-10 12:25:02,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148428474] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 12:25:02,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 12:25:02,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-10 12:25:02,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323828806] [2023-11-10 12:25:02,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:25:02,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-10 12:25:02,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:25:02,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-10 12:25:02,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-10 12:25:02,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 118 [2023-11-10 12:25:02,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 107 transitions, 226 flow. Second operand has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:02,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:25:02,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 118 [2023-11-10 12:25:02,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:25:02,244 INFO L124 PetriNetUnfolderBase]: 13/159 cut-off events. [2023-11-10 12:25:02,245 INFO L125 PetriNetUnfolderBase]: For 25/26 co-relation queries the response was YES. [2023-11-10 12:25:02,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 159 events. 13/159 cut-off events. For 25/26 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 275 event pairs, 0 based on Foata normal form. 19/165 useless extension candidates. Maximal degree in co-relation 100. Up to 26 conditions per place. [2023-11-10 12:25:02,247 INFO L140 encePairwiseOnDemand]: 103/118 looper letters, 26 selfloop transitions, 3 changer transitions 8/110 dead transitions. [2023-11-10 12:25:02,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 110 transitions, 315 flow [2023-11-10 12:25:02,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-10 12:25:02,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-10 12:25:02,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 628 transitions. [2023-11-10 12:25:02,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7602905569007264 [2023-11-10 12:25:02,265 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 628 transitions. [2023-11-10 12:25:02,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 628 transitions. [2023-11-10 12:25:02,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:25:02,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 628 transitions. [2023-11-10 12:25:02,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 89.71428571428571) internal successors, (628), 7 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-11-10 12:25:02,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 118.0) internal successors, (944), 8 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:02,282 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 118.0) internal successors, (944), 8 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:02,283 INFO L175 Difference]: Start difference. First operand has 105 places, 107 transitions, 226 flow. Second operand 7 states and 628 transitions. [2023-11-10 12:25:02,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 110 transitions, 315 flow [2023-11-10 12:25:02,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 110 transitions, 301 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-10 12:25:02,290 INFO L231 Difference]: Finished difference. Result has 110 places, 100 transitions, 223 flow [2023-11-10 12:25:02,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=223, PETRI_PLACES=110, PETRI_TRANSITIONS=100} [2023-11-10 12:25:02,294 INFO L281 CegarLoopForPetriNet]: 105 programPoint places, 5 predicate places. [2023-11-10 12:25:02,295 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 100 transitions, 223 flow [2023-11-10 12:25:02,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:02,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:25:02,295 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:25:02,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-10 12:25:02,296 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:25:02,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:25:02,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1529214910, now seen corresponding path program 1 times [2023-11-10 12:25:02,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:25:02,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018070538] [2023-11-10 12:25:02,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:25:02,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:25:02,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:25:02,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:25:02,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:25:02,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018070538] [2023-11-10 12:25:02,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018070538] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 12:25:02,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 12:25:02,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-10 12:25:02,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15321959] [2023-11-10 12:25:02,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:25:02,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 12:25:02,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:25:02,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 12:25:02,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-10 12:25:02,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 118 [2023-11-10 12:25:02,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 100 transitions, 223 flow. Second operand has 7 states, 7 states have (on average 83.57142857142857) internal successors, (585), 7 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:02,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:25:02,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 118 [2023-11-10 12:25:02,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:25:02,700 INFO L124 PetriNetUnfolderBase]: 99/414 cut-off events. [2023-11-10 12:25:02,700 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2023-11-10 12:25:02,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 715 conditions, 414 events. 99/414 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1836 event pairs, 54 based on Foata normal form. 0/360 useless extension candidates. Maximal degree in co-relation 699. Up to 136 conditions per place. [2023-11-10 12:25:02,706 INFO L140 encePairwiseOnDemand]: 105/118 looper letters, 43 selfloop transitions, 14 changer transitions 0/124 dead transitions. [2023-11-10 12:25:02,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 124 transitions, 400 flow [2023-11-10 12:25:02,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-10 12:25:02,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-10 12:25:02,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 854 transitions. [2023-11-10 12:25:02,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7237288135593221 [2023-11-10 12:25:02,708 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 854 transitions. [2023-11-10 12:25:02,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 854 transitions. [2023-11-10 12:25:02,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:25:02,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 854 transitions. [2023-11-10 12:25:02,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 85.4) internal successors, (854), 10 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-11-10 12:25:02,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 118.0) internal successors, (1298), 11 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:02,713 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 118.0) internal successors, (1298), 11 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:02,713 INFO L175 Difference]: Start difference. First operand has 110 places, 100 transitions, 223 flow. Second operand 10 states and 854 transitions. [2023-11-10 12:25:02,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 124 transitions, 400 flow [2023-11-10 12:25:02,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 124 transitions, 391 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-10 12:25:02,719 INFO L231 Difference]: Finished difference. Result has 113 places, 107 transitions, 282 flow [2023-11-10 12:25:02,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=282, PETRI_PLACES=113, PETRI_TRANSITIONS=107} [2023-11-10 12:25:02,720 INFO L281 CegarLoopForPetriNet]: 105 programPoint places, 8 predicate places. [2023-11-10 12:25:02,721 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 107 transitions, 282 flow [2023-11-10 12:25:02,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 83.57142857142857) internal successors, (585), 7 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:02,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:25:02,722 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:25:02,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-10 12:25:02,722 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:25:02,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:25:02,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1883660261, now seen corresponding path program 1 times [2023-11-10 12:25:02,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:25:02,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220914153] [2023-11-10 12:25:02,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:25:02,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:25:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:25:02,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:25:02,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:25:02,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220914153] [2023-11-10 12:25:02,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220914153] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 12:25:02,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 12:25:02,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-10 12:25:02,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588275016] [2023-11-10 12:25:02,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:25:02,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 12:25:02,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:25:02,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 12:25:02,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-10 12:25:02,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 118 [2023-11-10 12:25:02,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 107 transitions, 282 flow. Second operand has 7 states, 7 states have (on average 83.57142857142857) internal successors, (585), 7 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:02,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:25:02,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 118 [2023-11-10 12:25:02,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:25:03,030 INFO L124 PetriNetUnfolderBase]: 79/316 cut-off events. [2023-11-10 12:25:03,031 INFO L125 PetriNetUnfolderBase]: For 65/69 co-relation queries the response was YES. [2023-11-10 12:25:03,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 591 conditions, 316 events. 79/316 cut-off events. For 65/69 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1179 event pairs, 45 based on Foata normal form. 4/294 useless extension candidates. Maximal degree in co-relation 403. Up to 136 conditions per place. [2023-11-10 12:25:03,033 INFO L140 encePairwiseOnDemand]: 105/118 looper letters, 29 selfloop transitions, 8 changer transitions 16/120 dead transitions. [2023-11-10 12:25:03,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 120 transitions, 415 flow [2023-11-10 12:25:03,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-10 12:25:03,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-10 12:25:03,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 850 transitions. [2023-11-10 12:25:03,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7203389830508474 [2023-11-10 12:25:03,036 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 850 transitions. [2023-11-10 12:25:03,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 850 transitions. [2023-11-10 12:25:03,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:25:03,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 850 transitions. [2023-11-10 12:25:03,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 85.0) internal successors, (850), 10 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:03,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 118.0) internal successors, (1298), 11 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:03,041 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 118.0) internal successors, (1298), 11 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:03,041 INFO L175 Difference]: Start difference. First operand has 113 places, 107 transitions, 282 flow. Second operand 10 states and 850 transitions. [2023-11-10 12:25:03,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 120 transitions, 415 flow [2023-11-10 12:25:03,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 120 transitions, 411 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-10 12:25:03,046 INFO L231 Difference]: Finished difference. Result has 123 places, 101 transitions, 270 flow [2023-11-10 12:25:03,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=270, PETRI_PLACES=123, PETRI_TRANSITIONS=101} [2023-11-10 12:25:03,048 INFO L281 CegarLoopForPetriNet]: 105 programPoint places, 18 predicate places. [2023-11-10 12:25:03,048 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 101 transitions, 270 flow [2023-11-10 12:25:03,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 83.57142857142857) internal successors, (585), 7 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:03,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:25:03,048 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:25:03,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-10 12:25:03,049 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:25:03,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:25:03,049 INFO L85 PathProgramCache]: Analyzing trace with hash -421014528, now seen corresponding path program 1 times [2023-11-10 12:25:03,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:25:03,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176317682] [2023-11-10 12:25:03,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:25:03,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:25:03,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:25:03,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:25:03,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:25:03,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176317682] [2023-11-10 12:25:03,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176317682] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:25:03,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857690654] [2023-11-10 12:25:03,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:25:03,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:25:03,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:25:03,203 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 12:25:03,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-10 12:25:03,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:25:03,290 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-10 12:25:03,296 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:25:03,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:25:03,421 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:25:03,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:25:03,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857690654] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-10 12:25:03,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-10 12:25:03,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2023-11-10 12:25:03,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723368009] [2023-11-10 12:25:03,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:25:03,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 12:25:03,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:25:03,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 12:25:03,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-11-10 12:25:03,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 118 [2023-11-10 12:25:03,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 101 transitions, 270 flow. Second operand has 7 states, 7 states have (on average 83.85714285714286) internal successors, (587), 7 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:03,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:25:03,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 118 [2023-11-10 12:25:03,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:25:03,671 INFO L124 PetriNetUnfolderBase]: 64/237 cut-off events. [2023-11-10 12:25:03,672 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2023-11-10 12:25:03,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489 conditions, 237 events. 64/237 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 688 event pairs, 14 based on Foata normal form. 8/238 useless extension candidates. Maximal degree in co-relation 391. Up to 67 conditions per place. [2023-11-10 12:25:03,674 INFO L140 encePairwiseOnDemand]: 110/118 looper letters, 34 selfloop transitions, 7 changer transitions 0/108 dead transitions. [2023-11-10 12:25:03,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 108 transitions, 375 flow [2023-11-10 12:25:03,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-10 12:25:03,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-10 12:25:03,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 598 transitions. [2023-11-10 12:25:03,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7239709443099274 [2023-11-10 12:25:03,676 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 598 transitions. [2023-11-10 12:25:03,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 598 transitions. [2023-11-10 12:25:03,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:25:03,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 598 transitions. [2023-11-10 12:25:03,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 85.42857142857143) internal successors, (598), 7 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:03,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 118.0) internal successors, (944), 8 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:03,679 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 118.0) internal successors, (944), 8 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:03,679 INFO L175 Difference]: Start difference. First operand has 123 places, 101 transitions, 270 flow. Second operand 7 states and 598 transitions. [2023-11-10 12:25:03,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 108 transitions, 375 flow [2023-11-10 12:25:03,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 108 transitions, 325 flow, removed 10 selfloop flow, removed 13 redundant places. [2023-11-10 12:25:03,684 INFO L231 Difference]: Finished difference. Result has 111 places, 103 transitions, 257 flow [2023-11-10 12:25:03,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=257, PETRI_PLACES=111, PETRI_TRANSITIONS=103} [2023-11-10 12:25:03,686 INFO L281 CegarLoopForPetriNet]: 105 programPoint places, 6 predicate places. [2023-11-10 12:25:03,686 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 103 transitions, 257 flow [2023-11-10 12:25:03,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 83.85714285714286) internal successors, (587), 7 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:03,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:25:03,687 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:25:03,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-10 12:25:03,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:25:03,893 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:25:03,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:25:03,893 INFO L85 PathProgramCache]: Analyzing trace with hash -835771919, now seen corresponding path program 1 times [2023-11-10 12:25:03,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:25:03,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592536070] [2023-11-10 12:25:03,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:25:03,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:25:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:25:03,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:25:03,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:25:03,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592536070] [2023-11-10 12:25:03,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592536070] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:25:03,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868429406] [2023-11-10 12:25:03,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:25:03,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:25:03,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:25:03,985 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 12:25:03,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-10 12:25:04,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:25:04,055 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-10 12:25:04,057 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:25:04,121 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:25:04,122 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:25:04,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:25:04,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868429406] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-10 12:25:04,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-10 12:25:04,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2023-11-10 12:25:04,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616180370] [2023-11-10 12:25:04,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:25:04,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 12:25:04,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:25:04,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 12:25:04,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-11-10 12:25:04,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 118 [2023-11-10 12:25:04,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 103 transitions, 257 flow. Second operand has 7 states, 7 states have (on average 83.85714285714286) internal successors, (587), 7 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:04,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:25:04,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 118 [2023-11-10 12:25:04,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:25:04,315 INFO L124 PetriNetUnfolderBase]: 51/223 cut-off events. [2023-11-10 12:25:04,316 INFO L125 PetriNetUnfolderBase]: For 71/89 co-relation queries the response was YES. [2023-11-10 12:25:04,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 223 events. 51/223 cut-off events. For 71/89 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 596 event pairs, 12 based on Foata normal form. 18/228 useless extension candidates. Maximal degree in co-relation 362. Up to 58 conditions per place. [2023-11-10 12:25:04,318 INFO L140 encePairwiseOnDemand]: 110/118 looper letters, 36 selfloop transitions, 7 changer transitions 0/110 dead transitions. [2023-11-10 12:25:04,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 110 transitions, 370 flow [2023-11-10 12:25:04,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-10 12:25:04,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-10 12:25:04,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 598 transitions. [2023-11-10 12:25:04,320 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7239709443099274 [2023-11-10 12:25:04,320 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 598 transitions. [2023-11-10 12:25:04,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 598 transitions. [2023-11-10 12:25:04,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:25:04,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 598 transitions. [2023-11-10 12:25:04,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 85.42857142857143) internal successors, (598), 7 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:04,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 118.0) internal successors, (944), 8 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:04,323 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 118.0) internal successors, (944), 8 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:04,323 INFO L175 Difference]: Start difference. First operand has 111 places, 103 transitions, 257 flow. Second operand 7 states and 598 transitions. [2023-11-10 12:25:04,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 110 transitions, 370 flow [2023-11-10 12:25:04,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 110 transitions, 361 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-10 12:25:04,326 INFO L231 Difference]: Finished difference. Result has 115 places, 104 transitions, 276 flow [2023-11-10 12:25:04,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=276, PETRI_PLACES=115, PETRI_TRANSITIONS=104} [2023-11-10 12:25:04,327 INFO L281 CegarLoopForPetriNet]: 105 programPoint places, 10 predicate places. [2023-11-10 12:25:04,328 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 104 transitions, 276 flow [2023-11-10 12:25:04,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 83.85714285714286) internal successors, (587), 7 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:04,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:25:04,328 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:25:04,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-10 12:25:04,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:25:04,534 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:25:04,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:25:04,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1953864894, now seen corresponding path program 1 times [2023-11-10 12:25:04,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:25:04,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841345089] [2023-11-10 12:25:04,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:25:04,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:25:04,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:25:04,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:25:04,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:25:04,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841345089] [2023-11-10 12:25:04,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841345089] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:25:04,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63049128] [2023-11-10 12:25:04,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:25:04,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:25:04,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:25:04,922 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 12:25:04,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-10 12:25:04,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:25:05,000 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-10 12:25:05,003 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:25:05,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:25:05,157 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:25:05,213 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:25:05,213 INFO L351 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 21 treesize of output 14 [2023-11-10 12:25:05,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:25:05,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63049128] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:25:05,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:25:05,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 8] total 17 [2023-11-10 12:25:05,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098381887] [2023-11-10 12:25:05,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:25:05,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-10 12:25:05,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:25:05,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-10 12:25:05,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2023-11-10 12:25:05,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 118 [2023-11-10 12:25:05,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 104 transitions, 276 flow. Second operand has 17 states, 17 states have (on average 55.76470588235294) internal successors, (948), 17 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:05,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:25:05,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 118 [2023-11-10 12:25:05,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:25:05,628 INFO L124 PetriNetUnfolderBase]: 415/937 cut-off events. [2023-11-10 12:25:05,628 INFO L125 PetriNetUnfolderBase]: For 573/573 co-relation queries the response was YES. [2023-11-10 12:25:05,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2239 conditions, 937 events. 415/937 cut-off events. For 573/573 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4926 event pairs, 135 based on Foata normal form. 1/929 useless extension candidates. Maximal degree in co-relation 2150. Up to 415 conditions per place. [2023-11-10 12:25:05,633 INFO L140 encePairwiseOnDemand]: 100/118 looper letters, 91 selfloop transitions, 26 changer transitions 4/165 dead transitions. [2023-11-10 12:25:05,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 165 transitions, 729 flow [2023-11-10 12:25:05,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-10 12:25:05,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-10 12:25:05,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1140 transitions. [2023-11-10 12:25:05,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4830508474576271 [2023-11-10 12:25:05,637 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1140 transitions. [2023-11-10 12:25:05,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1140 transitions. [2023-11-10 12:25:05,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:25:05,638 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1140 transitions. [2023-11-10 12:25:05,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 57.0) internal successors, (1140), 20 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:05,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 118.0) internal successors, (2478), 21 states have internal predecessors, (2478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:05,644 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 118.0) internal successors, (2478), 21 states have internal predecessors, (2478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:05,644 INFO L175 Difference]: Start difference. First operand has 115 places, 104 transitions, 276 flow. Second operand 20 states and 1140 transitions. [2023-11-10 12:25:05,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 165 transitions, 729 flow [2023-11-10 12:25:05,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 165 transitions, 711 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-10 12:25:05,648 INFO L231 Difference]: Finished difference. Result has 136 places, 119 transitions, 421 flow [2023-11-10 12:25:05,648 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=421, PETRI_PLACES=136, PETRI_TRANSITIONS=119} [2023-11-10 12:25:05,650 INFO L281 CegarLoopForPetriNet]: 105 programPoint places, 31 predicate places. [2023-11-10 12:25:05,651 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 119 transitions, 421 flow [2023-11-10 12:25:05,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 55.76470588235294) internal successors, (948), 17 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:05,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:25:05,651 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:25:05,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-10 12:25:05,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:25:05,856 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:25:05,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:25:05,857 INFO L85 PathProgramCache]: Analyzing trace with hash -354561320, now seen corresponding path program 2 times [2023-11-10 12:25:05,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:25:05,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303609024] [2023-11-10 12:25:05,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:25:05,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:25:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:25:06,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:25:06,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:25:06,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303609024] [2023-11-10 12:25:06,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303609024] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:25:06,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339000817] [2023-11-10 12:25:06,392 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-10 12:25:06,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:25:06,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:25:06,393 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 12:25:06,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-10 12:25:06,482 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-10 12:25:06,482 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:25:06,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-10 12:25:06,488 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:25:06,727 INFO L351 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-11-10 12:25:06,881 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-10 12:25:06,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-10 12:25:06,988 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-10 12:25:07,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:25:07,040 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:25:07,169 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_129 (Array Int Int))) (= (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~counter~0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_129) c_~A~0.base) c_~A~0.offset))) is different from false [2023-11-10 12:25:07,177 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_129 (Array Int Int))) (= (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~counter~0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_129) c_~A~0.base) c_~A~0.offset))) is different from false [2023-11-10 12:25:07,189 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_128))) (= (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~counter~0) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_129) c_~A~0.base) c_~A~0.offset)))) is different from false [2023-11-10 12:25:07,207 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_128))) (= (+ (select (select .cse0 |c_ULTIMATE.start_main_#t~ret8#1.base|) |c_ULTIMATE.start_main_#t~ret8#1.offset|) c_~counter~0) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_129) |c_ULTIMATE.start_main_#t~ret8#1.base|) |c_ULTIMATE.start_main_#t~ret8#1.offset|)))) is different from false [2023-11-10 12:25:07,235 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_128))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_129) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~counter~0)))) is different from false [2023-11-10 12:25:07,241 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_128))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_129) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ c_~counter~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|))))) is different from false [2023-11-10 12:25:07,287 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:25:07,287 INFO L351 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 46 treesize of output 35 [2023-11-10 12:25:07,291 INFO L351 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 286 treesize of output 254 [2023-11-10 12:25:07,305 INFO L351 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 13 treesize of output 11 [2023-11-10 12:25:07,308 INFO L351 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 24 treesize of output 20 [2023-11-10 12:25:07,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-10 12:25:07,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339000817] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:25:07,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:25:07,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 17] total 40 [2023-11-10 12:25:07,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491853876] [2023-11-10 12:25:07,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:25:07,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-11-10 12:25:07,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:25:07,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-11-10 12:25:07,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=998, Unknown=15, NotChecked=414, Total=1560 [2023-11-10 12:25:07,438 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 118 [2023-11-10 12:25:07,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 119 transitions, 421 flow. Second operand has 40 states, 40 states have (on average 41.75) internal successors, (1670), 40 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:07,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:25:07,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 118 [2023-11-10 12:25:07,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:25:08,436 INFO L124 PetriNetUnfolderBase]: 607/1334 cut-off events. [2023-11-10 12:25:08,436 INFO L125 PetriNetUnfolderBase]: For 1398/1398 co-relation queries the response was YES. [2023-11-10 12:25:08,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3573 conditions, 1334 events. 607/1334 cut-off events. For 1398/1398 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8176 event pairs, 78 based on Foata normal form. 1/1323 useless extension candidates. Maximal degree in co-relation 3548. Up to 442 conditions per place. [2023-11-10 12:25:08,445 INFO L140 encePairwiseOnDemand]: 96/118 looper letters, 116 selfloop transitions, 50 changer transitions 4/203 dead transitions. [2023-11-10 12:25:08,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 203 transitions, 1086 flow [2023-11-10 12:25:08,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-10 12:25:08,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-11-10 12:25:08,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 1182 transitions. [2023-11-10 12:25:08,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3709981167608286 [2023-11-10 12:25:08,448 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 1182 transitions. [2023-11-10 12:25:08,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 1182 transitions. [2023-11-10 12:25:08,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:25:08,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 1182 transitions. [2023-11-10 12:25:08,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 43.77777777777778) internal successors, (1182), 27 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:08,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 118.0) internal successors, (3304), 28 states have internal predecessors, (3304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:08,454 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 118.0) internal successors, (3304), 28 states have internal predecessors, (3304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:08,454 INFO L175 Difference]: Start difference. First operand has 136 places, 119 transitions, 421 flow. Second operand 27 states and 1182 transitions. [2023-11-10 12:25:08,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 203 transitions, 1086 flow [2023-11-10 12:25:08,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 203 transitions, 1016 flow, removed 20 selfloop flow, removed 12 redundant places. [2023-11-10 12:25:08,460 INFO L231 Difference]: Finished difference. Result has 152 places, 139 transitions, 623 flow [2023-11-10 12:25:08,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=623, PETRI_PLACES=152, PETRI_TRANSITIONS=139} [2023-11-10 12:25:08,461 INFO L281 CegarLoopForPetriNet]: 105 programPoint places, 47 predicate places. [2023-11-10 12:25:08,461 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 139 transitions, 623 flow [2023-11-10 12:25:08,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 41.75) internal successors, (1670), 40 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:08,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:25:08,462 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:25:08,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-10 12:25:08,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:25:08,667 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:25:08,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:25:08,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1247441638, now seen corresponding path program 3 times [2023-11-10 12:25:08,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:25:08,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258504750] [2023-11-10 12:25:08,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:25:08,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:25:08,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:25:08,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:25:08,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:25:08,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258504750] [2023-11-10 12:25:08,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258504750] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:25:08,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803528813] [2023-11-10 12:25:08,997 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-10 12:25:08,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:25:08,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:25:08,998 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-11-10 12:25:09,001 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-11-10 12:25:09,079 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-10 12:25:09,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:25:09,080 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-10 12:25:09,082 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:25:09,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:25:09,230 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:25:09,264 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:25:09,264 INFO L351 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 21 treesize of output 14 [2023-11-10 12:25:09,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:25:09,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803528813] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:25:09,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:25:09,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 8] total 17 [2023-11-10 12:25:09,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577894194] [2023-11-10 12:25:09,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:25:09,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-10 12:25:09,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:25:09,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-10 12:25:09,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2023-11-10 12:25:09,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 118 [2023-11-10 12:25:09,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 139 transitions, 623 flow. Second operand has 17 states, 17 states have (on average 55.88235294117647) internal successors, (950), 17 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:09,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:25:09,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 118 [2023-11-10 12:25:09,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:25:09,752 INFO L124 PetriNetUnfolderBase]: 763/1651 cut-off events. [2023-11-10 12:25:09,752 INFO L125 PetriNetUnfolderBase]: For 2303/2303 co-relation queries the response was YES. [2023-11-10 12:25:09,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4635 conditions, 1651 events. 763/1651 cut-off events. For 2303/2303 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 10956 event pairs, 215 based on Foata normal form. 1/1635 useless extension candidates. Maximal degree in co-relation 4608. Up to 1019 conditions per place. [2023-11-10 12:25:09,761 INFO L140 encePairwiseOnDemand]: 100/118 looper letters, 116 selfloop transitions, 28 changer transitions 4/192 dead transitions. [2023-11-10 12:25:09,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 192 transitions, 1132 flow [2023-11-10 12:25:09,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-10 12:25:09,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-10 12:25:09,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1138 transitions. [2023-11-10 12:25:09,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4822033898305085 [2023-11-10 12:25:09,765 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1138 transitions. [2023-11-10 12:25:09,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1138 transitions. [2023-11-10 12:25:09,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:25:09,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1138 transitions. [2023-11-10 12:25:09,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 56.9) internal successors, (1138), 20 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:09,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 118.0) internal successors, (2478), 21 states have internal predecessors, (2478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:09,773 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 118.0) internal successors, (2478), 21 states have internal predecessors, (2478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:09,773 INFO L175 Difference]: Start difference. First operand has 152 places, 139 transitions, 623 flow. Second operand 20 states and 1138 transitions. [2023-11-10 12:25:09,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 192 transitions, 1132 flow [2023-11-10 12:25:09,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 192 transitions, 1036 flow, removed 32 selfloop flow, removed 15 redundant places. [2023-11-10 12:25:09,782 INFO L231 Difference]: Finished difference. Result has 159 places, 149 transitions, 689 flow [2023-11-10 12:25:09,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=689, PETRI_PLACES=159, PETRI_TRANSITIONS=149} [2023-11-10 12:25:09,784 INFO L281 CegarLoopForPetriNet]: 105 programPoint places, 54 predicate places. [2023-11-10 12:25:09,784 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 149 transitions, 689 flow [2023-11-10 12:25:09,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 55.88235294117647) internal successors, (950), 17 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:09,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:25:09,784 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:25:09,791 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-11-10 12:25:09,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:25:09,992 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:25:09,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:25:09,992 INFO L85 PathProgramCache]: Analyzing trace with hash -371238208, now seen corresponding path program 4 times [2023-11-10 12:25:09,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:25:09,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936276060] [2023-11-10 12:25:09,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:25:09,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:25:10,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:25:10,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:25:10,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:25:10,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936276060] [2023-11-10 12:25:10,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936276060] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:25:10,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058493607] [2023-11-10 12:25:10,351 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-10 12:25:10,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:25:10,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:25:10,353 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-11-10 12:25:10,355 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-11-10 12:25:10,427 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-10 12:25:10,427 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:25:10,429 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-10 12:25:10,431 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:25:10,634 INFO L351 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-11-10 12:25:10,753 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-10 12:25:10,785 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-10 12:25:10,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:25:10,873 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:25:10,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:25:10,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058493607] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:25:10,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:25:10,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 8] total 30 [2023-11-10 12:25:10,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3356474] [2023-11-10 12:25:10,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:25:10,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-10 12:25:10,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:25:10,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-10 12:25:10,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=770, Unknown=0, NotChecked=0, Total=870 [2023-11-10 12:25:10,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 118 [2023-11-10 12:25:10,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 149 transitions, 689 flow. Second operand has 30 states, 30 states have (on average 42.6) internal successors, (1278), 30 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:10,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:25:10,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 118 [2023-11-10 12:25:10,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:25:11,893 INFO L124 PetriNetUnfolderBase]: 919/1981 cut-off events. [2023-11-10 12:25:11,893 INFO L125 PetriNetUnfolderBase]: For 2563/2563 co-relation queries the response was YES. [2023-11-10 12:25:11,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5513 conditions, 1981 events. 919/1981 cut-off events. For 2563/2563 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 13826 event pairs, 236 based on Foata normal form. 1/1966 useless extension candidates. Maximal degree in co-relation 5483. Up to 1046 conditions per place. [2023-11-10 12:25:11,904 INFO L140 encePairwiseOnDemand]: 96/118 looper letters, 129 selfloop transitions, 46 changer transitions 4/212 dead transitions. [2023-11-10 12:25:11,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 212 transitions, 1297 flow [2023-11-10 12:25:11,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-10 12:25:11,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-11-10 12:25:11,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1088 transitions. [2023-11-10 12:25:11,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3688135593220339 [2023-11-10 12:25:11,907 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 1088 transitions. [2023-11-10 12:25:11,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 1088 transitions. [2023-11-10 12:25:11,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:25:11,907 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1088 transitions. [2023-11-10 12:25:11,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 43.52) internal successors, (1088), 25 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:11,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 118.0) internal successors, (3068), 26 states have internal predecessors, (3068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:11,912 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 118.0) internal successors, (3068), 26 states have internal predecessors, (3068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:11,912 INFO L175 Difference]: Start difference. First operand has 159 places, 149 transitions, 689 flow. Second operand 25 states and 1088 transitions. [2023-11-10 12:25:11,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 212 transitions, 1297 flow [2023-11-10 12:25:11,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 212 transitions, 1237 flow, removed 11 selfloop flow, removed 14 redundant places. [2023-11-10 12:25:11,919 INFO L231 Difference]: Finished difference. Result has 170 places, 162 transitions, 844 flow [2023-11-10 12:25:11,920 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=844, PETRI_PLACES=170, PETRI_TRANSITIONS=162} [2023-11-10 12:25:11,920 INFO L281 CegarLoopForPetriNet]: 105 programPoint places, 65 predicate places. [2023-11-10 12:25:11,920 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 162 transitions, 844 flow [2023-11-10 12:25:11,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 42.6) internal successors, (1278), 30 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:11,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:25:11,921 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:25:11,928 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-11-10 12:25:12,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:25:12,129 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:25:12,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:25:12,129 INFO L85 PathProgramCache]: Analyzing trace with hash -2067986484, now seen corresponding path program 5 times [2023-11-10 12:25:12,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:25:12,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371565161] [2023-11-10 12:25:12,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:25:12,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:25:12,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:25:12,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:25:12,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:25:12,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371565161] [2023-11-10 12:25:12,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371565161] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:25:12,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449873442] [2023-11-10 12:25:12,386 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-10 12:25:12,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:25:12,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:25:12,387 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-11-10 12:25:12,389 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-11-10 12:25:12,458 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-10 12:25:12,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:25:12,459 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-10 12:25:12,461 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:25:12,704 INFO L351 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-11-10 12:25:12,843 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-10 12:25:12,897 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-10 12:25:12,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:25:12,954 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:25:13,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:25:13,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449873442] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:25:13,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:25:13,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 8] total 27 [2023-11-10 12:25:13,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073263077] [2023-11-10 12:25:13,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:25:13,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-10 12:25:13,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:25:13,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-10 12:25:13,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2023-11-10 12:25:13,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 118 [2023-11-10 12:25:13,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 162 transitions, 844 flow. Second operand has 27 states, 27 states have (on average 42.888888888888886) internal successors, (1158), 27 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:13,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:25:13,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 118 [2023-11-10 12:25:13,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:25:13,880 INFO L124 PetriNetUnfolderBase]: 1093/2323 cut-off events. [2023-11-10 12:25:13,880 INFO L125 PetriNetUnfolderBase]: For 3911/3911 co-relation queries the response was YES. [2023-11-10 12:25:13,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6808 conditions, 2323 events. 1093/2323 cut-off events. For 3911/3911 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 16579 event pairs, 220 based on Foata normal form. 1/2314 useless extension candidates. Maximal degree in co-relation 6776. Up to 1076 conditions per place. [2023-11-10 12:25:13,895 INFO L140 encePairwiseOnDemand]: 96/118 looper letters, 135 selfloop transitions, 62 changer transitions 4/234 dead transitions. [2023-11-10 12:25:13,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 234 transitions, 1571 flow [2023-11-10 12:25:13,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-10 12:25:13,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-11-10 12:25:13,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 1174 transitions. [2023-11-10 12:25:13,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3684871311989956 [2023-11-10 12:25:13,898 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 1174 transitions. [2023-11-10 12:25:13,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 1174 transitions. [2023-11-10 12:25:13,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:25:13,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 1174 transitions. [2023-11-10 12:25:13,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 43.48148148148148) internal successors, (1174), 27 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:13,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 118.0) internal successors, (3304), 28 states have internal predecessors, (3304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:13,907 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 118.0) internal successors, (3304), 28 states have internal predecessors, (3304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:13,907 INFO L175 Difference]: Start difference. First operand has 170 places, 162 transitions, 844 flow. Second operand 27 states and 1174 transitions. [2023-11-10 12:25:13,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 234 transitions, 1571 flow [2023-11-10 12:25:13,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 234 transitions, 1442 flow, removed 45 selfloop flow, removed 17 redundant places. [2023-11-10 12:25:13,956 INFO L231 Difference]: Finished difference. Result has 180 places, 178 transitions, 1024 flow [2023-11-10 12:25:13,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1024, PETRI_PLACES=180, PETRI_TRANSITIONS=178} [2023-11-10 12:25:13,957 INFO L281 CegarLoopForPetriNet]: 105 programPoint places, 75 predicate places. [2023-11-10 12:25:13,957 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 178 transitions, 1024 flow [2023-11-10 12:25:13,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 42.888888888888886) internal successors, (1158), 27 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:13,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:25:13,959 INFO L208 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] [2023-11-10 12:25:13,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-10 12:25:14,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:25:14,165 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:25:14,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:25:14,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1616359747, now seen corresponding path program 6 times [2023-11-10 12:25:14,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:25:14,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794820839] [2023-11-10 12:25:14,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:25:14,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:25:14,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:25:14,276 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:25:14,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:25:14,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794820839] [2023-11-10 12:25:14,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794820839] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:25:14,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530790578] [2023-11-10 12:25:14,276 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-10 12:25:14,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:25:14,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:25:14,278 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-11-10 12:25:14,280 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-11-10 12:25:14,386 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-11-10 12:25:14,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:25:14,387 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-10 12:25:14,388 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:25:14,512 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:25:14,512 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:25:14,665 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:25:14,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530790578] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:25:14,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:25:14,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2023-11-10 12:25:14,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228207982] [2023-11-10 12:25:14,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:25:14,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-10 12:25:14,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:25:14,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-10 12:25:14,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2023-11-10 12:25:14,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 118 [2023-11-10 12:25:14,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 178 transitions, 1024 flow. Second operand has 24 states, 24 states have (on average 81.0) internal successors, (1944), 24 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:14,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:25:14,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 118 [2023-11-10 12:25:14,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:25:15,078 INFO L124 PetriNetUnfolderBase]: 468/1542 cut-off events. [2023-11-10 12:25:15,079 INFO L125 PetriNetUnfolderBase]: For 2500/2517 co-relation queries the response was YES. [2023-11-10 12:25:15,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4502 conditions, 1542 events. 468/1542 cut-off events. For 2500/2517 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 11213 event pairs, 174 based on Foata normal form. 41/1568 useless extension candidates. Maximal degree in co-relation 4466. Up to 498 conditions per place. [2023-11-10 12:25:15,088 INFO L140 encePairwiseOnDemand]: 98/118 looper letters, 182 selfloop transitions, 40 changer transitions 0/304 dead transitions. [2023-11-10 12:25:15,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 304 transitions, 2335 flow [2023-11-10 12:25:15,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-10 12:25:15,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-11-10 12:25:15,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1486 transitions. [2023-11-10 12:25:15,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.699623352165725 [2023-11-10 12:25:15,091 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1486 transitions. [2023-11-10 12:25:15,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1486 transitions. [2023-11-10 12:25:15,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:25:15,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1486 transitions. [2023-11-10 12:25:15,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 82.55555555555556) internal successors, (1486), 18 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:15,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 118.0) internal successors, (2242), 19 states have internal predecessors, (2242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:15,096 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 118.0) internal successors, (2242), 19 states have internal predecessors, (2242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:15,097 INFO L175 Difference]: Start difference. First operand has 180 places, 178 transitions, 1024 flow. Second operand 18 states and 1486 transitions. [2023-11-10 12:25:15,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 304 transitions, 2335 flow [2023-11-10 12:25:15,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 304 transitions, 2141 flow, removed 56 selfloop flow, removed 20 redundant places. [2023-11-10 12:25:15,108 INFO L231 Difference]: Finished difference. Result has 186 places, 208 transitions, 1308 flow [2023-11-10 12:25:15,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=911, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1308, PETRI_PLACES=186, PETRI_TRANSITIONS=208} [2023-11-10 12:25:15,109 INFO L281 CegarLoopForPetriNet]: 105 programPoint places, 81 predicate places. [2023-11-10 12:25:15,110 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 208 transitions, 1308 flow [2023-11-10 12:25:15,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 81.0) internal successors, (1944), 24 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:15,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:25:15,111 INFO L208 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] [2023-11-10 12:25:15,121 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-11-10 12:25:15,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-10 12:25:15,324 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:25:15,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:25:15,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1368534576, now seen corresponding path program 7 times [2023-11-10 12:25:15,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:25:15,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553748688] [2023-11-10 12:25:15,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:25:15,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:25:15,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:25:15,474 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:25:15,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:25:15,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553748688] [2023-11-10 12:25:15,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553748688] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:25:15,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555970290] [2023-11-10 12:25:15,475 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-10 12:25:15,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:25:15,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:25:15,476 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-11-10 12:25:15,478 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-11-10 12:25:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:25:15,554 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-10 12:25:15,555 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:25:15,690 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:25:15,690 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:25:15,860 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:25:15,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555970290] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:25:15,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:25:15,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2023-11-10 12:25:15,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165041579] [2023-11-10 12:25:15,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:25:15,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-10 12:25:15,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:25:15,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-10 12:25:15,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2023-11-10 12:25:15,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 118 [2023-11-10 12:25:15,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 208 transitions, 1308 flow. Second operand has 24 states, 24 states have (on average 81.08333333333333) internal successors, (1946), 24 states have internal predecessors, (1946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:15,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:25:15,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 118 [2023-11-10 12:25:15,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:25:16,271 INFO L124 PetriNetUnfolderBase]: 399/1326 cut-off events. [2023-11-10 12:25:16,271 INFO L125 PetriNetUnfolderBase]: For 2273/2313 co-relation queries the response was YES. [2023-11-10 12:25:16,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4087 conditions, 1326 events. 399/1326 cut-off events. For 2273/2313 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9593 event pairs, 158 based on Foata normal form. 64/1370 useless extension candidates. Maximal degree in co-relation 3962. Up to 523 conditions per place. [2023-11-10 12:25:16,279 INFO L140 encePairwiseOnDemand]: 98/118 looper letters, 102 selfloop transitions, 15 changer transitions 88/286 dead transitions. [2023-11-10 12:25:16,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 286 transitions, 2186 flow [2023-11-10 12:25:16,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-10 12:25:16,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-11-10 12:25:16,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1486 transitions. [2023-11-10 12:25:16,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.699623352165725 [2023-11-10 12:25:16,281 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1486 transitions. [2023-11-10 12:25:16,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1486 transitions. [2023-11-10 12:25:16,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:25:16,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1486 transitions. [2023-11-10 12:25:16,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 82.55555555555556) internal successors, (1486), 18 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:16,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 118.0) internal successors, (2242), 19 states have internal predecessors, (2242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:16,285 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 118.0) internal successors, (2242), 19 states have internal predecessors, (2242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:16,285 INFO L175 Difference]: Start difference. First operand has 186 places, 208 transitions, 1308 flow. Second operand 18 states and 1486 transitions. [2023-11-10 12:25:16,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 286 transitions, 2186 flow [2023-11-10 12:25:16,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 286 transitions, 2176 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-11-10 12:25:16,295 INFO L231 Difference]: Finished difference. Result has 207 places, 182 transitions, 1089 flow [2023-11-10 12:25:16,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=1274, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1089, PETRI_PLACES=207, PETRI_TRANSITIONS=182} [2023-11-10 12:25:16,296 INFO L281 CegarLoopForPetriNet]: 105 programPoint places, 102 predicate places. [2023-11-10 12:25:16,296 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 182 transitions, 1089 flow [2023-11-10 12:25:16,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 81.08333333333333) internal successors, (1946), 24 states have internal predecessors, (1946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:16,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:25:16,297 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:25:16,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-10 12:25:16,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:25:16,507 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:25:16,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:25:16,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1608304131, now seen corresponding path program 8 times [2023-11-10 12:25:16,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:25:16,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122403498] [2023-11-10 12:25:16,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:25:16,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:25:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:25:16,645 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-10 12:25:16,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:25:16,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122403498] [2023-11-10 12:25:16,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122403498] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:25:16,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886119594] [2023-11-10 12:25:16,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-10 12:25:16,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:25:16,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:25:16,647 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-11-10 12:25:16,671 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-11-10 12:25:16,726 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-10 12:25:16,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:25:16,728 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-10 12:25:16,729 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:25:16,819 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-10 12:25:16,820 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:25:16,893 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-10 12:25:16,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886119594] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:25:16,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:25:16,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 19 [2023-11-10 12:25:16,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505312516] [2023-11-10 12:25:16,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:25:16,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-10 12:25:16,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:25:16,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-10 12:25:16,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2023-11-10 12:25:16,896 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 118 [2023-11-10 12:25:16,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 182 transitions, 1089 flow. Second operand has 19 states, 19 states have (on average 77.21052631578948) internal successors, (1467), 19 states have internal predecessors, (1467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:16,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:25:16,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 118 [2023-11-10 12:25:16,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:25:17,747 INFO L124 PetriNetUnfolderBase]: 488/1122 cut-off events. [2023-11-10 12:25:17,747 INFO L125 PetriNetUnfolderBase]: For 2766/2766 co-relation queries the response was YES. [2023-11-10 12:25:17,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4295 conditions, 1122 events. 488/1122 cut-off events. For 2766/2766 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5928 event pairs, 13 based on Foata normal form. 55/1173 useless extension candidates. Maximal degree in co-relation 4166. Up to 179 conditions per place. [2023-11-10 12:25:17,757 INFO L140 encePairwiseOnDemand]: 96/118 looper letters, 187 selfloop transitions, 133 changer transitions 0/380 dead transitions. [2023-11-10 12:25:17,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 380 transitions, 3085 flow [2023-11-10 12:25:17,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-11-10 12:25:17,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2023-11-10 12:25:17,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 3195 transitions. [2023-11-10 12:25:17,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6603968582058702 [2023-11-10 12:25:17,760 INFO L72 ComplementDD]: Start complementDD. Operand 41 states and 3195 transitions. [2023-11-10 12:25:17,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 3195 transitions. [2023-11-10 12:25:17,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:25:17,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 41 states and 3195 transitions. [2023-11-10 12:25:17,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 42 states, 41 states have (on average 77.92682926829268) internal successors, (3195), 41 states have internal predecessors, (3195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:17,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 42 states, 42 states have (on average 118.0) internal successors, (4956), 42 states have internal predecessors, (4956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:17,769 INFO L81 ComplementDD]: Finished complementDD. Result has 42 states, 42 states have (on average 118.0) internal successors, (4956), 42 states have internal predecessors, (4956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:17,769 INFO L175 Difference]: Start difference. First operand has 207 places, 182 transitions, 1089 flow. Second operand 41 states and 3195 transitions. [2023-11-10 12:25:17,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 380 transitions, 3085 flow [2023-11-10 12:25:17,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 380 transitions, 2645 flow, removed 136 selfloop flow, removed 30 redundant places. [2023-11-10 12:25:17,782 INFO L231 Difference]: Finished difference. Result has 224 places, 264 transitions, 1895 flow [2023-11-10 12:25:17,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=1895, PETRI_PLACES=224, PETRI_TRANSITIONS=264} [2023-11-10 12:25:17,783 INFO L281 CegarLoopForPetriNet]: 105 programPoint places, 119 predicate places. [2023-11-10 12:25:17,783 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 264 transitions, 1895 flow [2023-11-10 12:25:17,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 77.21052631578948) internal successors, (1467), 19 states have internal predecessors, (1467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:17,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:25:17,784 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:25:17,791 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-11-10 12:25:17,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-10 12:25:17,989 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:25:17,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:25:17,990 INFO L85 PathProgramCache]: Analyzing trace with hash -417318196, now seen corresponding path program 9 times [2023-11-10 12:25:17,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:25:17,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215106748] [2023-11-10 12:25:17,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:25:17,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:25:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:25:18,111 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-10 12:25:18,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:25:18,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215106748] [2023-11-10 12:25:18,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215106748] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:25:18,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222734375] [2023-11-10 12:25:18,112 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-10 12:25:18,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:25:18,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:25:18,113 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 12:25:18,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-10 12:25:18,240 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-10 12:25:18,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:25:18,242 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-10 12:25:18,243 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:25:18,377 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-10 12:25:18,377 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:25:18,556 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-10 12:25:18,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222734375] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:25:18,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:25:18,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2023-11-10 12:25:18,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833691665] [2023-11-10 12:25:18,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:25:18,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-10 12:25:18,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:25:18,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-10 12:25:18,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2023-11-10 12:25:18,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 118 [2023-11-10 12:25:18,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 264 transitions, 1895 flow. Second operand has 24 states, 24 states have (on average 81.0) internal successors, (1944), 24 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:18,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:25:18,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 118 [2023-11-10 12:25:18,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:25:18,883 INFO L124 PetriNetUnfolderBase]: 324/855 cut-off events. [2023-11-10 12:25:18,884 INFO L125 PetriNetUnfolderBase]: For 4342/4373 co-relation queries the response was YES. [2023-11-10 12:25:18,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3818 conditions, 855 events. 324/855 cut-off events. For 4342/4373 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4052 event pairs, 42 based on Foata normal form. 40/883 useless extension candidates. Maximal degree in co-relation 3692. Up to 177 conditions per place. [2023-11-10 12:25:18,891 INFO L140 encePairwiseOnDemand]: 102/118 looper letters, 143 selfloop transitions, 60 changer transitions 0/320 dead transitions. [2023-11-10 12:25:18,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 320 transitions, 2684 flow [2023-11-10 12:25:18,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-10 12:25:18,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-11-10 12:25:18,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1473 transitions. [2023-11-10 12:25:18,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.693502824858757 [2023-11-10 12:25:18,893 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1473 transitions. [2023-11-10 12:25:18,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1473 transitions. [2023-11-10 12:25:18,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:25:18,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1473 transitions. [2023-11-10 12:25:18,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 81.83333333333333) internal successors, (1473), 18 states have internal predecessors, (1473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:18,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 118.0) internal successors, (2242), 19 states have internal predecessors, (2242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:18,898 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 118.0) internal successors, (2242), 19 states have internal predecessors, (2242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:18,898 INFO L175 Difference]: Start difference. First operand has 224 places, 264 transitions, 1895 flow. Second operand 18 states and 1473 transitions. [2023-11-10 12:25:18,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 320 transitions, 2684 flow [2023-11-10 12:25:18,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 320 transitions, 2647 flow, removed 6 selfloop flow, removed 11 redundant places. [2023-11-10 12:25:18,917 INFO L231 Difference]: Finished difference. Result has 233 places, 267 transitions, 2037 flow [2023-11-10 12:25:18,917 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=1799, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2037, PETRI_PLACES=233, PETRI_TRANSITIONS=267} [2023-11-10 12:25:18,917 INFO L281 CegarLoopForPetriNet]: 105 programPoint places, 128 predicate places. [2023-11-10 12:25:18,917 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 267 transitions, 2037 flow [2023-11-10 12:25:18,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 81.0) internal successors, (1944), 24 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:18,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:25:18,918 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:25:18,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-10 12:25:19,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-10 12:25:19,124 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:25:19,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:25:19,124 INFO L85 PathProgramCache]: Analyzing trace with hash -566051691, now seen corresponding path program 10 times [2023-11-10 12:25:19,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:25:19,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405547633] [2023-11-10 12:25:19,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:25:19,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:25:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:25:20,287 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:25:20,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:25:20,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405547633] [2023-11-10 12:25:20,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405547633] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:25:20,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805848763] [2023-11-10 12:25:20,287 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-10 12:25:20,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:25:20,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:25:20,288 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 12:25:20,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-10 12:25:20,363 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-10 12:25:20,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:25:20,365 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-10 12:25:20,366 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:25:20,839 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-10 12:25:20,839 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:25:21,081 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:25:21,081 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 43 [2023-11-10 12:25:21,196 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-10 12:25:21,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805848763] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:25:21,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:25:21,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 21, 14] total 52 [2023-11-10 12:25:21,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863334465] [2023-11-10 12:25:21,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:25:21,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-11-10 12:25:21,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:25:21,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-11-10 12:25:21,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2473, Unknown=0, NotChecked=0, Total=2652 [2023-11-10 12:25:21,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 118 [2023-11-10 12:25:21,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 267 transitions, 2037 flow. Second operand has 52 states, 52 states have (on average 33.57692307692308) internal successors, (1746), 52 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:21,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:25:21,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 118 [2023-11-10 12:25:21,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:25:24,520 INFO L124 PetriNetUnfolderBase]: 2123/3856 cut-off events. [2023-11-10 12:25:24,520 INFO L125 PetriNetUnfolderBase]: For 17741/17741 co-relation queries the response was YES. [2023-11-10 12:25:24,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17080 conditions, 3856 events. 2123/3856 cut-off events. For 17741/17741 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 24901 event pairs, 208 based on Foata normal form. 1/3841 useless extension candidates. Maximal degree in co-relation 16404. Up to 2299 conditions per place. [2023-11-10 12:25:24,550 INFO L140 encePairwiseOnDemand]: 82/118 looper letters, 415 selfloop transitions, 171 changer transitions 6/617 dead transitions. [2023-11-10 12:25:24,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 617 transitions, 5542 flow [2023-11-10 12:25:24,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2023-11-10 12:25:24,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2023-11-10 12:25:24,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 2336 transitions. [2023-11-10 12:25:24,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29994863893168977 [2023-11-10 12:25:24,553 INFO L72 ComplementDD]: Start complementDD. Operand 66 states and 2336 transitions. [2023-11-10 12:25:24,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 2336 transitions. [2023-11-10 12:25:24,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:25:24,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 66 states and 2336 transitions. [2023-11-10 12:25:24,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 67 states, 66 states have (on average 35.39393939393939) internal successors, (2336), 66 states have internal predecessors, (2336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:24,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 67 states, 67 states have (on average 118.0) internal successors, (7906), 67 states have internal predecessors, (7906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:24,566 INFO L81 ComplementDD]: Finished complementDD. Result has 67 states, 67 states have (on average 118.0) internal successors, (7906), 67 states have internal predecessors, (7906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:24,566 INFO L175 Difference]: Start difference. First operand has 233 places, 267 transitions, 2037 flow. Second operand 66 states and 2336 transitions. [2023-11-10 12:25:24,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 617 transitions, 5542 flow [2023-11-10 12:25:24,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 617 transitions, 5395 flow, removed 14 selfloop flow, removed 14 redundant places. [2023-11-10 12:25:24,619 INFO L231 Difference]: Finished difference. Result has 302 places, 416 transitions, 3602 flow [2023-11-10 12:25:24,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=1959, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=66, PETRI_FLOW=3602, PETRI_PLACES=302, PETRI_TRANSITIONS=416} [2023-11-10 12:25:24,620 INFO L281 CegarLoopForPetriNet]: 105 programPoint places, 197 predicate places. [2023-11-10 12:25:24,620 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 416 transitions, 3602 flow [2023-11-10 12:25:24,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 33.57692307692308) internal successors, (1746), 52 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:24,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:25:24,621 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:25:24,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-10 12:25:24,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-10 12:25:24,826 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:25:24,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:25:24,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1160301033, now seen corresponding path program 11 times [2023-11-10 12:25:24,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:25:24,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429837110] [2023-11-10 12:25:24,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:25:24,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:25:24,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:25:25,897 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:25:25,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:25:25,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429837110] [2023-11-10 12:25:25,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429837110] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:25:25,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666512256] [2023-11-10 12:25:25,898 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-10 12:25:25,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:25:25,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:25:25,899 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 12:25:25,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-10 12:25:25,977 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-11-10 12:25:25,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:25:25,979 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-10 12:25:25,980 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:25:26,443 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-10 12:25:26,444 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:25:26,677 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:25:26,677 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 43 [2023-11-10 12:25:26,790 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-10 12:25:26,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666512256] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:25:26,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:25:26,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 21, 14] total 53 [2023-11-10 12:25:26,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461888902] [2023-11-10 12:25:26,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:25:26,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-11-10 12:25:26,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:25:26,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-11-10 12:25:26,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2566, Unknown=0, NotChecked=0, Total=2756 [2023-11-10 12:25:26,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 118 [2023-11-10 12:25:26,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 416 transitions, 3602 flow. Second operand has 53 states, 53 states have (on average 33.60377358490566) internal successors, (1781), 53 states have internal predecessors, (1781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:26,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:25:26,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 118 [2023-11-10 12:25:26,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:25:29,734 INFO L124 PetriNetUnfolderBase]: 2469/4534 cut-off events. [2023-11-10 12:25:29,734 INFO L125 PetriNetUnfolderBase]: For 22243/22266 co-relation queries the response was YES. [2023-11-10 12:25:29,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21252 conditions, 4534 events. 2469/4534 cut-off events. For 22243/22266 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 30625 event pairs, 436 based on Foata normal form. 19/4531 useless extension candidates. Maximal degree in co-relation 21187. Up to 3034 conditions per place. [2023-11-10 12:25:29,773 INFO L140 encePairwiseOnDemand]: 84/118 looper letters, 443 selfloop transitions, 148 changer transitions 4/620 dead transitions. [2023-11-10 12:25:29,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 620 transitions, 6084 flow [2023-11-10 12:25:29,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-11-10 12:25:29,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2023-11-10 12:25:29,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 2147 transitions. [2023-11-10 12:25:29,776 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2982772992497916 [2023-11-10 12:25:29,777 INFO L72 ComplementDD]: Start complementDD. Operand 61 states and 2147 transitions. [2023-11-10 12:25:29,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 2147 transitions. [2023-11-10 12:25:29,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:25:29,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 61 states and 2147 transitions. [2023-11-10 12:25:29,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 62 states, 61 states have (on average 35.19672131147541) internal successors, (2147), 61 states have internal predecessors, (2147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:29,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 62 states, 62 states have (on average 118.0) internal successors, (7316), 62 states have internal predecessors, (7316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:29,786 INFO L81 ComplementDD]: Finished complementDD. Result has 62 states, 62 states have (on average 118.0) internal successors, (7316), 62 states have internal predecessors, (7316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:29,787 INFO L175 Difference]: Start difference. First operand has 302 places, 416 transitions, 3602 flow. Second operand 61 states and 2147 transitions. [2023-11-10 12:25:29,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 620 transitions, 6084 flow [2023-11-10 12:25:29,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 620 transitions, 5970 flow, removed 33 selfloop flow, removed 19 redundant places. [2023-11-10 12:25:29,880 INFO L231 Difference]: Finished difference. Result has 349 places, 443 transitions, 4130 flow [2023-11-10 12:25:29,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=3502, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=61, PETRI_FLOW=4130, PETRI_PLACES=349, PETRI_TRANSITIONS=443} [2023-11-10 12:25:29,881 INFO L281 CegarLoopForPetriNet]: 105 programPoint places, 244 predicate places. [2023-11-10 12:25:29,881 INFO L495 AbstractCegarLoop]: Abstraction has has 349 places, 443 transitions, 4130 flow [2023-11-10 12:25:29,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 33.60377358490566) internal successors, (1781), 53 states have internal predecessors, (1781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:29,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:25:29,882 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:25:29,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-10 12:25:30,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-10 12:25:30,087 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:25:30,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:25:30,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1051731269, now seen corresponding path program 12 times [2023-11-10 12:25:30,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:25:30,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295202481] [2023-11-10 12:25:30,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:25:30,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:25:30,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:25:30,754 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:25:30,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:25:30,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295202481] [2023-11-10 12:25:30,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295202481] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:25:30,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240527984] [2023-11-10 12:25:30,754 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-10 12:25:30,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:25:30,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:25:30,756 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 12:25:30,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-10 12:25:30,893 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-11-10 12:25:30,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:25:30,895 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-10 12:25:30,897 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:25:31,214 INFO L351 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 19 treesize of output 1 [2023-11-10 12:25:31,345 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-10 12:25:31,384 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-10 12:25:31,652 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:25:31,652 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:25:31,985 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-10 12:25:31,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240527984] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:25:31,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:25:31,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25, 14] total 57 [2023-11-10 12:25:31,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989028861] [2023-11-10 12:25:31,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:25:31,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-11-10 12:25:31,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:25:31,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-11-10 12:25:31,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=3000, Unknown=0, NotChecked=0, Total=3192 [2023-11-10 12:25:31,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 118 [2023-11-10 12:25:31,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 443 transitions, 4130 flow. Second operand has 57 states, 57 states have (on average 33.56140350877193) internal successors, (1913), 57 states have internal predecessors, (1913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:31,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:25:31,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 118 [2023-11-10 12:25:31,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:25:35,568 INFO L124 PetriNetUnfolderBase]: 2905/5349 cut-off events. [2023-11-10 12:25:35,568 INFO L125 PetriNetUnfolderBase]: For 30216/30239 co-relation queries the response was YES. [2023-11-10 12:25:35,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26146 conditions, 5349 events. 2905/5349 cut-off events. For 30216/30239 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 37553 event pairs, 553 based on Foata normal form. 19/5342 useless extension candidates. Maximal degree in co-relation 26074. Up to 3637 conditions per place. [2023-11-10 12:25:35,613 INFO L140 encePairwiseOnDemand]: 84/118 looper letters, 501 selfloop transitions, 187 changer transitions 4/717 dead transitions. [2023-11-10 12:25:35,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 717 transitions, 7515 flow [2023-11-10 12:25:35,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2023-11-10 12:25:35,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2023-11-10 12:25:35,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 2565 transitions. [2023-11-10 12:25:35,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2977710703505921 [2023-11-10 12:25:35,620 INFO L72 ComplementDD]: Start complementDD. Operand 73 states and 2565 transitions. [2023-11-10 12:25:35,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 2565 transitions. [2023-11-10 12:25:35,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:25:35,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 73 states and 2565 transitions. [2023-11-10 12:25:35,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 74 states, 73 states have (on average 35.136986301369866) internal successors, (2565), 73 states have internal predecessors, (2565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:35,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 74 states, 74 states have (on average 118.0) internal successors, (8732), 74 states have internal predecessors, (8732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:35,634 INFO L81 ComplementDD]: Finished complementDD. Result has 74 states, 74 states have (on average 118.0) internal successors, (8732), 74 states have internal predecessors, (8732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:35,634 INFO L175 Difference]: Start difference. First operand has 349 places, 443 transitions, 4130 flow. Second operand 73 states and 2565 transitions. [2023-11-10 12:25:35,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 419 places, 717 transitions, 7515 flow [2023-11-10 12:25:35,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 717 transitions, 7266 flow, removed 22 selfloop flow, removed 49 redundant places. [2023-11-10 12:25:35,759 INFO L231 Difference]: Finished difference. Result has 383 places, 507 transitions, 5132 flow [2023-11-10 12:25:35,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=3895, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=73, PETRI_FLOW=5132, PETRI_PLACES=383, PETRI_TRANSITIONS=507} [2023-11-10 12:25:35,760 INFO L281 CegarLoopForPetriNet]: 105 programPoint places, 278 predicate places. [2023-11-10 12:25:35,760 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 507 transitions, 5132 flow [2023-11-10 12:25:35,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 33.56140350877193) internal successors, (1913), 57 states have internal predecessors, (1913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:35,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:25:35,760 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:25:35,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-10 12:25:35,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:25:35,967 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:25:35,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:25:35,967 INFO L85 PathProgramCache]: Analyzing trace with hash 598546437, now seen corresponding path program 13 times [2023-11-10 12:25:35,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:25:35,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283700709] [2023-11-10 12:25:35,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:25:35,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:25:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:25:37,074 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:25:37,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:25:37,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283700709] [2023-11-10 12:25:37,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283700709] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:25:37,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128596882] [2023-11-10 12:25:37,075 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-10 12:25:37,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:25:37,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:25:37,077 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 12:25:37,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-10 12:25:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:25:37,170 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-10 12:25:37,172 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:25:37,507 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-10 12:25:37,507 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:25:37,731 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:25:37,732 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 43 [2023-11-10 12:25:37,819 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-10 12:25:37,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128596882] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:25:37,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:25:37,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 16, 14] total 51 [2023-11-10 12:25:37,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683170236] [2023-11-10 12:25:37,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:25:37,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-11-10 12:25:37,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:25:37,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-11-10 12:25:37,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2375, Unknown=0, NotChecked=0, Total=2550 [2023-11-10 12:25:37,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 118 [2023-11-10 12:25:37,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 507 transitions, 5132 flow. Second operand has 51 states, 51 states have (on average 33.21568627450981) internal successors, (1694), 51 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:37,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:25:37,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 118 [2023-11-10 12:25:37,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:25:41,139 INFO L124 PetriNetUnfolderBase]: 3334/6144 cut-off events. [2023-11-10 12:25:41,139 INFO L125 PetriNetUnfolderBase]: For 42949/42972 co-relation queries the response was YES. [2023-11-10 12:25:41,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31555 conditions, 6144 events. 3334/6144 cut-off events. For 42949/42972 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 44405 event pairs, 648 based on Foata normal form. 19/6136 useless extension candidates. Maximal degree in co-relation 31471. Up to 4125 conditions per place. [2023-11-10 12:25:41,189 INFO L140 encePairwiseOnDemand]: 84/118 looper letters, 531 selfloop transitions, 201 changer transitions 4/761 dead transitions. [2023-11-10 12:25:41,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 761 transitions, 8498 flow [2023-11-10 12:25:41,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2023-11-10 12:25:41,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2023-11-10 12:25:41,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 2482 transitions. [2023-11-10 12:25:41,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30048426150121066 [2023-11-10 12:25:41,192 INFO L72 ComplementDD]: Start complementDD. Operand 70 states and 2482 transitions. [2023-11-10 12:25:41,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 2482 transitions. [2023-11-10 12:25:41,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:25:41,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 70 states and 2482 transitions. [2023-11-10 12:25:41,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 71 states, 70 states have (on average 35.457142857142856) internal successors, (2482), 70 states have internal predecessors, (2482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:41,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 71 states, 71 states have (on average 118.0) internal successors, (8378), 71 states have internal predecessors, (8378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:41,200 INFO L81 ComplementDD]: Finished complementDD. Result has 71 states, 71 states have (on average 118.0) internal successors, (8378), 71 states have internal predecessors, (8378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:41,201 INFO L175 Difference]: Start difference. First operand has 383 places, 507 transitions, 5132 flow. Second operand 70 states and 2482 transitions. [2023-11-10 12:25:41,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 761 transitions, 8498 flow [2023-11-10 12:25:41,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 761 transitions, 8055 flow, removed 116 selfloop flow, removed 51 redundant places. [2023-11-10 12:25:41,398 INFO L231 Difference]: Finished difference. Result has 405 places, 549 transitions, 5739 flow [2023-11-10 12:25:41,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=4711, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=171, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=70, PETRI_FLOW=5739, PETRI_PLACES=405, PETRI_TRANSITIONS=549} [2023-11-10 12:25:41,399 INFO L281 CegarLoopForPetriNet]: 105 programPoint places, 300 predicate places. [2023-11-10 12:25:41,399 INFO L495 AbstractCegarLoop]: Abstraction has has 405 places, 549 transitions, 5739 flow [2023-11-10 12:25:41,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 33.21568627450981) internal successors, (1694), 51 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:41,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:25:41,399 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:25:41,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-11-10 12:25:41,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-10 12:25:41,600 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:25:41,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:25:41,600 INFO L85 PathProgramCache]: Analyzing trace with hash -866312573, now seen corresponding path program 14 times [2023-11-10 12:25:41,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:25:41,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949918809] [2023-11-10 12:25:41,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:25:41,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:25:41,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:25:42,360 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:25:42,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:25:42,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949918809] [2023-11-10 12:25:42,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949918809] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:25:42,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270281927] [2023-11-10 12:25:42,360 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-10 12:25:42,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:25:42,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:25:42,361 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 12:25:42,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-10 12:25:42,442 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-10 12:25:42,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:25:42,443 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-10 12:25:42,445 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:25:42,813 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-10 12:25:42,813 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:25:43,033 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:25:43,033 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 43 [2023-11-10 12:25:43,138 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-10 12:25:43,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270281927] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:25:43,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:25:43,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 19, 14] total 48 [2023-11-10 12:25:43,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273453975] [2023-11-10 12:25:43,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:25:43,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-11-10 12:25:43,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:25:43,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-11-10 12:25:43,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2090, Unknown=0, NotChecked=0, Total=2256 [2023-11-10 12:25:43,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 118 [2023-11-10 12:25:43,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 549 transitions, 5739 flow. Second operand has 48 states, 48 states have (on average 40.625) internal successors, (1950), 48 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:43,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:25:43,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 118 [2023-11-10 12:25:43,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:25:46,247 INFO L124 PetriNetUnfolderBase]: 3610/6699 cut-off events. [2023-11-10 12:25:46,248 INFO L125 PetriNetUnfolderBase]: For 53336/53359 co-relation queries the response was YES. [2023-11-10 12:25:46,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35141 conditions, 6699 events. 3610/6699 cut-off events. For 53336/53359 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 49544 event pairs, 797 based on Foata normal form. 19/6682 useless extension candidates. Maximal degree in co-relation 35052. Up to 4778 conditions per place. [2023-11-10 12:25:46,304 INFO L140 encePairwiseOnDemand]: 86/118 looper letters, 535 selfloop transitions, 196 changer transitions 4/763 dead transitions. [2023-11-10 12:25:46,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 466 places, 763 transitions, 8836 flow [2023-11-10 12:25:46,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2023-11-10 12:25:46,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2023-11-10 12:25:46,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 2699 transitions. [2023-11-10 12:25:46,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3573887711864407 [2023-11-10 12:25:46,307 INFO L72 ComplementDD]: Start complementDD. Operand 64 states and 2699 transitions. [2023-11-10 12:25:46,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 2699 transitions. [2023-11-10 12:25:46,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:25:46,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 64 states and 2699 transitions. [2023-11-10 12:25:46,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 65 states, 64 states have (on average 42.171875) internal successors, (2699), 64 states have internal predecessors, (2699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:46,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 65 states, 65 states have (on average 118.0) internal successors, (7670), 65 states have internal predecessors, (7670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:46,315 INFO L81 ComplementDD]: Finished complementDD. Result has 65 states, 65 states have (on average 118.0) internal successors, (7670), 65 states have internal predecessors, (7670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:46,315 INFO L175 Difference]: Start difference. First operand has 405 places, 549 transitions, 5739 flow. Second operand 64 states and 2699 transitions. [2023-11-10 12:25:46,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 466 places, 763 transitions, 8836 flow [2023-11-10 12:25:46,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 427 places, 763 transitions, 8601 flow, removed 57 selfloop flow, removed 39 redundant places. [2023-11-10 12:25:46,538 INFO L231 Difference]: Finished difference. Result has 434 places, 579 transitions, 6515 flow [2023-11-10 12:25:46,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=5514, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=174, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=64, PETRI_FLOW=6515, PETRI_PLACES=434, PETRI_TRANSITIONS=579} [2023-11-10 12:25:46,539 INFO L281 CegarLoopForPetriNet]: 105 programPoint places, 329 predicate places. [2023-11-10 12:25:46,539 INFO L495 AbstractCegarLoop]: Abstraction has has 434 places, 579 transitions, 6515 flow [2023-11-10 12:25:46,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 40.625) internal successors, (1950), 48 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:46,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:25:46,540 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:25:46,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-10 12:25:46,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:25:46,745 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:25:46,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:25:46,745 INFO L85 PathProgramCache]: Analyzing trace with hash 854208213, now seen corresponding path program 15 times [2023-11-10 12:25:46,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:25:46,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661089850] [2023-11-10 12:25:46,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:25:46,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:25:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:25:47,744 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:25:47,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:25:47,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661089850] [2023-11-10 12:25:47,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661089850] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:25:47,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374291947] [2023-11-10 12:25:47,745 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-10 12:25:47,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:25:47,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:25:47,746 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 12:25:47,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-10 12:25:47,894 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-10 12:25:47,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:25:47,896 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 73 conjunts are in the unsatisfiable core [2023-11-10 12:25:47,901 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:25:48,403 INFO L351 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-11-10 12:25:48,765 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-10 12:25:48,825 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-10 12:25:49,238 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:25:49,239 INFO L351 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 15 treesize of output 14 [2023-11-10 12:25:49,400 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:25:49,400 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:25:49,948 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_485 (Array Int Int)) (v_ArrVal_484 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_485) c_~A~0.base))) (= (select .cse0 (+ c_~A~0.offset (* c_~N~0 4) (- 4))) (+ c_~counter~0 (select .cse0 (+ c_~A~0.offset 4)))))) is different from false [2023-11-10 12:25:49,960 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_485 (Array Int Int)) (v_ArrVal_484 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_485) |c_ULTIMATE.start_main_#t~ret8#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret8#1.offset| (* c_~N~0 4) (- 4))) (+ c_~counter~0 (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret8#1.offset| 4)))))) is different from false [2023-11-10 12:25:49,970 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_485 (Array Int Int)) (v_ArrVal_484 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_485) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (= (select .cse0 (+ (* c_~N~0 4) (- 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (+ (select .cse0 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) c_~counter~0)))) is different from false [2023-11-10 12:25:49,975 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_485 (Array Int Int)) (v_ArrVal_484 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_484) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_485) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (= (select .cse0 (+ (* c_~N~0 4) (- 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (+ c_~counter~0 (select .cse0 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) is different from false [2023-11-10 12:25:50,176 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:25:50,176 INFO L351 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 56 treesize of output 45 [2023-11-10 12:25:50,183 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:25:50,183 INFO L351 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 206 treesize of output 184 [2023-11-10 12:25:50,191 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:25:50,191 INFO L351 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 36 treesize of output 34 [2023-11-10 12:25:50,225 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:25:50,226 INFO L351 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 42 treesize of output 28 [2023-11-10 12:25:50,637 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:25:50,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374291947] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:25:50,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:25:50,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 34, 31] total 85 [2023-11-10 12:25:50,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482165530] [2023-11-10 12:25:50,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:25:50,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2023-11-10 12:25:50,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:25:50,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2023-11-10 12:25:50,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=509, Invalid=5974, Unknown=13, NotChecked=644, Total=7140 [2023-11-10 12:25:50,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 118 [2023-11-10 12:25:50,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 579 transitions, 6515 flow. Second operand has 85 states, 85 states have (on average 32.71764705882353) internal successors, (2781), 85 states have internal predecessors, (2781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:50,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:25:50,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 118 [2023-11-10 12:25:50,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:25:57,732 INFO L124 PetriNetUnfolderBase]: 4840/8916 cut-off events. [2023-11-10 12:25:57,732 INFO L125 PetriNetUnfolderBase]: For 81251/81274 co-relation queries the response was YES. [2023-11-10 12:25:57,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48393 conditions, 8916 events. 4840/8916 cut-off events. For 81251/81274 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 69960 event pairs, 946 based on Foata normal form. 17/8905 useless extension candidates. Maximal degree in co-relation 48299. Up to 5216 conditions per place. [2023-11-10 12:25:57,814 INFO L140 encePairwiseOnDemand]: 78/118 looper letters, 700 selfloop transitions, 408 changer transitions 12/1145 dead transitions. [2023-11-10 12:25:57,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 523 places, 1145 transitions, 14353 flow [2023-11-10 12:25:57,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-11-10 12:25:57,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2023-11-10 12:25:57,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 3248 transitions. [2023-11-10 12:25:57,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29918938835666914 [2023-11-10 12:25:57,819 INFO L72 ComplementDD]: Start complementDD. Operand 92 states and 3248 transitions. [2023-11-10 12:25:57,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 3248 transitions. [2023-11-10 12:25:57,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:25:57,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 92 states and 3248 transitions. [2023-11-10 12:25:57,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 93 states, 92 states have (on average 35.30434782608695) internal successors, (3248), 92 states have internal predecessors, (3248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:57,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 93 states, 93 states have (on average 118.0) internal successors, (10974), 93 states have internal predecessors, (10974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:57,831 INFO L81 ComplementDD]: Finished complementDD. Result has 93 states, 93 states have (on average 118.0) internal successors, (10974), 93 states have internal predecessors, (10974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:57,831 INFO L175 Difference]: Start difference. First operand has 434 places, 579 transitions, 6515 flow. Second operand 92 states and 3248 transitions. [2023-11-10 12:25:57,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 523 places, 1145 transitions, 14353 flow [2023-11-10 12:25:58,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 469 places, 1145 transitions, 13517 flow, removed 269 selfloop flow, removed 54 redundant places. [2023-11-10 12:25:58,179 INFO L231 Difference]: Finished difference. Result has 499 places, 833 transitions, 10875 flow [2023-11-10 12:25:58,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=5971, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=197, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=92, PETRI_FLOW=10875, PETRI_PLACES=499, PETRI_TRANSITIONS=833} [2023-11-10 12:25:58,180 INFO L281 CegarLoopForPetriNet]: 105 programPoint places, 394 predicate places. [2023-11-10 12:25:58,180 INFO L495 AbstractCegarLoop]: Abstraction has has 499 places, 833 transitions, 10875 flow [2023-11-10 12:25:58,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 32.71764705882353) internal successors, (2781), 85 states have internal predecessors, (2781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:58,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:25:58,181 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:25:58,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-11-10 12:25:58,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:25:58,386 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:25:58,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:25:58,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1080324807, now seen corresponding path program 16 times [2023-11-10 12:25:58,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:25:58,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835638977] [2023-11-10 12:25:58,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:25:58,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:25:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:25:59,332 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:25:59,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:25:59,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835638977] [2023-11-10 12:25:59,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835638977] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:25:59,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340332469] [2023-11-10 12:25:59,333 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-10 12:25:59,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:25:59,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:25:59,334 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 12:25:59,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-10 12:25:59,417 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-10 12:25:59,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:25:59,419 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-10 12:25:59,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:25:59,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-10 12:25:59,916 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-10 12:26:00,160 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-10 12:26:00,160 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:26:00,537 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_514 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_514) c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 c_~A~0.offset)) (+ c_~counter~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4)))))) is different from false [2023-11-10 12:26:00,553 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:26:00,553 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 73 [2023-11-10 12:26:00,563 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:26:00,563 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 31 [2023-11-10 12:26:00,969 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 1 not checked. [2023-11-10 12:26:00,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340332469] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:26:00,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:26:00,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 23, 21] total 63 [2023-11-10 12:26:00,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484791713] [2023-11-10 12:26:00,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:26:00,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2023-11-10 12:26:00,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:26:00,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2023-11-10 12:26:00,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=3555, Unknown=25, NotChecked=120, Total=3906 [2023-11-10 12:26:00,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 118 [2023-11-10 12:26:00,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 499 places, 833 transitions, 10875 flow. Second operand has 63 states, 63 states have (on average 35.26984126984127) internal successors, (2222), 63 states have internal predecessors, (2222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:26:00,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:26:00,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 118 [2023-11-10 12:26:00,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:26:06,637 INFO L124 PetriNetUnfolderBase]: 5229/9639 cut-off events. [2023-11-10 12:26:06,637 INFO L125 PetriNetUnfolderBase]: For 110481/110504 co-relation queries the response was YES. [2023-11-10 12:26:06,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58882 conditions, 9639 events. 5229/9639 cut-off events. For 110481/110504 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 76515 event pairs, 1113 based on Foata normal form. 19/9618 useless extension candidates. Maximal degree in co-relation 58760. Up to 6497 conditions per place. [2023-11-10 12:26:06,739 INFO L140 encePairwiseOnDemand]: 86/118 looper letters, 747 selfloop transitions, 284 changer transitions 4/1060 dead transitions. [2023-11-10 12:26:06,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 554 places, 1060 transitions, 15252 flow [2023-11-10 12:26:06,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-11-10 12:26:06,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2023-11-10 12:26:06,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 2215 transitions. [2023-11-10 12:26:06,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3128531073446328 [2023-11-10 12:26:06,742 INFO L72 ComplementDD]: Start complementDD. Operand 60 states and 2215 transitions. [2023-11-10 12:26:06,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 2215 transitions. [2023-11-10 12:26:06,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:26:06,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 60 states and 2215 transitions. [2023-11-10 12:26:06,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 61 states, 60 states have (on average 36.916666666666664) internal successors, (2215), 60 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:26:06,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 61 states, 61 states have (on average 118.0) internal successors, (7198), 61 states have internal predecessors, (7198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:26:06,749 INFO L81 ComplementDD]: Finished complementDD. Result has 61 states, 61 states have (on average 118.0) internal successors, (7198), 61 states have internal predecessors, (7198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:26:06,749 INFO L175 Difference]: Start difference. First operand has 499 places, 833 transitions, 10875 flow. Second operand 60 states and 2215 transitions. [2023-11-10 12:26:06,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 554 places, 1060 transitions, 15252 flow [2023-11-10 12:26:07,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 509 places, 1060 transitions, 14155 flow, removed 464 selfloop flow, removed 45 redundant places. [2023-11-10 12:26:07,492 INFO L231 Difference]: Finished difference. Result has 524 places, 893 transitions, 11523 flow [2023-11-10 12:26:07,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=9802, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=833, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=234, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=588, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=11523, PETRI_PLACES=524, PETRI_TRANSITIONS=893} [2023-11-10 12:26:07,493 INFO L281 CegarLoopForPetriNet]: 105 programPoint places, 419 predicate places. [2023-11-10 12:26:07,493 INFO L495 AbstractCegarLoop]: Abstraction has has 524 places, 893 transitions, 11523 flow [2023-11-10 12:26:07,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 35.26984126984127) internal successors, (2222), 63 states have internal predecessors, (2222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:26:07,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:26:07,494 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:26:07,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-11-10 12:26:07,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:26:07,699 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:26:07,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:26:07,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1011265485, now seen corresponding path program 17 times [2023-11-10 12:26:07,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:26:07,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806905347] [2023-11-10 12:26:07,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:26:07,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:26:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:26:09,080 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:26:09,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:26:09,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806905347] [2023-11-10 12:26:09,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806905347] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:26:09,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408904380] [2023-11-10 12:26:09,080 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-10 12:26:09,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:26:09,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:26:09,081 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 12:26:09,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-10 12:26:09,174 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-11-10 12:26:09,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:26:09,176 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-10 12:26:09,178 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:26:09,186 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-10 12:26:09,251 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-10 12:26:09,252 INFO L351 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 11 treesize of output 11 [2023-11-10 12:26:09,668 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-10 12:26:09,761 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-10 12:26:09,761 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:26:10,047 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_544 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_544) c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_#t~post1#1| 4) 4)) c_~counter~0) (+ (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 4)))))) is different from false [2023-11-10 12:26:10,051 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_544 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_544) c_~A~0.base))) (= (+ (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 4))) (+ c_~counter~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4)))))) is different from false [2023-11-10 12:26:10,066 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:26:10,067 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 73 [2023-11-10 12:26:10,077 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:26:10,077 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 31 [2023-11-10 12:26:10,520 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 2 not checked. [2023-11-10 12:26:10,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408904380] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:26:10,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:26:10,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 23, 21] total 61 [2023-11-10 12:26:10,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300507816] [2023-11-10 12:26:10,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:26:10,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2023-11-10 12:26:10,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:26:10,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2023-11-10 12:26:10,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=3238, Unknown=15, NotChecked=230, Total=3660 [2023-11-10 12:26:10,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 118 [2023-11-10 12:26:10,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 524 places, 893 transitions, 11523 flow. Second operand has 61 states, 61 states have (on average 30.39344262295082) internal successors, (1854), 61 states have internal predecessors, (1854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:26:10,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:26:10,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 118 [2023-11-10 12:26:10,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:26:16,750 INFO L124 PetriNetUnfolderBase]: 5744/10540 cut-off events. [2023-11-10 12:26:16,751 INFO L125 PetriNetUnfolderBase]: For 119909/119932 co-relation queries the response was YES. [2023-11-10 12:26:16,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65219 conditions, 10540 events. 5744/10540 cut-off events. For 119909/119932 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 84886 event pairs, 1024 based on Foata normal form. 19/10515 useless extension candidates. Maximal degree in co-relation 65090. Up to 6723 conditions per place. [2023-11-10 12:26:16,863 INFO L140 encePairwiseOnDemand]: 82/118 looper letters, 799 selfloop transitions, 371 changer transitions 4/1196 dead transitions. [2023-11-10 12:26:16,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 1196 transitions, 17242 flow [2023-11-10 12:26:16,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2023-11-10 12:26:16,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2023-11-10 12:26:16,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 2210 transitions. [2023-11-10 12:26:16,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2754237288135593 [2023-11-10 12:26:16,866 INFO L72 ComplementDD]: Start complementDD. Operand 68 states and 2210 transitions. [2023-11-10 12:26:16,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 2210 transitions. [2023-11-10 12:26:16,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:26:16,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 68 states and 2210 transitions. [2023-11-10 12:26:16,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 69 states, 68 states have (on average 32.5) internal successors, (2210), 68 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:26:16,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 69 states, 69 states have (on average 118.0) internal successors, (8142), 69 states have internal predecessors, (8142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:26:16,874 INFO L81 ComplementDD]: Finished complementDD. Result has 69 states, 69 states have (on average 118.0) internal successors, (8142), 69 states have internal predecessors, (8142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:26:16,874 INFO L175 Difference]: Start difference. First operand has 524 places, 893 transitions, 11523 flow. Second operand 68 states and 2210 transitions. [2023-11-10 12:26:16,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 589 places, 1196 transitions, 17242 flow [2023-11-10 12:26:17,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 1196 transitions, 16866 flow, removed 141 selfloop flow, removed 36 redundant places. [2023-11-10 12:26:17,720 INFO L231 Difference]: Finished difference. Result has 568 places, 976 transitions, 13605 flow [2023-11-10 12:26:17,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=11169, PETRI_DIFFERENCE_MINUEND_PLACES=486, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=893, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=302, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=68, PETRI_FLOW=13605, PETRI_PLACES=568, PETRI_TRANSITIONS=976} [2023-11-10 12:26:17,721 INFO L281 CegarLoopForPetriNet]: 105 programPoint places, 463 predicate places. [2023-11-10 12:26:17,721 INFO L495 AbstractCegarLoop]: Abstraction has has 568 places, 976 transitions, 13605 flow [2023-11-10 12:26:17,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 30.39344262295082) internal successors, (1854), 61 states have internal predecessors, (1854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:26:17,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:26:17,722 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:26:17,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-11-10 12:26:17,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:26:17,926 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:26:17,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:26:17,927 INFO L85 PathProgramCache]: Analyzing trace with hash -471008997, now seen corresponding path program 18 times [2023-11-10 12:26:17,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:26:17,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614543729] [2023-11-10 12:26:17,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:26:17,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:26:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:26:18,695 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:26:18,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:26:18,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614543729] [2023-11-10 12:26:18,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614543729] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:26:18,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670518533] [2023-11-10 12:26:18,695 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-10 12:26:18,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:26:18,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:26:18,696 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 12:26:18,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-10 12:26:18,781 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-11-10 12:26:18,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:26:18,783 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-10 12:26:18,796 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:26:19,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-10 12:26:19,231 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-10 12:26:19,417 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-10 12:26:19,417 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:26:19,616 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_573 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_573) c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 c_~A~0.offset)) (+ c_~counter~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))))))) is different from false [2023-11-10 12:26:19,659 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_573 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_573) c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_#t~post1#1| 4) 4)) c_~counter~0) (+ (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 c_~A~0.offset))))) is different from false [2023-11-10 12:26:19,663 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_573 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_573) c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4)) c_~counter~0) (+ (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 c_~A~0.offset))))) is different from false [2023-11-10 12:26:19,679 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:26:19,679 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 73 [2023-11-10 12:26:19,690 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:26:19,690 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 31 [2023-11-10 12:26:20,076 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 5 not checked. [2023-11-10 12:26:20,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670518533] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:26:20,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:26:20,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 23, 21] total 65 [2023-11-10 12:26:20,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065613162] [2023-11-10 12:26:20,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:26:20,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2023-11-10 12:26:20,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:26:20,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2023-11-10 12:26:20,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=3573, Unknown=3, NotChecked=366, Total=4160 [2023-11-10 12:26:20,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 118 [2023-11-10 12:26:20,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 976 transitions, 13605 flow. Second operand has 65 states, 65 states have (on average 31.246153846153845) internal successors, (2031), 65 states have internal predecessors, (2031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:26:20,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:26:20,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 118 [2023-11-10 12:26:20,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:26:26,635 INFO L124 PetriNetUnfolderBase]: 6402/11853 cut-off events. [2023-11-10 12:26:26,636 INFO L125 PetriNetUnfolderBase]: For 158740/158763 co-relation queries the response was YES. [2023-11-10 12:26:26,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76480 conditions, 11853 events. 6402/11853 cut-off events. For 158740/158763 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 98328 event pairs, 1373 based on Foata normal form. 19/11829 useless extension candidates. Maximal degree in co-relation 76337. Up to 7648 conditions per place. [2023-11-10 12:26:26,801 INFO L140 encePairwiseOnDemand]: 86/118 looper letters, 944 selfloop transitions, 354 changer transitions 4/1324 dead transitions. [2023-11-10 12:26:26,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 634 places, 1324 transitions, 20421 flow [2023-11-10 12:26:26,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2023-11-10 12:26:26,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2023-11-10 12:26:26,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 2345 transitions. [2023-11-10 12:26:26,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28801277327437974 [2023-11-10 12:26:26,803 INFO L72 ComplementDD]: Start complementDD. Operand 69 states and 2345 transitions. [2023-11-10 12:26:26,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 2345 transitions. [2023-11-10 12:26:26,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:26:26,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 69 states and 2345 transitions. [2023-11-10 12:26:26,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 70 states, 69 states have (on average 33.98550724637681) internal successors, (2345), 69 states have internal predecessors, (2345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:26:26,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 70 states, 70 states have (on average 118.0) internal successors, (8260), 70 states have internal predecessors, (8260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:26:26,811 INFO L81 ComplementDD]: Finished complementDD. Result has 70 states, 70 states have (on average 118.0) internal successors, (8260), 70 states have internal predecessors, (8260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:26:26,811 INFO L175 Difference]: Start difference. First operand has 568 places, 976 transitions, 13605 flow. Second operand 69 states and 2345 transitions. [2023-11-10 12:26:26,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 634 places, 1324 transitions, 20421 flow [2023-11-10 12:26:28,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 595 places, 1324 transitions, 19204 flow, removed 475 selfloop flow, removed 39 redundant places. [2023-11-10 12:26:28,043 INFO L231 Difference]: Finished difference. Result has 603 places, 1051 transitions, 14845 flow [2023-11-10 12:26:28,044 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=12733, PETRI_DIFFERENCE_MINUEND_PLACES=527, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=976, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=295, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=675, PETRI_DIFFERENCE_SUBTRAHEND_STATES=69, PETRI_FLOW=14845, PETRI_PLACES=603, PETRI_TRANSITIONS=1051} [2023-11-10 12:26:28,045 INFO L281 CegarLoopForPetriNet]: 105 programPoint places, 498 predicate places. [2023-11-10 12:26:28,045 INFO L495 AbstractCegarLoop]: Abstraction has has 603 places, 1051 transitions, 14845 flow [2023-11-10 12:26:28,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 31.246153846153845) internal successors, (2031), 65 states have internal predecessors, (2031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:26:28,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:26:28,045 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:26:28,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-11-10 12:26:28,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-11-10 12:26:28,250 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:26:28,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:26:28,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1832893349, now seen corresponding path program 19 times [2023-11-10 12:26:28,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:26:28,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83773698] [2023-11-10 12:26:28,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:26:28,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:26:28,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:26:29,185 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:26:29,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:26:29,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83773698] [2023-11-10 12:26:29,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83773698] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:26:29,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025852027] [2023-11-10 12:26:29,186 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-10 12:26:29,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:26:29,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:26:29,187 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 12:26:29,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-11-10 12:26:29,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:26:29,273 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 71 conjunts are in the unsatisfiable core [2023-11-10 12:26:29,288 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:26:29,294 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-10 12:26:29,322 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-10 12:26:29,323 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2023-11-10 12:26:29,432 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-10 12:26:29,433 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-11-10 12:26:29,645 INFO L351 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-10 12:26:29,803 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-10 12:26:29,956 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-10 12:26:30,071 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:26:30,072 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:26:30,243 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_606 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_606) c_~A~0.base))) (= (+ (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 4))) (+ c_~counter~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))))))) is different from false [2023-11-10 12:26:30,390 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_606 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_606) c_~A~0.base))) (= (+ (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 4))) (let ((.cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse1)) c_~counter~0 (select .cse0 (+ c_~A~0.offset .cse1 4))))))) is different from false [2023-11-10 12:26:30,403 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_606 (Array Int Int))) (= (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~counter~0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_606) c_~A~0.base) c_~A~0.offset))) is different from false [2023-11-10 12:26:30,560 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_605))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_606) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~counter~0)))) is different from false [2023-11-10 12:26:30,564 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_605))) (= (+ (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_~counter~0) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_606) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) is different from false [2023-11-10 12:26:30,590 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:26:30,590 INFO L351 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 46 treesize of output 35 [2023-11-10 12:26:30,592 INFO L351 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 286 treesize of output 254 [2023-11-10 12:26:30,595 INFO L351 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 13 treesize of output 11 [2023-11-10 12:26:30,597 INFO L351 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 24 treesize of output 20 [2023-11-10 12:26:30,833 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 9 not checked. [2023-11-10 12:26:30,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025852027] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:26:30,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:26:30,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 26, 24] total 68 [2023-11-10 12:26:30,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969474238] [2023-11-10 12:26:30,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:26:30,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2023-11-10 12:26:30,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:26:30,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2023-11-10 12:26:30,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=3551, Unknown=84, NotChecked=630, Total=4556 [2023-11-10 12:26:30,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 118 [2023-11-10 12:26:30,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 603 places, 1051 transitions, 14845 flow. Second operand has 68 states, 68 states have (on average 30.08823529411765) internal successors, (2046), 68 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:26:30,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:26:30,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 118 [2023-11-10 12:26:30,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:26:37,951 INFO L124 PetriNetUnfolderBase]: 6655/12278 cut-off events. [2023-11-10 12:26:37,951 INFO L125 PetriNetUnfolderBase]: For 162182/162205 co-relation queries the response was YES. [2023-11-10 12:26:38,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79296 conditions, 12278 events. 6655/12278 cut-off events. For 162182/162205 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 102259 event pairs, 1647 based on Foata normal form. 19/12248 useless extension candidates. Maximal degree in co-relation 79147. Up to 8526 conditions per place. [2023-11-10 12:26:38,114 INFO L140 encePairwiseOnDemand]: 85/118 looper letters, 911 selfloop transitions, 337 changer transitions 4/1274 dead transitions. [2023-11-10 12:26:38,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 671 places, 1274 transitions, 19712 flow [2023-11-10 12:26:38,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2023-11-10 12:26:38,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2023-11-10 12:26:38,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 2275 transitions. [2023-11-10 12:26:38,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.271544521365481 [2023-11-10 12:26:38,117 INFO L72 ComplementDD]: Start complementDD. Operand 71 states and 2275 transitions. [2023-11-10 12:26:38,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 2275 transitions. [2023-11-10 12:26:38,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:26:38,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 71 states and 2275 transitions. [2023-11-10 12:26:38,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 72 states, 71 states have (on average 32.04225352112676) internal successors, (2275), 71 states have internal predecessors, (2275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:26:38,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 72 states, 72 states have (on average 118.0) internal successors, (8496), 72 states have internal predecessors, (8496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:26:38,124 INFO L81 ComplementDD]: Finished complementDD. Result has 72 states, 72 states have (on average 118.0) internal successors, (8496), 72 states have internal predecessors, (8496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:26:38,124 INFO L175 Difference]: Start difference. First operand has 603 places, 1051 transitions, 14845 flow. Second operand 71 states and 2275 transitions. [2023-11-10 12:26:38,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 671 places, 1274 transitions, 19712 flow [2023-11-10 12:26:39,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 616 places, 1274 transitions, 18915 flow, removed 149 selfloop flow, removed 55 redundant places. [2023-11-10 12:26:39,455 INFO L231 Difference]: Finished difference. Result has 621 places, 1069 transitions, 15252 flow [2023-11-10 12:26:39,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=14082, PETRI_DIFFERENCE_MINUEND_PLACES=546, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1051, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=323, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=724, PETRI_DIFFERENCE_SUBTRAHEND_STATES=71, PETRI_FLOW=15252, PETRI_PLACES=621, PETRI_TRANSITIONS=1069} [2023-11-10 12:26:39,456 INFO L281 CegarLoopForPetriNet]: 105 programPoint places, 516 predicate places. [2023-11-10 12:26:39,456 INFO L495 AbstractCegarLoop]: Abstraction has has 621 places, 1069 transitions, 15252 flow [2023-11-10 12:26:39,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 30.08823529411765) internal successors, (2046), 68 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:26:39,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:26:39,457 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:26:39,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-11-10 12:26:39,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-11-10 12:26:39,657 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:26:39,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:26:39,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1991443877, now seen corresponding path program 20 times [2023-11-10 12:26:39,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:26:39,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426779607] [2023-11-10 12:26:39,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:26:39,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:26:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:26:41,039 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:26:41,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:26:41,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426779607] [2023-11-10 12:26:41,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426779607] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:26:41,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040712986] [2023-11-10 12:26:41,040 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-10 12:26:41,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:26:41,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:26:41,041 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 12:26:41,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-11-10 12:26:41,127 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-10 12:26:41,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:26:41,129 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-10 12:26:41,131 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:26:41,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-10 12:26:41,579 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-10 12:26:41,822 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-10 12:26:41,822 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:26:42,047 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_635 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_635) c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~counter~0) (+ (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 4)))))) is different from false [2023-11-10 12:26:42,198 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:26:42,199 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 73 [2023-11-10 12:26:42,210 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:26:42,210 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 31 [2023-11-10 12:26:42,598 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-10 12:26:42,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040712986] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:26:42,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:26:42,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 21, 21] total 63 [2023-11-10 12:26:42,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847240323] [2023-11-10 12:26:42,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:26:42,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2023-11-10 12:26:42,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:26:42,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2023-11-10 12:26:42,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=3574, Unknown=13, NotChecked=120, Total=3906 [2023-11-10 12:26:42,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 118 [2023-11-10 12:26:42,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 621 places, 1069 transitions, 15252 flow. Second operand has 63 states, 63 states have (on average 33.19047619047619) internal successors, (2091), 63 states have internal predecessors, (2091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:26:42,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:26:42,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 118 [2023-11-10 12:26:42,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:26:50,161 INFO L124 PetriNetUnfolderBase]: 7299/13519 cut-off events. [2023-11-10 12:26:50,162 INFO L125 PetriNetUnfolderBase]: For 188742/188765 co-relation queries the response was YES. [2023-11-10 12:26:50,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88021 conditions, 13519 events. 7299/13519 cut-off events. For 188742/188765 co-relation queries the response was YES. Maximal size of possible extension queue 685. Compared 115191 event pairs, 1824 based on Foata normal form. 20/13485 useless extension candidates. Maximal degree in co-relation 87868. Up to 9265 conditions per place. [2023-11-10 12:26:50,332 INFO L140 encePairwiseOnDemand]: 83/118 looper letters, 973 selfloop transitions, 383 changer transitions 8/1389 dead transitions. [2023-11-10 12:26:50,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 692 places, 1389 transitions, 21758 flow [2023-11-10 12:26:50,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2023-11-10 12:26:50,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2023-11-10 12:26:50,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 2609 transitions. [2023-11-10 12:26:50,334 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.298786074209803 [2023-11-10 12:26:50,334 INFO L72 ComplementDD]: Start complementDD. Operand 74 states and 2609 transitions. [2023-11-10 12:26:50,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 2609 transitions. [2023-11-10 12:26:50,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:26:50,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 74 states and 2609 transitions. [2023-11-10 12:26:50,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 75 states, 74 states have (on average 35.25675675675676) internal successors, (2609), 74 states have internal predecessors, (2609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:26:50,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 75 states, 75 states have (on average 118.0) internal successors, (8850), 75 states have internal predecessors, (8850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:26:50,342 INFO L81 ComplementDD]: Finished complementDD. Result has 75 states, 75 states have (on average 118.0) internal successors, (8850), 75 states have internal predecessors, (8850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:26:50,343 INFO L175 Difference]: Start difference. First operand has 621 places, 1069 transitions, 15252 flow. Second operand 74 states and 2609 transitions. [2023-11-10 12:26:50,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 692 places, 1389 transitions, 21758 flow [2023-11-10 12:26:51,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 633 places, 1389 transitions, 21124 flow, removed 107 selfloop flow, removed 59 redundant places. [2023-11-10 12:26:51,796 INFO L231 Difference]: Finished difference. Result has 646 places, 1141 transitions, 17102 flow [2023-11-10 12:26:51,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=14650, PETRI_DIFFERENCE_MINUEND_PLACES=560, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1069, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=323, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=738, PETRI_DIFFERENCE_SUBTRAHEND_STATES=74, PETRI_FLOW=17102, PETRI_PLACES=646, PETRI_TRANSITIONS=1141} [2023-11-10 12:26:51,797 INFO L281 CegarLoopForPetriNet]: 105 programPoint places, 541 predicate places. [2023-11-10 12:26:51,797 INFO L495 AbstractCegarLoop]: Abstraction has has 646 places, 1141 transitions, 17102 flow [2023-11-10 12:26:51,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 33.19047619047619) internal successors, (2091), 63 states have internal predecessors, (2091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:26:51,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:26:51,798 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:26:51,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-11-10 12:26:51,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:26:51,998 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:26:51,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:26:51,999 INFO L85 PathProgramCache]: Analyzing trace with hash -948951447, now seen corresponding path program 21 times [2023-11-10 12:26:51,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:26:51,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025768360] [2023-11-10 12:26:51,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:26:51,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:26:52,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:26:52,705 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:26:52,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:26:52,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025768360] [2023-11-10 12:26:52,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025768360] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:26:52,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276693958] [2023-11-10 12:26:52,705 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-10 12:26:52,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:26:52,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:26:52,706 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 12:26:52,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-11-10 12:26:52,800 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-10 12:26:52,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:26:52,801 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-10 12:26:52,803 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:26:53,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-10 12:26:53,347 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-10 12:26:53,572 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:26:53,573 INFO L351 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 15 treesize of output 14 [2023-11-10 12:26:53,740 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-10 12:26:53,740 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:26:54,479 INFO L322 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-11-10 12:26:54,480 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 77 [2023-11-10 12:26:54,496 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:26:54,497 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 41 [2023-11-10 12:26:54,934 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 13 refuted. 1 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-10 12:26:54,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276693958] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:26:54,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:26:54,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 27, 25] total 72 [2023-11-10 12:26:54,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240027906] [2023-11-10 12:26:54,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:26:54,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2023-11-10 12:26:54,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:26:54,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2023-11-10 12:26:54,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=4714, Unknown=7, NotChecked=0, Total=5112 [2023-11-10 12:26:54,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 118 [2023-11-10 12:26:54,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 646 places, 1141 transitions, 17102 flow. Second operand has 72 states, 72 states have (on average 31.180555555555557) internal successors, (2245), 72 states have internal predecessors, (2245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:26:54,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:26:54,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 118 [2023-11-10 12:26:54,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:26:59,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:27:05,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:27:08,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:27:11,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:27:13,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:27:15,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:27:21,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:27:25,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:27:28,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:27:30,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:27:34,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:27:41,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:27:43,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:27:45,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:27:53,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:27:55,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:28:02,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:28:07,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:28:09,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:28:11,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:28:17,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:28:19,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:28:21,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:28:23,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:28:30,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:28:37,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:28:39,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:28:41,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:28:51,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:28:55,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:28:57,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:29:00,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:29:02,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:29:04,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:29:18,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:29:24,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:29:32,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:29:41,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:29:43,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:29:45,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:29:47,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:29:49,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:29:54,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:29:56,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:29:57,900 INFO L124 PetriNetUnfolderBase]: 9447/17292 cut-off events. [2023-11-10 12:29:57,900 INFO L125 PetriNetUnfolderBase]: For 291736/291759 co-relation queries the response was YES. [2023-11-10 12:29:58,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119606 conditions, 17292 events. 9447/17292 cut-off events. For 291736/291759 co-relation queries the response was YES. Maximal size of possible extension queue 918. Compared 152444 event pairs, 1100 based on Foata normal form. 19/17281 useless extension candidates. Maximal degree in co-relation 119440. Up to 7533 conditions per place. [2023-11-10 12:29:58,188 INFO L140 encePairwiseOnDemand]: 79/118 looper letters, 1134 selfloop transitions, 1370 changer transitions 16/2542 dead transitions. [2023-11-10 12:29:58,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 853 places, 2542 transitions, 41819 flow [2023-11-10 12:29:58,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2023-11-10 12:29:58,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2023-11-10 12:29:58,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 6970 transitions. [2023-11-10 12:29:58,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.278621682123441 [2023-11-10 12:29:58,194 INFO L72 ComplementDD]: Start complementDD. Operand 212 states and 6970 transitions. [2023-11-10 12:29:58,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 212 states and 6970 transitions. [2023-11-10 12:29:58,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:29:58,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 212 states and 6970 transitions. [2023-11-10 12:29:58,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 213 states, 212 states have (on average 32.87735849056604) internal successors, (6970), 212 states have internal predecessors, (6970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:29:58,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 213 states, 213 states have (on average 118.0) internal successors, (25134), 213 states have internal predecessors, (25134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:29:58,220 INFO L81 ComplementDD]: Finished complementDD. Result has 213 states, 213 states have (on average 118.0) internal successors, (25134), 213 states have internal predecessors, (25134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:29:58,220 INFO L175 Difference]: Start difference. First operand has 646 places, 1141 transitions, 17102 flow. Second operand 212 states and 6970 transitions. [2023-11-10 12:29:58,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 853 places, 2542 transitions, 41819 flow [2023-11-10 12:30:00,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 790 places, 2542 transitions, 39923 flow, removed 609 selfloop flow, removed 63 redundant places. [2023-11-10 12:30:00,622 INFO L231 Difference]: Finished difference. Result has 870 places, 1986 transitions, 35684 flow [2023-11-10 12:30:00,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=15966, PETRI_DIFFERENCE_MINUEND_PLACES=579, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=625, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=460, PETRI_DIFFERENCE_SUBTRAHEND_STATES=212, PETRI_FLOW=35684, PETRI_PLACES=870, PETRI_TRANSITIONS=1986} [2023-11-10 12:30:00,624 INFO L281 CegarLoopForPetriNet]: 105 programPoint places, 765 predicate places. [2023-11-10 12:30:00,624 INFO L495 AbstractCegarLoop]: Abstraction has has 870 places, 1986 transitions, 35684 flow [2023-11-10 12:30:00,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 31.180555555555557) internal successors, (2245), 72 states have internal predecessors, (2245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:30:00,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:30:00,625 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:30:00,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-11-10 12:30:00,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:30:00,832 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:30:00,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:30:00,832 INFO L85 PathProgramCache]: Analyzing trace with hash 946802051, now seen corresponding path program 22 times [2023-11-10 12:30:00,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:30:00,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218497257] [2023-11-10 12:30:00,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:30:00,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:30:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:30:02,153 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:30:02,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:30:02,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218497257] [2023-11-10 12:30:02,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218497257] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:30:02,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706036767] [2023-11-10 12:30:02,153 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-10 12:30:02,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:30:02,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:30:02,156 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 12:30:02,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-11-10 12:30:02,296 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-10 12:30:02,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:30:02,298 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-10 12:30:02,300 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:30:02,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-10 12:30:02,904 INFO L351 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 22 treesize of output 15 [2023-11-10 12:30:02,998 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-10 12:30:02,999 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:30:03,191 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_693 (Array Int Int))) (= c_~counter~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_693) c_~A~0.base))) (+ (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 4)))))) is different from false [2023-11-10 12:30:03,203 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_693 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_693) c_~A~0.base))) (+ (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~counter~0))) is different from false [2023-11-10 12:30:03,211 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_693 (Array Int Int))) (= (+ c_~counter~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_#t~post1#1| 4) 4))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_693) c_~A~0.base))) (+ (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 4)))))) is different from false [2023-11-10 12:30:03,305 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:30:03,305 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 66 [2023-11-10 12:30:03,311 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:30:03,312 INFO L351 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 18 treesize of output 12 [2023-11-10 12:30:03,737 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 5 not checked. [2023-11-10 12:30:03,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706036767] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:30:03,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:30:03,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 21, 21] total 61 [2023-11-10 12:30:03,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196181007] [2023-11-10 12:30:03,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:30:03,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2023-11-10 12:30:03,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:30:03,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2023-11-10 12:30:03,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=3112, Unknown=9, NotChecked=342, Total=3660 [2023-11-10 12:30:03,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 118 [2023-11-10 12:30:03,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 870 places, 1986 transitions, 35684 flow. Second operand has 61 states, 61 states have (on average 30.34426229508197) internal successors, (1851), 61 states have internal predecessors, (1851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:30:03,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:30:03,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 118 [2023-11-10 12:30:03,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:30:16,730 INFO L124 PetriNetUnfolderBase]: 9747/17910 cut-off events. [2023-11-10 12:30:16,731 INFO L125 PetriNetUnfolderBase]: For 465933/465949 co-relation queries the response was YES. [2023-11-10 12:30:16,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149623 conditions, 17910 events. 9747/17910 cut-off events. For 465933/465949 co-relation queries the response was YES. Maximal size of possible extension queue 946. Compared 159202 event pairs, 1941 based on Foata normal form. 13/17864 useless extension candidates. Maximal degree in co-relation 149384. Up to 12291 conditions per place. [2023-11-10 12:30:17,061 INFO L140 encePairwiseOnDemand]: 83/118 looper letters, 1593 selfloop transitions, 622 changer transitions 4/2241 dead transitions. [2023-11-10 12:30:17,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 929 places, 2241 transitions, 44189 flow [2023-11-10 12:30:17,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-11-10 12:30:17,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2023-11-10 12:30:17,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 2056 transitions. [2023-11-10 12:30:17,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27656712402475114 [2023-11-10 12:30:17,064 INFO L72 ComplementDD]: Start complementDD. Operand 63 states and 2056 transitions. [2023-11-10 12:30:17,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 2056 transitions. [2023-11-10 12:30:17,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:30:17,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 63 states and 2056 transitions. [2023-11-10 12:30:17,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 64 states, 63 states have (on average 32.63492063492063) internal successors, (2056), 63 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:30:17,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 64 states, 64 states have (on average 118.0) internal successors, (7552), 64 states have internal predecessors, (7552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:30:17,070 INFO L81 ComplementDD]: Finished complementDD. Result has 64 states, 64 states have (on average 118.0) internal successors, (7552), 64 states have internal predecessors, (7552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:30:17,070 INFO L175 Difference]: Start difference. First operand has 870 places, 1986 transitions, 35684 flow. Second operand 63 states and 2056 transitions. [2023-11-10 12:30:17,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 929 places, 2241 transitions, 44189 flow [2023-11-10 12:30:23,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 890 places, 2241 transitions, 37705 flow, removed 3144 selfloop flow, removed 39 redundant places. [2023-11-10 12:30:23,567 INFO L231 Difference]: Finished difference. Result has 901 places, 2041 transitions, 32591 flow [2023-11-10 12:30:23,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=29616, PETRI_DIFFERENCE_MINUEND_PLACES=828, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1986, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=576, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=32591, PETRI_PLACES=901, PETRI_TRANSITIONS=2041} [2023-11-10 12:30:23,569 INFO L281 CegarLoopForPetriNet]: 105 programPoint places, 796 predicate places. [2023-11-10 12:30:23,570 INFO L495 AbstractCegarLoop]: Abstraction has has 901 places, 2041 transitions, 32591 flow [2023-11-10 12:30:23,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 30.34426229508197) internal successors, (1851), 61 states have internal predecessors, (1851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:30:23,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:30:23,570 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:30:23,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-11-10 12:30:23,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-11-10 12:30:23,771 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:30:23,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:30:23,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1093921903, now seen corresponding path program 23 times [2023-11-10 12:30:23,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:30:23,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476864112] [2023-11-10 12:30:23,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:30:23,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:30:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:30:24,634 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:30:24,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:30:24,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476864112] [2023-11-10 12:30:24,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476864112] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:30:24,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132262857] [2023-11-10 12:30:24,634 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-10 12:30:24,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:30:24,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:30:24,635 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 12:30:24,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-11-10 12:30:24,728 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-11-10 12:30:24,728 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:30:24,729 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-10 12:30:24,731 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:30:25,094 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-10 12:30:25,094 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:30:25,337 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:30:25,337 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 43 [2023-11-10 12:30:25,451 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-10 12:30:25,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132262857] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:30:25,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:30:25,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21, 14] total 43 [2023-11-10 12:30:25,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200807759] [2023-11-10 12:30:25,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:30:25,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-11-10 12:30:25,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:30:25,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-11-10 12:30:25,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1665, Unknown=0, NotChecked=0, Total=1806 [2023-11-10 12:30:25,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 118 [2023-11-10 12:30:25,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 901 places, 2041 transitions, 32591 flow. Second operand has 43 states, 43 states have (on average 39.06976744186046) internal successors, (1680), 43 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:30:25,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:30:25,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 118 [2023-11-10 12:30:25,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:30:37,059 INFO L124 PetriNetUnfolderBase]: 10251/18847 cut-off events. [2023-11-10 12:30:37,060 INFO L125 PetriNetUnfolderBase]: For 405461/405484 co-relation queries the response was YES. [2023-11-10 12:30:37,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147041 conditions, 18847 events. 10251/18847 cut-off events. For 405461/405484 co-relation queries the response was YES. Maximal size of possible extension queue 996. Compared 169571 event pairs, 2336 based on Foata normal form. 19/18763 useless extension candidates. Maximal degree in co-relation 146793. Up to 15731 conditions per place. [2023-11-10 12:30:37,495 INFO L140 encePairwiseOnDemand]: 89/118 looper letters, 2016 selfloop transitions, 260 changer transitions 4/2311 dead transitions. [2023-11-10 12:30:37,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 937 places, 2311 transitions, 41655 flow [2023-11-10 12:30:37,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-10 12:30:37,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2023-11-10 12:30:37,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 1602 transitions. [2023-11-10 12:30:37,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34810951760104303 [2023-11-10 12:30:37,497 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 1602 transitions. [2023-11-10 12:30:37,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 1602 transitions. [2023-11-10 12:30:37,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:30:37,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 1602 transitions. [2023-11-10 12:30:37,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 41.07692307692308) internal successors, (1602), 39 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:30:37,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 118.0) internal successors, (4720), 40 states have internal predecessors, (4720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:30:37,501 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 118.0) internal successors, (4720), 40 states have internal predecessors, (4720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:30:37,502 INFO L175 Difference]: Start difference. First operand has 901 places, 2041 transitions, 32591 flow. Second operand 39 states and 1602 transitions. [2023-11-10 12:30:37,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 937 places, 2311 transitions, 41655 flow [2023-11-10 12:30:42,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 886 places, 2311 transitions, 40451 flow, removed 303 selfloop flow, removed 51 redundant places. [2023-11-10 12:30:42,476 INFO L231 Difference]: Finished difference. Result has 895 places, 2126 transitions, 34385 flow [2023-11-10 12:30:42,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=31480, PETRI_DIFFERENCE_MINUEND_PLACES=848, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2041, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=178, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1807, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=34385, PETRI_PLACES=895, PETRI_TRANSITIONS=2126} [2023-11-10 12:30:42,478 INFO L281 CegarLoopForPetriNet]: 105 programPoint places, 790 predicate places. [2023-11-10 12:30:42,478 INFO L495 AbstractCegarLoop]: Abstraction has has 895 places, 2126 transitions, 34385 flow [2023-11-10 12:30:42,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 39.06976744186046) internal successors, (1680), 43 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:30:42,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:30:42,478 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:30:42,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-11-10 12:30:42,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-11-10 12:30:42,686 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:30:42,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:30:42,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1411386229, now seen corresponding path program 24 times [2023-11-10 12:30:42,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:30:42,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425713185] [2023-11-10 12:30:42,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:30:42,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:30:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:30:43,920 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:30:43,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:30:43,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425713185] [2023-11-10 12:30:43,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425713185] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:30:43,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621783920] [2023-11-10 12:30:43,920 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-10 12:30:43,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:30:43,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:30:43,921 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 12:30:43,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-11-10 12:30:44,017 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-11-10 12:30:44,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:30:44,019 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 70 conjunts are in the unsatisfiable core [2023-11-10 12:30:44,022 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:30:44,530 INFO L351 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 19 treesize of output 1 [2023-11-10 12:30:44,861 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-10 12:30:44,923 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-10 12:30:45,351 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:30:45,351 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 14 [2023-11-10 12:30:45,504 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:30:45,504 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:30:46,099 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_752 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_752) c_~A~0.base))) (= (select .cse0 (+ c_~A~0.offset (* c_~N~0 4) (- 4))) (+ (select .cse0 (+ c_~A~0.offset 4)) c_~counter~0)))) is different from false [2023-11-10 12:30:46,114 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_751 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_751) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_752) c_~A~0.base))) (= (select .cse0 (+ c_~A~0.offset (* c_~N~0 4) (- 4))) (+ c_~counter~0 (select .cse0 (+ c_~A~0.offset 4)))))) is different from false [2023-11-10 12:30:46,279 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_751 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_751) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_752) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (= (select .cse0 (+ (* c_~N~0 4) (- 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (+ c_~counter~0 (select .cse0 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)))))) is different from false [2023-11-10 12:30:46,639 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:30:46,639 INFO L351 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 56 treesize of output 45 [2023-11-10 12:30:46,647 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:30:46,648 INFO L351 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 98 treesize of output 91 [2023-11-10 12:30:46,656 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:30:46,657 INFO L351 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 83 treesize of output 69 [2023-11-10 12:30:46,665 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:30:46,665 INFO L351 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 35 treesize of output 33 [2023-11-10 12:30:47,149 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:30:47,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621783920] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:30:47,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:30:47,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 34, 31] total 86 [2023-11-10 12:30:47,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483970889] [2023-11-10 12:30:47,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:30:47,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2023-11-10 12:30:47,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:30:47,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2023-11-10 12:30:47,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=6333, Unknown=40, NotChecked=492, Total=7310 [2023-11-10 12:30:47,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 118 [2023-11-10 12:30:47,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 895 places, 2126 transitions, 34385 flow. Second operand has 86 states, 86 states have (on average 32.68604651162791) internal successors, (2811), 86 states have internal predecessors, (2811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:30:47,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:30:47,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 118 [2023-11-10 12:30:47,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:31:07,597 INFO L124 PetriNetUnfolderBase]: 12095/22321 cut-off events. [2023-11-10 12:31:07,597 INFO L125 PetriNetUnfolderBase]: For 500317/500340 co-relation queries the response was YES. [2023-11-10 12:31:08,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176750 conditions, 22321 events. 12095/22321 cut-off events. For 500317/500340 co-relation queries the response was YES. Maximal size of possible extension queue 1174. Compared 206793 event pairs, 2399 based on Foata normal form. 17/22251 useless extension candidates. Maximal degree in co-relation 176495. Up to 14048 conditions per place. [2023-11-10 12:31:08,167 INFO L140 encePairwiseOnDemand]: 77/118 looper letters, 1953 selfloop transitions, 1056 changer transitions 24/3058 dead transitions. [2023-11-10 12:31:08,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1000 places, 3058 transitions, 55554 flow [2023-11-10 12:31:08,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2023-11-10 12:31:08,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2023-11-10 12:31:08,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 3852 transitions. [2023-11-10 12:31:08,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3022598870056497 [2023-11-10 12:31:08,171 INFO L72 ComplementDD]: Start complementDD. Operand 108 states and 3852 transitions. [2023-11-10 12:31:08,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 3852 transitions. [2023-11-10 12:31:08,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:31:08,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 108 states and 3852 transitions. [2023-11-10 12:31:08,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 109 states, 108 states have (on average 35.666666666666664) internal successors, (3852), 108 states have internal predecessors, (3852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:31:08,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 109 states, 109 states have (on average 118.0) internal successors, (12862), 109 states have internal predecessors, (12862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:31:08,182 INFO L81 ComplementDD]: Finished complementDD. Result has 109 states, 109 states have (on average 118.0) internal successors, (12862), 109 states have internal predecessors, (12862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:31:08,182 INFO L175 Difference]: Start difference. First operand has 895 places, 2126 transitions, 34385 flow. Second operand 108 states and 3852 transitions. [2023-11-10 12:31:08,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1000 places, 3058 transitions, 55554 flow [2023-11-10 12:31:14,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 976 places, 3058 transitions, 54765 flow, removed 301 selfloop flow, removed 24 redundant places. [2023-11-10 12:31:14,967 INFO L231 Difference]: Finished difference. Result has 1022 places, 2532 transitions, 46920 flow [2023-11-10 12:31:14,969 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=33928, PETRI_DIFFERENCE_MINUEND_PLACES=869, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=715, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=108, PETRI_FLOW=46920, PETRI_PLACES=1022, PETRI_TRANSITIONS=2532} [2023-11-10 12:31:14,970 INFO L281 CegarLoopForPetriNet]: 105 programPoint places, 917 predicate places. [2023-11-10 12:31:14,970 INFO L495 AbstractCegarLoop]: Abstraction has has 1022 places, 2532 transitions, 46920 flow [2023-11-10 12:31:14,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 86 states have (on average 32.68604651162791) internal successors, (2811), 86 states have internal predecessors, (2811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:31:14,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:31:14,971 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:31:14,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-11-10 12:31:15,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-11-10 12:31:15,172 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:31:15,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:31:15,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1319847327, now seen corresponding path program 25 times [2023-11-10 12:31:15,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:31:15,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882793472] [2023-11-10 12:31:15,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:31:15,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:31:15,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:31:15,968 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:31:15,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:31:15,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882793472] [2023-11-10 12:31:15,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882793472] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:31:15,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458524040] [2023-11-10 12:31:15,969 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-10 12:31:15,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:31:15,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:31:15,970 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 12:31:15,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-11-10 12:31:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:31:16,065 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-10 12:31:16,066 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:31:16,420 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-10 12:31:16,421 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:31:16,680 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:31:16,680 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 43 [2023-11-10 12:31:16,758 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-10 12:31:16,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458524040] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:31:16,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:31:16,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 16, 14] total 48 [2023-11-10 12:31:16,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411064555] [2023-11-10 12:31:16,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:31:16,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-11-10 12:31:16,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:31:16,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-11-10 12:31:16,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=2102, Unknown=0, NotChecked=0, Total=2256 [2023-11-10 12:31:16,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 118 [2023-11-10 12:31:16,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1022 places, 2532 transitions, 46920 flow. Second operand has 48 states, 48 states have (on average 40.291666666666664) internal successors, (1934), 48 states have internal predecessors, (1934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:31:16,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:31:16,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 118 [2023-11-10 12:31:16,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:31:34,764 INFO L124 PetriNetUnfolderBase]: 12531/23153 cut-off events. [2023-11-10 12:31:34,764 INFO L125 PetriNetUnfolderBase]: For 627420/627443 co-relation queries the response was YES. [2023-11-10 12:31:35,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198361 conditions, 23153 events. 12531/23153 cut-off events. For 627420/627443 co-relation queries the response was YES. Maximal size of possible extension queue 1229. Compared 215607 event pairs, 2949 based on Foata normal form. 19/23045 useless extension candidates. Maximal degree in co-relation 198061. Up to 18909 conditions per place. [2023-11-10 12:31:35,449 INFO L140 encePairwiseOnDemand]: 86/118 looper letters, 2424 selfloop transitions, 374 changer transitions 4/2830 dead transitions. [2023-11-10 12:31:35,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1092 places, 2830 transitions, 57258 flow [2023-11-10 12:31:35,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2023-11-10 12:31:35,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2023-11-10 12:31:35,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 3187 transitions. [2023-11-10 12:31:35,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35537466547725244 [2023-11-10 12:31:35,453 INFO L72 ComplementDD]: Start complementDD. Operand 76 states and 3187 transitions. [2023-11-10 12:31:35,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 3187 transitions. [2023-11-10 12:31:35,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:31:35,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 76 states and 3187 transitions. [2023-11-10 12:31:35,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 77 states, 76 states have (on average 41.93421052631579) internal successors, (3187), 76 states have internal predecessors, (3187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:31:35,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 77 states, 77 states have (on average 118.0) internal successors, (9086), 77 states have internal predecessors, (9086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:31:35,472 INFO L81 ComplementDD]: Finished complementDD. Result has 77 states, 77 states have (on average 118.0) internal successors, (9086), 77 states have internal predecessors, (9086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:31:35,472 INFO L175 Difference]: Start difference. First operand has 1022 places, 2532 transitions, 46920 flow. Second operand 76 states and 3187 transitions. [2023-11-10 12:31:35,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1092 places, 2830 transitions, 57258 flow [2023-11-10 12:31:45,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1049 places, 2830 transitions, 54588 flow, removed 1251 selfloop flow, removed 43 redundant places. [2023-11-10 12:31:45,637 INFO L231 Difference]: Finished difference. Result has 1066 places, 2609 transitions, 47084 flow [2023-11-10 12:31:45,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=44366, PETRI_DIFFERENCE_MINUEND_PLACES=974, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=312, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=76, PETRI_FLOW=47084, PETRI_PLACES=1066, PETRI_TRANSITIONS=2609} [2023-11-10 12:31:45,639 INFO L281 CegarLoopForPetriNet]: 105 programPoint places, 961 predicate places. [2023-11-10 12:31:45,639 INFO L495 AbstractCegarLoop]: Abstraction has has 1066 places, 2609 transitions, 47084 flow [2023-11-10 12:31:45,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 40.291666666666664) internal successors, (1934), 48 states have internal predecessors, (1934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:31:45,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:31:45,640 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:31:45,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2023-11-10 12:31:45,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:31:45,844 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:31:45,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:31:45,844 INFO L85 PathProgramCache]: Analyzing trace with hash -317907899, now seen corresponding path program 26 times [2023-11-10 12:31:45,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:31:45,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964496043] [2023-11-10 12:31:45,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:31:45,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:31:45,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:31:47,074 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:31:47,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:31:47,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964496043] [2023-11-10 12:31:47,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964496043] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:31:47,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859999731] [2023-11-10 12:31:47,075 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-10 12:31:47,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:31:47,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:31:47,076 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 12:31:47,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-11-10 12:31:47,170 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-10 12:31:47,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:31:47,171 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-10 12:31:47,173 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:31:47,779 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-10 12:31:47,780 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:31:48,159 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:31:48,159 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 43 [2023-11-10 12:31:48,278 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-10 12:31:48,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859999731] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:31:48,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:31:48,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 19, 14] total 56 [2023-11-10 12:31:48,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628710599] [2023-11-10 12:31:48,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:31:48,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-11-10 12:31:48,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:31:48,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-11-10 12:31:48,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=2923, Unknown=0, NotChecked=0, Total=3080 [2023-11-10 12:31:48,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 118 [2023-11-10 12:31:48,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1066 places, 2609 transitions, 47084 flow. Second operand has 56 states, 56 states have (on average 33.267857142857146) internal successors, (1863), 56 states have internal predecessors, (1863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:31:48,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:31:48,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 118 [2023-11-10 12:31:48,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:32:08,179 INFO L124 PetriNetUnfolderBase]: 13002/24084 cut-off events. [2023-11-10 12:32:08,180 INFO L125 PetriNetUnfolderBase]: For 648455/648478 co-relation queries the response was YES. [2023-11-10 12:32:08,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205578 conditions, 24084 events. 13002/24084 cut-off events. For 648455/648478 co-relation queries the response was YES. Maximal size of possible extension queue 1309. Compared 226213 event pairs, 3228 based on Foata normal form. 19/23971 useless extension candidates. Maximal degree in co-relation 205266. Up to 20125 conditions per place. [2023-11-10 12:32:08,942 INFO L140 encePairwiseOnDemand]: 80/118 looper letters, 2539 selfloop transitions, 291 changer transitions 13/2868 dead transitions. [2023-11-10 12:32:08,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1135 places, 2868 transitions, 57338 flow [2023-11-10 12:32:08,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2023-11-10 12:32:08,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2023-11-10 12:32:08,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 2514 transitions. [2023-11-10 12:32:08,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2959039548022599 [2023-11-10 12:32:08,945 INFO L72 ComplementDD]: Start complementDD. Operand 72 states and 2514 transitions. [2023-11-10 12:32:08,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 2514 transitions. [2023-11-10 12:32:08,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:32:08,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 72 states and 2514 transitions. [2023-11-10 12:32:08,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 73 states, 72 states have (on average 34.916666666666664) internal successors, (2514), 72 states have internal predecessors, (2514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:32:08,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 73 states, 73 states have (on average 118.0) internal successors, (8614), 73 states have internal predecessors, (8614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:32:08,952 INFO L81 ComplementDD]: Finished complementDD. Result has 73 states, 73 states have (on average 118.0) internal successors, (8614), 73 states have internal predecessors, (8614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:32:08,953 INFO L175 Difference]: Start difference. First operand has 1066 places, 2609 transitions, 47084 flow. Second operand 72 states and 2514 transitions. [2023-11-10 12:32:08,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1135 places, 2868 transitions, 57338 flow [2023-11-10 12:32:20,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1093 places, 2868 transitions, 56746 flow, removed 146 selfloop flow, removed 42 redundant places. [2023-11-10 12:32:20,841 INFO L231 Difference]: Finished difference. Result has 1109 places, 2669 transitions, 49367 flow [2023-11-10 12:32:20,843 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=46501, PETRI_DIFFERENCE_MINUEND_PLACES=1022, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=236, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=72, PETRI_FLOW=49367, PETRI_PLACES=1109, PETRI_TRANSITIONS=2669} [2023-11-10 12:32:20,844 INFO L281 CegarLoopForPetriNet]: 105 programPoint places, 1004 predicate places. [2023-11-10 12:32:20,844 INFO L495 AbstractCegarLoop]: Abstraction has has 1109 places, 2669 transitions, 49367 flow [2023-11-10 12:32:20,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 33.267857142857146) internal successors, (1863), 56 states have internal predecessors, (1863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:32:20,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:32:20,844 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:32:20,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2023-11-10 12:32:21,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:32:21,049 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:32:21,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:32:21,049 INFO L85 PathProgramCache]: Analyzing trace with hash 96552585, now seen corresponding path program 27 times [2023-11-10 12:32:21,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:32:21,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327304571] [2023-11-10 12:32:21,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:32:21,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:32:21,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:32:21,634 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-10 12:32:21,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:32:21,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327304571] [2023-11-10 12:32:21,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327304571] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:32:21,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795787945] [2023-11-10 12:32:21,634 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-10 12:32:21,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:32:21,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:32:21,636 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 12:32:21,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-11-10 12:32:21,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-10 12:32:21,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:32:21,741 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-10 12:32:21,743 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:32:22,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-10 12:32:22,235 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-10 12:32:22,485 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:32:22,486 INFO L351 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 15 treesize of output 14 [2023-11-10 12:32:22,656 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-10 12:32:22,656 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:32:23,459 INFO L322 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-11-10 12:32:23,460 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 77 [2023-11-10 12:32:23,477 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:32:23,478 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 41 [2023-11-10 12:32:23,944 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-10 12:32:23,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795787945] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:32:23,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:32:23,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 27, 25] total 61 [2023-11-10 12:32:23,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929097263] [2023-11-10 12:32:23,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:32:23,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2023-11-10 12:32:23,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:32:23,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2023-11-10 12:32:23,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=3355, Unknown=1, NotChecked=0, Total=3660 [2023-11-10 12:32:23,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 118 [2023-11-10 12:32:23,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1109 places, 2669 transitions, 49367 flow. Second operand has 61 states, 61 states have (on average 33.47540983606557) internal successors, (2042), 61 states have internal predecessors, (2042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:32:23,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:32:23,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 118 [2023-11-10 12:32:23,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:32:27,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:32:31,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:32:34,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:32:36,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:32:40,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:32:42,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:32:46,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:32:48,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:32:51,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:32:53,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:32:55,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:32:57,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:33:01,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:33:04,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:33:08,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:33:14,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:33:16,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:33:18,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:33:21,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:33:24,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:33:26,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:33:32,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:33:35,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:33:37,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:33:39,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:33:41,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:33:43,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2023-11-10 12:33:44,295 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-10 12:33:44,295 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-10 12:33:45,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2023-11-10 12:33:45,495 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-11-10 12:33:45,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2023-11-10 12:33:45,521 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-11-10 12:33:45,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-10 12:33:45,521 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-11-10 12:33:45,522 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-11-10 12:33:45,522 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-11-10 12:33:45,523 INFO L445 BasicCegarLoop]: Path program histogram: [27, 1, 1, 1, 1, 1] [2023-11-10 12:33:45,525 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-10 12:33:45,525 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-10 12:33:45,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 12:33:45 BasicIcfg [2023-11-10 12:33:45,527 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-10 12:33:45,527 INFO L158 Benchmark]: Toolchain (without parser) took 524996.83ms. Allocated memory was 358.6MB in the beginning and 5.8GB in the end (delta: 5.4GB). Free memory was 309.8MB in the beginning and 1.1GB in the end (delta: -824.6MB). Peak memory consumption was 4.6GB. Max. memory is 8.0GB. [2023-11-10 12:33:45,527 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 255.9MB. Free memory is still 209.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-10 12:33:45,528 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.54ms. Allocated memory is still 358.6MB. Free memory was 309.5MB in the beginning and 298.0MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-11-10 12:33:45,528 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.90ms. Allocated memory is still 358.6MB. Free memory was 298.0MB in the beginning and 295.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-10 12:33:45,528 INFO L158 Benchmark]: Boogie Preprocessor took 38.42ms. Allocated memory is still 358.6MB. Free memory was 295.8MB in the beginning and 294.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-11-10 12:33:45,528 INFO L158 Benchmark]: RCFGBuilder took 555.00ms. Allocated memory is still 358.6MB. Free memory was 294.2MB in the beginning and 314.8MB in the end (delta: -20.6MB). Peak memory consumption was 23.9MB. Max. memory is 8.0GB. [2023-11-10 12:33:45,528 INFO L158 Benchmark]: TraceAbstraction took 524138.50ms. Allocated memory was 358.6MB in the beginning and 5.8GB in the end (delta: 5.4GB). Free memory was 313.8MB in the beginning and 1.1GB in the end (delta: -820.6MB). Peak memory consumption was 4.6GB. Max. memory is 8.0GB. [2023-11-10 12:33:45,531 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 255.9MB. Free memory is still 209.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 216.54ms. Allocated memory is still 358.6MB. Free memory was 309.5MB in the beginning and 298.0MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.90ms. Allocated memory is still 358.6MB. Free memory was 298.0MB in the beginning and 295.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.42ms. Allocated memory is still 358.6MB. Free memory was 295.8MB in the beginning and 294.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 555.00ms. Allocated memory is still 358.6MB. Free memory was 294.2MB in the beginning and 314.8MB in the end (delta: -20.6MB). Peak memory consumption was 23.9MB. Max. memory is 8.0GB. * TraceAbstraction took 524138.50ms. Allocated memory was 358.6MB in the beginning and 5.8GB in the end (delta: 5.4GB). Free memory was 313.8MB in the beginning and 1.1GB in the end (delta: -820.6MB). Peak memory consumption was 4.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 81]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 75]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 76]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 132 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 524.0s, OverallIterations: 32, TraceHistogramMax: 2, PathProgramHistogramMax: 27, EmptinessCheckTime: 0.0s, AutomataDifference: 464.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 464 mSolverCounterUnknown, 12739 SdHoareTripleChecker+Valid, 187.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12739 mSDsluCounter, 47348 SdHoareTripleChecker+Invalid, 182.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 9608 IncrementalHoareTripleChecker+Unchecked, 45339 mSDsCounter, 743 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 84640 IncrementalHoareTripleChecker+Invalid, 95455 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 743 mSolverCounterUnsat, 2009 mSDtfsCounter, 84640 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 464 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8459 GetRequests, 5785 SyntacticMatches, 45 SemanticMatches, 2628 ConstructedPredicates, 28 IntricatePredicates, 0 DeprecatedPredicates, 96176 ImplicationChecksByTransitivity, 146.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49367occurred in iteration=31, InterpolantAutomatonStates: 1593, 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.4s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 50.2s InterpolantComputationTime, 6634 NumberOfCodeBlocks, 6634 NumberOfCodeBlocksAsserted, 96 NumberOfCheckSat, 9736 ConstructedInterpolants, 214 QuantifiedInterpolants, 78132 SizeOfPredicates, 604 NumberOfNonLiveVariables, 7482 ConjunctsInSsa, 1263 ConjunctsInUnsatCore, 90 InterpolantComputations, 5 PerfectInterpolantSequences, 351/1517 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 [2023-11-10 12:33:45,537 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Completed graceful shutdown