/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/stack_longest-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 11:15:05,507 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 11:15:05,572 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2023-11-17 11:15:05,599 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 11:15:05,600 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 11:15:05,600 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 11:15:05,601 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 11:15:05,601 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 11:15:05,602 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 11:15:05,602 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 11:15:05,602 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 11:15:05,603 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 11:15:05,603 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 11:15:05,603 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 11:15:05,604 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 11:15:05,604 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 11:15:05,604 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 11:15:05,604 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 11:15:05,605 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 11:15:05,605 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 11:15:05,605 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 11:15:05,606 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 11:15:05,606 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 11:15:05,606 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 11:15:05,606 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 11:15:05,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:15:05,607 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 11:15:05,607 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 11:15:05,607 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 11:15:05,608 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 11:15:05,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 11:15:05,608 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 11:15:05,608 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true [2023-11-17 11:15:05,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 11:15:05,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 11:15:05,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 11:15:05,879 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 11:15:05,879 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 11:15:05,880 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longest-2.i [2023-11-17 11:15:07,137 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 11:15:07,477 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 11:15:07,478 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-2.i [2023-11-17 11:15:07,492 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96ba8f435/d718207bd9b640f8bf8f339e0c7bf029/FLAGd12b7b1a8 [2023-11-17 11:15:07,511 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96ba8f435/d718207bd9b640f8bf8f339e0c7bf029 [2023-11-17 11:15:07,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 11:15:07,515 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 11:15:07,516 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 11:15:07,516 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 11:15:07,520 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 11:15:07,520 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:15:07" (1/1) ... [2023-11-17 11:15:07,521 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f6b90b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:15:07, skipping insertion in model container [2023-11-17 11:15:07,521 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:15:07" (1/1) ... [2023-11-17 11:15:07,568 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 11:15:07,959 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-2.i[41530,41543] [2023-11-17 11:15:07,990 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:15:08,003 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 11:15:08,041 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-2.i[41530,41543] [2023-11-17 11:15:08,050 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:15:08,109 INFO L206 MainTranslator]: Completed translation [2023-11-17 11:15:08,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:15:08 WrapperNode [2023-11-17 11:15:08,111 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 11:15:08,113 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 11:15:08,113 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 11:15:08,113 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 11:15:08,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:15:08" (1/1) ... [2023-11-17 11:15:08,154 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:15:08" (1/1) ... [2023-11-17 11:15:08,187 INFO L138 Inliner]: procedures = 278, calls = 40, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 154 [2023-11-17 11:15:08,188 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 11:15:08,189 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 11:15:08,189 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 11:15:08,189 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 11:15:08,196 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:15:08" (1/1) ... [2023-11-17 11:15:08,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:15:08" (1/1) ... [2023-11-17 11:15:08,214 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:15:08" (1/1) ... [2023-11-17 11:15:08,214 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:15:08" (1/1) ... [2023-11-17 11:15:08,225 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:15:08" (1/1) ... [2023-11-17 11:15:08,228 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:15:08" (1/1) ... [2023-11-17 11:15:08,230 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:15:08" (1/1) ... [2023-11-17 11:15:08,232 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:15:08" (1/1) ... [2023-11-17 11:15:08,235 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 11:15:08,236 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 11:15:08,236 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 11:15:08,236 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 11:15:08,252 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:15:08" (1/1) ... [2023-11-17 11:15:08,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:15:08,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:15:08,290 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 11:15:08,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 11:15:08,321 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-11-17 11:15:08,321 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-11-17 11:15:08,321 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-11-17 11:15:08,321 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-11-17 11:15:08,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 11:15:08,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 11:15:08,322 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-17 11:15:08,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 11:15:08,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 11:15:08,323 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-17 11:15:08,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 11:15:08,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 11:15:08,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 11:15:08,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 11:15:08,325 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 11:15:08,450 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 11:15:08,453 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 11:15:08,720 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 11:15:08,952 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 11:15:08,953 INFO L307 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-17 11:15:08,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:15:08 BoogieIcfgContainer [2023-11-17 11:15:08,954 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 11:15:08,957 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 11:15:08,957 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 11:15:08,960 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 11:15:08,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 11:15:07" (1/3) ... [2023-11-17 11:15:08,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@637762d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:15:08, skipping insertion in model container [2023-11-17 11:15:08,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:15:08" (2/3) ... [2023-11-17 11:15:08,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@637762d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:15:08, skipping insertion in model container [2023-11-17 11:15:08,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:15:08" (3/3) ... [2023-11-17 11:15:08,963 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longest-2.i [2023-11-17 11:15:08,983 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 11:15:08,983 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 11:15:08,983 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 11:15:09,062 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-17 11:15:09,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 35 transitions, 84 flow [2023-11-17 11:15:09,143 INFO L124 PetriNetUnfolderBase]: 5/33 cut-off events. [2023-11-17 11:15:09,144 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 11:15:09,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 33 events. 5/33 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 61 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 29. Up to 3 conditions per place. [2023-11-17 11:15:09,151 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 35 transitions, 84 flow [2023-11-17 11:15:09,158 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 31 transitions, 71 flow [2023-11-17 11:15:09,164 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:15:09,186 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 31 transitions, 71 flow [2023-11-17 11:15:09,191 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 31 transitions, 71 flow [2023-11-17 11:15:09,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 31 transitions, 71 flow [2023-11-17 11:15:09,209 INFO L124 PetriNetUnfolderBase]: 5/31 cut-off events. [2023-11-17 11:15:09,209 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-17 11:15:09,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 31 events. 5/31 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 59 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 29. Up to 3 conditions per place. [2023-11-17 11:15:09,211 INFO L119 LiptonReduction]: Number of co-enabled transitions 430 [2023-11-17 11:15:10,519 INFO L134 LiptonReduction]: Checked pairs total: 1215 [2023-11-17 11:15:10,520 INFO L136 LiptonReduction]: Total number of compositions: 21 [2023-11-17 11:15:10,539 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:15:10,548 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;@61b2d11c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:15:10,548 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-17 11:15:10,552 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:15:10,553 INFO L124 PetriNetUnfolderBase]: 1/9 cut-off events. [2023-11-17 11:15:10,553 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:15:10,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:15:10,554 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-17 11:15:10,554 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:15:10,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:15:10,560 INFO L85 PathProgramCache]: Analyzing trace with hash 395025706, now seen corresponding path program 1 times [2023-11-17 11:15:10,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:15:10,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867261290] [2023-11-17 11:15:10,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:15:10,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:15:10,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:15:10,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:10,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:15:10,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867261290] [2023-11-17 11:15:10,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867261290] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:15:10,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:15:10,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:15:10,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896153426] [2023-11-17 11:15:10,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:15:10,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:15:10,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:15:10,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:15:10,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:15:10,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2023-11-17 11:15:10,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 21 transitions, 51 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:10,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:15:10,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2023-11-17 11:15:10,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:15:10,986 INFO L124 PetriNetUnfolderBase]: 203/344 cut-off events. [2023-11-17 11:15:10,986 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2023-11-17 11:15:10,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 723 conditions, 344 events. 203/344 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1157 event pairs, 67 based on Foata normal form. 10/258 useless extension candidates. Maximal degree in co-relation 610. Up to 219 conditions per place. [2023-11-17 11:15:10,991 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 28 selfloop transitions, 2 changer transitions 3/33 dead transitions. [2023-11-17 11:15:10,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 33 transitions, 147 flow [2023-11-17 11:15:10,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:15:10,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:15:11,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2023-11-17 11:15:11,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35119047619047616 [2023-11-17 11:15:11,003 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 59 transitions. [2023-11-17 11:15:11,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 59 transitions. [2023-11-17 11:15:11,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:15:11,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 59 transitions. [2023-11-17 11:15:11,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:11,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:11,011 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:11,013 INFO L175 Difference]: Start difference. First operand has 24 places, 21 transitions, 51 flow. Second operand 3 states and 59 transitions. [2023-11-17 11:15:11,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 33 transitions, 147 flow [2023-11-17 11:15:11,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 33 transitions, 139 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-17 11:15:11,018 INFO L231 Difference]: Finished difference. Result has 24 places, 21 transitions, 60 flow [2023-11-17 11:15:11,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=24, PETRI_TRANSITIONS=21} [2023-11-17 11:15:11,023 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 0 predicate places. [2023-11-17 11:15:11,023 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 21 transitions, 60 flow [2023-11-17 11:15:11,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:11,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:15:11,024 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-11-17 11:15:11,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 11:15:11,024 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:15:11,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:15:11,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1054439, now seen corresponding path program 1 times [2023-11-17 11:15:11,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:15:11,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692180293] [2023-11-17 11:15:11,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:15:11,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:15:11,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:15:11,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:11,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:15:11,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692180293] [2023-11-17 11:15:11,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692180293] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:15:11,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533772950] [2023-11-17 11:15:11,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:15:11,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:15:11,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:15:11,147 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 11:15:11,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-17 11:15:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:15:11,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-17 11:15:11,255 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:15:11,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:11,299 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:15:11,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:11,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533772950] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:15:11,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:15:11,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2023-11-17 11:15:11,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781613165] [2023-11-17 11:15:11,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:15:11,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 11:15:11,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:15:11,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 11:15:11,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-17 11:15:11,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2023-11-17 11:15:11,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 21 transitions, 60 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:11,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:15:11,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2023-11-17 11:15:11,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:15:11,604 INFO L124 PetriNetUnfolderBase]: 629/1072 cut-off events. [2023-11-17 11:15:11,604 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2023-11-17 11:15:11,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2388 conditions, 1072 events. 629/1072 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4378 event pairs, 103 based on Foata normal form. 22/804 useless extension candidates. Maximal degree in co-relation 1964. Up to 246 conditions per place. [2023-11-17 11:15:11,612 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 76 selfloop transitions, 15 changer transitions 3/94 dead transitions. [2023-11-17 11:15:11,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 94 transitions, 429 flow [2023-11-17 11:15:11,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 11:15:11,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 11:15:11,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 151 transitions. [2023-11-17 11:15:11,614 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3852040816326531 [2023-11-17 11:15:11,615 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 151 transitions. [2023-11-17 11:15:11,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 151 transitions. [2023-11-17 11:15:11,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:15:11,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 151 transitions. [2023-11-17 11:15:11,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:11,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 56.0) internal successors, (448), 8 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:11,618 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 56.0) internal successors, (448), 8 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:11,618 INFO L175 Difference]: Start difference. First operand has 24 places, 21 transitions, 60 flow. Second operand 7 states and 151 transitions. [2023-11-17 11:15:11,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 94 transitions, 429 flow [2023-11-17 11:15:11,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 94 transitions, 427 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:15:11,621 INFO L231 Difference]: Finished difference. Result has 34 places, 35 transitions, 193 flow [2023-11-17 11:15:11,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=193, PETRI_PLACES=34, PETRI_TRANSITIONS=35} [2023-11-17 11:15:11,622 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 10 predicate places. [2023-11-17 11:15:11,622 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 35 transitions, 193 flow [2023-11-17 11:15:11,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:11,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:15:11,622 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:15:11,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-17 11:15:11,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:15:11,830 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:15:11,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:15:11,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1971124776, now seen corresponding path program 1 times [2023-11-17 11:15:11,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:15:11,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721355594] [2023-11-17 11:15:11,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:15:11,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:15:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:15:11,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:11,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:15:11,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721355594] [2023-11-17 11:15:11,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721355594] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:15:11,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:15:11,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:15:11,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995155472] [2023-11-17 11:15:11,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:15:11,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:15:11,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:15:11,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:15:11,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:15:11,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 56 [2023-11-17 11:15:11,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 35 transitions, 193 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:11,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:15:11,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 56 [2023-11-17 11:15:11,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:15:12,068 INFO L124 PetriNetUnfolderBase]: 408/733 cut-off events. [2023-11-17 11:15:12,069 INFO L125 PetriNetUnfolderBase]: For 501/501 co-relation queries the response was YES. [2023-11-17 11:15:12,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1958 conditions, 733 events. 408/733 cut-off events. For 501/501 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3018 event pairs, 136 based on Foata normal form. 24/641 useless extension candidates. Maximal degree in co-relation 1397. Up to 434 conditions per place. [2023-11-17 11:15:12,073 INFO L140 encePairwiseOnDemand]: 51/56 looper letters, 34 selfloop transitions, 10 changer transitions 0/44 dead transitions. [2023-11-17 11:15:12,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 44 transitions, 302 flow [2023-11-17 11:15:12,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:15:12,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:15:12,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2023-11-17 11:15:12,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2023-11-17 11:15:12,077 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 56 transitions. [2023-11-17 11:15:12,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 56 transitions. [2023-11-17 11:15:12,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:15:12,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 56 transitions. [2023-11-17 11:15:12,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:12,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:12,080 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:12,080 INFO L175 Difference]: Start difference. First operand has 34 places, 35 transitions, 193 flow. Second operand 3 states and 56 transitions. [2023-11-17 11:15:12,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 44 transitions, 302 flow [2023-11-17 11:15:12,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 44 transitions, 288 flow, removed 7 selfloop flow, removed 0 redundant places. [2023-11-17 11:15:12,091 INFO L231 Difference]: Finished difference. Result has 36 places, 35 transitions, 199 flow [2023-11-17 11:15:12,091 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=199, PETRI_PLACES=36, PETRI_TRANSITIONS=35} [2023-11-17 11:15:12,093 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 12 predicate places. [2023-11-17 11:15:12,093 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 35 transitions, 199 flow [2023-11-17 11:15:12,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:12,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:15:12,094 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:15:12,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 11:15:12,094 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:15:12,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:15:12,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1609483055, now seen corresponding path program 1 times [2023-11-17 11:15:12,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:15:12,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067268278] [2023-11-17 11:15:12,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:15:12,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:15:12,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:15:12,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:12,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:15:12,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067268278] [2023-11-17 11:15:12,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067268278] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:15:12,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:15:12,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:15:12,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720380302] [2023-11-17 11:15:12,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:15:12,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:15:12,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:15:12,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:15:12,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:15:12,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 56 [2023-11-17 11:15:12,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 35 transitions, 199 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:12,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:15:12,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 56 [2023-11-17 11:15:12,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:15:12,750 INFO L124 PetriNetUnfolderBase]: 526/947 cut-off events. [2023-11-17 11:15:12,751 INFO L125 PetriNetUnfolderBase]: For 706/706 co-relation queries the response was YES. [2023-11-17 11:15:12,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2691 conditions, 947 events. 526/947 cut-off events. For 706/706 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4116 event pairs, 179 based on Foata normal form. 0/923 useless extension candidates. Maximal degree in co-relation 1889. Up to 624 conditions per place. [2023-11-17 11:15:12,756 INFO L140 encePairwiseOnDemand]: 52/56 looper letters, 54 selfloop transitions, 6 changer transitions 6/66 dead transitions. [2023-11-17 11:15:12,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 66 transitions, 449 flow [2023-11-17 11:15:12,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:15:12,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:15:12,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2023-11-17 11:15:12,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36160714285714285 [2023-11-17 11:15:12,758 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 81 transitions. [2023-11-17 11:15:12,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 81 transitions. [2023-11-17 11:15:12,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:15:12,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 81 transitions. [2023-11-17 11:15:12,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:12,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 56.0) internal successors, (280), 5 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:12,760 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 56.0) internal successors, (280), 5 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:12,760 INFO L175 Difference]: Start difference. First operand has 36 places, 35 transitions, 199 flow. Second operand 4 states and 81 transitions. [2023-11-17 11:15:12,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 66 transitions, 449 flow [2023-11-17 11:15:12,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 66 transitions, 428 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:15:12,765 INFO L231 Difference]: Finished difference. Result has 39 places, 39 transitions, 238 flow [2023-11-17 11:15:12,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=238, PETRI_PLACES=39, PETRI_TRANSITIONS=39} [2023-11-17 11:15:12,766 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 15 predicate places. [2023-11-17 11:15:12,766 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 39 transitions, 238 flow [2023-11-17 11:15:12,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:12,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:15:12,766 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:15:12,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 11:15:12,767 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:15:12,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:15:12,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1309211193, now seen corresponding path program 2 times [2023-11-17 11:15:12,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:15:12,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740098814] [2023-11-17 11:15:12,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:15:12,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:15:12,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:15:13,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:13,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:15:13,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740098814] [2023-11-17 11:15:13,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740098814] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:15:13,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:15:13,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:15:13,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69439084] [2023-11-17 11:15:13,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:15:13,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:15:13,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:15:13,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:15:13,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:15:13,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 56 [2023-11-17 11:15:13,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 39 transitions, 238 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:13,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:15:13,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 56 [2023-11-17 11:15:13,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:15:13,320 INFO L124 PetriNetUnfolderBase]: 626/1129 cut-off events. [2023-11-17 11:15:13,321 INFO L125 PetriNetUnfolderBase]: For 1020/1020 co-relation queries the response was YES. [2023-11-17 11:15:13,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3049 conditions, 1129 events. 626/1129 cut-off events. For 1020/1020 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5134 event pairs, 258 based on Foata normal form. 6/1117 useless extension candidates. Maximal degree in co-relation 2150. Up to 603 conditions per place. [2023-11-17 11:15:13,327 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 54 selfloop transitions, 8 changer transitions 7/69 dead transitions. [2023-11-17 11:15:13,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 69 transitions, 489 flow [2023-11-17 11:15:13,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:15:13,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:15:13,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2023-11-17 11:15:13,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36160714285714285 [2023-11-17 11:15:13,330 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 81 transitions. [2023-11-17 11:15:13,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 81 transitions. [2023-11-17 11:15:13,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:15:13,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 81 transitions. [2023-11-17 11:15:13,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:13,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 56.0) internal successors, (280), 5 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:13,332 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 56.0) internal successors, (280), 5 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:13,332 INFO L175 Difference]: Start difference. First operand has 39 places, 39 transitions, 238 flow. Second operand 4 states and 81 transitions. [2023-11-17 11:15:13,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 69 transitions, 489 flow [2023-11-17 11:15:13,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 69 transitions, 480 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-17 11:15:13,338 INFO L231 Difference]: Finished difference. Result has 41 places, 42 transitions, 286 flow [2023-11-17 11:15:13,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=286, PETRI_PLACES=41, PETRI_TRANSITIONS=42} [2023-11-17 11:15:13,340 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 17 predicate places. [2023-11-17 11:15:13,341 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 42 transitions, 286 flow [2023-11-17 11:15:13,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:13,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:15:13,344 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:15:13,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 11:15:13,345 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:15:13,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:15:13,345 INFO L85 PathProgramCache]: Analyzing trace with hash 2094668692, now seen corresponding path program 3 times [2023-11-17 11:15:13,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:15:13,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962374583] [2023-11-17 11:15:13,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:15:13,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:15:13,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:15:13,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 11:15:13,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:15:13,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962374583] [2023-11-17 11:15:13,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962374583] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:15:13,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:15:13,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:15:13,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920384894] [2023-11-17 11:15:13,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:15:13,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:15:13,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:15:13,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:15:13,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:15:13,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2023-11-17 11:15:13,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 42 transitions, 286 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:13,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:15:13,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2023-11-17 11:15:13,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:15:13,866 INFO L124 PetriNetUnfolderBase]: 822/1474 cut-off events. [2023-11-17 11:15:13,866 INFO L125 PetriNetUnfolderBase]: For 1725/1725 co-relation queries the response was YES. [2023-11-17 11:15:13,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4048 conditions, 1474 events. 822/1474 cut-off events. For 1725/1725 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 7502 event pairs, 266 based on Foata normal form. 6/1462 useless extension candidates. Maximal degree in co-relation 2491. Up to 854 conditions per place. [2023-11-17 11:15:13,873 INFO L140 encePairwiseOnDemand]: 51/56 looper letters, 51 selfloop transitions, 16 changer transitions 0/67 dead transitions. [2023-11-17 11:15:13,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 67 transitions, 553 flow [2023-11-17 11:15:13,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:15:13,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:15:13,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2023-11-17 11:15:13,875 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34523809523809523 [2023-11-17 11:15:13,875 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 58 transitions. [2023-11-17 11:15:13,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 58 transitions. [2023-11-17 11:15:13,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:15:13,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 58 transitions. [2023-11-17 11:15:13,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:13,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:13,876 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:13,876 INFO L175 Difference]: Start difference. First operand has 41 places, 42 transitions, 286 flow. Second operand 3 states and 58 transitions. [2023-11-17 11:15:13,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 67 transitions, 553 flow [2023-11-17 11:15:13,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 67 transitions, 541 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-17 11:15:13,882 INFO L231 Difference]: Finished difference. Result has 43 places, 49 transitions, 414 flow [2023-11-17 11:15:13,883 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=414, PETRI_PLACES=43, PETRI_TRANSITIONS=49} [2023-11-17 11:15:13,883 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 19 predicate places. [2023-11-17 11:15:13,883 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 49 transitions, 414 flow [2023-11-17 11:15:13,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:13,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:15:13,884 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:15:13,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 11:15:13,884 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:15:13,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:15:13,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1551338954, now seen corresponding path program 4 times [2023-11-17 11:15:13,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:15:13,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411670036] [2023-11-17 11:15:13,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:15:13,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:15:13,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:15:14,188 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 11:15:14,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:15:14,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411670036] [2023-11-17 11:15:14,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411670036] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:15:14,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:15:14,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:15:14,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298228246] [2023-11-17 11:15:14,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:15:14,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:15:14,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:15:14,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:15:14,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:15:14,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2023-11-17 11:15:14,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 49 transitions, 414 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:14,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:15:14,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2023-11-17 11:15:14,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:15:14,406 INFO L124 PetriNetUnfolderBase]: 916/1644 cut-off events. [2023-11-17 11:15:14,407 INFO L125 PetriNetUnfolderBase]: For 2871/2871 co-relation queries the response was YES. [2023-11-17 11:15:14,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4806 conditions, 1644 events. 916/1644 cut-off events. For 2871/2871 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8402 event pairs, 542 based on Foata normal form. 0/1632 useless extension candidates. Maximal degree in co-relation 2584. Up to 1210 conditions per place. [2023-11-17 11:15:14,415 INFO L140 encePairwiseOnDemand]: 52/56 looper letters, 52 selfloop transitions, 13 changer transitions 0/65 dead transitions. [2023-11-17 11:15:14,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 65 transitions, 643 flow [2023-11-17 11:15:14,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:15:14,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:15:14,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2023-11-17 11:15:14,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27232142857142855 [2023-11-17 11:15:14,417 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 61 transitions. [2023-11-17 11:15:14,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 61 transitions. [2023-11-17 11:15:14,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:15:14,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 61 transitions. [2023-11-17 11:15:14,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:14,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 56.0) internal successors, (280), 5 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:14,423 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 56.0) internal successors, (280), 5 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:14,423 INFO L175 Difference]: Start difference. First operand has 43 places, 49 transitions, 414 flow. Second operand 4 states and 61 transitions. [2023-11-17 11:15:14,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 65 transitions, 643 flow [2023-11-17 11:15:14,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 65 transitions, 605 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:15:14,429 INFO L231 Difference]: Finished difference. Result has 46 places, 52 transitions, 479 flow [2023-11-17 11:15:14,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=479, PETRI_PLACES=46, PETRI_TRANSITIONS=52} [2023-11-17 11:15:14,430 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 22 predicate places. [2023-11-17 11:15:14,430 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 52 transitions, 479 flow [2023-11-17 11:15:14,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:14,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:15:14,430 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:15:14,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 11:15:14,431 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:15:14,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:15:14,431 INFO L85 PathProgramCache]: Analyzing trace with hash 214523361, now seen corresponding path program 1 times [2023-11-17 11:15:14,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:15:14,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470053382] [2023-11-17 11:15:14,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:15:14,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:15:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:15:15,479 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:15,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:15:15,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470053382] [2023-11-17 11:15:15,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470053382] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:15:15,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455410760] [2023-11-17 11:15:15,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:15:15,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:15:15,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:15:15,482 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 11:15:15,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-17 11:15:15,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:15:15,618 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-17 11:15:15,621 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:15:15,678 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-11-17 11:15:15,679 INFO L378 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 29 treesize of output 34 [2023-11-17 11:15:15,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 11:15:15,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 11:15:15,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 14 [2023-11-17 11:15:15,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-17 11:15:15,996 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:15,996 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:15:16,249 INFO L349 Elim1Store]: treesize reduction 21, result has 54.3 percent of original size [2023-11-17 11:15:16,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2023-11-17 11:15:16,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2023-11-17 11:15:16,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2023-11-17 11:15:16,301 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:16,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455410760] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:15:16,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:15:16,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2023-11-17 11:15:16,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973423372] [2023-11-17 11:15:16,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:15:16,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-17 11:15:16,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:15:16,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-17 11:15:16,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=200, Unknown=1, NotChecked=0, Total=272 [2023-11-17 11:15:16,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2023-11-17 11:15:16,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 52 transitions, 479 flow. Second operand has 17 states, 17 states have (on average 10.0) internal successors, (170), 17 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:16,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:15:16,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2023-11-17 11:15:16,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:15:18,175 INFO L124 PetriNetUnfolderBase]: 1788/3268 cut-off events. [2023-11-17 11:15:18,176 INFO L125 PetriNetUnfolderBase]: For 8171/8171 co-relation queries the response was YES. [2023-11-17 11:15:18,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9644 conditions, 3268 events. 1788/3268 cut-off events. For 8171/8171 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 17500 event pairs, 419 based on Foata normal form. 130/3386 useless extension candidates. Maximal degree in co-relation 7578. Up to 530 conditions per place. [2023-11-17 11:15:18,192 INFO L140 encePairwiseOnDemand]: 44/56 looper letters, 137 selfloop transitions, 72 changer transitions 34/243 dead transitions. [2023-11-17 11:15:18,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 243 transitions, 2023 flow [2023-11-17 11:15:18,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-17 11:15:18,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-11-17 11:15:18,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 312 transitions. [2023-11-17 11:15:18,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3277310924369748 [2023-11-17 11:15:18,194 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 312 transitions. [2023-11-17 11:15:18,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 312 transitions. [2023-11-17 11:15:18,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:15:18,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 312 transitions. [2023-11-17 11:15:18,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 18.352941176470587) internal successors, (312), 17 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:18,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 56.0) internal successors, (1008), 18 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:18,197 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 56.0) internal successors, (1008), 18 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:18,197 INFO L175 Difference]: Start difference. First operand has 46 places, 52 transitions, 479 flow. Second operand 17 states and 312 transitions. [2023-11-17 11:15:18,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 243 transitions, 2023 flow [2023-11-17 11:15:18,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 243 transitions, 1980 flow, removed 21 selfloop flow, removed 1 redundant places. [2023-11-17 11:15:18,211 INFO L231 Difference]: Finished difference. Result has 73 places, 101 transitions, 1354 flow [2023-11-17 11:15:18,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1354, PETRI_PLACES=73, PETRI_TRANSITIONS=101} [2023-11-17 11:15:18,212 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 49 predicate places. [2023-11-17 11:15:18,212 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 101 transitions, 1354 flow [2023-11-17 11:15:18,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 10.0) internal successors, (170), 17 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:18,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:15:18,212 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 1, 1, 1, 1] [2023-11-17 11:15:18,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-17 11:15:18,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-17 11:15:18,419 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:15:18,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:15:18,420 INFO L85 PathProgramCache]: Analyzing trace with hash 579767018, now seen corresponding path program 2 times [2023-11-17 11:15:18,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:15:18,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928840047] [2023-11-17 11:15:18,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:15:18,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:15:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:15:18,514 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:18,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:15:18,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928840047] [2023-11-17 11:15:18,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928840047] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:15:18,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386099891] [2023-11-17 11:15:18,515 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 11:15:18,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:15:18,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:15:18,516 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 11:15:18,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-17 11:15:18,641 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 11:15:18,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 11:15:18,643 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-17 11:15:18,645 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:15:18,672 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:18,672 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:15:18,732 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:18,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386099891] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:15:18,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:15:18,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-11-17 11:15:18,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117171898] [2023-11-17 11:15:18,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:15:18,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-17 11:15:18,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:15:18,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-17 11:15:18,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-11-17 11:15:18,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2023-11-17 11:15:18,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 101 transitions, 1354 flow. Second operand has 13 states, 13 states have (on average 10.0) internal successors, (130), 13 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:18,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:15:18,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2023-11-17 11:15:18,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:15:19,874 INFO L124 PetriNetUnfolderBase]: 3470/6216 cut-off events. [2023-11-17 11:15:19,874 INFO L125 PetriNetUnfolderBase]: For 38396/38396 co-relation queries the response was YES. [2023-11-17 11:15:19,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23710 conditions, 6216 events. 3470/6216 cut-off events. For 38396/38396 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 35894 event pairs, 1331 based on Foata normal form. 198/6414 useless extension candidates. Maximal degree in co-relation 22256. Up to 2629 conditions per place. [2023-11-17 11:15:19,920 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 191 selfloop transitions, 150 changer transitions 5/346 dead transitions. [2023-11-17 11:15:19,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 346 transitions, 4167 flow [2023-11-17 11:15:19,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 11:15:19,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-17 11:15:19,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 284 transitions. [2023-11-17 11:15:19,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3901098901098901 [2023-11-17 11:15:19,923 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 284 transitions. [2023-11-17 11:15:19,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 284 transitions. [2023-11-17 11:15:19,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:15:19,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 284 transitions. [2023-11-17 11:15:19,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 21.846153846153847) internal successors, (284), 13 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:19,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 56.0) internal successors, (784), 14 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:19,925 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 56.0) internal successors, (784), 14 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:19,925 INFO L175 Difference]: Start difference. First operand has 73 places, 101 transitions, 1354 flow. Second operand 13 states and 284 transitions. [2023-11-17 11:15:19,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 346 transitions, 4167 flow [2023-11-17 11:15:20,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 346 transitions, 3828 flow, removed 85 selfloop flow, removed 5 redundant places. [2023-11-17 11:15:20,101 INFO L231 Difference]: Finished difference. Result has 90 places, 192 transitions, 3106 flow [2023-11-17 11:15:20,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=1129, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3106, PETRI_PLACES=90, PETRI_TRANSITIONS=192} [2023-11-17 11:15:20,102 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 66 predicate places. [2023-11-17 11:15:20,102 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 192 transitions, 3106 flow [2023-11-17 11:15:20,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.0) internal successors, (130), 13 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:20,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:15:20,103 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:15:20,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-17 11:15:20,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:15:20,311 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:15:20,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:15:20,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1666441903, now seen corresponding path program 2 times [2023-11-17 11:15:20,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:15:20,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077449403] [2023-11-17 11:15:20,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:15:20,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:15:20,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:15:20,920 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:20,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:15:20,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077449403] [2023-11-17 11:15:20,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077449403] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:15:20,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282329231] [2023-11-17 11:15:20,921 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 11:15:20,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:15:20,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:15:20,922 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 11:15:20,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-17 11:15:21,076 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 11:15:21,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 11:15:21,079 INFO L262 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-17 11:15:21,082 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:15:21,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 11:15:21,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-11-17 11:15:21,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 11:15:21,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 14 [2023-11-17 11:15:21,299 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:21,299 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:15:21,402 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:21,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282329231] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:15:21,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:15:21,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2023-11-17 11:15:21,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136603838] [2023-11-17 11:15:21,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:15:21,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-17 11:15:21,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:15:21,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-17 11:15:21,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-11-17 11:15:21,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2023-11-17 11:15:21,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 192 transitions, 3106 flow. Second operand has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:21,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:15:21,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2023-11-17 11:15:21,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:15:23,999 INFO L124 PetriNetUnfolderBase]: 7592/13610 cut-off events. [2023-11-17 11:15:24,000 INFO L125 PetriNetUnfolderBase]: For 91837/91837 co-relation queries the response was YES. [2023-11-17 11:15:24,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55150 conditions, 13610 events. 7592/13610 cut-off events. For 91837/91837 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 93194 event pairs, 2730 based on Foata normal form. 150/13760 useless extension candidates. Maximal degree in co-relation 52858. Up to 5828 conditions per place. [2023-11-17 11:15:24,109 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 209 selfloop transitions, 299 changer transitions 15/523 dead transitions. [2023-11-17 11:15:24,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 523 transitions, 8618 flow [2023-11-17 11:15:24,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-17 11:15:24,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-17 11:15:24,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 220 transitions. [2023-11-17 11:15:24,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3273809523809524 [2023-11-17 11:15:24,111 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 220 transitions. [2023-11-17 11:15:24,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 220 transitions. [2023-11-17 11:15:24,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:15:24,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 220 transitions. [2023-11-17 11:15:24,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 18.333333333333332) internal successors, (220), 12 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:24,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 56.0) internal successors, (728), 13 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:24,114 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 56.0) internal successors, (728), 13 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:24,114 INFO L175 Difference]: Start difference. First operand has 90 places, 192 transitions, 3106 flow. Second operand 12 states and 220 transitions. [2023-11-17 11:15:24,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 523 transitions, 8618 flow [2023-11-17 11:15:24,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 523 transitions, 7282 flow, removed 658 selfloop flow, removed 2 redundant places. [2023-11-17 11:15:24,514 INFO L231 Difference]: Finished difference. Result has 103 places, 383 transitions, 6268 flow [2023-11-17 11:15:24,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=2514, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=131, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=6268, PETRI_PLACES=103, PETRI_TRANSITIONS=383} [2023-11-17 11:15:24,516 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 79 predicate places. [2023-11-17 11:15:24,516 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 383 transitions, 6268 flow [2023-11-17 11:15:24,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:24,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:15:24,517 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:15:24,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-17 11:15:24,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:15:24,729 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:15:24,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:15:24,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1917462743, now seen corresponding path program 3 times [2023-11-17 11:15:24,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:15:24,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306812927] [2023-11-17 11:15:24,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:15:24,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:15:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:15:25,359 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:25,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:15:25,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306812927] [2023-11-17 11:15:25,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306812927] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:15:25,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676682064] [2023-11-17 11:15:25,360 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 11:15:25,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:15:25,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:15:25,361 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-17 11:15:25,380 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-17 11:15:25,544 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-17 11:15:25,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 11:15:25,548 INFO L262 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-17 11:15:25,551 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:15:25,575 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-11-17 11:15:25,576 INFO L378 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 29 treesize of output 34 [2023-11-17 11:15:25,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 11:15:25,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-17 11:15:25,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 11:15:25,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 14 [2023-11-17 11:15:25,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-11-17 11:15:26,085 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:26,085 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:15:26,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-17 11:15:26,200 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_450 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_450) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))) is different from false [2023-11-17 11:15:26,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:15:26,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-11-17 11:15:26,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2023-11-17 11:15:26,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2023-11-17 11:15:26,253 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-11-17 11:15:26,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676682064] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:15:26,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:15:26,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 5] total 18 [2023-11-17 11:15:26,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278866776] [2023-11-17 11:15:26,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:15:26,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-17 11:15:26,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:15:26,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-17 11:15:26,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=277, Unknown=1, NotChecked=34, Total=380 [2023-11-17 11:15:26,258 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2023-11-17 11:15:26,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 383 transitions, 6268 flow. Second operand has 20 states, 20 states have (on average 10.45) internal successors, (209), 20 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:26,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:15:26,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2023-11-17 11:15:26,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:15:29,810 INFO L124 PetriNetUnfolderBase]: 9476/17062 cut-off events. [2023-11-17 11:15:29,811 INFO L125 PetriNetUnfolderBase]: For 94856/94856 co-relation queries the response was YES. [2023-11-17 11:15:29,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66798 conditions, 17062 events. 9476/17062 cut-off events. For 94856/94856 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 120277 event pairs, 2426 based on Foata normal form. 204/17266 useless extension candidates. Maximal degree in co-relation 61586. Up to 7404 conditions per place. [2023-11-17 11:15:29,926 INFO L140 encePairwiseOnDemand]: 51/56 looper letters, 233 selfloop transitions, 381 changer transitions 43/657 dead transitions. [2023-11-17 11:15:29,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 657 transitions, 10267 flow [2023-11-17 11:15:29,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-17 11:15:29,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-11-17 11:15:29,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 326 transitions. [2023-11-17 11:15:29,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32341269841269843 [2023-11-17 11:15:29,928 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 326 transitions. [2023-11-17 11:15:29,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 326 transitions. [2023-11-17 11:15:29,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:15:29,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 326 transitions. [2023-11-17 11:15:29,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 18.11111111111111) internal successors, (326), 18 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:29,931 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 56.0) internal successors, (1064), 19 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:29,931 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 56.0) internal successors, (1064), 19 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:29,931 INFO L175 Difference]: Start difference. First operand has 103 places, 383 transitions, 6268 flow. Second operand 18 states and 326 transitions. [2023-11-17 11:15:29,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 657 transitions, 10267 flow [2023-11-17 11:15:30,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 657 transitions, 10171 flow, removed 48 selfloop flow, removed 0 redundant places. [2023-11-17 11:15:30,329 INFO L231 Difference]: Finished difference. Result has 127 places, 476 transitions, 9114 flow [2023-11-17 11:15:30,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=6158, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=289, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=9114, PETRI_PLACES=127, PETRI_TRANSITIONS=476} [2023-11-17 11:15:30,330 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 103 predicate places. [2023-11-17 11:15:30,330 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 476 transitions, 9114 flow [2023-11-17 11:15:30,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 10.45) internal successors, (209), 20 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:30,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:15:30,330 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:15:30,336 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-17 11:15:30,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-17 11:15:30,533 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:15:30,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:15:30,533 INFO L85 PathProgramCache]: Analyzing trace with hash 220630707, now seen corresponding path program 4 times [2023-11-17 11:15:30,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:15:30,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247601880] [2023-11-17 11:15:30,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:15:30,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:15:30,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:15:31,488 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:31,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:15:31,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247601880] [2023-11-17 11:15:31,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247601880] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:15:31,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72916296] [2023-11-17 11:15:31,489 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 11:15:31,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:15:31,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:15:31,490 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-17 11:15:31,512 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-17 11:15:31,678 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 11:15:31,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 11:15:31,680 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-17 11:15:31,684 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:15:31,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 11:15:31,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 11:15:31,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 14 [2023-11-17 11:15:31,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 11:15:31,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 14 [2023-11-17 11:15:31,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 11:15:31,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 14 [2023-11-17 11:15:31,931 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:31,932 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:15:32,116 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:32,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72916296] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:15:32,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:15:32,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2023-11-17 11:15:32,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480486447] [2023-11-17 11:15:32,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:15:32,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-17 11:15:32,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:15:32,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-17 11:15:32,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2023-11-17 11:15:32,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2023-11-17 11:15:32,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 476 transitions, 9114 flow. Second operand has 17 states, 17 states have (on average 12.117647058823529) internal successors, (206), 17 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:32,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:15:32,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2023-11-17 11:15:32,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:15:38,198 INFO L124 PetriNetUnfolderBase]: 14884/26757 cut-off events. [2023-11-17 11:15:38,199 INFO L125 PetriNetUnfolderBase]: For 198832/198832 co-relation queries the response was YES. [2023-11-17 11:15:38,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110887 conditions, 26757 events. 14884/26757 cut-off events. For 198832/198832 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 200582 event pairs, 3911 based on Foata normal form. 174/26931 useless extension candidates. Maximal degree in co-relation 104513. Up to 11730 conditions per place. [2023-11-17 11:15:38,444 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 307 selfloop transitions, 723 changer transitions 86/1116 dead transitions. [2023-11-17 11:15:38,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 1116 transitions, 18819 flow [2023-11-17 11:15:38,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-17 11:15:38,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-11-17 11:15:38,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 640 transitions. [2023-11-17 11:15:38,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32653061224489793 [2023-11-17 11:15:38,450 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 640 transitions. [2023-11-17 11:15:38,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 640 transitions. [2023-11-17 11:15:38,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:15:38,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 640 transitions. [2023-11-17 11:15:38,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 18.285714285714285) internal successors, (640), 35 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:38,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 56.0) internal successors, (2016), 36 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:38,460 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 56.0) internal successors, (2016), 36 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:38,460 INFO L175 Difference]: Start difference. First operand has 127 places, 476 transitions, 9114 flow. Second operand 35 states and 640 transitions. [2023-11-17 11:15:38,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 1116 transitions, 18819 flow [2023-11-17 11:15:39,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 1116 transitions, 18409 flow, removed 40 selfloop flow, removed 6 redundant places. [2023-11-17 11:15:39,245 INFO L231 Difference]: Finished difference. Result has 164 places, 802 transitions, 17024 flow [2023-11-17 11:15:39,245 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=8827, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=415, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=17024, PETRI_PLACES=164, PETRI_TRANSITIONS=802} [2023-11-17 11:15:39,246 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 140 predicate places. [2023-11-17 11:15:39,246 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 802 transitions, 17024 flow [2023-11-17 11:15:39,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 12.117647058823529) internal successors, (206), 17 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:39,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:15:39,247 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:15:39,254 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-17 11:15:39,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:15:39,448 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:15:39,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:15:39,448 INFO L85 PathProgramCache]: Analyzing trace with hash -788938835, now seen corresponding path program 5 times [2023-11-17 11:15:39,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:15:39,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495182610] [2023-11-17 11:15:39,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:15:39,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:15:39,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:15:40,557 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:40,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:15:40,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495182610] [2023-11-17 11:15:40,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495182610] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:15:40,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016924380] [2023-11-17 11:15:40,558 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 11:15:40,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:15:40,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:15:40,559 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-17 11:15:40,573 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-17 11:15:40,770 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-11-17 11:15:40,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 11:15:40,773 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 56 conjunts are in the unsatisfiable core [2023-11-17 11:15:40,780 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:15:40,793 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 11:15:40,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-17 11:15:40,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 11:15:40,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-17 11:15:41,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-11-17 11:15:41,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 11:15:41,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 14 [2023-11-17 11:15:41,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-11-17 11:15:41,285 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:41,286 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:15:48,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:15:48,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 54 [2023-11-17 11:15:48,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 101 [2023-11-17 11:15:48,282 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 11:15:48,282 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 11:15:48,283 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 11:15:48,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2023-11-17 11:15:48,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:15:48,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 355 treesize of output 339 [2023-11-17 11:15:48,396 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:48,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016924380] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:15:48,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:15:48,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 25 [2023-11-17 11:15:48,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855131017] [2023-11-17 11:15:48,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:15:48,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-17 11:15:48,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:15:48,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-17 11:15:48,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=471, Unknown=0, NotChecked=0, Total=702 [2023-11-17 11:15:48,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2023-11-17 11:15:48,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 802 transitions, 17024 flow. Second operand has 27 states, 27 states have (on average 10.222222222222221) internal successors, (276), 27 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:48,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:15:48,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2023-11-17 11:15:48,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:15:52,793 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-17 11:16:08,943 INFO L124 PetriNetUnfolderBase]: 27168/48971 cut-off events. [2023-11-17 11:16:08,944 INFO L125 PetriNetUnfolderBase]: For 448962/448962 co-relation queries the response was YES. [2023-11-17 11:16:09,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217099 conditions, 48971 events. 27168/48971 cut-off events. For 448962/448962 co-relation queries the response was YES. Maximal size of possible extension queue 892. Compared 398016 event pairs, 5617 based on Foata normal form. 24/48995 useless extension candidates. Maximal degree in co-relation 206543. Up to 22132 conditions per place. [2023-11-17 11:16:09,477 INFO L140 encePairwiseOnDemand]: 45/56 looper letters, 434 selfloop transitions, 1359 changer transitions 99/1892 dead transitions. [2023-11-17 11:16:09,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 1892 transitions, 38335 flow [2023-11-17 11:16:09,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-17 11:16:09,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-11-17 11:16:09,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 698 transitions. [2023-11-17 11:16:09,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32800751879699247 [2023-11-17 11:16:09,485 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 698 transitions. [2023-11-17 11:16:09,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 698 transitions. [2023-11-17 11:16:09,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:16:09,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 698 transitions. [2023-11-17 11:16:09,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 18.36842105263158) internal successors, (698), 38 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:16:09,495 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 56.0) internal successors, (2184), 39 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:16:09,496 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 56.0) internal successors, (2184), 39 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:16:09,496 INFO L175 Difference]: Start difference. First operand has 164 places, 802 transitions, 17024 flow. Second operand 38 states and 698 transitions. [2023-11-17 11:16:09,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 1892 transitions, 38335 flow [2023-11-17 11:16:12,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 1892 transitions, 36747 flow, removed 427 selfloop flow, removed 4 redundant places. [2023-11-17 11:16:12,817 INFO L231 Difference]: Finished difference. Result has 210 places, 1544 transitions, 35520 flow [2023-11-17 11:16:12,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=16310, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=802, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=659, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=35520, PETRI_PLACES=210, PETRI_TRANSITIONS=1544} [2023-11-17 11:16:12,819 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 186 predicate places. [2023-11-17 11:16:12,819 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 1544 transitions, 35520 flow [2023-11-17 11:16:12,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 10.222222222222221) internal successors, (276), 27 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:16:12,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:16:12,820 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:16:12,828 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-17 11:16:13,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:16:13,024 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:16:13,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:16:13,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1146024723, now seen corresponding path program 6 times [2023-11-17 11:16:13,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:16:13,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646847694] [2023-11-17 11:16:13,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:16:13,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:16:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:16:13,975 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:16:13,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:16:13,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646847694] [2023-11-17 11:16:13,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646847694] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:16:13,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361883730] [2023-11-17 11:16:13,976 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-17 11:16:13,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:16:13,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:16:13,978 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-17 11:16:13,980 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-17 11:16:14,327 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-11-17 11:16:14,327 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 11:16:14,330 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-17 11:16:14,334 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:16:14,344 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 11:16:14,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-17 11:16:14,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-17 11:16:14,432 INFO L349 Elim1Store]: treesize reduction 34, result has 26.1 percent of original size [2023-11-17 11:16:14,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 48 treesize of output 19 [2023-11-17 11:16:14,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 11:16:14,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 19 [2023-11-17 11:16:14,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 44 [2023-11-17 11:16:14,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 11:16:14,685 INFO L349 Elim1Store]: treesize reduction 51, result has 40.0 percent of original size [2023-11-17 11:16:14,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 46 [2023-11-17 11:16:15,185 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:16:15,186 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:16:15,350 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_774 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_774) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294))) is different from false [2023-11-17 11:16:15,903 INFO L349 Elim1Store]: treesize reduction 61, result has 40.8 percent of original size [2023-11-17 11:16:15,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 59 [2023-11-17 11:16:15,920 INFO L349 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2023-11-17 11:16:15,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 98 treesize of output 58 [2023-11-17 11:16:15,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2023-11-17 11:16:17,979 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 23 refuted. 2 times theorem prover too weak. 0 trivial. 6 not checked. [2023-11-17 11:16:17,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361883730] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:16:17,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:16:17,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2023-11-17 11:16:17,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538994373] [2023-11-17 11:16:17,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:16:17,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-17 11:16:17,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:16:17,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-17 11:16:17,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=506, Unknown=3, NotChecked=46, Total=650 [2023-11-17 11:16:17,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2023-11-17 11:16:17,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 1544 transitions, 35520 flow. Second operand has 26 states, 26 states have (on average 10.346153846153847) internal successors, (269), 26 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:16:17,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:16:17,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2023-11-17 11:16:17,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:16:20,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 11:16:22,396 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 [0] [2023-11-17 11:16:24,411 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 [0] [2023-11-17 11:16:26,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 [0] [2023-11-17 11:16:28,798 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 [0] [2023-11-17 11:16:30,804 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 [0] [2023-11-17 11:16:33,005 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 [0] [2023-11-17 11:16:35,009 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 [0] [2023-11-17 11:16:37,023 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 [0] [2023-11-17 11:16:39,027 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 [0] [2023-11-17 11:16:41,040 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 [0] [2023-11-17 11:16:42,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 11:16:44,453 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 [0] [2023-11-17 11:16:46,460 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 [0] [2023-11-17 11:16:48,613 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 [0] [2023-11-17 11:16:50,618 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 [0] [2023-11-17 11:16:52,750 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 [0] [2023-11-17 11:16:54,755 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 [0] [2023-11-17 11:16:57,511 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 [0] [2023-11-17 11:16:59,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 11:17:01,826 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 [0] [2023-11-17 11:17:03,834 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 [0] [2023-11-17 11:17:05,906 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 [0] [2023-11-17 11:17:07,914 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 [0] [2023-11-17 11:17:11,814 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 [0] [2023-11-17 11:17:13,819 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 [0] [2023-11-17 11:17:15,994 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 [0] [2023-11-17 11:17:17,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 11:17:19,531 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 [0] [2023-11-17 11:17:22,452 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 [0] [2023-11-17 11:17:24,458 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 [0] [2023-11-17 11:17:26,470 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 [0] [2023-11-17 11:17:28,474 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 [0] [2023-11-17 11:17:30,479 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 [0] [2023-11-17 11:17:32,481 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 [0] [2023-11-17 11:17:34,599 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 [0] [2023-11-17 11:17:36,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 11:17:39,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 [0] [2023-11-17 11:17:41,399 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 [0] [2023-11-17 11:17:44,004 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 [0] [2023-11-17 11:17:46,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 [0] [2023-11-17 11:17:48,254 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 [0] [2023-11-17 11:17:50,268 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 [0] [2023-11-17 11:17:52,329 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 [0] [2023-11-17 11:17:54,333 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 [0] [2023-11-17 11:17:56,337 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 [0] [2023-11-17 11:17:58,665 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 [0] [2023-11-17 11:18:00,670 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 [0] [2023-11-17 11:18:04,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 11:18:07,934 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 [0] [2023-11-17 11:18:10,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 11:18:12,825 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 [0] [2023-11-17 11:18:14,830 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 [0] [2023-11-17 11:18:16,841 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 [0] [2023-11-17 11:18:19,656 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 [0] [2023-11-17 11:18:21,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 11:18:24,025 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 [0] [2023-11-17 11:18:27,355 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 [0] [2023-11-17 11:18:29,367 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 [0] [2023-11-17 11:18:31,373 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 [0] [2023-11-17 11:18:33,497 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 [0] [2023-11-17 11:18:35,981 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 [0] [2023-11-17 11:18:37,985 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 [0] [2023-11-17 11:18:39,991 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 [0] [2023-11-17 11:18:41,993 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 [0] [2023-11-17 11:18:44,836 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 [0] [2023-11-17 11:18:47,814 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 [0] [2023-11-17 11:18:50,361 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 [0] [2023-11-17 11:18:52,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 [0] [2023-11-17 11:18:53,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 11:18:55,996 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 [0] [2023-11-17 11:18:58,141 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 [0] [2023-11-17 11:19:02,143 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 [0] [2023-11-17 11:19:04,146 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 [0] [2023-11-17 11:19:06,151 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 [0] [2023-11-17 11:19:08,154 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 [0] [2023-11-17 11:19:10,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 11:19:12,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 [0] [2023-11-17 11:19:14,080 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 [0] [2023-11-17 11:19:16,090 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 [0] [2023-11-17 11:19:19,521 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 [0] [2023-11-17 11:19:21,527 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 [0] [2023-11-17 11:19:23,539 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 [0] [2023-11-17 11:19:25,553 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 [0] [2023-11-17 11:19:27,830 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 [0] [2023-11-17 11:19:29,954 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 [0] [2023-11-17 11:19:31,961 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 [0] [2023-11-17 11:19:34,147 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 [0] [2023-11-17 11:19:36,150 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 [0] [2023-11-17 11:19:38,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 [0] [2023-11-17 11:19:41,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 11:19:43,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 [0] [2023-11-17 11:19:47,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 [0] [2023-11-17 11:19:49,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 [0] [2023-11-17 11:19:52,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 11:19:54,950 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 [0] [2023-11-17 11:19:57,085 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 [0] [2023-11-17 11:19:59,088 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 [0] [2023-11-17 11:20:01,095 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 [0] [2023-11-17 11:20:03,097 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 [0] [2023-11-17 11:20:05,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 [0] [2023-11-17 11:20:07,105 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 [0] [2023-11-17 11:20:09,113 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 [0] [2023-11-17 11:20:11,116 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 [0] [2023-11-17 11:20:13,126 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 [0] [2023-11-17 11:20:15,132 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 [0] [2023-11-17 11:20:17,137 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 [0] [2023-11-17 11:20:19,143 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 [0] [2023-11-17 11:20:21,698 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 [0] [2023-11-17 11:20:24,782 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 [0] [2023-11-17 11:20:26,787 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 [0] [2023-11-17 11:20:28,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 11:20:30,797 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 [0] [2023-11-17 11:20:32,816 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 [0] [2023-11-17 11:20:33,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 11:20:36,527 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 [0] [2023-11-17 11:20:38,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 11:20:40,091 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 [0] [2023-11-17 11:20:42,093 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 [0] [2023-11-17 11:20:44,960 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 [0] [2023-11-17 11:20:50,771 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 [0] [2023-11-17 11:20:53,264 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 [0] [2023-11-17 11:20:55,267 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 [0] [2023-11-17 11:20:57,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 [0] [2023-11-17 11:20:59,276 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 [0] [2023-11-17 11:21:01,289 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 [0] [2023-11-17 11:21:03,431 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 [0] [2023-11-17 11:21:05,443 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 [0] [2023-11-17 11:21:07,446 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 [0] [2023-11-17 11:21:09,451 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 [0] [2023-11-17 11:21:11,454 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 [0] [2023-11-17 11:21:13,457 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 [0] [2023-11-17 11:21:15,459 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 [0] [2023-11-17 11:21:17,466 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 [0] [2023-11-17 11:21:19,468 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 [0] [2023-11-17 11:21:21,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 11:21:27,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 [0] [2023-11-17 11:21:31,432 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 [0] [2023-11-17 11:21:33,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 11:21:34,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 11:21:40,756 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 [0] [2023-11-17 11:21:47,690 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 [0] [2023-11-17 11:21:49,694 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 [0] [2023-11-17 11:21:51,772 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 [0] [2023-11-17 11:21:55,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-17 11:21:58,073 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 [0] [2023-11-17 11:22:00,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 [0] [2023-11-17 11:22:02,081 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 [0] [2023-11-17 11:22:04,083 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 [0] [2023-11-17 11:22:06,152 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 [0] [2023-11-17 11:22:08,157 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 [0] [2023-11-17 11:22:10,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 [0] [2023-11-17 11:22:12,714 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 [0] [2023-11-17 11:22:14,360 INFO L124 PetriNetUnfolderBase]: 32394/58636 cut-off events. [2023-11-17 11:22:14,360 INFO L125 PetriNetUnfolderBase]: For 664261/664261 co-relation queries the response was YES. [2023-11-17 11:22:15,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298973 conditions, 58636 events. 32394/58636 cut-off events. For 664261/664261 co-relation queries the response was YES. Maximal size of possible extension queue 947. Compared 487832 event pairs, 7392 based on Foata normal form. 24/58660 useless extension candidates. Maximal degree in co-relation 286454. Up to 26341 conditions per place. [2023-11-17 11:22:15,179 INFO L140 encePairwiseOnDemand]: 51/56 looper letters, 369 selfloop transitions, 1872 changer transitions 97/2338 dead transitions. [2023-11-17 11:22:15,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 2338 transitions, 52160 flow [2023-11-17 11:22:15,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-17 11:22:15,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-11-17 11:22:15,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 674 transitions. [2023-11-17 11:22:15,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3167293233082707 [2023-11-17 11:22:15,184 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 674 transitions. [2023-11-17 11:22:15,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 674 transitions. [2023-11-17 11:22:15,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:22:15,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 674 transitions. [2023-11-17 11:22:15,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 17.736842105263158) internal successors, (674), 38 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:15,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 56.0) internal successors, (2184), 39 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:15,190 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 56.0) internal successors, (2184), 39 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:15,190 INFO L175 Difference]: Start difference. First operand has 210 places, 1544 transitions, 35520 flow. Second operand 38 states and 674 transitions. [2023-11-17 11:22:15,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 2338 transitions, 52160 flow [2023-11-17 11:22:19,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 2338 transitions, 51050 flow, removed 539 selfloop flow, removed 5 redundant places. [2023-11-17 11:22:19,667 INFO L231 Difference]: Finished difference. Result has 246 places, 2008 transitions, 48799 flow [2023-11-17 11:22:19,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=34672, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1406, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=48799, PETRI_PLACES=246, PETRI_TRANSITIONS=2008} [2023-11-17 11:22:19,669 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 222 predicate places. [2023-11-17 11:22:19,669 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 2008 transitions, 48799 flow [2023-11-17 11:22:19,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 10.346153846153847) internal successors, (269), 26 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:19,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:22:19,669 INFO L208 CegarLoopForPetriNet]: trace histogram [11, 10, 10, 1, 1, 1, 1] [2023-11-17 11:22:19,677 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-17 11:22:19,874 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,SelfDestructingSolverStorable13 [2023-11-17 11:22:19,875 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:22:19,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:22:19,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1849131914, now seen corresponding path program 3 times [2023-11-17 11:22:19,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:22:19,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576085772] [2023-11-17 11:22:19,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:22:19,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:22:19,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:22:20,125 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:22:20,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:22:20,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576085772] [2023-11-17 11:22:20,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576085772] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:22:20,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794977744] [2023-11-17 11:22:20,126 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 11:22:20,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:22:20,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:22:20,129 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-17 11:22:20,140 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-17 11:22:20,830 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-11-17 11:22:20,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 11:22:20,835 INFO L262 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-17 11:22:20,837 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:22:20,894 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:22:20,894 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:22:21,090 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:22:21,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794977744] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:22:21,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:22:21,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2023-11-17 11:22:21,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730022379] [2023-11-17 11:22:21,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:22:21,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-17 11:22:21,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:22:21,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-17 11:22:21,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2023-11-17 11:22:21,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2023-11-17 11:22:21,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 2008 transitions, 48799 flow. Second operand has 25 states, 25 states have (on average 10.0) internal successors, (250), 25 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:21,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:22:21,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2023-11-17 11:22:21,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:23:20,116 INFO L124 PetriNetUnfolderBase]: 67621/120519 cut-off events. [2023-11-17 11:23:20,116 INFO L125 PetriNetUnfolderBase]: For 2210230/2210230 co-relation queries the response was YES. [2023-11-17 11:23:21,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 656565 conditions, 120519 events. 67621/120519 cut-off events. For 2210230/2210230 co-relation queries the response was YES. Maximal size of possible extension queue 1307. Compared 1032168 event pairs, 20254 based on Foata normal form. 2804/123323 useless extension candidates. Maximal degree in co-relation 646547. Up to 52466 conditions per place. [2023-11-17 11:23:22,048 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 622 selfloop transitions, 4347 changer transitions 11/4980 dead transitions. [2023-11-17 11:23:22,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 4980 transitions, 124223 flow [2023-11-17 11:23:22,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-17 11:23:22,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-11-17 11:23:22,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 568 transitions. [2023-11-17 11:23:22,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4057142857142857 [2023-11-17 11:23:22,051 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 568 transitions. [2023-11-17 11:23:22,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 568 transitions. [2023-11-17 11:23:22,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:23:22,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 568 transitions. [2023-11-17 11:23:22,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 22.72) internal successors, (568), 25 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:22,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 56.0) internal successors, (1456), 26 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:22,055 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 56.0) internal successors, (1456), 26 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:22,055 INFO L175 Difference]: Start difference. First operand has 246 places, 2008 transitions, 48799 flow. Second operand 25 states and 568 transitions. [2023-11-17 11:23:22,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 4980 transitions, 124223 flow [2023-11-17 11:23:43,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 4980 transitions, 122741 flow, removed 688 selfloop flow, removed 5 redundant places. [2023-11-17 11:23:43,376 INFO L231 Difference]: Finished difference. Result has 287 places, 4585 transitions, 126987 flow [2023-11-17 11:23:43,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=47923, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2008, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1884, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=126987, PETRI_PLACES=287, PETRI_TRANSITIONS=4585} [2023-11-17 11:23:43,378 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 263 predicate places. [2023-11-17 11:23:43,378 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 4585 transitions, 126987 flow [2023-11-17 11:23:43,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 10.0) internal successors, (250), 25 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:43,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:23:43,379 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:23:43,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-17 11:23:43,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-17 11:23:43,590 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:23:43,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:23:43,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1383355029, now seen corresponding path program 7 times [2023-11-17 11:23:43,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:23:43,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067225760] [2023-11-17 11:23:43,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:23:43,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:23:43,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:23:44,967 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:23:44,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:23:44,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067225760] [2023-11-17 11:23:44,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067225760] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:23:44,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414312540] [2023-11-17 11:23:44,967 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-17 11:23:44,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:23:44,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:23:44,969 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-17 11:23:44,995 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-17 11:23:45,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:23:45,174 INFO L262 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-17 11:23:45,178 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:23:45,199 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-11-17 11:23:45,200 INFO L378 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 29 treesize of output 34 [2023-11-17 11:23:45,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-17 11:23:45,295 INFO L349 Elim1Store]: treesize reduction 34, result has 26.1 percent of original size [2023-11-17 11:23:45,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 48 treesize of output 19 [2023-11-17 11:23:45,351 INFO L349 Elim1Store]: treesize reduction 34, result has 26.1 percent of original size [2023-11-17 11:23:45,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 48 treesize of output 19 [2023-11-17 11:23:45,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2023-11-17 11:23:45,439 INFO L349 Elim1Store]: treesize reduction 34, result has 26.1 percent of original size [2023-11-17 11:23:45,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 48 treesize of output 19 [2023-11-17 11:23:45,487 INFO L349 Elim1Store]: treesize reduction 34, result has 26.1 percent of original size [2023-11-17 11:23:45,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 48 treesize of output 19 [2023-11-17 11:23:45,620 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 4 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:23:45,620 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:23:45,872 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1044 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1044) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294))) is different from false [2023-11-17 11:23:48,169 INFO L349 Elim1Store]: treesize reduction 61, result has 40.8 percent of original size [2023-11-17 11:23:48,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 59 [2023-11-17 11:23:48,180 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-17 11:23:48,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 44 [2023-11-17 11:23:48,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2023-11-17 11:23:50,230 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 2 proven. 52 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:23:50,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414312540] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:23:50,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:23:50,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2023-11-17 11:23:50,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869473225] [2023-11-17 11:23:50,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:23:50,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-17 11:23:50,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:23:50,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-17 11:23:50,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=650, Unknown=4, NotChecked=52, Total=812 [2023-11-17 11:23:50,233 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2023-11-17 11:23:50,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 4585 transitions, 126987 flow. Second operand has 29 states, 29 states have (on average 10.620689655172415) internal successors, (308), 29 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:50,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:23:50,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2023-11-17 11:23:50,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-11-17 11:23:58,249 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 11:23:58,249 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 11:23:58,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-17 11:23:58,251 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-17 11:23:58,259 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-17 11:23:58,452 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,SelfDestructingSolverStorable15 [2023-11-17 11:23:58,452 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (29states, 7/56 universal loopers) in iteration 16,while PetriNetUnfolder was constructing finite prefix that currently has 37267 conditions, 7777 events (4227/7776 cut-off events. For 92768/92768 co-relation queries the response was YES. Maximal size of possible extension queue 585. Compared 59656 event pairs, 1349 based on Foata normal form. 0/8358 useless extension candidates. Maximal degree in co-relation 37178. Up to 3580 conditions per place.). [2023-11-17 11:23:58,454 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2023-11-17 11:23:58,454 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-17 11:23:58,455 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2023-11-17 11:23:58,455 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2023-11-17 11:23:58,455 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-17 11:23:58,455 INFO L445 BasicCegarLoop]: Path program histogram: [7, 4, 3, 1, 1] [2023-11-17 11:23:58,459 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 11:23:58,459 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 11:23:58,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 11:23:58 BasicIcfg [2023-11-17 11:23:58,462 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 11:23:58,462 INFO L158 Benchmark]: Toolchain (without parser) took 530947.22ms. Allocated memory was 173.0MB in the beginning and 5.2GB in the end (delta: 5.1GB). Free memory was 133.1MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 3.0GB. Max. memory is 8.0GB. [2023-11-17 11:23:58,462 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 173.0MB. Free memory was 120.7MB in the beginning and 120.6MB in the end (delta: 71.1kB). There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 11:23:58,462 INFO L158 Benchmark]: CACSL2BoogieTranslator took 595.74ms. Allocated memory is still 173.0MB. Free memory was 133.1MB in the beginning and 103.2MB in the end (delta: 29.8MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2023-11-17 11:23:58,462 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.02ms. Allocated memory is still 173.0MB. Free memory was 103.2MB in the beginning and 100.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:23:58,463 INFO L158 Benchmark]: Boogie Preprocessor took 46.29ms. Allocated memory is still 173.0MB. Free memory was 100.7MB in the beginning and 98.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:23:58,463 INFO L158 Benchmark]: RCFGBuilder took 718.85ms. Allocated memory was 173.0MB in the beginning and 248.5MB in the end (delta: 75.5MB). Free memory was 98.6MB in the beginning and 198.5MB in the end (delta: -99.9MB). Peak memory consumption was 42.0MB. Max. memory is 8.0GB. [2023-11-17 11:23:58,463 INFO L158 Benchmark]: TraceAbstraction took 529505.10ms. Allocated memory was 248.5MB in the beginning and 5.2GB in the end (delta: 5.0GB). Free memory was 197.5MB in the beginning and 2.2GB in the end (delta: -2.0GB). Peak memory consumption was 3.0GB. Max. memory is 8.0GB. [2023-11-17 11:23:58,464 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.15ms. Allocated memory is still 173.0MB. Free memory was 120.7MB in the beginning and 120.6MB in the end (delta: 71.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 595.74ms. Allocated memory is still 173.0MB. Free memory was 133.1MB in the beginning and 103.2MB in the end (delta: 29.8MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 75.02ms. Allocated memory is still 173.0MB. Free memory was 103.2MB in the beginning and 100.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.29ms. Allocated memory is still 173.0MB. Free memory was 100.7MB in the beginning and 98.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 718.85ms. Allocated memory was 173.0MB in the beginning and 248.5MB in the end (delta: 75.5MB). Free memory was 98.6MB in the beginning and 198.5MB in the end (delta: -99.9MB). Peak memory consumption was 42.0MB. Max. memory is 8.0GB. * TraceAbstraction took 529505.10ms. Allocated memory was 248.5MB in the beginning and 5.2GB in the end (delta: 5.0GB). Free memory was 197.5MB in the beginning and 2.2GB in the end (delta: -2.0GB). Peak memory consumption was 3.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 33 PlacesBefore, 24 PlacesAfterwards, 31 TransitionsBefore, 21 TransitionsAfterwards, 430 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 17 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 21 TotalNumberOfCompositions, 1215 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 760, independent: 689, independent conditional: 0, independent unconditional: 689, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 332, independent: 303, independent conditional: 0, independent unconditional: 303, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 332, independent: 287, independent conditional: 0, independent unconditional: 287, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 45, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 228, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 168, dependent conditional: 0, dependent unconditional: 168, unknown: 12, unknown conditional: 0, unknown unconditional: 12] ], Cache Queries: [ total: 760, independent: 386, independent conditional: 0, independent unconditional: 386, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 332, unknown conditional: 0, unknown unconditional: 332] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 77, Positive conditional cache size: 0, Positive unconditional cache size: 77, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (29states, 7/56 universal loopers) in iteration 16,while PetriNetUnfolder was constructing finite prefix that currently has 37267 conditions, 7777 events (4227/7776 cut-off events. For 92768/92768 co-relation queries the response was YES. Maximal size of possible extension queue 585. Compared 59656 event pairs, 1349 based on Foata normal form. 0/8358 useless extension candidates. Maximal degree in co-relation 37178. Up to 3580 conditions per place.). - TimeoutResultAtElement [Line: 1022]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (29states, 7/56 universal loopers) in iteration 16,while PetriNetUnfolder was constructing finite prefix that currently has 37267 conditions, 7777 events (4227/7776 cut-off events. For 92768/92768 co-relation queries the response was YES. Maximal size of possible extension queue 585. Compared 59656 event pairs, 1349 based on Foata normal form. 0/8358 useless extension candidates. Maximal degree in co-relation 37178. Up to 3580 conditions per place.). - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (29states, 7/56 universal loopers) in iteration 16,while PetriNetUnfolder was constructing finite prefix that currently has 37267 conditions, 7777 events (4227/7776 cut-off events. For 92768/92768 co-relation queries the response was YES. Maximal size of possible extension queue 585. Compared 59656 event pairs, 1349 based on Foata normal form. 0/8358 useless extension candidates. Maximal degree in co-relation 37178. Up to 3580 conditions per place.). - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (29states, 7/56 universal loopers) in iteration 16,while PetriNetUnfolder was constructing finite prefix that currently has 37267 conditions, 7777 events (4227/7776 cut-off events. For 92768/92768 co-relation queries the response was YES. Maximal size of possible extension queue 585. Compared 59656 event pairs, 1349 based on Foata normal form. 0/8358 useless extension candidates. Maximal degree in co-relation 37178. Up to 3580 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 54 locations, 6 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: 529.4s, OverallIterations: 16, TraceHistogramMax: 11, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 495.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.4s, HoareTripleCheckerStatistics: 221 mSolverCounterUnknown, 4531 SdHoareTripleChecker+Valid, 331.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4531 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 330.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 660 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 709 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4414 IncrementalHoareTripleChecker+Invalid, 6004 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 709 mSolverCounterUnsat, 0 mSDtfsCounter, 4414 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 747 GetRequests, 403 SyntacticMatches, 27 SemanticMatches, 317 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 3485 ImplicationChecksByTransitivity, 34.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126987occurred in iteration=15, InterpolantAutomatonStates: 224, 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.3s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 27.0s InterpolantComputationTime, 555 NumberOfCodeBlocks, 555 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 764 ConstructedInterpolants, 56 QuantifiedInterpolants, 15420 SizeOfPredicates, 61 NumberOfNonLiveVariables, 2916 ConjunctsInSsa, 352 ConjunctsInUnsatCore, 36 InterpolantComputations, 6 PerfectInterpolantSequences, 55/1131 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown